A notion of classical pure type system (Preliminary version)

Electronic Notes in Theoretical Computer Science

Volumn 6, Issue , 1997, Pages 4-59

  Barthe, Gilles ^a   Hatcliff, John ^b   Sørensen, Morten Heine ^c  

^a CWI   (Netherlands)

^b Department of Computer Science   (United States)

^c UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CONTINUUM MECHANICS; LOGIC PROGRAMMING; MATHEMATICAL OPERATORS; MATHEMATICAL TRANSFORMATIONS; SEMANTICS; SYNTACTICS; THEOREM PROVING;

CURRY-HOWARD (CH) ISOMORPHISM; INTUITIONISTIC LOGICS; LAMBEK-LAWVERE (LL) ISOMORPHISM; PROOF-RELEVANT SYSTEMS;

FORMAL LOGIC;

EID: 18944391197     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80170-7     Document Type: Conference Paper

References (98)

1. Abramsky S., Gabbay D., Maibaum T. Handbook of Logic in Computer Science. 1992;Oxford Science Publications
2. Appel A. Compiling with Continuations. 1992;Cambridge University Press
3. Barbanera F., Berardi S. A strong normalization result for classical logic. Annals of Pure and Applied Logic. 76:(2):December 1995;99-116
4. Barbanera F., Berardi S. A symmetric lambda calculus for classical program extraction. Information and Computation. 125:(2):March 1996;103-117
5. Barendregt H. Introduction to Generalised Type Systems. J. Functional Programming. 1:(2):April 1991;125-154
6. H. Barendregt. Lambda calculi with types. In Abramsky et al. [1], pages 117 - 309. Volume 2.
7. Barendregt H.P. The Lambda Calculus: Its Syntax and Semantics. volume 103 of Studies in Logic and the Foundations of Mathematics. revised edition :1984;North-Holland
8. B. Barras, S. Boutin, C. Comes, J. Courant, J-C. Filliatre, E. Gimenez, H. Herbelin, G. Huet, C. Muiioz, C. Murthy, C. Parent, C. Paulin-Mohring, A. Saibi, and B. Werner. The Coq proof assistant user's guide. Version 6.1. Technical report, INRIA - Rocquencourt, December 1996. Available by ftp from ftp.inria.fr along with the implementation.
9. G. Barthe. Extensions of pure type systems. In M. Dezani-Ciancaglini and G. Plotkin, editors, Proceedings of TLCA'95, volume 902 of Lecture Notes in Computer Science, pages 16 - 31. Springer-Verlag, April 1995.
10. G. Barthe, J. Hatcliff, and M.H. Sørensen. CPS-translation and applications: the cube and beyond. In O. Danvy, editor, Proceedings of the Second ACM SIGPLAN Workshop on Continuations, number NS-96 - 13 in BRIGS Notes, pages 4/1 - 4/31, 1996.
11. G. Barthe and M.H. Sørensen. Domain-free pure type systems. In S. Adian and A. Nerode, editors, Proceedings of LFCS'97, Lecture Notes in Computer Science, 1997. To appear.
12. van Benthem L.S., Jutting. Typing in pure type systems. Information and Computation. 105:(1):July 1993;30-41
13. S. Berardi. Type dependence and Constructive Mathematics. PhD thesis, University of Torino, 1990.
14. G.M. Bierman. Towards a classical linear A-calculus. In Proceedings of Tokyo Conference on Linear Logic, volume 3 of Electronic Notes in Theoretical Computer Science. Elsevier, 1996.
15. Brouwer L.E.J. Intuitionistische splitsing van mathematische grondbegrippen. Nederl. Akad. Wetensch. Verslagen. 32:1923;877-880
16. R. Constable. Constructive mathematics and automatic program writers. In Proceedings of the IFIP Congress, pages 229 - 233, Ljubljana, 1971.
17. Constable R. programs as proofs: A synopsis. Information Processing Letters. 16:(3):1983;105-112
18. R. Constable and C.R. Murthy. Finding computational contents in classical proofs. In G. Huet and G. Plotkin, editors, Proceedings of the First Workshop on Logical Frameworks, pages 341 - 362. Cambridge University Press, 1990.
19. Constable R.L., Allen S.F., Bromley H.M., Cleaveland W.R., Cremer J.F., Harper R.W., Howe D.J., Knoblock T.B., Mendler N.P., Panangaden P., Sasaki J.T., Smith S.F. Implementing Mathematics with the NuPrl Development System. 1986;Prentice-Hall, Inc
20. Coquand T., Herbelin H. A-translation and looping combinators in pure type systems. Journal of Functional Programming. 4:(l):1994;77-88
21. Curry H.B., Feys R. Combinatory Logic. 1958;North-Holland
22. O. Danvy, editor. Proceedings of the Second ACM SIGPLAN Workshop on Continuations, number NS-96 - 13 in BRIGS Notes, 1996.
23. P. de Groote. A CPS-translation of the λμ-calculus. In S. Tison, editor, Proceedings of CAAP'94, volume 787 of Lecture Notes in Computer Science, pages 85 - 99. Springer-Verlag, 1994.
24. de Groote P. A simple calculus of exception handling. Dezani-Ciancaglini M., Plotkin G. Typed Lambda Calculus and Applications, volume 902 of Lecture Notes in Computer Science. 1995;201-215 Springer-Verlag
25. de Groote P. The Curry-Howard isomorphism. volume 8 of Cahiers du centre de logique. 1995;Universite catholique de Louvain
26. G. Dowek, G. Huet, and B. Werner, On the existence of long b̃n-normal forms in the cube, In H. Geuvers, editor, Informal Proceedings of TYPES'93, pages 115 - 130, 1993. Available from http://www.dcs.ed.ac.uk/ lfcsinfo/research/types-bra/proc/index.html.
27. B.F. Duba, R. Harper, and D. MacQueen. Typing first-class continuations in ML. In Conference Record of the Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1991.
28. M. Felleisen. The Calculi of XV-CS Conversion: A Syntactic theory of Control and State in Imperative Higher Order programming Languages. PhD thesis, Indiana University, 1987.
29. Felleisen M., Friedman D., Kohlbecker E., Duba B. A syntactic theory of sequential control. Theoretical Computer Science. 52:(3):1987;205-237
30. H. Geuvers. Logics and Type Systems. PhD thesis, University of Nijmegen, 1993.
31. Geuvers H., Nederhof M.-J. A modular proof of strong normalisation for the Calculus of Constructions. Journal of Functional Programming. 1:1991;155-189
32. Girard, Y. Lafont J.-Y., Taylor P. Proofs and Types. Number 7 in Tracts in Theoretical Computer Science. 1989;Cambridge University Press
33. Gordon M.J.C., Melham T.F. Introduction to HOL: A theorem proving environment for higher-order logic. 1993;Cambridge University Press
34. T.G. Griffin. A formulae-as-types notion of control. In Conference Record of the Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 47 - 58. ACM Press, 1990.
35. Griffin T.G. Logical interpretations and computational simulations. Manuscript. 1992
36. R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. In Proceedings of LICS'87, pages 194 - 204. IEEE Computer Society Press, 1987.
37. R. Harper and M. Lillibridge. Explicit polymorphism and GPS conversion. In Conference Record of the Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 206 - 219. ACM Press, 1993.
38. Harper R., Lillibridge M. Polymorphic type assignment and GPS conversion. LISP and Symbolic Computation. 6:1993;361-380
39. H. Herbelin. Sequents qu'on calcule. PhD thesis, Universite Paris 7, 1995.
40. Heyting A. Mathematische Grundlagenforschung. Intuitionismus. Beweis-theorie. Springer. 1934
41. Hirokawa S., Komori Y., Takeuti I. A reduction rule for the Peirce formula. Manuscript. 1994
42. Hofmann M. Sound and complete axiomatisations of call-by-balue control operators. Mathematical Structures in Computer Science. 5:(4):December 1995;461-482
43. Howard W. The formulae-as-types notion of construction. Seldin J.P., Hindley J.R. To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism. 1980;479-490 Academic Press Limited
44. B. Jacobs. Categorical logic and type theory. Book. In preparation, 199x.
45. Khasidashvili Z., van Oostrom V. Context-sensitive conditional expression reduction systems. Elsevier, Electronic Notes in Theoretical Computer Science. 2:1995;. Available at http://www.elsevier/nl/mcs/tcs/pc/volume2.htm
46. Kleene S.C. On the interpretation of intuitionistic number theory. Journal of Symbolic Logic. 10:1945;109-124
47. Kleene S.C. Introduction to Metamathematics. 1952;Van Nostrand
48. J.W. Klop. Term-rewriting systems. In Abramsky et al. [1], pages 1 - 116. Volume 2.
49. Klop J.W., van Oostrom V., van Raamsdonk F. Combinatory reduction systems: Introduction and survey. Theoretical Computer Science. 121:(l-2):1993;279-308
50. Kolmogorov A. Sur le principe de tertium non datur. Maté maticéskij Sbornik. 32:1925;646-667. English translation in [96]
51. Kolmogorov A. Zur Deutung der intuitionistischen Logik. Mathematische Zeitschrift. 35:1932;58-65
52. Lambek J. Deductive systems and categories I. Syntactic calculus and residuated categories. Mathematical Systems Theory. 2:(4):1968;287-318
53. Lambek J. From A-calculus to cartesian closed categories. Hindley J.R., Seldin J.P. To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism. 1980;375-402 Academic Press
54. Lambek J., Scott P.J. Introduction to Higher-Order Categorical Logic. Cambridge Studies in Advanced Mathematics. 1986;Cambridge University Press
55. Lawvere F.W. Ajointness in foundations. Dialectica. 23:1969;281-296
56. Luo Z. Computation and Reasoning: A Type Theory for Computer Science. Number 11 in International Series of Monographs on Computer Science. 1994;Oxford University Press
57. Z. Luo and R. Pollack. LEGO proof development system: User's manual. Technical Report ECS-LFCS-92 - 211, LFCS, Computer Science Dept., University of Edinburgh, May 1992.
58. L. Magnusson. The implementation of ALF: a proof editor based on Martin-Löf's monomorphic type theory with explicit substitution. PhD thesis, Department of Computer Science, Chalmers University, 1994.
59. C. Mann. The connection between equivalences of proofs and cartesian closed categories. Proceedings of the London Mathematical Society, 31:289 - 310, 1975.
60. Martin-Löf P. Intuitionistic Type Theory. volume 1 of Studies in Proof Theory. 1984;Bibliopolis, Naples
61. Meyer A.R., Wand M. Continuation semantics in typed lambda-calculi (summary). Parikh R. Logics of Programs, volume 193 of Lecture Notes in Computer Science. 1985;219-224 Springer-Verlag
62. C. Murthy. Extracting Constructive Contents from Classical Proofs. PhD thesis, Cornell University, 1990.
63. Murthy C. An evaluation semantics for classical proofs. Logic in Computer Science. 1991
64. Murthy C.R. A computational analysis of Girard's translation and LC. Logic in Computer Science. 1992
65. Murthy C.R. Control operators, hierachies, and pseudo-classical type systems: A-translation at work. ACM SIGPLAN Workshop on Continuations. 1992
66. Nakano H. A constructive logic behind the catch and throw mechanism. Annals of Pure and Applied Logic, 69. October 1994;2-3. 269-301
67. Nederpelt R., Geuvers H., de Vrijer R. Selected papers on Automath, volume 133 of Studies in Logic and the Foundations of Mathematics. 1994;North-Holland, Amsterdam
68. Nordstrom B., Petersson K., Smith J. Programming in Martin-Löf's Type Theory. An Introduction. Number 7 in International Series of Monographs on Computer Science. 1990;Oxford University Press
69. Ong C.-H.L. A semantic view of classical proofs: Type-theoretic, categorical, and denotational characterizations. Logic in Computer Science. 1996;. To appear
70. C.-H.L. Ong and C.A. Stewart. A Curry-Howard Foundation for functional computation with control. In Proceedings of POPL '97, pages ??-?? ACM Press, 1997.
71. M. Parigot. λμ-calculus: An algorithmic interpretation of classical natural deduction. In International Conference on Logic Programming and Automated Reasoning, volume 624 of Lecture Notes in Computer Science, pages 190 - 201. Springer-Verlag, 1992.
72. M. Parigot. Strong normalization for second order classical natural deduction. In Proceedings of LICS'93, pages 39 - 46. IEEE Computer Society Press, 1993.
73. F. Pfenning. Elf: a meta-language for deductive systems. In A. Bundy, editor, Proceedings of CADE-12, volume 814 of Lecture Notes in Artificial Intelligence, pages 811 - 815. Springer-Verlag, 1994.
74. A. Pitts. Categorical logic. Technical Report 367, University of Cambridge Computer Laboratory, May 1995.
75. Pitts A., Dybjer P. Semantics and Logics of Computation. Publications of the Isaac Newton Institute. 1997;Cambridge University Press
76. Plotkin G. Call-by-name, call-by-value and the A-calculus. Theoretical Computer Science. 1:1975;125-159
77. R. Pollack. The Theory of LEGO: A Proof Checker for the Extended Calculus of Constructions. PhD thesis, University of Edinburgh, 1994. Available by anonymous ftp from ftp.cs.chalmers.se in directory pub/users/pollack.
78. Pottinger G. Normalization as a homomorphic image of cut-elimination. Archive for Mathematical Logic. 12:1977;323-357
79. G. Pottinger. Strong normalisation for terms of the theory of constructions. Technical Report TR 11 - 7, Odissey Research Associates, 1987.
80. Prawitz D. Natural Deduction: A proof theoretical study. 1965;Almquist & Wiksell
81. Prawitz D. Ideas and results of proof theory. Fenstad J.E. The 2nd Scandinavian Logical Symposium. 1970;235-307 North-Holland
82. N.J. Rehof and M.H. Sørensen. The AA calculus. In M. Hagiya and J. Mitchell, editors, Proceedings of TAGS ″94, volume 789 of Lecture Notes in Computer Science, pages 516 - 542. Springer-Verlag, 1994.
83. Reynolds J.C. The discoveries of continuations. LISP and Symbolic Computation. 6:1993;233-248
84. E. Ritter, D. Pym, and L. Wallen. Proof-terms for classical and intuitionistic logic (extended abstract). In M. McRobbie and J. Slaney, editors, Proceedings of CADE'96, volume 1104 of Lecture Notes in Artificial Intelligence, pages ?? - ??, 1996.
85. R. Seely. Modelling computations: A 2-categorical framework. In Proceedings of LICS'87, pages 65 - 71. IEEE Computer Society Press, 1987.
86. Seldin J.P. On the proof theory of the intermediate logic MH. Journal of Symbolic Logic. 51:(3):1986;626-647
87. Seldin J.P. Normalization and excluded middle. Studia Logic. XLVIII:(2):1989;193-217
88. Seldin J.P. On the proof theory of Coquand's calculus of constructions. Annals of Pure and Applied Logic. 83:(1):January 1997;23-101. 6
89. Shankar N., Owre S., Rushby J.M. The PVS Proof Checker: A Reference Manual. Computer Science Laboratory, SRI International, Menlo Park, CA, February 1993. A new edition for PVS Version 2 is expected in late. 1996
90. Stalmarck G. Normalization theorems for full first order classical natural deduction. Journal of Symbolic Logic. 56:(1):1991;129-149
91. M. Stefanova and H. Geuvers. A simple set-theoretic semantics for the Calculus of Constructions. In S. Berardi and M. Coppo, editors, Proceedings of TYPES'95, volume 1158 of Lecture Notes in Computer Science. Springer-Verlag, 1996.
92. Streicher Th. Semantics of Type Theory. Correctness, Completeness and Independence results. 1991;Progress in Theoretical Computer Science. Birkhauser
93. Terlouw J. Strong normalization in type systems: a model theoretic approach. Annals of Pure and Applied Logic. 73:(l):May 1995;53-78
94. Tonino H., Fujita K. On the adequacy of representing higher order intuitionistic logic as a pure type system. Annals of Pure and Applied Logic. 57:(3):June 1992;251-276
95. Ungar A. Normalization, cut-elimination and the theory of proofs. 1992;Number 28 in Lecture Notes. Center for the Study of Language and Information, Stanford, CA
96. van Heijenoort J. From Frege to Godel: A Source-Book in Mathematical Logic. 1967;1879-1931 Harvard University Press
97. Werner B. Continuations, evaluation styles and types systems. Manuscript. 1992
98. Zucker J. The correspondence between cut-elimination and normalization. Archive for Mathematical Logic. 7:1974;113-155