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.

• Type: Conference
• Year: 2003
• Where: CC
• Authors: Olivier Danvy
• Keywords: CC 2003, Monadic Normal Forms, Programming Languages, Short-cut Boolean Evaluation, Tail Recursive