AbstractIn this paper we discuss and compare abstract machines for the lambda-calculus, implementing various evaluation strategies. Starting from the well-known Categorical abstract machine (CAM) and Krivine's abstract machine (KAM), we develop two families of machines that differ in the way they treat environments. The first family is inspired by the work on closed reduction strategies, whereas the second is built in the spirit of the jumping machines based on the work done on Linear Logic
Taha and Nielsen have developed a multi-stage calculus {\lambda}{\alpha} witha sound type system usi...
We present a systematic construction of environment-based abstract machines from context-sensitive c...
AbstractThe Cartesian closed categories have been shown by several authors to provide the right fram...
AbstractIn this paper we discuss and compare abstract machines for the lambda-calculus, implementing...
Curien's CAM is an environment machine for the untyped lambda -calculus based on cartesian closed ca...
AbstractWe present a nondeterministic calculus of closures for the evaluation of λ-calculus, which i...
We bridge the gap between functional evaluators and abstract machines for the lambda-calculus, using...
We materialize the common belief that calculi with explicit substitutions provide an intermediate st...
Machine Peter Sestoft Department of Mathematics and Physics Royal Veterinary and Agricultural Univ...
International audienceThe λ-calculus is a peculiar computational model whose definition does not com...
International audienceThe Krivine machine is a simple and natural implementation of the normal weak-...
AbstractCurien's CAM is an environment machine for the untyped λ-calculus based on cartesian closed ...
The paper presents an approach to system modelling in design of both hardware and software systems. ...
AbstractWe introduce a new kind of abstract machine based on the chemical metaphor used in the Γ lan...
It is well-known that many environment-based abstract machines can be seen as strategies in lambda c...
Taha and Nielsen have developed a multi-stage calculus {\lambda}{\alpha} witha sound type system usi...
We present a systematic construction of environment-based abstract machines from context-sensitive c...
AbstractThe Cartesian closed categories have been shown by several authors to provide the right fram...
AbstractIn this paper we discuss and compare abstract machines for the lambda-calculus, implementing...
Curien's CAM is an environment machine for the untyped lambda -calculus based on cartesian closed ca...
AbstractWe present a nondeterministic calculus of closures for the evaluation of λ-calculus, which i...
We bridge the gap between functional evaluators and abstract machines for the lambda-calculus, using...
We materialize the common belief that calculi with explicit substitutions provide an intermediate st...
Machine Peter Sestoft Department of Mathematics and Physics Royal Veterinary and Agricultural Univ...
International audienceThe λ-calculus is a peculiar computational model whose definition does not com...
International audienceThe Krivine machine is a simple and natural implementation of the normal weak-...
AbstractCurien's CAM is an environment machine for the untyped λ-calculus based on cartesian closed ...
The paper presents an approach to system modelling in design of both hardware and software systems. ...
AbstractWe introduce a new kind of abstract machine based on the chemical metaphor used in the Γ lan...
It is well-known that many environment-based abstract machines can be seen as strategies in lambda c...
Taha and Nielsen have developed a multi-stage calculus {\lambda}{\alpha} witha sound type system usi...
We present a systematic construction of environment-based abstract machines from context-sensitive c...
AbstractThe Cartesian closed categories have been shown by several authors to provide the right fram...