References

[1]

Joe Armstrong. A history of Erlang. In HOPL III: Proceedings of the third ACM SIGPLAN conference on History of programming languages, pages 6.1–6.26, New York, NY, USA, 2007. ACM.

[2]

Carl Bruggeman, Oscar Waddell, and R. Kent Dybvig. Representing control in the presence of one-shot continuations. In In Proceedings of the ACM SIGPLAN’96 Conference on Programming Language Design and Implementation, pages 99–107, 1996.

[3]

Emmanuel Chailloux et al. OCaml4MultiCore : Objective caml for multicore architectures. web site, November 2009. [link]

[4]

Chung chieh Shan. Shift to control. In Olin Shivers and Oscar Waddell, editors, Proceedings of the 5th workshop on Scheme and functional programming, pages 99–107. Indiana University, 2004.

[5]

Koen Claessen. A poor man’s concurrency monad. Journal of Functional Programming, 9(3):313–323, May 1999. Functionnal Pearls.

[6]

Russ Cox. Libtask: a coroutine library for C and Unix. Software library. [link]

[7]

Ralf S. Engelschall. GNU Pth - the GNU portable threads. Software library. [link]

[8]

D. P. Friedman. Applications of continuations. Invited Tutorial, Fifteenth Annual ACM Symposium on Principles of Programming Languages, January 1988. [link]

[9]

Steven E. Ganz, Daniel P. Friedman, and Mitchell Wand. Trampolined style. In International Conference on Functional Programming, pages 18–27, 1999.

[10]

Mark P. Jones and Paul Hudak. Implicit and explicit parallel programming in haskell. Technical Report YALEU/DCS/RR-982, Department of Computer Science, Yale University, New Haven, CT 06520-2158, 1993.

[11]

G. Kahn and D. B. MacQueen. Coroutines and networks of parallel processes. In Information processing, pages 993–998, Toronto, August 1977.

[12]

R. Kelsey, W. Clinger, and J. Rees (eds.). Revised⁵ report on the algorithmic language scheme. Higher-Order and Symbolic Computation, 11(1), 1998.

[13]

Oleg Kiselyov. How to remove a dynamic prompt: static and dynamic delimited continuation operators are equally expressible. Technical Report 611, Indiana University, March 2005. [link]

[14]

Oleg Kiselyov. Delimited control in OCaml, abstractly and concretely system description. Technical report, March 2010. Also on FLOPS 2010. [link]

[15]

Xavier Leroy. The Objective Caml system – Documentation and user’s manual. INRIA, release 3.11 edition, 2008.

[16]

Chuanpeng Li, Chen Ding, and Kai Shen. Quantifying the cost of context switch. In ExpCS ’07: Proceedings of the 2007 workshop on Experimental computer science, page 2, New York, NY, USA, 2007. ACM.

[17]

Peng Li and Steve Zdancewic. Combining events and threads for scalable network services. In Proceedings of 2007 ACM SIGPLAN Conference on Programming Languages Design and Implementation (PLDI), pages 189–199, 2007.

[18]

B. Liskov and L. Shrira. Promises: linguistic support for efficient asynchronous procedure calls in distributed systems. SIGPLAN Not., 23:260–267, June 1988. [link]

[19]

M. Douglas McIlroy. Coroutines. Internal report, Bell telephone laboratories, Murray Hill, New Jersey, May 1968.

[20]

Simon Peyton Jones. Tackling the awkward squad: monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell. In Engineering theories of software construction, Marktoberdof Summer School 2000, pages 47–96. IOS Press, 2001. [link]

[21]

Simon Peyton Jones, editor. Haskell 98 Language and Libraries – The Revised Report. Cambridge University Press, 2003.

[22]

Simon Peyton Jones. Beautiful code, chapter Beautiful concurrency. O’Reilly, 2007.

[23]

Amr Sabry, Chung chieh Shan, and Oleg Kiselyov. Native delimited continuations in (byte-code) OCaml. OCaml library, 2008. [link]

[24]

Gerd Stolpmann. Ocamlnet. [link]

[25]

Gerald Jay Sussman and Guy L. Steele. Scheme: A interpreter for extended lambda calculus. Higher-Order and Symbolic Computation, 11(4):405–439, December 1998. Reprint from AI memo 349, December 1975.

[26]

Jérôme Vouillon. Lwt: a cooperative thread library. In ML ’08: Proceedings of the 2008 ACM SIGPLAN workshop on ML, pages 3–12, New York, NY, USA, 2008. ACM.