-
1
The Safe Lambda Calculus
Published 2009-02-01“…In this paper, we introduce the safe lambda calculus, which is obtained by transposing (and generalizing) the safety condition to the setting of the simply-typed lambda calculus. …”
Get full text
Article -
2
The Safe Lambda Calculus
Published 2009“…In this paper, we introduce the safe lambda calculus, which is obtained by transposing (and generalizing) the safety condition to the setting of the simply-typed lambda calculus. …”
Journal article -
3
The safe lambda calculus
Published 2009“…We transpose and generalize this restriction to the setting of the simply-typed lambda calculus, giving rise to what we call the safe lambda calculus. …”
Thesis -
4
-
5
Ordered Models of the Lambda Calculus
Published 2013-12-01“…Answering a question by Honsell and Plotkin, we show that there are two equations between lambda terms, the so-called subtractive equations, consistent with lambda calculus but not simultaneously satisfied in any partially ordered model with bottom element. …”
Get full text
Article -
6
-
7
-
8
Semantics of Typed Lambda-Calculus with Constructors
Published 2011-03-01“…We present a Curry-style second-order type system with union and intersection types for the lambda-calculus with constructors of Arbiser, Miquel and Rios, an extension of lambda-calculus with a pattern matching mechanism for variadic constructors. …”
Get full text
Article -
9
Addressing Machines as models of lambda-calculus
Published 2022-07-01“…In order to obtain a model of the full untyped $\lambda$-calculus, we need to introduce a rule that bares similarities with the $\omega$-rule and the rule $\zeta_\beta$ from combinatory logic.…”
Get full text
Article -
10
On Constructor Rewrite Systems and the Lambda Calculus
Published 2012-08-01“…We prove that orthogonal constructor term rewrite systems and lambda-calculus with weak (i.e., no reduction is allowed under the scope of a lambda-abstraction) call-by-value reduction can simulate each other with a linear overhead. …”
Get full text
Article -
11
-
12
SCHEME: An Interpreter for Extended Lambda Calculus
Published 2004“…Inspired by ACTORS [Greif and Hewitt] [Smith and Hewitt], we have implemented an interpreter for a LISP-like language, SCHEME, based on the lambda calculus [Church], but extended for side effects, multiprocessing, and process synchronization. …”
Get full text
-
13
-
14
Lineal: A linear-algebraic Lambda-calculus
Published 2017-03-01“…This language extends the Lambda-calculus with the possibility to make arbitrary linear combinations of terms alpha.t + beta.u. …”
Get full text
Article -
15
RPO, Second-order Contexts, and Lambda-calculus
Published 2009-08-01“…Then, we apply such extended RPO technique to the lambda-calculus, endowed with lazy and call by value reduction strategies. …”
Get full text
Article -
16
-
17
Proof nets and the call-by-value lambda-calculus
Published 2013-03-01“…This paper gives a detailed account of the relationship between (a variant of) the call-by-value lambda calculus and linear logic proof nets. The presentation is carefully tuned in order to realize a strong bisimulation between the two systems: every single rewriting step on the calculus maps to a single step on the nets, and viceversa. …”
Get full text
Article -
18
Encoding many-valued logic in $\lambda$-calculus
Published 2021-06-01“…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 fresh constant. …”
Get full text
Article -
19
Light Logics and the Call-by-Value Lambda Calculus
Published 2008-11-01“…Designing a type assignment system for pure lambda calculus from these logics, however, is problematic. …”
Get full text
Article -
20