Add to ORKGInternational audienceA simple lazy machine which runs programs written in lambda-calculus. It was introduced by the author in 1985. It has been, since, used and implemented by several authors but remained unpublished. It will appear soon in a special issue of Higher Order and Symbolic Computation
AbstractIn this paper we discuss and compare abstract machines for the lambda-calculus, implementing...
We present fully abstract encodings of the call-by-name lambda-calculus into HOcore, a minimal highe...
We present an encoding of the call-by-value $\lambda$-calculus into the $\pi$-calculus, alternative ...
We present a calculus that captures the operational semantics of call-by-need.We demonstrate t...
International audienceIn a previous paper, Benaissa, Lescanne, and Rose, have extended the weak lamb...
AbstractWe describe lambda calculus reduction strategies using big-step operational semantics and sh...
http://www.acm.orgInternational audienceWe present the lambda-bar-mu-mu-tilde-calculus, a syntax for...
We bridge the gap between compositional evaluators and abstract machines for the lambda-calculus, us...
Lambda-calculus is a language introduced by Church in 1930 aiming to build a logical basis for mathe...
Turing machines and register machines have been used for decades in theoretical computer science as ...
We bridge the gap between functional evaluators and abstract machines for the lambda-calculus, using...
The lambda-calculus with generalized applications is the Curry-Howard counterpart to the system of n...
Machine Peter Sestoft Department of Mathematics and Physics Royal Veterinary and Agricultural Univ...
The lambda-calculus with generalized applications is the Curry-Howard counterpart to the system of n...
International audienceThe Krivine machine is a simple and natural implementation of the normal weak-...
AbstractIn this paper we discuss and compare abstract machines for the lambda-calculus, implementing...
We present fully abstract encodings of the call-by-name lambda-calculus into HOcore, a minimal highe...
We present an encoding of the call-by-value $\lambda$-calculus into the $\pi$-calculus, alternative ...
We present a calculus that captures the operational semantics of call-by-need.We demonstrate t...
International audienceIn a previous paper, Benaissa, Lescanne, and Rose, have extended the weak lamb...
AbstractWe describe lambda calculus reduction strategies using big-step operational semantics and sh...
http://www.acm.orgInternational audienceWe present the lambda-bar-mu-mu-tilde-calculus, a syntax for...
We bridge the gap between compositional evaluators and abstract machines for the lambda-calculus, us...
Lambda-calculus is a language introduced by Church in 1930 aiming to build a logical basis for mathe...
Turing machines and register machines have been used for decades in theoretical computer science as ...
We bridge the gap between functional evaluators and abstract machines for the lambda-calculus, using...
The lambda-calculus with generalized applications is the Curry-Howard counterpart to the system of n...
Machine Peter Sestoft Department of Mathematics and Physics Royal Veterinary and Agricultural Univ...
The lambda-calculus with generalized applications is the Curry-Howard counterpart to the system of n...
International audienceThe Krivine machine is a simple and natural implementation of the normal weak-...
AbstractIn this paper we discuss and compare abstract machines for the lambda-calculus, implementing...
We present fully abstract encodings of the call-by-name lambda-calculus into HOcore, a minimal highe...
We present an encoding of the call-by-value $\lambda$-calculus into the $\pi$-calculus, alternative ...