A confluent λ-calculus with a catch/throw mechanism

Journal of Functional Programming

Volumn 9, Issue 6, 1999, Pages 625-647

  Crolard, Tristan ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033268793     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796899003512     Document Type: Article

References (28)

1. Barbanera, F. and Berardi, S. (1994a) A symmetric lambda calculus for 'classical' program extraction. Theoretical Aspects of Computer Software: Lecture Notes in Computer Science 542, pp. 495-515. Springer-Verlag.
2. Barbanera, F. and Berardi, S. (1994b) Extracting constructive content from classical logic via control-like reductions. Lecture Notes in Compter Science 662. Springer-Verlag.
3. Beus, B. and Streicher, T. (1998) Classical logic, continuation semantics and abstract machines. J. Functional Programming (submitted).
4. Crolard, T. (1996) Extension de l'isomorphisme de Curry-Howard au traitement des exceptions (application d'une étude de la dualité en logique intuitionniste). Thèse de Doctorat, Université Paris 7.
5. Crolard, T. (1999) Subtractive logic. Theoretical Comput. Sci. (to appear).
6. De Groote, P. (1994) A CPS-Translation of the λμ-calculus. Lecture Notes in Computer Science 787, p. 85.
7. De Groote, P. (1994b) On the relation between the lambda-calculus and the syntactic theory of sequential control. Lecture Notes in Computer Science 822, p. 31.
8. De Groote, P. (1995) A simple calculus of exception handling. 2nd Int. Conference on Typed Lambda Calculi and Applications: Lecture Notes in Computer Science, pp. 201-215. Springer-Verlag.
9. De Groote, P. (1999) An environment machine for the λμ-calculus. Mathematical Structure of Computer Science (to appear).
10. Felleisen, M., Friedman, D. P., Kohlbecker, E. and Duba, B. F. (1986) Reasoning with continuations. First Symp. on Logic and Computer Science, pp. 131-141.
11. Felleisen, M., Friedman, D. P., Kohlbecker, E. and Duba, B. F. (1987) A syntactic theory of sequential control. Theoretical Comput. Sci. 52(3), 205-237.
12. Griffin, T. G. (1990) A formulæ-as-type notion of control. Conference Record of the 17th Annual ACM Symposium on Principles of Programming Languages, pp. 47-58.
13. Kameyama, Y. (1997) A new formulation of the catch/throw mechanism. In: Ida, T., Ohori, A. and Takeichi, M. (eds.), Second Fuji International Workshop on Functional and Logic Programming, pp. 106-122. World Scientific.
14. Kameyama, Y. and Sato, M. (1998) A classical catch/throw calculus with tag abstraction and its strong normalizability. In: Lin, X. (ed.), Proc. 4th Australasian Theory Symp.: Australian Computer Science Communications 20-3, pp. 183-197. Springer-Verlag.
15. Krivine, J.-L. (1994) Classical logic, storage operators and second order λ-calculus. Ann. Pure & Appl. Logic, 68, 53-78.
16. Murthy, C. R. (1990) Extracting constructive content from classical proofs. PhD thesis, Department of Computer Science, Cornell University.
17. Murthy, C. R. (1991) Classical proofs as programs: How, when, and why. Technical Report 91-1215, Department of Computer Science, Cornell University.
18. Nakano, H. (1994a) A constructive logic behind the catch and throw mechanism. Ann. Pure & Appl. Logic, 69(3), 269-301.
19. Nakano, H. (1994b) The non-deterministic catch and throw mechanism and its subject reduction property. Logic, Language and Computation: Lecture Notes in Computer Science 592, pp. 61-72. Springer-Verlag.
20. Nakano, H. (1995) The logical structures of the catch and throw mechanism. PhD thesis, The University of Tokyo.
21. Ong, C.-H. L. and Stewart, C. A. (1997) A Curry-Howard foundation for functional computation with control. Conference record of POPL '97: 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 215-227.
22. Ong, C.-H. L. (1996) A semantic view of classical proofs: Type-theoretic, categorical, and denotational characterizations (preliminary extended abstract). Proceedings 11th Ann. IEEE Symp. on Logic in Computer Science, LICS'96, pp. 230-241. New Brunswick, NJ. IEEE Press.
23. Parigot, M. (1992) λμ-calculus: an algorithmic interpretation of classical natural deduction. Proc. Logic Prog. and Autom. Reasoning: Lecture Notes in Computer Science 624, pp. 190-201. Springer-Verlag.
24. Parigot, M. (1993) Classical proofs as programs. Computational Logic and Theory: Lecture Notes in Computer Science 713, pp. 263-276. Springer-Verlag.
25. Py, W. (1998) Propriétés combinatoires du λμ-calcul. Thèse de Doctorat, Université de Savoie.
26. Δ-calculus. Theoretical Aspects of Computer Software: Lecture Notes in Computer Science 542, pp. 516-542. Springer-Verlag.
27. Reynolds, J. C. (1993) The discoveries of continuations. Lisp and Symbolic Computation, 6, 233-248.
28. Sato, M. (1997) Intuitionistic and classical natural deduction systems with the Catch and the Throw rules. Theoretical Comput. Sci. 175(1), 75-92.