Representing Control: a Study of the CPS Transformation

DOI10.1017/S0960129500001535zbMATH Open0941.00040DBLPjournals/mscs/DanvyF92OpenAlexW1999336811WikidataQ56430282 ScholiaQ56430282MaRDI QIDQ4493071FDOQ4493071

Authors:

Publication date: 2 August 2000

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129500001535

zbMATH Keywords

ConferenceProceedingsFunctional programmingSpecial issueNice (France)LispACM conference

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cites Work

• Call-by-name, call-by-value and the \(\lambda\)-calculus
• A syntactic theory of sequential control
• Automatic autoprojection of recursive equations with global variables and abstract data types
• Two-level semantics and abstract interpretation
• Two-level semantics and code generation
• Automatic autoprojection of higher order recursive equations

Cited In (5)

• Axioms for control operators in the CPS hierarchy
• On typing delimited continuations: Three new solutions to the printf problem
• Formal compiler construction in a logical framework
• A static simulation of dynamic delimited control
• Magic-sets for localised analysis of Java bytecode

This page was built for publication: Representing Control: a Study of the CPS Transformation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4493071)