Skip to main content
Journal ArticleOPEN ACCESS

A new one-pass transformation into monadic normal form

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2003) 2622 77-89
DOI: 10.1007/3-540-36579-6_6
8Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Danvy, O. (2003). A new one-pass transformation into monadic normal form. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2622, 77–89. https://doi.org/10.1007/3-540-36579-6_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free