Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Heijltjes, Willem B."'
Publikováno v:
FSCD 2022
FSCD 2022, Aug 2022, Haifa, Israel
Heijltjes, W, Hughes, D & Strassburger, L 2022, Normalization Without Syntax . in A P Felty (ed.), 7th International Conference on Formal Structures for Computation and Deduction, FSCD 2022 : FSCD 2022 . 2022 edn, vol. 228, 19, Leibniz International Proceedings in Informatics, LIPIcs, vol. 228, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Dagstuhl, Germany, pp. 19:1-19:19 . https://doi.org/10.4230/LIPIcs.FSCD.2022.19
FSCD 2022, Aug 2022, Haifa, Israel
Heijltjes, W, Hughes, D & Strassburger, L 2022, Normalization Without Syntax . in A P Felty (ed.), 7th International Conference on Formal Structures for Computation and Deduction, FSCD 2022 : FSCD 2022 . 2022 edn, vol. 228, 19, Leibniz International Proceedings in Informatics, LIPIcs, vol. 228, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Dagstuhl, Germany, pp. 19:1-19:19 . https://doi.org/10.4230/LIPIcs.FSCD.2022.19
We present normalization for intuitionistic combinatorial proofs (ICPs) and relate it to the simply-typed lambda-calculus. We prove confluence and strong normalization. Combinatorial proofs, or "proofs without syntax", form a graphical semantics of p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::617975127fa8cd596475eb88add245ef
https://inria.hal.science/hal-03654060/document
https://inria.hal.science/hal-03654060/document
Autor:
Guerrieri, Giulio, Heijltjes, Willem B., Paulus, Joseph W. N., Baier, Christel, Goubault-Larrecq, Jean
Publikováno v:
Guerrieri, G, Heijltjes, W & Paulus, J 2021, A deep quantitative type system . in C Baier & J Goubault-Larrecq (eds), 29th EACSL Annual Conference on Computer Science Logic, CSL 2021 : CSL 2021 . 2021 edn, vol. 183, 24, Leibniz International Proceedings in Informatics, LIPIcs, vol. 183, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Dagstuhl, Germany, pp. 24:1-24:24, 29th EACSL Annual Conference on Computer Science Logic (CSL 2021), Lubijana, Slovenia, 25/01/21 . https://doi.org/10.4230/LIPIcs.CSL.2021.24
29th EACSL Annual Conference on Computer Science Logic (CSL 2021), 24:1-24:24
STARTPAGE=24:1;ENDPAGE=24:24;TITLE=29th EACSL Annual Conference on Computer Science Logic (CSL 2021)
29th EACSL Annual Conference on Computer Science Logic (CSL 2021), 24:1-24:24
STARTPAGE=24:1;ENDPAGE=24:24;TITLE=29th EACSL Annual Conference on Computer Science Logic (CSL 2021)
We investigate intersection types and resource lambda-calculus in deep-inference proof theory. We give a unified type system that is parametric in various aspects: it encompasses resource calculi, intersection-typed lambda-calculus, and simply-typed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fd66c817ee971ec5d3c66094f45a2541
https://doi.org/10.4230/LIPIcs.CSL.2021.24
https://doi.org/10.4230/LIPIcs.CSL.2021.24
Publikováno v:
Bellin, G & Heijltjes, W 2018, Proof nets for bi-intuitionistic linear logic . in H Kirchner (ed.), 3rd International Conference on Formal Structures for Computation and Deduction, FSCD 2018 : Leibnitz International proceedings in Informatics . vol. 108, 10, Leibniz International Proceedings in Informations (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, pp. 1-17 . https://doi.org/10.4230/LIPIcs.FSCD.2018.10
Bi-Intuitionistic Linear Logic (BILL) is an extension of Intuitionistic Linear Logic with a par, dual to the tensor, and subtraction, dual to linear implication. It is the logic of categories with a monoidal closed and a monoidal co-closed structure
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7387b684be9fa5ab15ad54afff8d740f
https://purehost.bath.ac.uk/ws/files/184911245/BILL.pdf
https://purehost.bath.ac.uk/ws/files/184911245/BILL.pdf