Author:
ARIOLA ZENA M.,HERBELIN HUGO
Abstract
AbstractThe historical design of the call-by-value theory of control relies on the reification of evaluation contexts as regular functions and on the use of ordinary term application for jumping to a continuation. To the contrary, thecontrol calculus, developed by the authors, distinguishes betweenjumpsandterms. This alternative calculus, which derives from Parigot's λμ-calculus, works by directstructural substitutionof evaluation contexts. We review and revisit the legacy theories of control and argue thatprovides an observationally equivalent but smoother theory. In an additional note contributed by Matthias Felleisen, we review the story of the birth of control calculi during the mid- to late-eighties at Indiana University.
Publisher
Cambridge University Press (CUP)
Reference23 articles.
1. Parallel Reduction in Type Free λμ-Calculus
2. Confluence by decreasing diagrams
3. Murthy C. (1992) Control operators, hierarchies, and pseudo-classical type systems: A- translation at work. ACM Workshop on Continuations, pp. 49–71.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Fully Abstract Encodings of $\lambda$-Calculus in HOcore through Abstract Machines;Logical Methods in Computer Science;2024-07-03
2. Sequent calculus as a compiler intermediate language;ACM SIGPLAN Notices;2016-12-05
3. Sequent calculus as a compiler intermediate language;Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming;2016-09-04
4. Compositional semantics for composable continuations;ACM SIGPLAN Notices;2014-11-26
5. Compositional semantics for composable continuations;Proceedings of the 19th ACM SIGPLAN international conference on Functional programming;2014-08-19