Control reduction theories: The benefit of structural substitution

Journal of Functional Programming

Volumn 18, Issue 3, 2008, Pages 373-419

  Ariola, Zena M ^a   Herbelin, Hugo ^b  

^a UNIVERSITY OF OREGON   (United States)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

INDIANA UNIVERSITY; REDUCTION THEORY; REGULAR FUNCTION;

BIOMINERALIZATION;

CALCULATIONS;

EID: 42149148022     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796807006612     Document Type: Article

References (23)

1. Ariola, Z. M. & Herbelin, H. (2003) Minimal classical logic and control operators. In Thirtieth International Colloquium on Automata, Languages and Programming, ICALP'03, eindhoven, the Netherlands, June 30 - July 4, 2003, vol. 2719. Springer-Verlag, LNCS, pp. 871-885.
2. Ariola, Z. M., Herbelin, H. & Sabry, A. (2004) A type-theoretic foundation of continuations and prompts. In ACM Sigplan International Conference on Functional Programming. New York: ACM Press, pp. 40-53.
3. Ariola, Z. M., Herbelin, H. & Sabry, A. (2007) A proof-theoretic foundation of abortive continuations. Higher-Order and Symbolic Computation. 20(4). In press.
4. Ariola, Z. M., Herbelin, H. & Sabry, A. (2008) A type-theoretic foundation of delimited continuations. Higher-Order and Symbolic Computation. To appear.
5. Baba, K., Hirokawa, S. & etsu Fujita, K. (2001) Parallel reduction in type free λμ-calculus. Electronic notes in theoretical computer science, 42, 52-66.
6. Curien, P.-L. & Herbelin, H. (2000) The duality of computation. In ACM Sigplan International Conference on Functional Programming. New York: ACM Press, pp. 233-243.
7. de Groote, P. (1994) On the relation between the lambda-mu calculus and the syntactic theory of sequential control. In Pfennig, F. (ed), Logic Programming and Automated Reasoning, Proc. of the 5th International Conference, LPAR'94. Berlin, Heidelberg: Springer, pp. 31-43.
8. Duba, B. F., Harper, R. & MacQueen, D. (1991) Typing first-class continuations in ML. In Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, pp. 163-173.
9. Felleisen, M. (1988) The theory and practice of first-class prompts. In Proceedings of the 15th ACM symposium on Principles of Programming Languages (popl '88). New York: ACM Press, pp. 180-190.
10. Felleisen, M. & Friedman, D. (1986) Control operators, the seed machine, and the lambda-calculus. In Formal Description of Programming Concepts-iii. North-Holland, pp. 193-217.
11. Felleisen, M. & Hieb, R. (1992) The revised report on the syntactic theories of sequential control and state. Theor. Comput. Sci. 103(2), 235-271.
12. Felleisen, M., Friedman, D., Kohlbecker, E. & Duba, B. (1986) Reasoning with continuations. In First Symposium on Logic and Computer Science, pp. 131-141.
13. Felleisen, M., Friedman, D. P., Kohlbecker, E. & Duba, B. (1987) A syntactic theory of sequential control. Theor. Comput. Sci. 52(3), 205-237. Preliminary version: Reasoning with Continuations, in Proceedings of the 1st IEEE Symposium on Logic in Computer Science, 1986.
14. Filman, R. E. & Friedman, D. P. (1984) Coordinated Computing: Tools and Techniques for Distributed Software. New York: McGraw Hill.
15. Ganz, S. E., Friedman, D. P. & Wand, M. (1999) Trampolined style. In ACM sigplan international conference on functional programming. New York: ACM Press, pp. 18-27.
16. Griffin, T. G. (1990) The formulae-as-types notion of control. In Conf Record 17th Annual ACM Symp. on Principles of Programming Languages, POPL'90, s an francisco, CA, USA, 17-19 Jan 1990. New York: ACM Press, pp. 47-57.
17. Haynes, C. T & Friedman, D. P. (1984) Engines build process abstractions. In Conference record of the 1984 ACM Symposium on Lisp and Functional Programming. ACM, pp. 18-24.
18. Huet, G. & Lévy, J.-J. (1991) Computations in orthogonal rewriting systems 1 and 2. Computational Logic. Essays in Honor of Alan Robinson, ed. j.-l. lassez & g.d. plotkin.
19. Murthy, C. (1992) Control operators, hierarchies, and pseudo-classical type systems: A-translation at work. ACM Workshop on Continuations, pp. 49-71.
20. Ong, C.-H. L. & Stewart, C. A. (1997) A Curry-Howard foundation for functional computation with control. Conf. Record 24th ACM SIGPLAN-SIGACT symp. on Principles of Programming Languages, POPL'97, Paris, France, 15-17 Jan. 1997. New York: ACM Press, pp. 215-227.
21. Parigot, M. (1992) Lambda-mu-calculus: An algorithmic interpretation of classical natural deduction. In Logic Programming and Automated Reasoning: International Conference LPAR '92 Proceedings, St. Petersburg, Russia. Springer-Verlag, pp. 190-201.
22. Plotkin, G. D. (1975) Call-by-name, call-by-value, and the λ-calculus. Theor. Comput. Sci. 1, 125-159.
23. van Oostrom, V. (1994) Confluence by decreasing diagrams. Theor. Comput. Sci. 126(1), 259-280.