A New One-Pass Transformation into Monadic Normal Form

Authors

  • Olivier Danvy

DOI:

https://doi.org/10.7146/brics.v9i52.21767

Abstract

We present a translation from the call-by-value lambda-calculus to monadic normal forms that includes short-cut boolean evaluation. The translation is higher-order, operates in one pass, duplicates no code, generates no chains of thunks, and is properly tail recursive. It makes a crucial use of symbolic computation at translation time.

Downloads

Published

2002-12-05

How to Cite

Danvy, O. (2002). A New One-Pass Transformation into Monadic Normal Form. BRICS Report Series, 9(52). https://doi.org/10.7146/brics.v9i52.21767