Lazy evaluation and delimited control

DOI10.1145/1480881.1480903zbMath1315.68049arXiv1003.5197OpenAlexW2051431350MaRDI QIDQ5261514

Andrew Lumsdaine, Amr Sabry, Ronald Garcia

Publication date: 3 July 2015

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

Full work available at URL: https://arxiv.org/abs/1003.5197

zbMATH Keywords

lambda calculusreduction semanticsabstract machinescall-by-needdelimited continuations

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (5)

Three Syntactic Theories for Combinatory Graph Reduction ⋮ Classical Call-by-Need and Duality ⋮ Inter-deriving semantic artifacts for object-oriented programming ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Lazy evaluation and delimited control