A Hierarchy for Delimited Continuations in Call-by-Name

DOI10.1007/978-3-642-12032-9_26zbMath1284.03139OpenAlexW2126896456MaRDI QIDQ3557863

Alexis Saurin

Publication date: 27 April 2010

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12032-9_26

zbMATH Keywords

abstract machinedelimited controlBöhm theoremstreamsCPS translation\(\Lambda \mu \)-calculusCPS hierarchy

Mathematics Subject Classification ID

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

Related Items (2)

Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus ⋮ The approximation theorem for the Λμ-calculus

This page was built for publication: A Hierarchy for Delimited Continuations in Call-by-Name