Results 1 to 10 of about 31,361 (278)
Superdevelopments for Weak Reduction [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We study superdevelopments in the weak lambda calculus of Cagman and Hindley, a confluent variant of the standard weak lambda calculus in which reduction below lambdas is forbidden. In contrast to developments, a superdevelopment from a term M allows not
Eduardo Bonelli, Pablo Barenbaum
doaj +5 more sources
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
Completeness of algebraic CPS simulations [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 The algebraic lambda calculus and the linear algebraic lambda calculus are two extensions of the classical lambda calculus with linear combinations of terms.
Ali Assaf, Simon Perdrix
doaj +6 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
Rewriting Modulo β in the λΠ-Calculus Modulo [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 The lambda-Pi-calculus Modulo is a variant of the lambda-calculus with dependent types where beta-conversion is extended with user-defined rewrite rules.
Ronan Saillard
doaj +6 more sources
Encoding many-valued logic in $\lambda$-calculus [PDF]
Logical Methods in Computer Science, 2021 We will extend the well-known Church encoding of Boolean logic into $\lambda$-calculus to an encoding of McCarthy's $3$-valued logic into a suitable infinitary extension of $\lambda$-calculus that identifies all unsolvables by $\bot$, where $\bot$ is a ...
Fer-Jan de Vries
doaj +3 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
Characterisation of Strongly Normalising lambda-mu-Terms [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 We provide a characterisation of strongly normalising terms of the lambda-mu-calculus by means of a type system that uses intersection and product types.
Steffen van Bakel +2 more
doaj +4 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