Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

34

CC
2003
Springer

favoriteEmaildiscussreport

141views System Software» more CC 2003»

A New One-Pass Transformation into Monadic Normal Form

14 years 4 months ago

A New One-Pass Transformation into Monadic Normal Form

Download www.daimi.au.dk

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

Real-time Traffic

CC 2003 | Monadic Normal Forms | Programming Languages | Short-cut Boolean Evaluation | Tail Recursive |

claim paper

Related Content

» Programming monads operationally with Unimo

» On Restructuring Nested Relations in Partitioned Normal Form

» A New Proposal Of QuasiSolved Form For Equality Constraint Solving

» Monad Transformers and Modular Interpreters

» Eager Normal Form Bisimulation

» Handling Qualitative Preferences Using Normal Form Functions

» Irrelevant variability normalization based HMM training using map estimation of feature tr...

» Lightweight monadic regions

» Transformations between Signed and Classical Clause Logic

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	CC
Authors	Olivier Danvy

Comments (0)