Compiling with continuations, continued

Kennedy, Andrew

doi:10.1145/1291151.1291179

Cited by 63 publications

(50 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The intermediate form, originally expressed in the source functional language, was designed to allow code optimization. More specialized intermediate languages, such as the A-normal forms, [9], first-order intermediate languages, [10], and CPS languages, [17], were introduced to reduce the size of the intermediate representation of the code, and perform better optimizations. Our intermediate language is designed to be close to the target of our compilation, which is scripting languages such as JavaScript and Python.…”

Section: Comparisons With Other Workmentioning

confidence: 99%

A Provably Correct Compilation of Functional Languages into Scripting Languages

Giannini¹,

Shaqiri²

2017

SACS

View full text Add to dashboard Cite

In this paper we consider the problem of translating core F#, a typed functional language including mutable variables and exception handling, into scripting languages such as JavaScript or Python. In previous work, we abstracted the most significant characteristics of scripting languages in an intermediate language (IL for short). IL is a block-structured imperative language in which a definition of a name does not have to statically precede its use. We define a bigstep operational semantics for core F# and for IL and formalise the translation of F# expressions into IL. The main contribution of the paper is the proof of correctness of the given translation, which is done by showing that the evaluation of a well-typed F# program converges to a primitive value if and only if the evaluation of its translation into IL converges to the same value.

show abstract

Section: Comparisons With Other Workmentioning

confidence: 99%

A Provably Correct Compilation of Functional Languages into Scripting Languages

Giannini¹,

Shaqiri²

2017

SACS

View full text Add to dashboard Cite

show abstract

“…When this function gets called the first time, it starts out by decrypting the encrypted instructions (offsets 5-11), thus replacing the encrypted code in memory. Subsequently (offsets [12][13][14], it replaces its first instruction by a direct jump in order to skip over the decryption loop in future executions. The remaining code (offsets [15][16][17][18][19][20][21][22][23], which is also the target of that jump, simply performs the callback function call and then returns 1.…”

Section: Flexibilitymentioning

confidence: 99%

“…I is an untyped, or rather, dynamically typed CPS-variant of S, inspired by Kennedy's intermediate language [12]. Parts of it are shown in Figure 5.…”

Section: Intermediate Language Imentioning

confidence: 99%

Pilsner: a compositionally verified compiler for a higher-order imperative language

Neis

Hur

Kaiser

et al. 2015

Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming

View full text Add to dashboard Cite

Compiler verification is essential for the construction of fully verified software, but most prior work (such as CompCert) has focused on verifying whole-program compilers. To support separate compilation and to enable linking of results from different verified compilers, it is important to develop a compositional notion of compiler correctness that is modular (preserved under linking), transitive (supports multi-pass compilation), and flexible (applicable to compilers that use different intermediate languages or employ non-standard program transformations).In this paper, building on prior work of Hur et al., we develop a novel approach to compositional compiler verification based on parametric inter-language simulations (PILS). PILS are modular: they enable compiler verification in a manner that supports separate compilation. PILS are transitive: we use them to verify Pilsner, a simple (but non-trivial) multi-pass optimizing compiler (programmed in Coq) from an ML-like source language S to an assembly-like target language T, going through a CPS-based intermediate language. Pilsner is the first multi-pass compiler for a higher-order imperative language to be compositionally verified. Lastly, PILS are flexible: we use them to additionally verify (1) Zwickel, a direct non-optimizing compiler for S, and (2) a handcoded self-modifying T module, proven correct w.r.t. an S-level specification. The output of Zwickel and the self-modifying T module can then be safely linked together with the output of Pilsner. All together, this has been a significant undertaking, involving several person-years of work and over 55,000 lines of Coq.

show abstract

“…This uses the standard de Bruijn machinery to perform the substitution [Pierce 2002]. More efficient imperative algorithms exist [Appel and Jim 1997, Benton et al 2004, Kennedy 2007. The key point is that these algorithms are intensional.…”

Section: Intensional Analysismentioning

confidence: 99%

Unembedding domain-specific languages

Atkey

Lindley

Yallop

2009

Proceedings of the 2nd ACM SIGPLAN Symposium on Haskell

View full text Add to dashboard Cite

Higher-order abstract syntax provides a convenient way of embedding domain-specific languages, but is awkward to analyse and manipulate directly.We explore the boundaries of higher-order abstract syntax. Our key tool is the unembedding of embedded terms as de Bruijn terms, enabling intensional analysis. As part of our solution we present techniques for separating the definition of an embedded program from its interpretation, giving modular extensions of the embedded language, and different ways to encode the types of the embedded language.

show abstract

Compiling with continuations, continued

Cited by 63 publications

References 32 publications

A Provably Correct Compilation of Functional Languages into Scripting Languages

A Provably Correct Compilation of Functional Languages into Scripting Languages

Pilsner: a compositionally verified compiler for a higher-order imperative language

Unembedding domain-specific languages

Contact Info

Product

Resources

About