Cutting Out Continuations

DOI10.1007/978-3-319-30936-1_10zbMath1343.68041OpenAlexW2463394296WikidataQ58061571 ScholiaQ58061571MaRDI QIDQ3188285

G. Hutton, P. Bähr

Publication date: 17 August 2016

Published in: A List of Successes That Can Change the World (Search for Journal in Brave)

Full work available at URL: http://eprints.nottingham.ac.uk/32703/

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Related Items (1)

Programming language semantics: It’s easy as 1,2,3

Uses Software

• GitHub

Cites Work

• Unnamed Item
• A functional correspondence between call-by-need evaluators and lazy abstract machines
• A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
• Deriving Target Code as a Representation of Continuation Semantics
• Calculating correct compilers
• The Mechanical Evaluation of Expressions

This page was built for publication: Cutting Out Continuations