Sciweavers

Share
CC
2003
Springer

A New One-Pass Transformation into Monadic Normal Form

10 years 6 months ago
A New One-Pass Transformation into Monadic Normal Form
We present a translation from the call-by-value λ-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.
Olivier Danvy
Added 06 Jul 2010
Updated 06 Jul 2010
Type Conference
Year 2003
Where CC
Authors Olivier Danvy
Comments (0)
books