A formulae-as-types interpretation of subtractive logic

Journal of Logic and Computation

Volumn 14, Issue 4, 2004, Pages 529-570

  Crolard, Tristan ^a  

^a UNIVERSITÉ PARIS EST CRÉTEIL   (France)

Author keywords

Control operators; Coroutines; Curry Howard isomorphism; Subtractive logic

Indexed keywords

CONTROL OPERATORS; COROUTINES; CURRY-HOWARD ISOMORPHISM; SUBTRACTIVE LOGIC;

FORMAL LOGIC; MATHEMATICAL OPERATORS; OPTIMIZATION; SET THEORY; THEOREM PROVING;

COMPUTER SCIENCE;

EID: 4444237095     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/14.4.529     Document Type: Conference Paper

References (53)

1. Z. Ariola and H. Herbelin. Minimal classical logic and control operators. In Proceedings of ICALP'03, volume 2719 of Lecture Notes in Computer Science. Springer-Verlag, 2003.
2. F. Barbanera and S. Berardi. Extracting constructive content from classical logic via control-like reductions. In volume 662 of Lecture Notes in Computer Science, pp. 47-59. Springer-Verlag, 1994.
3. E. W. Beth. Semantic construction of intuitionistic logic. Koninklijke Nederlandse Akademie van Wetenschappen, Mededelingen, Nieuwe Reeks, 19, 357-388, 1956.
4. T. Brauner and V. de Paiva. A formulation of linear logic based on dependency-relations. In Proceedings of Annual Conference of the European Association for Computer Science Logic, volume 1414 of Lecture Notes in Computer Science. Springer-Verlag, 1997.
5. B. C. Cooper and J. G. Morrisett. Adding threads to standard ML. Report CMU-CS-90-186, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 1990.
6. T. Crolard. 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, 1996.
7. T. Crolard. A confluent lambda-calculus with a catch/throw mechanism. Journal of Functional Programming, 9, 625-647, 1999.
8. T. Crolard. Subtractive Logic. Theoretical Computer Science, 254, 151-185, 2001.
9. P.-L. Curien and H. Herbelin. The duality of computation. In Proceedings of the ACM Sigplan International Conference on Functional Programming (ICFP-00), volume 35.9 of ACM Sigplan Notices, pp. 233-243, N.Y., September 18-21 2000. ACM Press.
10. P. De Groote. On the relation between the lambda-calculus and the syntactic theory of sequential control. Volume 822 of Lecture Notes in Computer Science, pp. 31-43. Springer-Verlag, 1994.
11. P. de Groote. A simple calculus of exception handling. In Second International Conference on Typed Lambda Calculi and Applications, Edinburgh. Volume 902 of Lecture Notes in Computer Science, pp. 201-215. Springer-Verlag, 1995.
12. P. de Groote. Strong normalization of classical natural deduction with disjunction. In Typed Lambda Calculi and Applications, volume 2044 of Lecture Notes in Computer Science, p. 182. Springer-Verlag, 2001.
13. V. de Paiva and E. Ritter. A Parigot-style linear lambda-calculus for full intuitionistic linear logic. Submitted, 2003.
14. A. G. Dragalin. Mathematical intuitionism: Introduction to proof theory, In Translations of Mathematical Monographs, volume 67. American Matematical Society, Providence, Rhode Island, 1988.
15. B. Duba, R. Harper, and D. MacQueen. Typing first-class continuations in ML. In ACM-SIGPLAN ACM-SIGACT, Conference Record of the 18th Annual ACM Symposium on Principles of Programming Languages (POPL '91), pp. 163-173, Orlando, FL, USA, January 1991. ACM Press.
16. R. Dyckhoff. Contraction-free sequent calculi for intuitionistic logic. The Journal of Symbolic Logic, 57, 795-807, 1992.
17. A. Filinski. Declarative Continuations: An Investigation of Duality in Programming Language Semantics. In Category Theory and Computer Science, volume 389 of Lecture Notes in Computer Science, pp. 224-249. Springer-Verlag, 1989.
18. D. P. Friedman, C. T. Haynes, and M. Wand. Continuations and coroutines: An exercise in metaprogramming. In Proceedings of 1984 ACM Symposium on Lisp and Functional Programming, pp. 293-298, August 1984.
19. D. P. Friedman, C. T. Haynes, and M. Wand. Obtaining coroutines with continuations. Journal of Computer Languages, 11. 143-153, 1986.
20. D. M. Gabbay. Semantical Investigations in Heyting's Intuitionistic Logic. Reidel, Dordrecht, 1981.
21. R. Goré. Dual intuitionistic logic revisited. In Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX 2000, St Andrews, Scotland, UK, July 3-7, 2000, Proceedings, Roy Dyckhoff, ed., volume 1847 of Lecture Notes in Computer Science, pp. 252-267. Springer, 2000.
22. S. Görnemann. A logic stronger than intuitionism. The Journal of Symbolic Logic, 36, 249-261, 1971.
23. T. G. Griffin, A formulæ-as-type notion of control. In Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Langages, pp. 47-58, 1990.
24. The Open Group. The Single UNIX Specification, Version 2. 1997. Available from http://www.UNIX-systems.org/online.html.
25. M. Hyland and V. de Paiva. Full intuitionistic linear logic (extended abstract). Annals of Pure and Applied Logic, 64, 273-291, 1993.
26. Y. Kameyama. A new formulation of the catch/throw mechanism. In Second Fuji International Workshop on Functional and Logic Programming, T. Ida, A. Ohori, and M. Takeichi, eds, pp. 106-122. Word Scientific, 1997.
27. Y. Kameyama and M. Sato. A classical catch/throw calculus with tag abstraction and its strong normalizability. In Proceedings of the fourth Australasian Theory Symposium, volume 20-3 of Australian Computer Science Communications, X. Lin, ed., pp. 183-197. Springer-Verlag, 1998.
28. Y. Kameyama and M. Sato. Strong normalizability of the non-deterministic catch/throw calculi. Theoretical Computer Science, 272. 223-245, 2002.
29. S. C. Kleene. Introduction to metamathematics. North-Holland, Amsterdam, 1952. (Eighth reprint 1980.)
30. J.-L. Krivine. Classical logic, storage operators and second order λ-calculus. Annals of Pure and Applied Logic, 68, 53-78, 1994.
31. C. R. Murthy. Classical proofs as programs: How, when. and why. Technical Report 91-1215, Cornell University, Department of Computer Science, 1991.
32. H. Nakano. A constructive logic behind the catch and throw mechanism, Annals of Pure and Applied Logic, 69, 269-301, 1994.
33. H. Nakano. The non-deterministic catch and throw mechanism and its subject reduction property. In Logic, Language and Computation, volume 592 of Lecture Notes in Computer Science, pp. 61-72. Springer-Verlag, 1994.
34. H. Nakano. The Logical Structures of the Catch and Throw Mechanism. PhD thesis, The University of Tokyo, 1995.
35. H. Ono. Model extension theorem and Graigs interpolation theorem for intermediate predicate logics. Rep. Math. Logic, 15:41-57, 1983.
36. M. Parigot. λμ-calculus: an algorithmic interpretation of classical natural deduction. In Proceedings Logic Programming and Automated Reasoning, volume 624 of Lecture Notes in Computer Science, pp. 190-201. Springer-Verlag, 1992.
37. M. Parigot. Classical proofs as programs. In Computationnal logic and theory, volume 713 of Lecture Notes in Computer Science, pp. 263-276. Springer-Verlag, 1993.
38. M. Parigot. Strong normalization for second order classical natural deduction. In Proceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science, 1993.
39. D. Pym and E. Ritter. On the semantics of classical disjunction. Journal of Pure and Applied Algebra, 159, 315-338, 2001.
40. D. Pym, E. Ritter, and L. Wallen. Proof-terms for classical and intuitionistic resolution. In Proceedings of the Thirteenth International Conference on Automated Deduction (CADE-96), M. A. McRobbie and J. K. Slaney, eds, volume 1104 of Lecture Notes in Artificial Intelligence, pp. 17-31, Springer-Verlag, 1996.
41. D. Pym, E. Ritter, and L. Wallen. On the intuitionistic force of classical search. Theoretical Computer Science, 232, 299-333, 2000.
42. N. Ramsey. Concurrent programming in ML. Technical Report CS-TR-262-90, Department of Computer Science, Princeton University, Princeton, NJ, 1990.
43. C. Rauszer. A formalization of the propositional calculus of H-B logic. Studia Logica, 33, 23-34, 1974.
44. C. Rauszer. Semi-boolean algebras and their applications to intuitionistic logic with dual operations. In Fundamenta Mathematicae, 83, 219-249, 1974.
45. C. Rauszer. An algebraic and Kripke-style approach to a certain extension of intuitionistic logic. In Dissertationes Mathematicae, volume 167. Institut Mathématique de l'Académie Polonaise des Sciences, 1980.
46. Δ- calculus. In Theoretical Aspects of Computer Software, volume 542 of Lecture Notes In Computer Science, pp. 516-542. Springer-Verlag, 1994.
47. J. H. Reppy. Asynchronous signals is standard ML. Technical Report TR90-1144, Cornell University, Computer Science Department, August 1990.
48. J. H. Reppy. First-class synchronous operations, volume 907 of Lecture Notes in Computer Science, pp. 235-252, 1995.
49. G. Restall. Extending intuitionistic logic with subtraction. Available as http://consequently.org/papers/extendingj.pdf, 1997.
50. P. Selinger. Control categories and duality: On the categorical semantics of the lambda-mu calculus. Mathematical Structures in Computer Science, 11, 207-260, 2001.
51. M. E. Szabo. Gentzen Collected work. North-Holland, Amsterdam, 1969.
52. P. Wadler, Call-by-value is dual to call-by-name. In Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, Uppsala, Sweden, August 2003. ACM Press.
53. M. Wand. Continuation-based multiprocessing. In Conference Record of the 1980 LISP Conference, J. Allen, ed., pp. 19-28. The Lisp Company, 1980. Republished by ACM.