A New One-Pass Transformation into Monadic Normal Form

Danvy, Olivier

doi:10.1007/3-540-36579-6_6

Cited by 7 publications

(1 citation statement)

References 44 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The literature on ANF is scarce. Beyond the already cited original papers, Danvy has also studied them and their relationship to CPS, but usually calling them monadic normal forms [15,16,23] because of their relationship with Moggi's monadic λ-calculus [29]. That terminology however sometimes describes a more liberal notion of terms, for instance in Kennedy [24], which is also another relevant piece in the literature on ANF.…”

Section: Related Workmentioning

confidence: 99%

Crumbling Abstract Machines

Accattoli

Condoluci

Guerrieri

et al. 2019

Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming

View full text Add to dashboard Cite

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

show abstract

Section: Related Workmentioning

confidence: 99%

Crumbling Abstract Machines

Accattoli

Condoluci

Guerrieri

et al. 2019

Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming

View full text Add to dashboard Cite

show abstract

Shrinking Reductions in SML.NET

Benton

Kennedy

Lindley

et al. 2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Collapsing towers of interpreters

Amin

Rompf

2017

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Given a tower of interpreters, i.e., a sequence of multiple interpreters interpreting one another as input programs, we aim to collapse this tower into a compiler that removes all interpretive overhead and runs in a single pass. In the real world, a use case might be Python code executed by an x86 runtime, on a CPU emulated in a JavaScript VM, running on an ARM CPU. Collapsing such a tower can not only exponentially improve runtime performance, but also enable the use of base-language tools for interpreted programs, e.g., for analysis and verification. In this paper, we lay the foundations in an idealized but realistic setting. We present a multi-level lambda calculus that features staging constructs and stage polymorphism: based on runtime parameters, an evaluator either executes source code (thereby acting as an interpreter) or generates code (thereby acting as a compiler). We identify stage polymorphism, a programming model from the domain of high-performance program generators, as the key mechanism to make such interpreters compose in a collapsible way. We present Pink, a meta-circular Lisp-like evaluator on top of this calculus, and demonstrate that we can collapse arbitrarily many levels of self-interpretation, including levels with semantic modifications. We discuss several examples: compiling regular expressions through an interpreter to base code, building program transformers from modified interpreters, and others. We develop these ideas further to include reflection and reification, culminating in Purple, a reflective language inspired by Brown, Blond, and Black, which realizes a conceptually infinite tower, where every aspect of the semantics can change dynamically. Addressing an open challenge, we show how user programs can be compiled and recompiled under user-modified semantics.

show abstract

A New One-Pass Transformation into Monadic Normal Form

Cited by 7 publications

References 44 publications

Crumbling Abstract Machines

Crumbling Abstract Machines

Shrinking Reductions in SML.NET

Collapsing towers of interpreters

Contact Info

Product

Resources

About