Results 21 to 30 of about 230,472 (297)
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
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 +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.
Sabel, David +2 more
core +1 more source
A Lambda-Calculus with Constructors [PDF]
, 2006 We present an extension of the λ(η)-calculus with a case construct that propagates through functions like a head linear substitution, and show that this construction permits to recover the expressiveness of ML-style pattern matching. We then prove that this system enjoys the Church-Rosser property using a semi-automatic ‘divide and conquer' technique ...
Arbiser, Ariel +2 more
openaire +3 more sources
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
BRICS Report Series, 1995 This paper introduces trust analysis for higher-order languages. Trust<br />analysis encourages the programmer to make explicit the trustworthiness of<br />data, and in return it can guarantee that no mistakes with respect to trust will<br />be made at run-time.
Jens Palsberg, Peter Ørbæk
openaire +3 more sources
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