Representing model theory in a type-theoretical logical framework

Theoretical Computer Science

Volumn 412, Issue 37, 2011, Pages 4919-4945

  Horozal, Fulya ^a   Rabe, Florian ^a  

^a JACOBS UNIVERSITY BREMEN   (Germany)

Author keywords

First order logic; Logical framework; Model theory; Module system; Proof theory

Indexed keywords

FIRST ORDER LOGIC; LOGICAL FRAMEWORKS; MODEL THEORY; MODULE SYSTEMS; PROOF THEORY;

FORMAL LANGUAGES; FORMAL LOGIC; SEMANTICS; SET THEORY;

FORMAL METHODS;

EID: 79960905066     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2011.03.022     Document Type: Article

References (71)

1. A. Asperti, C. Sacerdoti Coen, E. Tassi, and S. Zacchiroli Crafting a Proof Assistant T. Altenkirch, C. McBride, TYPES 2006 Springer 18 32
2. P. Aczel The Type Theoretic Interpretation of Constructive Set Theory A. Macintyre, L. Pacholski, J. Paris, Logic Colloquium'77 1978 North-Holland 55 66
3. A. Avron, F. Honsell, M. Miculan, and C. Paravano Encoding modal logics in logical frameworks Studia Logica 60 1 1998 161 208
4. S. Autexier, D. Hutter, H. Mantel, and A. Schairer Towards an evolutionary formal software-development using CASL D. Bert, C. Choppy, P. Mosses, WADT, vol. 1827 Lecture Notes in Computer Science 1999 Springer 73 88
5. A. Appel Foundational proof-carrying code 16th Annual IEEE Symposium on Logic in Computer Science 2001 IEEE 247 258
6. H. Barendregt Lambda calculi with types S. Abramsky, D. Gabbay, T. Maibaum, Handbook of Logic in Computer Science, vol. 2 1992 Oxford University Press
7. Y. Bertot, and P. Castéran Coq'Art: The Calculus of Inductive Constructions 2004 Springer
8. P. Bernays A system of axiomatic set theoryPart I Journal of Symbolic Logic 2 1 1937 65 77
9. N. Benton, A. Kennedy, and C. Varming Some domain theory and denotational semantics in Coq Theorem Proving in Higher Order Logics S. Berghofer, T. Nipkow, C. Urban, M. Wenzel, Lecture Notes in Computer Science vol. 5674 2009 Springer 115 130
10. C. Brown Combining type theory and untyped set theory U. Furbach, N. Shankar, International Joint Conference on Automated Reasoning 2006 Springer 205 219 (Pubitemid 44532675)
11. T. Coquand, and P. Dybjer Intuitionistic model constructions and normalization proofs Mathematical Structures in Computer Science 7 1 1997 75 94 (Pubitemid 127019012)
12. H. Curry, and R. Feys Combinatory Logic 1958 North-Holland Amsterdam
13. T. Coquand, and G. Huet The calculus of constructions Information and Computation 76 23 1988 95 120
14. A. Church A formulation of the simple theory of types Journal of Symbolic Logic 5 1 1940 56 68
15. C. Coquand A formalised proof of the soundness and completeness of a simply typed lambda-calculus with explicit substitutions Higher-Order and Symbolic Computation 15 1 2002 57 90 (Pubitemid 35152029)
16. N. de Bruijn The mathematical language AUTOMATH M. Laudet, Proceedings of the Symposium on Automated Demonstration Lecture Notes in Mathematics vol. 25 1970 Springer 29 61
17. R. Diaconescu Proof systems for institutional logic Journal of Logic and Computation 16 3 2006 339 357 (Pubitemid 43823170)
18. W. Farmer, J. Guttman, F. Thayer, Little theories, in: D. Kapur (Ed.), Conference on Automated Deduction, 1992, pp. 467581.
19. A. Fraenkel, ber den Begriff "definit" und die Unabhngigkeit des Auswahlaxioms. Sitz. Berlin, 1922, pp. 253257.
20. J. Goguen, and R. Burstall A study in the foundations of programming methodology: specifications, institutions, charters and parchments D. Pitt, S. Abramsky, A. Poigné, D. Rydeheard, Workshop on Category Theory and Computer Programming 1986 Springer 313 333
21. J. Goguen, and R. Burstall Institutions: abstract model theory for specification and programming Journal of the Association for Computing Machinery 39 1 1992 95 146 (Pubitemid 23600413)
22. J. Goguen, T. Mossakowski, V. de Paiva, F. Rabe, and L. Schröder An institutional view on categorical logic International Journal of Software and Informatics 1 1 2007 129 152
23. K. Gödel The consistency of continuum hypothesis Annals of Mathematics Studies 3 1940 33 101
24. G. Gonthier, A computer-checked proof of the four colour theorem, 2006, http://research.microsoft.com/~gonthier/.
25. M. Gordon HOL: a proof generating system for higher-order logic G. Birtwistle, P. Subrahmanyam, VLSI Specification, Verification and Synthesis 1988 Kluwer-Academic Publishers 73 128
26. J. Goguen, and G. Rosu Institution morphisms Formal Aspects of Computing 13 2002 274 307 (Pubitemid 41204154)
27. J. Grimm, Implementation of bourbaki's elements of mathematics in coq: part one, theory of sets, Technical Report HAL:inria-00408143, INRIA, 2009.
28. J. Goguen, J. Thatcher, and E. Wagner An initial algebra approach to the specification, correctness and implementation of abstract data types R. Yeh, Current Trends in Programming Methodology, vol. 4 1978 Prentice Hall 80 149
29. T. Hales, The flyspeck project, 2003. See http://code.google.com/p/ flyspeck/.
30. J. Harrison HOL light: a tutorial introduction Proceedings of the First International Conference on Formal Methods in Computer-Aided Design 1996 Springer 265 269 (Pubitemid 126149763)
31. R. Harper, F. Honsell, and G. Plotkin A framework for defining logics Journal of the Association for Computing Machinery 40 1 1993 143 184
32. W. Howard The formulas-as-types notion of construction To H.B. Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism 1980 Academic Press 479 490
33. F. Horozal, and F. Rabe Representing model theory in a type-theoretical logical framework Fourth Workshop on Logical and Semantic Frameworks, with Applications Electronic Notes in Theoretical Computer Science vol. 256 2009 49 65
34. R. Harper, D. Sannella, and A. Tarlecki Structured presentations and logic representations Annals of Pure and Applied Logic 67 1994 113 160
35. M. Kohlhase, T. Mossakowski, F. Rabe, The LATIN Project, 2009. See https://trac.omdoc.org/LATIN/.
36. M. Kohlhase OMDoc: An Open Markup Format for Mathematical Documents (Version 1.2) Lecture Notes in Artificial Intelligence vol. 4180 2006 Springer
37. S. Mac Lane Categories for the Working Mathematician 1998 Springer
38. F. Lawvere, Functional semantics of algebraic theories, Ph.D. Thesis, Columbia University, 1963.
39. D. Lee, K. Crary, and R. Harper Towards a mechanized metatheory of standard ML M. Hofmann, M. Felleisen, Symposium on Principles of Programming Languages 2007 ACM 173 184
40. W. Lovas, and F. Pfenning Refinement types as proof irrelevance P. Curien, Typed Lambda Calculi and Applications Lecture Notes in Computer Science vol. 5608 2009 Springer 157 171
41. J. Meseguer General logics H.-D. Ebbinghaus, Proceedings, Logic Colloquium, 1987 1989 North-Holland 275 329
42. T. Mossakowski, J. Goguen, R. Diaconescu, and A. Tarlecki What is a logic? J. Béziau, Logica Universalis 2005 Birkhuser Verlag 113 133
43. P. Martin-Löf An intuitionistic theory of types: predicative part Proceedings of the '73 Logic Colloquium 1974 North-Holland 73 118
44. P. Martin-Löf On the meanings of the logical constants and the justifications of the logical laws Nordic Journal of Philosophical Logic 1 1 1996 3 10
45. T. Mossakowski, C. Maeder, and K. Lttich The heterogeneous tool set O. Grumberg, M. Huth, TACAS 2007 Lecture Notes in Computer Science vol. 4424 2007 519 522
46. L. Magnusson, and B. Nordström The ALF proof editor and its proof engine H. Barendregt, T. Nipkow, Types for Proofs and Programs Lecture Notes in Computer Science vol. 806 1994 Springer 213 237
47. O. Mller, T. Nipkow, D. von Oheimb, and O. Slotosch HOLCF=HOL+LCF Journal of Functional Programming 9 2 1999 191 223
48. T. Mossakowski, A. Tarlecki, and W. Pawlowski Combining and representing logical systems E. Moggi, G. Rosolini, Category Theory and Computer Science 1997 Springer 177 196 (Pubitemid 127118708)
49. T. Nipkow Structured proofs in Isar/HOL H. Geuvers, F. Wiedijk, TYPES Conference 2002 Springer 259 278
50. U. Norell, The agda wiKi, 2005, http://wiki.portal.chalmers.se/agda.
51. T. Nipkow, L. Paulson, and M. Wenzel Isabelle/HOL A Proof Assistant for Higher-Order Logic 2002 Springer
52. P. Naumov, M. Stehr, and J. Meseguer The HOL/NuPRL proof translator a practical approach to formal interoperability 14th International Conference on Theorem Proving in Higher Order Logics 2001 Springer
53. L. Paulson Isabelle: A Generic Theorem Prover Lecture Notes in Computer Science vol. 828 1994 Springer
54. L. Paulson, M. Coen, ZermeloFraenkel Set Theory, Isabelle distribution, ZF/ZF.thy, 1993.
55. F. Pfenning Structural cut elimination: I. Intuitionistic and classical logic Information and Computation 157 1-2 2000 84 141
56. F. Pfenning, and C. Schrmann System description: Twelf a meta-logical framework for deductive systems Lecture Notes in Computer Science 1632 1999 202 206
57. F. Rabe, Representing Logics and Logic Translations. Ph.D. Thesis, Jacobs University Bremen, 2008. Available at: http://kwarc.info/frabe/Research/ phdthesis.pdf.
58. F. Rabe, A logical framework combining model and proof theory, Under review, see http://kwarc.info/frabe/Research/rabecombining09.pdf, 2010.
59. F. Rabe, and C. Schrmann A practical module system for LF J. Cheney, A. Felty, Proceedings of the Workshop on Logical Frameworks: Meta-Theory and Practice (LFMTP) 2009 ACM Press 40 48
60. K. Sojakova, Mechanically verifying logic translations, 2010, Master's Thesis, Jacobs University Bremen.
61. D. Sannella, and M. Wirsing A kernel language for algebraic specification and implementation M. Karpinski, Fundamentals of Computation Theory 1983 Springer 413 427
62. A. Tarski, Pojcie prawdy w jzykach nauk dedukcyjnych. Prace Towarzystwa Naukowego Warszawskiego Wydzial III Nauk Matematyczno-Fizycznych, 34, 1933. English title: The concept of truth in the languages of the deductive sciences.
63. A. Tarski ber Unerreichbare Kardinalzahlen Fundamenta Mathematicae 30 1938 176 183
64. A. Tarlecki Moving between logical systems M. Haveraaen, O. Owe, O.-J. Dahl, Recent Trends in Data Type Specifications. 11th Workshop on Specification of Abstract Data Types Lecture Notes in Computer Science vol. 1130 1996 Springer Verlag 478 502 (Pubitemid 126125001)
65. A. Trybulec, H. Blair, Computer assisted reasoning with MIZAR, in: A. Joshi, (Ed.), Proceedings of the 9th International Joint Conference on Artificial Intelligence, 1985, pp. 2628.
66. A. Trybulec Tarski grothendieck set theory Journal of Formalized Mathematics 1989 Axiomatics
67. A. Tarski, and R. Vaught Arithmetical extensions of relational systems Compositio Mathematica 13 1956 81 102
68. J. von Neumann Eine axiomatisierung der mengenlehre Journal fr die Reine und Angewandte Mathematik 154 1925 219 240
69. N. Wiener A simplification of the logic of relations J. van Heijenoort, From Frege to Gödel 1967 Harvard Univ. Press 224 227
70. F. Wiedijk Mizar's soft type system K. Schneider, J. Brandt, Theorem Proving in Higher Order Logics Lecture Notes in Computer Science vol. 4732 2007 Springer 383 399
71. E. Zermelo Untersuchungen ber die Grundlagen der Mengenlehre I Mathematische Annalen 65 1908 261 281 English Title: Investigations in the Foundations of Set Theory I