On the geometry of intuitionistic S4 proofs

Homology, Homotopy and Applications

Volumn 5, Issue 2, 2003, Pages 137-209

  Goubault Larrecq, Jean ^a   Goubault, Éric ^b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b DIF   (France)

Author keywords

Comonads; Completeness; Curry Howard correspondence; Distributivity laws (for comonads); Intuitionistic logic; Lambda calculus; Logical relations; Modal logic; Presheaves; Resolution functors; S4; Simplicial sets; Subscones

Indexed keywords

EID: 18544367169     PISSN: 15320073     EISSN: 15320081     Source Type: Journal    
DOI: 10.4310/hha.2003.v5.n2.a6     Document Type: Conference Paper

References (53)

1. Moez Alimohamed, A characterization of lambda definability in categorical models of implicit polymorphism, Theoretical Computer Science 146 (1995), no. 1-2, 5-23.
2. Henk Barendregt, The lambda calculus, its syntax and semantics, Studies in Logic and the Foundations of Mathematics, vol. 103, North-Holland Publishing Company, Amsterdam, 1984.
3. Kalyan Basu, The geometry of sequential computation I: A simplicial geometry of interaction, Institutsbericht, Technische Universität München, Institut für Informatik, August 1997.
4. -, The geometry of sequential computation II: Full abstraction for PCF, Institutsbericht, Technische Universität München, Institut für Informatik, August 1997.
5. Alan Bawden and Jonathan Rees, Syntactic closures, 1988 ACM Conference on Lisp and Functional Programming, 1988, pp. 86-95.
6. P. Nick Benton, Gavin M. Bierman, and Valeria C. V. de Paiva, Computational types from a logical perspective, Journal of Functional Programming 8 (1998), no. 2, 177-193.
7. Gavin M. Bierman and Valeria de Paiva, Intuitionistic necessity revisited, Logic at Work (Amsterdam, the Netherlands), 1992, Revised version, Technical Report CSR-96-10, University of Birmingham, June 1996.
8. Anders Björner, Topological methods, Handbook of Combinatorics (R. Graham, M. Grötschel, and L. Lovász, eds.), vol. 2, Elsevier Science B.V., 1995, pp. 1819-1872.
9. Stephen Brookes and Shai Geva, Computational comonads and intensional semantics, Applications of Categories in Computer Science, Proceedings of the LMS Symposium (Durham) (M. P. Fourman, P. T. Johnstone, and A. M. Pitts, eds.), London Mathematical Society Lecture Notes, 1991.
10. Pierre-Louis Curien, Categorical combinators, sequential algorithms, and functional programming, 2nd ed., Progress in Theoretical Computer Science, Birkhäuser, Boston, 1993.
11. Rowan Davies and Frank Pfenning, A modal analysis of staged computation, 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 21-24 January 1996, pp. 258-270.
12. Nachum Dershowitz, Termination of rewriting, Journal of Symbolic Computation 3 (1987), 69-116.
13. Nachum Dershowitz and Jean-Pierre Jouannaud, Rewrite systems, Handbook of Theoretical Computer Science (Jan van Leeuwen, ed.), Elsevier Science Publishers b.v., 1990, pp. 243-320.
14. Philip J. Ehlers and Tim Porter, Joins for (augmented) simplicial sets, Bangor Maths Preprint 98.07, Bangor University, February 1998, Submitted to the Journal of Pure and Applied Algebra.
15. Peter J. Freyd and Andre Scedrov, Categories, allegories, North-Holland Mathematical Library, vol. 39, North-Holland, Amsterdam, 1990.
16. Harvey Friedman, Equality between functionals., Logic Colloquium 1972-73 (Rohit Parikh, ed.), Lecture Notes in Mathematics, vol. 453, Springer-Verlag, 1975, pp. 22-37.
17. Jean-Yves Girard, Linear logic, Theoretical Computer Science 50 (1987), 1-102.
18. Jean-Yves Girard, Yves Lafont, and Paul Taylor, Proofs and types, Cambridge Tracts in Theoretical Computer Science, vol. 7, Cambridge University Press, 1989.
19. Healfdene Goguen and Jean Goubault-Larrecq, Sequent combinators: A Hilbert system for the lambda calculus, Mathematical Structures in Computer Science 10 (2000), no. 1, 1-79.
20. Jean Goubault-Larrecq, On computational interpretations of the modal logic S4 I. Cut elimination, Interner Bericht 1996-35, University of Karlsruhe, 1996.
21. -, On computational interpretations of the modal logic S4 II. The λ ev Q-calculus, Interner Bericht 1996-34, University of Karlsruhe, 1996.
22. Jean Goubault-Larrecq and Éric Goubault, Order-theoretic, geometric and combinatorial models of intuitionistic S4 proofs, Presented at the 1st Workshop on Intuitionistic Modal Logics and Applications, Trento, Italy;
23. also at the 1st Workshop on Geometric Methods in Concurrency Theory, Aalborg, Denmark. Available at http://www.dyade.fr/fr/actions/vip/jgl/top.ps.gz, June 1999.
24. -, On the geometry of intuitionistic S4 proofs, Research Report LSV-01-8, Laboratoire Spécification et Vérification, ENS Cachan, France, November 2001, 107 pages, available at http://www.lsv.ens-cachan.fr/Publis/ RAPPORTS_LSV/rr-lsv-2001-8.rr.ps.
25. Jean Goubault-Larrecq, Sławomir Lasota, and David Nowak, Logical relations for monadic types, Proceedings of the 16th International Workshop on Computer Science Logic (CSL'02) (Edinburgh, Scotland), Springer-Verlag Lecture Notes in Computer Science, 2002, To appear.
26. Marco Grandis, Homotopical algebra in homotopical categories, Applied Categorical Structures 2 (1994), 351-406.
27. Timothy G. Griffin, A formulas-as-types notion of control, Proceedings of the 17th Annual ACM Symposium on Principles of Programming Languages (San Francisco, California), January 1990, pp. 47-58.
28. Mauric Herlihy and Sergio Rajsbaum, Algebraic topology and distributed computing - A primer, Computer Science Today, Recent Trends and Developments (Jan van Leeuwen, ed.), Lecture Notes in Computer Science, vol. 1000, Springer-Verlag, 1995, pp. 203-217.
29. Jonathan P. Hindley and J. Roger Seldin, Introduction to combinators and λ-calculus, London Mathematical Society Student Texts, vol. 1, Cambridge University Press, 1988.
30. William A. Howard, The formulae-as-types notion of construction, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism (J. R. Hindley and J. P. Seldin, eds.), Academic Press, 1980, pp. 479-490.
31. Gérard P. Huet, A unification algorithm for typed λ-calculus, Theoretical Computer Science 1 (1975), 27-57.
32. Jean-Pierre Jouannaud and Claude Kirchner, Solving equations in abstract algebras: a rule-based survey of unification, Tech. report, LRI, CNRS UA 410: Al Khowarizmi, March 1990.
33. Satoshi Kobayashi, Monad as modality, Theoretical Computer Science 175 (1997), no. 1, 29-74.
34. Joachim Lambek and Phil J. Scott, Introduction to higher order categorical logic, Cambridge Studies in Advanced Mathematics, vol. 7, Cambridge University Press, 1986.
35. Pierre Leleu, A modal lambda calculus with iteration and case constructs, Technical Report RR-3322, Institut National de Recherche en Informatique et en Automatique (Inria), France, 1997.
36. John Mac Carthy, P.W. Abrahams, D.J. Edwards, T.P. Hart, and M.I. Levin, LISP 1.5 programmer's manual, MIT Press, 1962.
37. Saunders Mac Lane, Categories for the working mathematician, Graduate Texts in Mathematics, vol. 5, Springer-Verlag, 1971.
38. Simone Martini and Andrea Masini, A modal view of linear logic, Journal of Symbolic Logic 59 (1994), no. 3, 888-899.
39. -, A computational interpretation of modal proofs, Proof Theory of Modal Logic (H. Wansing, ed.), Kluwer, 1996, pp. 213-241.
40. J. Peter May, Simplicial objects in algebraic topology, Chicago Lectures in Mathematics, The University of Chicago Press, 1967.
41. John C. Mitchell, Foundations for programming languages, MIT Press, 1985.
42. John C. Mitchell and Andre Scedrov, Notes on sconing and relators, Computer Science Logic '92, Selected Papers (E. Boerger et al., ed.), 1993, Available by anonymous ftp from host ftp.cis.upenn.edu and the file pub/papers/scedrov/rel.dvi, pp. 352-378.
43. Michel Parigot, λμ-calculus: an algorithmic interpretation of classical natural deduction, 3rd International Conference on Logic Programming and Automated Reasoning (Saint-Petersburg, USSR), Lecture Notes in Computer Science, vol. 417, Springer Verlag, July 1992.
44. Frank Pfenning and Rowan Davies, A judgmental reconstruction of modal logic, Invited talk, 1st Workshop on Intuitionistic Modal Logics and Applications, Trento, Italy., July 1999, Submitted to Mathematical Structures in Computer Science. Available at http://www-2.cs.emu.edu/~fp/papers/mscs00.ps.gz.
45. Frank Pfenning and Hao-Chi Wong, On a modal λ-calculus for S4, 11th Conference on Mathematical Foundations of Programming Semantics, 1995, Extended Abstract.
46. Gordon Plotkin, Call-by-name, call-by-value and the λ-calculus, Theoretical Computer Science 1 (1975), no. 2, 125-159.
47. Tim Porter, Letter to the authors and Rajeev Goré, August 04th 1999, Available from T. Porter or the authors.
48. Dag Prawitz, Natural deduction, a proof-theoretical study, Almqvist and Wiskell, Stockholm, 1965.
49. M. E. Szabo, The collected papers of Gerhard Gentzen, North-Holland Publishing Company, Amsterdam, 1969.
50. Daniele Turi, Functorial operational semantics and its denotational dual, Ph.D. thesis, Free University, Amsterdam, June 1996.
51. Philip Wickline, Peter Lee, and Frank Pfenning, Modal types as staging specifications for run-time code generation, ACM SIGPLAN Notices 33 (1998), no. 5, 224-235.
52. Frank Wolter and Michael Zakharyashev, Intuitionistic modal logic, Tech. report, The Institute of Computer Science, January 1999, To appear in Logic in Florence, 1995. Available at http://www.informatik.uni-leipzig.de/~wolter/ paper11.ps.
53. Houman Zolfaghari and Gonzalo E. Reyes, Topos-theoretic approaches to modality, Category Theory, Lecture Notes in Mathematics, vol. 1488, Springer-Verlag, Como, Italy, 1990, pp. 359-378.