Innovations in computational type theory using Nuprl

Journal of Applied Logic

Volumn 4, Issue 4, 2006, Pages 428-469

  Allen, S F ^a   Bickford, M ^a   Constable, R L ^a   Eaton, R ^a   Kreitz, C ^a   Lorigo, L ^a   Moran, E ^a  

^a School of Operations Research and Information Engineering   (United States)

Author keywords

Computational type theory; Dependent intersection types; Formal digital libraries; Logic of events; Martin L f type theory; Polymorphic subtyping; Program extraction; Proofs as programs; Tactics; Union types

Indexed keywords

COMPUTER SOFTWARE; DIFFERENTIATION (CALCULUS); DIGITAL LIBRARIES; DISTRIBUTED COMPUTER SYSTEMS; SET THEORY;

COMPUTATIONAL TYPE THEORY; DEPENDENT INTERSECTION TYPES; FORMAL DIGITAL LIBRARIES; LOGIC OF EVENTS; MARTIN-LÖF TYPE THEORY; POLYMORPHIC SUBTYPING; PROGRAM EXTRACTION; PROOFS AS PROGRAMS; TACTICS; UNION TYPES;

COMPUTATION THEORY;

EID: 33749576660     PISSN: 15708683     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jal.2005.10.005     Document Type: Article

References (111)

