Delimited dynamic binding

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

Volumn 2006, Issue , 2006, Pages 26-37

  Kiselyov, Oleg ^a   Shan, Chung Chieh ^b   Sabry, Amr ^c  

^a FNMOC ^*  (United States)

^b RUTGERS UNIVERSITY   (United States)

^c INDIANA UNIVERSITY   (United States)

Author keywords

Delimited continuations; Dynamic binding; Monads

Indexed keywords

DELIMITED CONTINUATIONS; DYNAMIC BINDING; MONADS;

COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; DATABASE SYSTEMS; PROBLEM SOLVING; TRANSLATION (LANGUAGES);

WEB SERVICES;

EID: 34247251995     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1159803.1159808     Document Type: Conference Paper

References (57)

1. ARIOLA, Z. M., HERBELIN, H., AND SABRY, A. A type-theoretic foundation of continuations and prompts. In Proceedings of the ACM SIGPLAN International Conference on Functional Programming (2004), ACM Press, pp. 40-53.
2. BAKER, H. G. Shallow binding in Lisp 1.5. Communications of the ACM 21, 7 (July 1978), 565-569.
3. BAKER, H. G. Shallow binding makes functional arrays fast. ACM SIGPLAN Notices 26, 8 (Aug. 1991), 145-147.
4. BALAT, V., AND DANVY, O. Memoization in type-directed partial evaluation. In ACM SIGPLAN/SIGSOFT Conference on Generative Programming and Component Engineering (2002), D. S. Batory, C. Consel, and W. Taha, Eds., no. 2487 in Lecture Notes in Computer Science, Springer-Verlag, pp. 78-92.
5. BALAT, V., DI COSMO, R., AND FIORE, M. Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (2004), ACM Press, pp. 64-76.
6. BAWDEN, A. Reification without evaluation. Memo 946, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, 1 June 1988.
7. BIERNACKA, M., BIERNACKI, D., AND DANVY, O. An operational foundation for delimited continuations in the CPS hierarchy. Logical Methods in Computer Science 1, 2:5 (2005).
8. BIERNACKI, D., AND DANVY, O. From interpreter to logic engine by defunctionalization. In LOPSTR 2003:13th International Symposium on Logic Based Program Synthesis and Transformation (2004), M. Bruynooghe, Ed., no. 3018 in Lecture Notes in Computer Science, Springer-Verlag, pp. 143-159.
9. CARTWRIGHT, R., AND FELLEISEN, M. Extensible denotational language specifications. In Theoretical Aspects of Computer Software: International Symposium (1994), M. Hagiya and J. C. Mitchell, Eds., no. 789 in Lecture Notes in Computer Science, Springer-Verlag, pp. 244-272.
10. CLEMENTS, J., AND FELLEISEN, M. A tail-recursive semantics for stack inspections. In Programming Languages and Systems: Proceedings of ESOP 2003, 12th European Symposium on Programming (2003), P. Degano, Ed., no. 2618 in Lecture Notes in Computer Science, Springer-Verlag, pp. 22-37.
11. COBBE, R., AND FELLEISEN, M. Environmental acquisition revisited. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (2005), ACM Press, pp. 14-25.
12. DANVY, O. Type-directed partial evaluation. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (1996), ACM Press, pp. 242-257.
13. DANVY, O., AND FILINSKI, A. A functional abstraction of typed contexts. Tech. Rep. 89/12, DIKU, University of Copenhagen, Denmark, 1989. http://www.daimi.au.dk/~danvy/Papers/fatc.ps.gz.
14. DANVY, O., AND FILINSKI, A. Abstracting control. In Proceedings of the ACM Conference on Lisp and Functional Programming (27-29 June 1990), ACM Press, pp. 151-160.
15. DANVY, O., AND FILINSKI, A. Representing control: A study of the CPS transformation. Mathematical Structures in Computer Science 2, 4 (Dec. 1992), 361-391.
16. DANVY, O., AND MALMKJÆR, K. Intensions and extensions in a reflective tower. In Proceedings of the ACM Conference on Lisp and Functional Programming (1988), ACM Press, pp. 327-341.
17. DYBJER, P., AND FILINSKI, A. Normalization and partial evaluation. In APPSEM 2000: International Summer School on Applied Semantics, Advanced Lectures (2002), G. Barthe, P. Dybjer, L. Pinto, and J. Saraiva, Eds., no. 2395 in Lecture Notes in Computer Science, Springer-Verlag, pp. 137-192.
18. DTBVIG, R. K., PEYTON JONES, S. L., AND SABRY, A. A monadic framework for delimited continuations. Tech. Rep. 615, Department of Computer Science, Indiana University, June 2005.
19. FEELEY, M. Parameter objects. Scheme Request for Implementation SRFI-39. http://srfi.schemers.org/srfi-39/, 2003.
20. v-CS Conversion: A Syntactic Theory of Control and State in Imperative Higher-Order Programming Languages. PhD thesis, Computer Science Department, Indiana University, Aug. 1987. Also as Tech. Rep. 226.
21. FELLEISEN, M. The theory and practice of first-class prompts. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Jan. 1988), ACM Press, pp. 180-190.
22. FELLEISEN, M. On the expressive power of programming languages. Science of Computer Programming 17, 1-3 (1991), 35-75.
23. FELLEISEN, M., FRIEDMAN, D. P., DUBA, B. F., AND MERRILL, J. Beyond continuations. Tech. Rep. 216, Computer Science Department, Indiana University, Feb. 1987.
24. FILINSKI, A. Representing monads. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (1994), ACM Press, pp. 446-457.
25. FILINSKI, A. Representing layered monads. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (1999), ACM Press, pp. 175-188.
26. FILINSKI, A. Normalization by evaluation for the computational lambda-calculus. In Proceedings of the 5th International Conference on Typed Lambda Calculi and Applications (May 2001), S. Abramsky, Ed., no. 2044 in Lecture Notes in Computer Science, Springer-Verlag, pp. 151-165.
27. FRANZ INC. Allegro Common Lisp 8.0, 17 Mar. 2006.
28. FRIEDMAN, D. P., AND HAYNES, C. T. Constraining control. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (1985), ACM Press, pp. 245-254.
29. GASBICHLER, M., KNAUEL, E., SPERBER, M., AND KELSEY, R. A. How to add threads to a sequential language without getting tangled up. In Proceedings of the 4th Workshop on Scheme and Functional Programming (7 Nov. 2003), M. Flatt, Ed., no. UUCS-03-023 in Tech. Rep., School of Computing, University of Utah, pp. 30-1-7.
30. GASBICHLER, M., AND SPERBER, M. Processes vs. user-level threads in Scsh. In Proceedings of the 3rd Workshop on Scheme and Functional Programming (3 Oct. 2002).
31. GIL, J., AND LORENZ, D. H. Environmental acquisition - a new inheritance-like abstraction mechanism. In Proceedings of the 11th Conference on Object-Oriented Programming Systems, Languages, and Applications (6-10 Oct. 1996), vol. 31(10) of ACM SIGPLAN Notices, ACM Press, pp. 214-231.
32. GRAUNKE, P. T. Web Interactions. PhD thesis, College of Computer Science, Northeastern University, June 2003.
33. GROBAUER, B., AND YANG, Z. The second Futamura projection for type-directed partial evaluation. Higher-Order and Symbolic Computation 14, 2-3 (2001), 173-219.
34. GUNTER, C. A., RÉMY, D., AND RIECKE, J. G. A generalization of exceptions and control in ML-like languages. In Functional Programming Languages and Computer Architecture: 7th Conference (26-28 June 1995), S. L. Peyton Jones, Ed., ACM Press, pp. 12-23.
35. GUNTER, C. A., RÉMY, D., AND RIECKE, J. G. Return types for functional continuations. http://pauillac.inria.fr/~remy/work/cupto/, Sept. 1998.
36. HAYNES, C. T., AND FRIEDMAN, D. P. Embedding continuations in procedural objects. ACM Transactions on Programming Languages and Systems 9, 4 (Oct. 1997), 582-598.
37. KAMEYAMA, Y., AND HASEGAWA, M. A sound and complete axiomatization of delimited continuations. In Proceedings of the ACM SIGPLAN International Conference on Functional Programming (2003), ACM Press, pp. 177-188.
38. KISELYOV, O. General ways to traverse collections, http://okmij.org/ftp/Scheme/enumerators-callcc.html; http://okmij.org/ftp/ Computation/Continuations.html, 1 Jan. 2004.
39. KISELYOV, O., SHAN, C.-c., FRIEDMAN, D. P., AND SABRY, A. Backtracking, interleaving, and terminating monad transformers (functional pearl). In Proceedings of the ACM SIGPLAN International Conference on Functional Programming (2005), ACM Press, pp. 192-203.
40. LAWALL, J. L., AND DANVY, O. Continuation-based partial evaluation. In Proceedings of the ACM Conference on Lisp and Functional Programming (1994), ACM Press, pp. 227-238.
41. LEROY, X., AND PESSAUX, F. Type-based analysis of uncaught exceptions. ACM Transactions on Programming Languages and Systems 22, 2 (2000), 340-377.
42. LIANG, S., HUDAK, P., AND JONES, M. Monad transformers and modular interpreters. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (1995), ACM Press, pp. 333-343.
43. MATTHEWS, J. I learned today that PLT Scheme actually has two kinds of thread-local storage boxes, http://keepworkingworkerbee. blogspot.com/2005/08/i-learned-today-that-plt-scheme.html, 26 Aug. 2005.
44. 5RS Scheme. In Proceedings of the 6th Workshop on Scheme and Functional Programming (24 Sept. 2005), J. M. Ashley and M. Sperber, Eds., no. 619 in Tech. Rep., Computer Science Department, Indiana University, pp. 41-54.
45. MOGGI, E. An abstract view of programming languages. Tech. Rep. ECS-LFCS-90-113, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, 1990.
46. MOREAU, L. A syntactic theory of dynamic binding. Higher-Order and Symbolic Computation 11, 3 (1998), 233-279.
47. QUEINNEC, C. Continuations and web servers. Higher-Order and Symbolic Computation 17, 4 (Dec. 2004), 277-295.
48. SABRY, A. Note on axiomatizing the semantics of control operators. Tech. Rep. CIS-TR-96-03, Department of Computer and Information Science, University of Oregon, 1996.
49. SEWELL, P., LEIFER, J. J., WANSBROUGH, K., ZAPPA NARDELLI, F., ALLEN-WILLIAMS, M., HABOUZIT, P., AND VAFBIADIS, V. Acute: High-level programming language design for distributed computation. In Proceedings of the ACM SIGPLAN International Conference on Functional Programming (2005), ACM Press, pp. 15-26.
50. SITARAM, D. Handling control. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (June 1993), ACM Press, pp. 147-155.
51. SITARAM, D. Unwind-protect in portable Scheme. In Proceedings of the 4th Workshop on Scheme and Functional Programming (7 Nov. 2003), M. Flatt, Ed., no. UUCS-03-023 in Tech. Rep., School of Computing, University of Utah, pp. 48-52.
52. SITARAM, D., AND FELLEISEN, M. Reasoning with continuations II: Full abstraction for models of control. In Proceedings of the ACM Conference on Lisp and Functional Programming (27-29 June 1990), ACM Press, pp. 161-175.
53. SMITH, B. C. Reflection and Semantics in a Procedural Language. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Feb. 1982. Also as Tech. Rep. MIT/LCS/TR-272.
54. SUMII, E. An implementation of transparent migration on standard Scheme. In Proceedings of the Workshop on Scheme and Functional Programming (Sept. 2000), M. Felleisen, Ed., no. 00-368 in Tech. Rep., Department of Computer Science, Rice University, pp. 61-63.
55. THIELECKE, H. Contrasting exceptions and continuations, http://www.cs.bham.ac.uk/~hxt/research/exncontjournal.pdf, 2001.
56. THIEMANN, P. Combinators for program generation. Journal of Functional Programming 9, 5 (1999), 483-525.
57. WAND, M., AND FRIEDMAN, D. P. The mystery of the tower revealed: A non-reflective description of the reflective tower. Lisp and Symbolic Computation 1, 1 (1988), 11-37.