Results 21 to 30 of about 31,361 (278)
Non-idempotent types for classical calculi in natural deduction style [PDF]
Logical Methods in Computer Science, 2020 In the first part of this paper, we define two resource aware typing systems for the {\lambda}{\mu}-calculus based on non-idempotent intersection and union types.
Delia Kesner, Pierre Vial
doaj +1 more source
Superdeduction in Lambda-Bar-Mu-Mu-Tilde [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Superdeduction is a method specially designed to ease the use of first-order theories in predicate logic. The theory is used to enrich the deduction system with new deduction rules in a systematic, correct and complete way.
Clément Houtmann
doaj +1 more source
Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi [PDF]
Logical Methods in Computer Science, 2009 The intuitionistic fragment of the call-by-name version of Curien and Herbelin's \lambda\_mu\_{\~mu}-calculus is isolated and proved strongly normalising by means of an embedding into the simply-typed lambda-calculus.
Jose Espirito Santo +2 more
doaj +1 more source
A strong call-by-need calculus [PDF]
Logical Methods in Computer Science, 2023 We present a call-by-need $\lambda$-calculus that enables strong reduction (that is, reduction inside the body of abstractions) and guarantees that arguments are only evaluated if needed and at most once.
Thibaut Balabonski +2 more
doaj +1 more source
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 +3 more sources
The Safe Lambda Calculus [PDF]
Logical Methods in Computer Science, 2009 Safety is a syntactic condition of higher-order grammars that constrains occurrences of variables in the production rules according to their type-theoretic order. In this paper, we introduce the safe lambda calculus, which is obtained by transposing (and
William Blum, C. -H. Luke Ong
doaj +1 more source
Non-idempotent intersection types and strong normalisation [PDF]
Logical Methods in Computer Science, 2013 We present a typing system with non-idempotent intersection types, typing a term syntax covering three different calculi: the pure {\lambda}-calculus, the calculus with explicit substitutions {\lambda}S, and the calculus with explicit substitutions ...
Alexis Bernadet, Stéphane Jean Lengrand
doaj +1 more source
Fully Abstract Encodings of $\lambda$-Calculus in HOcore through Abstract Machines [PDF]
Logical Methods in Computer ScienceWe present fully abstract encodings of the call-by-name and call-by-value $\lambda$-calculus into HOcore, a minimal higher-order process calculus with no name restriction.
Małgorzata Biernacka +5 more
doaj +1 more source
Extensional Models of Untyped Lambda-mu Calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 This paper proposes new mathematical models of the untyped Lambda-mu calculus. One is called the stream model, which is an extension of the lambda model, in which each term is interpreted as a function from streams to individual data. The other is called
Koji Nakazawa, Shin-ya Katsumata
doaj +1 more source
Labelled Lambda-calculi with Explicit Copy and Erase [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We present two rewriting systems that define labelled explicit substitution lambda-calculi. Our work is motivated by the close correspondence between Levy's labelled lambda-calculus and paths in proof-nets, which played an important role in the ...
Maribel Fernández, Nikolaos Siafakas
doaj +1 more source