An approach to call-by-name delimited continuations

DOI10.1145/1328438.1328484zbMath1295.68063OpenAlexW2062436529MaRDI QIDQ3189857

Hugo Herbelin, Silvia Ghilezan

Publication date: 12 September 2014

Published in: Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00524949/file/popl-HerGhi08-cbn-delim.pdf

zbMATH Keywords

classical logicdelimited controlBöhm separabilityobservational completeness

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (5)

Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus ⋮ Call-by-name extensionality and confluence ⋮ A Classical Sequent Calculus with Dependent Types ⋮ Unnamed Item ⋮ The approximation theorem for the Λμ-calculus

This page was built for publication: An approach to call-by-name delimited continuations