A proof-theoretic foundation of abortive continuations

Higher-Order and Symbolic Computation

Volumn 20, Issue 4, 2007, Pages 403-429

  Ariola, Zena M ^a   Herbelin, Hugo ^b   Sabry, Amr ^c  

^a UNIVERSITY OF OREGON   (United States)

^b INRIA   (France)

^c INDIANA UNIVERSITY   (United States)

Author keywords

Callcc; Classical logic; Intuitionistic logic; Minimal logic

Indexed keywords

CONTROL THEORY; SEMANTICS; THEOREM PROVING;

CLASSICAL LOGIC; INTUITIONISTIC LOGIC; MINIMAL LOGIC;

LOGIC PROGRAMMING;

EID: 36549088229     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10990-007-9007-z     Document Type: Article

References (32)

1. Ariola, Z.M., Herbelin, H.: 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. Lecture Notes in Computer Science, vol. 2719, pp. 871-885. Springer, New York (2003)
2. Ariola, Z.M., Herbelin, H., Sabry, A.: A type-theoretic foundation of continuations and prompts. In: ACM SIGPLAN International Conference on Functional Programming, pp. 40-53. ACM Press, New York (2004)
3. Ariola, Z.M., Herbelin, H., Sabry, A.: A proof-theoretic foundation of abortive continuations (extended version). Technical Report TR608, Computer Science Department, Indiana University (2005)
4. Avron, A.: Natural 3-valued logics-characterization and proof theory. J. Symb. Log. 56(1), 276-294 (1991)
5. Barbanera, F., Berardi, S.: Extracting constructive content from classical logic via control-like reductions. In: Bezem, M., Groote, J.F. (eds.) Proceedings 1st Intl. Conf. on Typed Lambda Calculi and Applications, TLCA'93, Utrecht, The Netherlands, 16-18 March 1993. Lecture Notes in Computer Science, vol. 664, pp. 45-59. Springer, Berlin (1993)
6. Barendregt, H.P.: Lambda calculi with types. In: Maibaum, A.G. (ed.) Handbook of Logic in Computer Science, vol. 2, pp. 117-309. Oxford University Press, Oxford (1992)
7. Bierman, G.: A computational interpretation of the lambda-mu calculus. In: Brim, L., Gruska, J., Zlatuska, J. (eds.) Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol. 1450, pp. 336-345. Springer, New York (1998)
8. Crolard, T.: A confluent lambda-calculus with a catch/throw mechanism. J. Funct. Program. 9(6), 625-647 (1999)
9. de Groote, P.: 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, pp. 31-43. Springer, Berlin (1994)
10. de Groote, P.: An environment machine for the lambda-mu-calculus. Math. Struct. Comput. Sci. 8(6), 637-669 (1998)
11. Felleisen, M.: The theory and practice of first-class prompts. In: Proceedings of the 15th ACM Symposium on Principles of Programming Languages (POPL'88), pp. 180-190. ACM Press, New York (1988)
12. Felleisen, M.: On the expressive power of programming languages. In: Jones, N. (ed.) ESOP'90 3rd European Symposium on Programming, Copenhagen, Denmark. Lecture Notes in Computer Science, vol. 432, pp. 134-151. Springer, New York (1990)
13. Felleisen, M., Hieb, R.: The revised report on the syntactic theories of sequential control and state. Theor. Comput. Sci. 103(2), 235-271 (1992)
14. Gentzen, G.: Investigations into logical deduction. In: Szabo, M. (ed.) Collected Papers of Gerhard Gentzen, pp. 68-131. North-Holland, Amsterdam (1969)
15. Girard, J.-Y.: A new constructive logic: classical logic. Math. Struct. Comput. Sci. 1(3), 255-296 (1991)
16. Goubault-Larrecq, J., Mackie, I.: Proof Theory and Automated Deduction. Kluwer Academic, Dordrecht (2001)
17. Griffin, T.G.: The formulae-as-types notion of control. In: Conf. Record 17th Annual ACM Symp. on Principles of Programming Languages, POPL'90, San Francisco, CA, USA, 17-19 Jan. 1990, pp. 47-57. ACM Press, New York (1990)
18. Hofmann, M.: Sound and complete axiomatisations of call-by-balue control operators. Math. Struct. Comput. Sci. 5(4), 461-482 (1995)
19. Johansson, I.: Der Minimalkalkül, ein reduzierter intuitionistischer Formalismus. Compos. Math. 4, 119-136 (1937)
20. Kameyama, Y., Hasegawa, M.: A sound and complete axiomatization of delimited continuations. In: Proc. of 8th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP'03, Uppsala, Sweden, 25-29 Aug. 2003. SIGPLAN Notices, vol. 38(9), pp. 177-188. ACM Press, New York (2003)
21. Lalement, R.: Computation as Logic. Prentice Hall International Series in Computer Science, Amsterdam (1993)
22. Ong, C.-H.L., Stewart, C.A.: A Curry-Howard foundation for functional computation with control. In: Conf. Record 24th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL'97, Paris, France, 15-17 Jan. 1997, pp. 215-227. ACM Press, New York (1997)
23. Parigot, M.: Lambda-mu-calculus: an algorithmic interpretation of classical natural deduction. In: Logic Programming and Automated Reasoning: International Conference LPAR'92 Proceedings, St. Petersburg, Russia, pp. 190-201. Springer, New York (1992)
24. Parigot, M.: Classical proofs as programs. Comput. Log. Theory 713, 263-276 (1993)
25. Parigot, M.: Strong normalization for second order classical natural deduction. In: Proceedings 8th Annual IEEE Symp. on Logic in Computer Science, LICS'93, pp. 39-47. IEEE Computer Society Press (1993)
26. Parigot, M.: Proofs of strong normalisation for second order classical natural deduction. J. Symb. Log. 62(4), 1461-1479 (1997)
27. Prawitz, D.: Natural Deduction, a Proof-Theoretical Study. Almquist and Wiksell, Stockholm (1965)
28. Py, W.: Confluence en λ μ-calcul. Ph.D. thesis, Université de Savoie (1998)
29. Sabry, A., Felleisen, M.: Reasoning about programs in continuation-passing style. Lisp Symb. Comput. 6(3-4), 289-360 (1993)
30. Selinger, P.: Control categories and duality: on the categorical semantics of the lambda-mu calculus. Math. Struct. Comput. Sci. 11(2), 207-260 (2001)
31. Streicher, T., Reus, B.: Classical logic: continuation semantics and abstract machines. J. Funct. Program. 8(6), 543-572 (1998)
32. van Dalen, D.: Logic and Structure. Springer, New York (1997)