A first-order one-pass CPS transformation

DOI10.1016/S0304-3975(02)00733-8zbMath1049.03013MaRDI QIDQ1884883

Lasse R. Nielsen, Olivier Danvy

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

\(\lambda\)-calculusAdministrative reductionsContinuation-passing styleContinuationsCPS transformation

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items (6)

A Functional Abstraction of Typed Invocation Contexts ⋮ Analyzing the environment structure of higher-order languages using frame strings ⋮ Mechanized Verification of CPS Transformations ⋮ Effect handlers via generalised continuations ⋮ On one-pass CPS transformations ⋮ Continuation passing style for effect handlers

Uses Software

• TALx86

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Notions of computation and monads
• The lambda calculus. Its syntax and semantics. Rev. ed.
• CPS transformation of beta-redexes
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Definitional interpreters for higher-order programming languages
• Back to direct style
• Secure information flow via linear continuations
• RULE 2001. Proceedings of the 2nd international workshop on rule-based programming (Satellite Event of PLI 2001), Florence, Italy, September 4, 2001
• Representing Control: a Study of the CPS Transformation
• CPS transformation of flow information
• A Simple CPS Transformation of Control-Flow Information
• Correctness of procedure representations in higher-order assembly language

This page was built for publication: A first-order one-pass CPS transformation