Author:
Harper Robert,Duba Bruce F.,Macqueen David
Abstract
AbstractAn extension of ML with continuation primitives similar to those found in Scheme is considered. A number of alternative type systems are discussed, and several programming examples are given. A continuation-based operational semantics is defined for a small, purely functional language, and the soundness of the Damas–Milner polymorphic type assignment system with respect to this semantics is proved. The full Damas–Milner type system is shown to be unsound in the presence of first-class continuations. Restrictions on polymorphism similar to those introduced in connection with reference types are shown to suffice for soundness.
Publisher
Cambridge University Press (CUP)
Reference42 articles.
1. Wand M. (1980) Continuation-based multiprocessing. In Conference Record of the 1980 LISP Conference, pp. 19–28.
2. Type inference for polymorphic references
3. Tofte M. (1988) Operational Semantics and Polymorphic Type Inference. PhD thesis, Edinburgh University, 1988. Available as Edinburgh University Laboratory for Foundations of Computer Science Technical Report ECS-LFCS-88-54.
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A General Fine-Grained Reduction Theory for Effect Handlers;Proceedings of the ACM on Programming Languages;2023-08-30
2. The history of Standard ML;Proceedings of the ACM on Programming Languages;2020-06-12
3. A verified abstract machine for functional coroutines;Electronic Proceedings in Theoretical Computer Science;2016-06-19
4. A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations;ACM Transactions on Programming Languages and Systems;2015-10-16
5. Proving termination of evaluation for System F with control operators;Electronic Proceedings in Theoretical Computer Science;2013-09-04