Obtaining coroutines with continuations
Computer Languages
Abstracting timed preemption with engines
Computer Languages
Abstract continuations: a mathematical semantics for handling full jumps
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
Reification without evaluation
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
Computer Languages
Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Notions of computation and monads
Information and Computation
No assembly required: compiling standard ML to C
ACM Letters on Programming Languages and Systems (LOPLAS)
Lisp and Symbolic Computation
Lisp and Symbolic Computation - Special issue on continuations—part I
CONS should not CONS its arguments, part II: Cheney on the M.T.A.
ACM SIGPLAN Notices
Lisp and Symbolic Computation
A model and stack implementation of multiple environments
Communications of the ACM
Böhm and Jacopini's reduction of flow charts
Communications of the ACM
An indeterminate constructor for applicative programming
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Design of a Concurrent and Distributed Language
Proceedings of the US/Japan Workshop on Parallel Symbolic Computing: Languages, Systems, and Applications
Continuation-based multiprocessing
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
Definitional interpreters for higher-order programming languages
ACM '72 Proceedings of the ACM annual conference - Volume 2
A Portable Multiprocessor Interface for Standard ML of New Jersey
A Portable Multiprocessor Interface for Standard ML of New Jersey
Workflow enactment with continuation and future objects
OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Advanced control flow in Java card programming
Proceedings of the 2004 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
A type-theoretic foundation of continuations and prompts
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
A syntactic correspondence between context-sensitive calculi and abstract machines
Theoretical Computer Science
Tasks: language support for event-driven programming
Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Status report: specifying javascript with ML
ML '07 Proceedings of the 2007 workshop on Workshop on ML
A concrete framework for environment machines
ACM Transactions on Computational Logic (TOCL)
A portable javascript thread library for Ajax applications
Companion to the 22nd ACM SIGPLAN conference on Object-oriented programming systems and applications companion
Information Processing Letters
Control reduction theories: The benefit of structural substitution
Journal of Functional Programming
Kilim: Isolation-Typed Actors for Java
ECOOP '08 Proceedings of the 22nd European conference on Object-Oriented Programming
CHR for Imperative Host Languages
Constraint Handling Rules
DSL '09 Proceedings of the IFIP TC 2 Working Conference on Domain-Specific Languages
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Selective tail call elimination
SAS'03 Proceedings of the 10th international conference on Static analysis
Inter-deriving semantic artifacts for object-oriented programming
Journal of Computer and System Sciences
From reduction-based to reduction-free normalization
AFP'08 Proceedings of the 6th international conference on Advanced functional programming
Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation
A new method for dependent parsing
ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
Space-efficient gradual typing
Higher-Order and Symbolic Computation
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Constructing customized interpreters from reusable evaluators using GAME
SC'12 Proceedings of the 11th international conference on Software Composition
Molecule: using monadic and streaming I/O to compose process networks on the JVM
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
Proceedings of the 2nd edition on Programming systems, languages and applications based on actors, agents, and decentralized control abstractions
PEPM '13 Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation
Proceedings of the first ACM SIGPLAN workshop on Functional art, music, modeling & design
Deriving interpretations of the gradually-typed lambda calculus
Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation
| Hi-index | 0.00 |
A trampolined program is organized as a single loop in which computations are scheduled and their execution allowed to proceed in discrete steps. Writing programs in trampolined style supports primitives for multithreading without language support for continuations. Various forms of trampolining allow for different degrees of interaction between threads. We present two architectures based on an only mildly intrusive trampolined style. Concurrency can be supported at multiple levels of granularity by performing the trampolining transformation multiple times.