A functional correspondence between evaluators and abstract machines

Ager, Mads Sig; Biernacki, Dariusz; Danvy, Olivier; Midtgaard, Jan

doi:10.1145/888251.888254

Cited by 91 publications

(63 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Without this initial step, formulating an appropriate specification for the lambda calculus compiler becomes significantly more complicated, as in (Meijer, 1992), due to the presence of a function type in the value domain. The same idea was also used in the work of Ager et al (2003a) to simplify the derivation of abstract machines.…”

Section: Reflectionmentioning

confidence: 99%

Calculating correct compilers

Bahr¹,

Hutton²

2015

J. Funct. Prog.

View full text Add to dashboard Cite

In this article we present a new approach to the problem of calculating compilers. In particular, we develop a simple but general technique that allows us to derive correct compilers from highlevel semantics by systematic calculation, with all details of the implementation of the compilers falling naturally out of the calculation process. Our approach is based upon the use of standard equational reasoning techniques, and has been applied to calculate compilers for a wide range of language features and their combination, including arithmetic expressions, exceptions, state, various forms of lambda calculi, bounded and unbounded loops, non-determinism, and interrupts. All the calculations in the article have been formalised using the Coq proof assistant, which serves as a convenient interactive tool for developing and verifying the calculations.

show abstract

Section: Reflectionmentioning

confidence: 99%

Calculating correct compilers

Bahr¹,

Hutton²

2015

J. Funct. Prog.

View full text Add to dashboard Cite

show abstract

“…We initially perform this calculation using the standard two step approach [1]: transformation into continuationpassing style, followed by defunctionalisation. Then in section 3 we show how these two transformation steps can be combined into a single step.…”

Section: Arithmetic Expressionsmentioning

confidence: 99%

“…Finally, our original evaluation function can now be redefined in terms of the new version by taking the identity function as the continuation in specification (1), which results in the definition eval x = eval x (λn → n).…”

Section: Step 1 -Add Continuationsmentioning

confidence: 99%

See 1 more Smart Citation

Cutting Out Continuations

Hutton

Bahr

2016

A List of Successes That Can Change the World

View full text Add to dashboard Cite

Abstract. In the field of program transformation, one often transforms programs into continuation-passing style to make their flow of control explicit, and then immediately removes the resulting continuations using defunctionalisation to make the programs first-order. In this article, we show how these two transformations can be fused together into a single transformation step that cuts out the need to first introduce and then eliminate continuations. Our approach is calculational, uses standard equational reasoning techniques, and is widely applicable.

show abstract

“…More recently, Ager, Biernacki, Danvy, and Midtgaard have addressed the problem of deriving abstract machines, including Krivine's machine, using continuation passing style transformations applied to evaluators and interpreters of the λ-calculus [3,4]. This is a slightly different approach than the one we have chosen here, because it relates programs (interpreters and abstract machines) that implement the same reduction strategy.…”

Section: Proof Of the Lazy Krivine Machinementioning

confidence: 99%

Explaining the lazy Krivine machine using explicit substitution and addresses

Lang

2007

Higher-Order Symb Comput

View full text Add to dashboard Cite

Abstract. In a previous paper, Benaissa, Lescanne, and Rose, have extended the weak lambda-calculus of explicit substitution λσw with addresses, so that it gives an account of the sharing implemented by lazy functional language interpreters. We show in this paper that their calculus, called λσ a w , fits well to the lazy Krivine machine, which describes the core of a lazy (call-by-need) functional programming language implementation. The lazy Krivine machine implements term evaluation sharing, that is essential for efficiency of such languages. The originality of our proof is that it gives a very detailed account of the implemented strategy.

show abstract

A functional correspondence between evaluators and abstract machines

Cited by 91 publications

References 22 publications

Calculating correct compilers

Calculating correct compilers

Cutting Out Continuations

Explaining the lazy Krivine machine using explicit substitution and addresses

Contact Info

Product

Resources

About