Obtaining coroutines with continuations
Computer Languages
Proc. of a conference on Functional programming languages and computer architecture
The theory and practice of first-class prompts
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
CML: A higher concurrent language
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Systems programming with Modula-3
Systems programming with Modula-3
Higher-order concurrency
Signatures for a network protocol stack: a systems application of Standard ML
LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
A generalization of exceptions and control in ML-like languages
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Proper tail recursion and space efficiency
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
The Definition of Standard ML
Implementing Threads in Standard ML
Advanced Functional Programming, Second International School-Tutorial Text
Continuation-based multiprocessing
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Network Protocol Stack in Standard ML
Higher-Order and Symbolic Computation
Proceedings of the 24th International Conference on Software Engineering
Final shift for call/cc:: direct implementation of shift and reset
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Integrating User-Level Threads with Processes in Scsh
Higher-Order and Symbolic Computation
Modular rollback through control logging: a pair of twin functional pearls
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Hi-index | 0.00 |
Threads can easily be implemented using first-class continuations, but the straightforward approaches for doing so lead to space leaks,especially in a language with exceptions like Standard ML. We showhow these space leaks arise and give a new implementation for threadsthat is safe for space.