Results 11 to 20 of about 31,361 (278)
Strong normalization of lambda-Sym-Prop- and lambda-bar-mu-mu-tilde-star- calculi [PDF]
Logical Methods in Computer Science, 2017 In this paper we give an arithmetical proof of the strong normalization of lambda-Sym-Prop of Berardi and Barbanera [1], which can be considered as a formulae-as-types translation of classical propositional logic in natural deduction style.
Peter Battyanyi, Karim Nour
doaj +6 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
Semantics of Higher-Order Recursion Schemes [PDF]
Logical Methods in Computer Science, 2011 Higher-order recursion schemes are recursive equations defining new operations from given ones called "terminals". Every such recursion scheme is proved to have a least interpreted semantics in every Scott's model of \lambda-calculus in which the ...
Jiri Adamek, Stefan Milius, Jiri Velebil
doaj +3 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
Translating HOL to Dedukti [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Dedukti is a logical framework based on the lambda-Pi-calculus modulo rewriting, which extends the lambda-Pi-calculus with rewrite rules. In this paper, we show how to translate the proofs of a family of HOL proof assistants to Dedukti.
Ali Assaf, Guillaume Burel
doaj +8 more sources
Modules over monads and operational semantics (expanded version) [PDF]
Logical Methods in Computer Science, 2022 This paper is a contribution to the search for efficient and high-level mathematical tools to specify and reason about (abstract) programming languages or calculi.
André Hirschowitz +2 more
doaj +1 more source
The untyped stack calculus and Bohm's theorem [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 The stack calculus is a functional language in which is in a Curry-Howard correspondence with classical logic. It enjoys confluence but, as well as Parigot's lambda-mu, does not admit the Bohm Theorem, typical of the lambda-calculus.
Alberto Carraro
doaj +1 more source
Relational Parametricity and Control [PDF]
Logical Methods in Computer Science, 2006 We study the equational theory of Parigot's second-order λμ-calculus in connection with a call-by-name continuation-passing style (CPS) translation into a fragment of the second-order λ-calculus.
Masahito Hasegawa
doaj +1 more source
Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications [PDF]
Logical Methods in Computer Science, 2023 Originating in Girard's Linear logic, Ehrhard and Regnier's Taylor expansion of $\lambda$-terms has been broadly used as a tool to approximate the terms of several variants of the $\lambda$-calculus. Many results arise from a Commutation theorem relating
Rémy Cerda, Lionel Vaux Auclair
doaj +1 more source