Control reduction theories: the benefit of structural substitution

DOI10.1017/S0956796807006612MaRDI QIDQ3503192zbMATH OpenFDO

Authors Zena M. Ariola, Hugo Herbelin

Publication date 22 May 2008

Published in Journal of Functional Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form
• A syntactic theory of sequential control
• scientific article; zbMATH DE number 7340561
• Compositional semantics for composable continuations: from abortive to delimited control
• Publication:4490747

Cites work

• A proof-theoretic foundation of abortive continuations
• Confluence by decreasing diagrams
• The duality of computation
• The revised report on the syntactic theories of sequential control and state
• Trampolined style

Cited in

(5)

• An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form
• A type-theoretic foundation of delimited continuations
• Classical call-by-need and duality
• Fully abstract encodings of \(\lambda\)-calculus in HOcore through abstract machines
• Continuation calculus

This page was built for publication: Control reduction theories: the benefit of structural substitution

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