A type-theoretic foundation of delimited continuations-Reference-Cited by-同舟云学术

A type-theoretic foundation of delimited continuations

Published:2007-10-24 Issue:3 Volume:22 Page:233-273
ISSN:1388-3690
Container-title:Higher-Order and Symbolic Computation
language:en
Short-container-title:Higher-Order Symb Comput

Author:

Ariola Zena M.,Herbelin Hugo,Sabry Amr

Publisher

Springer Science and Business Media LLC

Subject

Computer Science Applications,Software

Link

http://link.springer.com/content/pdf/10.1007/s10990-007-9006-0.pdf

Reference52 articles.

1. Lecture Notes in Comput. Sci.;Z.M. Ariola,2003

2. Ariola, Z.M., Herbelin, H.: Control reduction theories: the benefit of structural substitution. J. Funct. Program. (2007, to appear)

3. Ariola, Z.M., Herbelin, H., Sabry, A.: A type-theoretic foundation of continuations and prompts. In: ACM SIGPLAN International Conference on Functional Programming, pp. 40–53. ACM Press, New York (2004)

4. Baba, K., Hirokawa, S., Fujita, K.: Parallel reduction in type free λ μ-calculus. Electron. Notes Theor. Comput. Sci. 42, 52–66 (2001)

5. Lecture Notes in Comput. Sci.;F. Barbanera,1993

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A typed lambda-calculus with first-class configurations;Journal of Logic and Computation;2022-10-11

2. A computational interpretation of compact closed categories: reversible programming with negative and fractional types;Proceedings of the ACM on Programming Languages;2021-01-04

3. A Classical Sequent Calculus with Dependent Types;ACM Transactions on Programming Languages and Systems;2019-06-21

4. Handling delimited continuations with dependent types;Proceedings of the ACM on Programming Languages;2018-07-30

5. A Classical Sequent Calculus with Dependent Types;Programming Languages and Systems;2017