Results 21 to 30 of about 14,639 (283)
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
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
Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus [PDF]
Logical Methods in Computer Science, 2012 Inspired by a recent graphical formalism for lambda-calculus based on linear logic technology, we introduce an untyped structural lambda-calculus, called lambda j, which combines actions at a distance with exponential rules decomposing the substitution ...
Beniamino Accattoli, Delia Kesner
doaj +1 more source
Krivine Machine and Taylor Expansion in a Non-uniform Setting [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 The Krivine machine is an abstract machine implementing the linear head reduction of lambda-calculus. Ehrhard and Regnier gave a resource sensitive version returning the annotated form of a lambda-term accounting for the resources used by the linear head
Antoine Allioux
doaj +1 more source
Simulation in the call-by-need lambda-calculus with letrec [PDF]
, 2010 This paper shows the equivalence of applicative similarity and contextual approximation, and hence also of bisimilarity and contextual equivalence, in the deterministic call-by-need lambda calculus with letrec.
Machkasova, Elena +2 more
core +1 more source