Jun 13, 2007 · This machine uses weak head reduction to execute λ-calculus, which means that the active redex must be at the very beginning of the λ- term.
Oct 25, 2007 · Abstract. We present a particularly simple lazy lambda-calculus machine, which was introduced twenty-five years ago. It has been, since, used ...
We present a particularly simple lazy lambda-calculus machine, which was introduced twenty-five years ago. It has been, since, used and implemented by ...
The Krivine Abstract Machine (KAM) [57] is a standard call-by-name stack machine which gives an especially simple operational semantics to the λ-calculus. That ...
This machine was conceived in order to execute programs obtained from mathematical proofs, by means of the Curry-Howard (also known as “proof- ...
We consider an extension of the Krivine machine for the call-by-name lambda calculus, which includes strict operators and imperative features. We show that the ...
This paper examines the old question of the relationship between ISWIM and the λ-calculus, using the distinction between call-by-value and call-by-name.
People also ask
Is lambda calculus still used?
What was the purpose of inventing the lambda calculus?
What is a redex in lambda calculus?
What is the lambda calculus equivalent to?
To study call-by-name, we define a call-by-name ISWIM, corresponding ;IO a certain modification of the SECD machine, which keeps the above notion of value, and ...
Call-by-name (CBN) refers to a style of evaluation of the λ-calculus in which identifiers refer to arbitrary terms.
The mismatch between the operational semantics of the lambda calculus and the actual behavior of implemen- tations is a major obstacle for compiler writers.