Abstract
Starting from reduction semantics for several styles of coroutines from the literature, we apply Danvy's method to obtain equivalent functional implementations (definitional interpreters) for them. By applying existing type systems for programs with continuations, we obtain sound type systems for coroutines through the translation. The resulting type systems are similar to earlier hand-crafted ones. As a side product, we obtain implementations for these styles of coroutines in OCaml. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Anton, K., & Thiemann, P. (2010). Towards deriving type systems and implementations for coroutines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6461 LNCS, pp. 63–79). https://doi.org/10.1007/978-3-642-17164-2_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
