Results 11 to 20 of about 14,639 (283)
Trees from Functions as Processes [PDF]
Logical Methods in Computer Science, 2018 Levy-Longo Trees and Bohm Trees are the best known tree structures on the {\lambda}-calculus. We give general conditions under which an encoding of the {\lambda}-calculus into the {\pi}-calculus is sound and complete with respect to such trees.
Davide Sangiorgi, Xian Xu
doaj +7 more sources
Full Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion [PDF]
Logical Methods in Computer Science, 2012 We study the semantics of a resource-sensitive extension of the lambda calculus in a canonical reflexive object of a category of sets and relations, a relational version of Scott's original model of the pure lambda calculus.
Thomas Ehrhard +3 more
doaj +4 more sources
A System F accounting for scalars [PDF]
Logical Methods in Computer Science, 2012 The Algebraic lambda-calculus and the Linear-Algebraic lambda-calculus extend the lambda-calculus with the possibility of making arbitrary linear combinations of terms.
Pablo Arrighi, Alejandro Diaz-Caro
doaj +5 more sources
Confluence via strong normalisation in an algebraic λ-calculus with rewriting [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 The linear-algebraic lambda-calculus and the algebraic lambda-calculus are untyped lambda-calculi extended with arbitrary linear combinations of terms.
Pablo Buiras +2 more
doaj +6 more sources
Mathematical Structures in Computer Science, 2015 One of the best-known methods for discriminating λ-terms with respect to β-convertibility is due to Corrado Böhm. The idea is to compute the infinitary normal form of a λ-term M, the Böhm Tree (BT) of M. If λ-terms M, N have distinct BTs, then M ≠βN, that is, M and N are not β-convertible. But what if their BTs coincide?
Endrullis, Jörg +3 more
openaire +5 more sources
(Leftmost-Outermost) Beta Reduction is Invariant, Indeed [PDF]
Logical Methods in Computer Science, 2016 Slot and van Emde Boas' weak invariance thesis states that reasonable machines can simulate each other within a polynomially overhead in time. Is lambda-calculus a reasonable machine?
Beniamino Accattoli, Ugo Dal Lago
doaj +7 more sources
Extending the Extensional Lambda Calculus with Surjective Pairing is Conservative [PDF]
Logical Methods in Computer Science, 2006 We answer Klop and de Vrijer's question whether adding surjective-pairing axioms to the extensional lambda calculus yields a conservative extension. The answer is positive. As a byproduct we obtain a "syntactic" proof that the extensional lambda calculus
Kristian Stoevring
doaj +9 more sources
Normalizing the Taylor expansion of non-deterministic {\lambda}-terms, via parallel reduction of resource vectors [PDF]
Logical Methods in Computer Science, 2019 It has been known since Ehrhard and Regnier's seminal work on the Taylor expansion of $\lambda$-terms that this operation commutes with normalization: the expansion of a $\lambda$-term is always normalizable and its normal form is the expansion of the B\"
Lionel Vaux
doaj +5 more sources
A correspondence between rooted planar maps and normal planar lambda terms [PDF]
Logical Methods in Computer Science, 2015 A rooted planar map is a connected graph embedded in the 2-sphere, with one edge marked and assigned an orientation. A term of the pure lambda calculus is said to be linear if every variable is used exactly once, normal if it contains no beta-redexes ...
Noam Zeilberger, Alain Giorgetti
doaj +7 more sources
The Vectorial $\lambda$-Calculus [PDF]
, 2013 Comment: Long and corrected version of arXiv:1012.4032 (EPTCS 88:1-15), to appear in Information and ...
Arrighi, Pablo +2 more
openaire +5 more sources