Adding delimited and composable control to a production programming environment

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2007, Pages 165-176

  Flatt, Matthew ^a   Yu, Gang ^b   Findler, Robert Bruce ^c   Felleisen, Matthias ^d  

^a UNIVERSITY OF UTAH   (United States)

^b INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

^c UNIVERSITY OF CHICAGO   (United States)

^d NORTHEASTERN UNIVERSITY

Author keywords

Design; Languages

Indexed keywords

DYNAMIC BINDING; PLT SCHEME; PRODUCTION PROGRAMMING LANGUAGES; THEORETICAL PROGRAMMING LANGUAGES;

CONTROL THEORY; FORMAL LANGUAGES; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 38849087271     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1291151.1291178     Document Type: Conference Paper

References (32)

1. Dariusz Biernacki, Olivier Danvy, and Chung-chieh Shan. On the static and dynamic extents of delimited continuations. Science of Compututer Programming, 60(3):274-297, 2006.
2. John Clements and Matthias Felleisen. A tail-recursive machine with stack inspection. ACM Transactions on Computing Systems, 26(6):1029-1052, 2004.
3. John Clements, Matthew Flatt, and Matthias Felleisen. Modeling an algebraic stepper. In Proc. European Symposium on Programming, number 2028 in Lecture Notes in Computer Science, pages 320-334, April 2001.
4. Olivier Danvy and Andrzej Filinski. Abstracting control. In Proc. ACM Conference on Lisp and Functional Programming, pages 151-160, 1990.
5. R. Kent Dybvig, Simon Peyton Jones, and Amr Sabry. A monadic framework for delimited continuations. Journal of Functional Programming, 2006. To appear.
6. Matthias Felleisen. The theory and practice of first-class prompts. In Proc. ACM Symposium on Principles of Programming Languages, pages 180-190, 1988.
7. Matthias Felleisen. On the expressive power of programming languages. Science of Compututer Programming, 17(1-3):35-75, 1991.
8. Andrzej Filinski. Representing monads. In Proc. ACM Symposium on Principles of Programming Languages, pages 446-457, 1994.
9. Robert Bruce Findler, John Clements, Cormac Flanagan, Matthew Flatt, Shriram Krishnamurthi, Paul Stockler, and Matthias Felleisen. DrScheme: A programming environment for Scheme. Journal of Functional Programming, 12(2): 159-182, March 2002.
10. Matthew Flatt. PLT MzScheme: Language manual. Technical Report PLT-TR2007-1-V370, PLT Scheme, 2007.
11. Daniel P. Friedman and Christopher T. Haynes. Constraining control. In Proc. ACM Symposium on Principles of Programming Languages, pages 245-254, January 1985.
12. Martin Gasbichler and Michael Sperber. Final shift for call/cc: a direct implementation of shift and reset. In Proc. ACM International Conference on Functional Programming, pages 271-282, 2002.
13. Martin Gasbichler, Eric Knauel, Michael Sperber, and Richard A. Kelsey. How to add threads to a sequential language without getting tangled up. In Proc. Workshop on Scheme and Functional Programming, 2003.
14. Carl Gunter, Didier Rémy, and Jon Riecke. A generalization of exceptions and control in ML-like languages. In Proc. ACM Conference on Functional Programming and Computer Architecture, pages 12-23, 1995.
15. David Herman, Aaron Tomb, and Cormac Flanagan. Space-efficient gradual typing. In Proc. Trends in Functional Programming, 2007.
16. Robert Hieb and R. Kent Dybvig. Continuations and concurrency. In Proc. ACM Symposium on Principles and Practice of Parallel Programming, pages 128-136, 1990.
17. Robert Hieb, Kent Dybvig, and Claude W. Anderson, III. Subcontinuations. Lisp and Symbolic Computation, 7(1):83-110, 1994.
18. 5 report on the algorithmic language Scheme. ACM SIGPLAN Notices, 33(9), September 1998.
19. Richard A. Kelsey and Jonathan Rees. Scheme48, 2007. URL http://s48.org/.
20. Oleg Kiselyov. How to remove a dynamic prompt: static and dynamic delimited continuation operators are equally expressible. Technical Report TR6.1.1, Indiana University Computer Science, 2005a.
21. Oleg Kiselyov. Generic implementation of all four *F* operators: from controlo to shift, 2005b. URL http://okmij.org/ftp/computation/ continuations.html#generic-control.
22. Oleg Kiselyov, Chung-chieh Shan, and Amr Sabry. Delimited dynamic binding. In Proc. ACM International Conference on Functional Programming, pages 26-37, 2006.
23. Shriram Krishnamurthi, Peter Walton Hopkins, Jay McCarthy, Paul T. Graunke, Greg Pettyjohn, and Matthias Felleisen. Implementation and use of the PLT Scheme web server. Higher-Order and Symbolic Computation, 2007. To appear.
24. James Laird. Exceptions, continuations and macro-expressiveness. In Proc. European Symposium on Programming, pages 133-146, 2002.
25. Jacob Matthews, Robert Bruce Findler, Matthew Flatt, and Matthias Felleisen. A visual environment for developing context-sensitive term, rewriting systems. In Proc. International Conference on Rewriting Techniques and Applications, volume 3091 of Lecture Notes in Computer Science, 2004.
26. Christian Queinnec and Bernard P. Serpette. A dynamic extent control operator for partial continuations. In Proc. ACM Symposium on Principles of Programming Languages, pages 174-184, 1991.
27. Jon G. Riecke and Hayo Thielecke. Typed exceptions and continuations cannot macro-express each other. In Proc. International Colloquium on Automata, Languages and Programming, pages 635-644, 1999.
28. Chung-chieh Shan. Shift to control. In Proc. Workshop on Scheme and Functional Programming, pages 99-107, 2004.
29. Dorai Sitaram. Handling control. In Proc. ACM Conference on Programming Language Design and Implementation, pages 147-155, 1993.
30. Dorai Sitaram and Matthias Felleisen. Control delimiters and their hierarchies. Lisp and Symbolic Computation, 3(1):67-99, 1990.
31. 5,97 report on the algorithmic language Scheme, 2007.
32. Hayo Thielecke. On exceptions versus continuations in the presence of state. In Proc. European Symposium on Programming, pages 397-411, 2000.