Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Theory of computation → Lambda calculus"'
Autor:
Faggian, Claudia
Rewriting is a foundation for the operational theory of programming languages. The process of rewriting describes the computation of a result (typically, a normal form), with lambda-calculus being the paradigmatic example for rewriting as an abstract
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8fa2396dd3d27b179bd296083bd41c5a
Language Workbenches offer language designers an expressive environment in which to create their Domain Specific Languages (DSLs). Similarly, research into mechanised meta-theory has shown how dependently typed languages provide expressive environmen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3efce53a2d1a375a0dfa1a8a6ac04202
Autor:
Fernández, Maribel
In this talk we discuss the nominal approach to the specification of languages with binders and some applications to programming languages and verification.
LIPIcs, Vol. 260, 8th International Conference on Formal Structures for Computation and
LIPIcs, Vol. 260, 8th International Conference on Formal Structures for Computation and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b9528b12f6c816eba13d78b90b61ae63
Choreographic programming is a paradigm for concurrent and distributed software, whereby descriptions of the intended communications (choreographies) are automatically compiled into distributed code with strong safety and liveness properties (e.g., d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::830b8f013eed2804dfdb9f42bd7482f7
Autor:
Manzonetto, Giulio
We shortly summarize the contents of the book "A Lambda Calculus Satellite", presented at the 8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023).
LIPIcs, Vol. 260, 8th International Conference on Formal S
LIPIcs, Vol. 260, 8th International Conference on Formal S
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d19014636136f471208ac875e4cc64b3
Autor:
Barenbaum, Pablo, Sottile, Cristian
This paper defines two decreasing measures for terms of the simply typed λ-calculus, called the 𝒲-measure and the 𝒯^{𝐦}-measure. A decreasing measure is a function that maps each typable λ-term to an element of a well-founded ordering, in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa10dc7b7d049018618db8ce44e84f1c
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
Polynomial functors are categorical structures used in a variety of applications across theoretical computer science; for instance, in database theory, denotational semantics, functional programming, and type theory. A well-known problem is that the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ee22bea310934fd3dcc8c07fae624e6
Autor:
Kesner, Delia, Peyrot, Loïc
Solvability is a key notion in the theory of call-by-name lambda-calculus, used in particular to identify meaningful terms. However, adapting this notion to other call-by-name calculi, or extending it to different models of computation - such as call
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::77a668d082b7de8bf3f976623c18fe41
Autor:
Faggian, Claudia, Guerrieri, Giulio
We present a technique to study normalizing strategies when termination is asymptotic, that is, it appears as a limit, as opposite to reaching a normal form in a finite number of steps. Asymptotic termination occurs in several settings, such as effec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb0fb82b43ef90aa8f06121aeba00e76