1. Aagaard M., and Leeser M. Verifying a logic synthesis tool in Nuprl. In: Bochmann G., and Probst D. (Eds). Proceedings of Workshop on Computer-Aided Verification. Lecture Notes in Computer Science vol. 663 (1993), Springer-Verlag, Berlin 72-83
2. Abbott J., van Leeuwan A., and Strotmann A. Openmath: Communicating mathematical information between co-operating agents in a knowledge network. J. Intelligent Syst. (1998)
3. Allen S., Constable R., Eaton R., Kreitz C., and Lorigo L. The Nuprl open logical environment. In: McAllester D. (Ed). Proceedings of 17th Conference on Automated Deduction. Lecture Notes in Artificial Intelligence vol. 1831 (2000), Springer-Verlag, Berlin 170-176
4. S. Allen, M. Bickford, R. Constable, R. Eaton, C. Kreitz, A Nuprl-PVS connection: Integrating libraries of formal mathematics, Technical Report, Cornell University. Department of Computer Science, 2003
5. S.F. Allen, A non-type-theoretic definition of Martin-Löf's types, in: [51], pp. 215-224
6. S.F. Allen, A non-type-theoretic semantics for type-theoretic language, PhD thesis, Cornell University, 1987
7. S.F. Allen, From dy/dx to [ ]p: a matter of notation, in: Proceedings of the Conference on User Interfaces for Theorem Provers, Eindhoven, The Netherlands, 1998
8. Allen S.F. Abstract identifiers, intertextual reference and a computational basis for recordkeeping. First Monday 9 2 (2004)
9. Asperti A., Padovani L., Sacerdoti Coen C., Guidi F., and Schena I. Mathematical knowledge management in HELM. Ann. Math. Artificial Intelligence 38 1-3 (2003) 27-46
10. Backhouse R.C., Chisholm P., and Malcolm G. Do-it-yourself type theory (part II). EATCS Bull. 35 (1988) 205-245
11. A.L. Barabsi, R. Albert, Emergence of scaling in random networks, pp. 509-512
12. Barendregt H.P. Handbook of Logic in Computer Science, vol. 2 (1992), Oxford University Press, Oxford Chapter: Lambda Calculi with Types, pp. 118-310
13. J.L. Bates, A logic for correct program development, PhD thesis, Cornell University, 1979
14. Bates J.L., and Constable R.L. Proofs as programs. ACM Trans. Programming Lang. Syst. 7 1 (1985) 53-71
15. Bertot Y., and Castéran P. Interactive Theorem Proving and Program Development; Coq'Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science (2004), Springer-Verlag
16. Betarte G., and Tasistro A. Extension of Martin-Löf's type theory with record types and subtyping. Twenty-Five Years of Constructive Type Theory (1998), Oxford University Press, Oxford 21-39
17. M. Bickford, R.L. Constable, A logic of events, Technical Report TR2003-1893, Cornell University, 2003
18. Bickford M., Kreitz C., van Renesse R., and Liu X. Proving hybrid protocols correct. In: Boulton R., and Jackson P. (Eds). Proceedings of 14th International Conference on Theorem Proving in Higher Order Logics. Lecture Notes in Computer Science vol. 2152 (2001), Springer-Verlag, Berlin 105-120
19. Birman K., Constable R., Hayden M., Hickey J., Kreitz C., van Renesse R., Rodeh O., and Vogels W. The Horus and Ensemble projects: Accomplishments and limitations. DARPA Information Survivability Conference and Exposition (2000), IEEE Computer Society Press 149-160
20. Bishop E. Foundations of Constructive Analysis (1967), McGraw-Hill, New York
21. Bourbaki N. Elements of Mathematics, Algebra, vol. 1 (1968), Addison-Wesley, Reading, MA
22. Boyer R.S., and Moore J.S. A Computational Logic (1979), Academic Press, New York
23. Carlisle D., Ion P., Minder R., and Poppelier N. Mathematical markup language (MathML) 2.0 w3c recommendation, February 2001. www.w3.org/TR/2001/REC-MAthML2-20010221/
24. Church A. Introduction to Mathematical Logic, vol. I (1956), Princeton University Press
25. Constable R.L. Constructive mathematics and automatic program writers. Proceedings of the IFIP Congress (1971), North-Holland, Amsterdam 229-233
26. Constable R.L. Mathematics as programming. Proceedings of the Workshop on Programming and Logics. Lecture Notes in Computer Science vol. 164 (1983), Springer-Verlag, Berlin 116-128
27. R.L. Constable, The semantics of evidence, Technical Report TR85-684, Cornell University, 1985
28. Constable R.L. Creating and evaluating interactive formal courseware for mathematics and computing. In: Iskander M.F., Gonzalez M.J., Engel G.L., Rushforth C.K., Yoder M.A., Grow R.W., and Durney C.H. (Eds). Frontiers in Education (1996), IEEE
29. Constable R.L. Types in logic, mathematics and programming. In: Buss S.R. (Ed). Handbook of Proof Theory (1998), Elsevier, Amsterdam 683-786 Chapter X
30. R.L. Constable, S. Allen, M. Bickford, J. Caldwell, J. Hickey, C. Kreitz, Steps Toward a World Wide Digital Library of Formal Algorithmic Knowledge, vol. 1, 2003
31. Constable R.L., et al. Implementing Mathematics with the Nuprl Proof Development System (1986), Prentice-Hall, Englewood Cliffs, NJ
32. Constable R.L., and Hickey J. Nuprl's class theory and its applications. In: Bauer F.L., and Steinbrueggen R. (Eds). Foundations of Secure Computation. NATO ASI Series, Series F: Computer & System Sciences (2000), IOS Press, Amsterdam 91-116
33. Constable R.L., and Howe D.J. Implementing metamathematics as an approach to automatic theorem proving. In: Banerji R.B. (Ed). Formal Techniques in Artificial Intelligence: A Source Book (1990), Elsevier Science, Amsterdam 45-76
34. Constable R.L., Jackson P.B., Naumov P., and Uribe J. Constructively formalizing automata. Proof, Language and Interaction: Essays in Honour of Robin Milner (2000), MIT Press, Cambridge, MA 213-238
35. Constable R.L., Johnson S., and Eichenlaub C. Introduction to the PL/CV2 Programming Logic. Lecture Notes in Computer Science vol. 135 (1982), Springer-Verlag, Berlin
36. Constable R.L., and Johnson S.D. A PL/CV précis. Principles of Programming Languages (1979), ACM, New York 7-20
37. Constable R.L., Knoblock T., and Bates J.L. Writing programs that construct proofs. J. Automat. Reason. 1 3 (1984) 285-326
38. Constable R.L., and O'Donnell M.J. A Programming Logic (1978), Winthrop, MA
39. Constable R.L., and Zlatin D.R. The type theory of PL/CV3. ACM Trans. Programming Languages and Systems 6 1 (1984) 94-117
40. C. Cornes, J. Courant, J.-C. Filliâtre, G. Huet, P. Manoury, C. Paulin-Mohring, C. Muñoz, C. Murthy, C. Parent, A. Saïbi, B. Werner, The Coq Proof Assistant reference manual, Technical Report, INRIA, 1995
41. K. Crary, Foundations for the implementation of higher-order subtyping, in: 1997 ACM SIGPLAN International Conference on Functional Programming, 1997
42. K. Crary, Simple, efficient object encoding using intersection types, Technical Report TR98-1675, Department of Computer Science, Cornell University, April 1998
43. K. Crary, Type-theoretic methodology for practical programming languages, PhD thesis, Cornell University, Ithaca, NY, August 1998
44. Curry H.B., Feys R., and Craig W. Combinatory Logic, vol. I. Studies in Logic and the Foundations of Mathematics (1958), North-Holland, Amsterdam
45. de Bruijn N.G. The mathematical language Automath: its usage and some of its extensions. In: Seldin J.P., and Hindley J.R. (Eds). Symposium on Automatic Demonstration. Lecture Notes in Mathematics vol. 125 (1970), Springer-Verlag, Berlin 29-61
46. Dybjer P. Inductive sets and families in Martin-Löf's type theory and their set-theoretic semantics. In: Huet G., and Plotkin G. (Eds). Logical Frameworks (1991), Cambridge University Press, Cambridge 280-306
47. A. Felty, F. Stomp, A correctness proof of a cache coherence protocol, in: Proceedings of 11th Annual Conference on Computer Assurance, 1996, pp. 128-141
48. Felty A.P., and Howe D.J. Hybrid interactive theorem proving using Nuprl and HOL. In: McCune W. (Ed). Proceedings of the 14th International Conference on Automated Deduction. Lecture Notes in Artificial Intelligence vol. 1249 (1997), Springer-Verlag, Berlin 351-365
49. Girard J.-Y., Taylor P., and Lafont Y. Proofs and Types. Cambridge Tracts in Computer Science vol. 7 (1989), Cambridge University Press, Cambridge
50. Gordon M., Milner R., and Wadsworth C. Edinburgh LCF: A Mechanized Logic of Computation. Lecture Notes in Computer Science vol. 78 (1979), Springer-Verlag, Berlin
51. In: Gries D. (Ed). Proceedings of the 2nd IEEE Symposium on Logic in Computer Science (1987), IEEE Computer Society Press
52. T.G. Griffin, Notational definition and top-down refinement for interactive proof development systems, PhD thesis, Cornell University, 1988
53. R. Harper, M. Lillibridge, A type-theoretic approach to higher-order modules with sharing, in: Proceedings of 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland, OR, January 1994, pp. 123-137
54. Harper R., and Mitchell J.C. On the type structure of standard ML. ACM Trans. Programming Lang. Syst. 15 2 (1993) 211-252
55. HELM. Hypertextual electronic library of mathematics. http://www.cs.unibo.it/~asperti/HELM
56. Hickey J., Lynch N., and van Renesse R. Specifications and proofs for Ensemble layers. In: Cleaveland R. (Ed). Proceedings of 5th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science vol. 1579 (1999), Springer-Verlag, Berlin 119-133
57. Hickey J., Nogin A., Constable R.L., Aydemir B.E., Barzilay E., Bryukhov Y., Eaton R., Granicz A., Kopylov A., Kreitz C., Krupski V.N., Lorigo L., Schmitt S., Witty C., and Yu X. MetaPRL-A modular logical environment. In: Basin D., and Wolff B. (Eds). Proceedings of the 16th International Conference on Theorem Proving in Higher Order Logics. Lecture Notes in Computer Science vol. 2758 (2003), Springer-Verlag, Berlin 287-303
58. J.J. Hickey, The MetaPRL logical programming environment, PhD thesis, Cornell University, January 2001
59. Hoare C.A.R. Notes on data structuring. Structured Programming (1972), Academic Press, New York
60. J.G. Hook, D.J. Howe, Impredicative strong existential equivalent to type:type, Technical Report TR 86-760, Cornell University, Department of Computer Science, June 1986
61. Howard W. The formulas-as-types notion of construction. To H.B. Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism (1980), Academic Press, New York 479-490
62. Howe D.J. The computational behaviour of Girard's paradox. In: Gries D. (Ed). LICS-87-Second Annual Symposium on Logic in Computer Science (1987), IEEE Computer Society Press 205-214
63. D.J. Howe, Equality in lazy computation systems, in: Proceedings of 4th IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, pp. 198-203
64. Howe D.J. Importing mathematics from HOL into Nuprl. In: von Wright J., Grundy J., and Harrison J. (Eds). Theorem Proving in Higher Order Logics. Lecture Notes in Computer Science vol. 1125 (1996), Springer-Verlag, Berlin 267-282
65. Howe D.J. Semantic foundations for embedding HOL in Nuprl. In: Wirsing M., and Nivat M. (Eds). Algebraic Methodology and Software Technology. Lecture Notes in Computer Science vol. 1101 (1996), Springer-Verlag, Berlin 85-101
66. Howe D.J. A classical set-theoretic model of polymorphic extensional type theory. Unpublished manuscript, 1997, available at. ftp://ftp.research.bell-labs.com/dist/howe/set-nuprl.ps.gz
67. Howe D.J. Toward sharing libraries of mathematics between theorem provers. In: Gabbay D.M., and de Rijke M. (Eds). Frontiers of Combining Systems 2. Studies in Logic and Computation vol. 7 (2000), Research Studies Press/Wiley 161-176
68. Jackson P.B. Exploring abstract algebra in constructive type theory. In: Bundy A. (Ed). Proceedings of the 12th Conference on Automated Deduction. Lecture Notes in Artificial Intelligence vol. 814 (1994), Springer-Verlag, Berlin
69. Kleene S.C. Introduction to Metamathematics (1952), D. Van Nostrand, Princeton
70. J. Kleinberg, Authoritative sources in a hyperlinked environment, Proceedings of the Ninth ACM-SIAM Symposium on Discrete Algorithms, 1998
71. T. Knoblock, Metamathematical extensibility in type theory, PhD thesis, Cornell University, 1987
72. M. Kohlhase, OmDoc: An infrastructure for openmath content dictionary information, in: Bulletin of the ACM Special Interest Group for Algorithmic Mathematics SIGSAM, 2000
73. Kohlhase M. OmDoc: Towards an Internet standard for the administration, distribution and teaching of mathematical knowledge. Proceedings of Artificial Intelligence and Symbolic Computation. Lecture Notes in Computer Science vol. 1930 (2000), Springer-Verlag, Berlin
74. A. Kopylov, Dependent intersection: A new way of defining records in type theory, Department of Computer Science TR2000-1809, Cornell University, 2000
75. A. Kopylov, Dependent intersection: A new way of defining records in type theory, in: Proceedings of 8th IEEE Symposium on Logic in Computer Science, 2003, pp. 86-95
76. A.P. Kopylov, Type theoretical foundations for data structures, classes, and objects, PhD thesis, Cornell University, January 2004
77. Kreitz C. Automated fast-track reconfiguration of group communication systems. In: Cleaveland R. (Ed). Proceedings of 5th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science vol. 1579 (1999), Springer-Verlag, Berlin 104-118
78. C. Kreitz, The Nuprl Proof Development System, version 5: Reference Manual and User's Guide, Cornell University, Department of Computer Science, 2002
79. Kreitz C. Building reliable, high-performance networks with the Nuprl proof development system. J. Funct. Programming 14 1 (2004) 21-68
80. Kreitz C., Hayden M., and Hickey J. A proof environment for the development of group communication systems. In: Kirchner C., and Kirchner H. (Eds). Proceedings of 15th Conference on Automated Deduction. Lecture Notes in Artificial Intelligence vol. 1421 (1998), Springer-Verlag, Berlin 317-331
81. Kreitz C., and Otten J. Connection-based theorem proving in classical and non-classical logics. J. Universal Comput. Sci. 5 3 (1999) 88-112
82. Kreitz C., and Schmitt S. A uniform procedure for converting matrix proofs into sequent-style systems. J. Inform. Comput. 162 1-2 (2000) 226-254
83. Lamport L. Time, clocks and the ordering of events in a distributed system. Comm. ACM 21 7 (1978) 558-565
84. Lamport L. The mutual exclusion problem, part ii: statement and solutions. J. ACM 33 2 (1986) 327-348
85. Liu X., Kreitz C., van Renesse R., Hickey J., Hayden M., Birman K., and Constable R. Building reliable, high-performance communication systems from components. Proceedings of 17th ACM Symposium on Operating Systems Principles (SOSP'99). Oper. Syst. Rev. 34 (1999) 80-92
86. Liu X., van Renesse R., Bickford M., Kreitz C., and Constable R. Protocol switching: Exploiting meta-properties. In: Rodrigues L., and Raynal M. (Eds). International Workshop on Applied Reliable Group Communication (WARGC 2001) (2001), IEEE Computer Society Press 37-42
87. Lorigo L., Kleinberg J., Eaton R., and Constable R. A graph-based approach towards discerning inherent structures in a digital library of formal mathematics. Lecture Notes in Computer Science (2004), Springer-Verlag, Berlin 220-235
88. Lynch N. Distributed Algorithms (1996), Morgan Kaufmann, San Mateo, CA
89. Martin-Löf P. An intuitionistic theory of types: Predicative part. Logic Colloquium '73 (1973), North-Holland, Amsterdam 73-118
90. Martin-Löf P. Constructive mathematics and computer programming. Proceedings of the Sixth International Congress for Logic, Methodology, and Philosophy of Science (1982), North-Holland, Amsterdam 153-175
91. Martin-Löf P. Intuitionistic Type Theory. Studies in Proof Theory, Lecture Notes vol. 1 (1984), Bibliopolis, Napoli
92. The MathBus Term Structure. www.nuprl.org/mathbus/mathbusTOC.htm
93. P.F. Mendler, Inductive definition in type theory, PhD thesis, Cornell University, 1988
94. MoWGLI: Mathematic on the web: Get it by logics and interfaces. http://mowgli.cs.unibo.it
95. C. Murthy, A computational analysis of Girard's translation and LC, in: Seventh Symposium on Logic in Computer Science, 1992, pp. 90-101
96. Murthy C.R., and Russell J.R. A constructive proof of Higman's lemma. In: Mitchell J.C. (Ed). Fifth Annual Symposium on Logic in Computer Science, 1990 (1990), IEEE Computer Society Press 257-267
97. P. Naumov, Publishing formal mathematics on the web, Technical Report TR98-1689, Cornell University, Department of Computer Science, 1998
98. Nordström B., Petersson K., and Smith J.M. Programming in Martin-Löf's Type Theory (1990), Oxford Sciences Publication, Oxford
99. Nuprl home page. http://www.nuprl.org
100. Pollack R. Dependently typed records for representing mathematical structure. In: Harrison J., and Aagaard M. (Eds). Proceedings of 13th International Conference on Theorem Proving in Higher Order Logics. Lecture Notes in Computer Science vol. 1869 (2000), Springer-Verlag, Berlin 461-478
101. Russell B. Mathematical logic as based on a theory of types. Am. J. Math. 30 (1908) 222-262
102. L. Page, S. Brin, The anatomy of a large-scale hypertextual (web) search engine, in: Seventh International World Wide Web Conference, 1998
103. Schmitt S., Lorigo L., Kreitz C., and Nogin A. JProver: Integrating connection-based theorem proving into interactive proof assistants. In: Gore R., Leitsch A., and Nipkow T. (Eds). International Joint Conference on Automated Reasoning. Lecture Notes in Artificial Intelligence vol. 2083 (2001), Springer-Verlag, Berlin 421-426
104. Scott D. Data types as lattices. SIAM J. Comput. 5 (1976) 522-587
105. Smullyan R.M. First-Order Logic (1968), Springer-Verlag, Berlin
106. Thompson S. Type Theory and Functional Programming (1991), Addison-Wesley, Reading, MA
107. Sjerp Troelstra A. Metamathematical Investigation of Intuitionistic Mathematics. Lecture Notes in Mathematics vol. 344 (1973), Springer-Verlag, Berlin
108. Troelstra A.S., and van Dalen D. Constructivism in Mathematics, An Introduction, vols. I, II (1988), North-Holland, Amsterdam
109. University of Cambridge, Computer Laboratory, The HOL System: DESCRIPTION, March 1994
110. Whitehead A.N., and Russell B. Principia Mathematica, vols. 1, 2, 3. second ed. (1925-1927), Cambridge University Press
111. Zimmer J., and Kohlhase M. The Mathweb Software Bus for distributed mathematical reasoning. In: Ganzinger H. (Ed). Proceedings of 18th International Conference on Automated Deduction. Lecture Notes in Artificial Intelligence vol. 1632 (2002), Springer-Verlag, Berlin 217-221