A formulation of the simple theory of types (For Isabelle)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 417 LNCS, Issue , 1990, Pages 246-274

  Paulson, Lawrence C ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; FORMAL LOGIC;

AXIOM OF CHOICE; COMPUTATIONAL PROBLEM; HIGHER ORDER LOGIC; PROOF PROCEDURES; RECURSIVE TYPES; SIMPLE TYPE THEORIES; THEOREM PROVERS; TYPE INFERENCES;

COMPUTER CIRCUITS;

EID: 84947903145     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-52335-9_58     Document Type: Conference Paper

References (36)

1. Peter B. Andrews. An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof. Academic Press, 1986.
2. Peter B. Andrews, Dale A. Miller, Eve L. Cohen, and Frank Pfenning. Automating higher-order logic. In W. W. Bledsoe and D. W. Loveland, editors, Automated Theorem Proving: After 25 Years, pages 169–192, American Mathematical Society, 1984.
3. Roland Backhouse, Paul Chisholm, Grant Malcolm, and Erik Saaman. Do-it-yourself type theory. Formal Aspects of Computing, 1:19–84, 1989.
4. Robert S. Boyer and J Strother Moore. A Computational Logic. Academic Press, 1987.
5. Alonzo Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5:56–68, 1940.
6. Avra J. Cohn. A proof of correctness of the VIPER microprocessor: the first level. In Graham Birtwistle and P. A. Subrahmanyam, editors, VLSI Specification, Verification and Synthesis, pages 27–71, Kluwer Academic Publishers, 1988.
7. R. L. Constable, S. F. Allen, H. M. Bromley, W. R. Cleaveland, J. F. Cremer, R. W. Harper, D. J. Howe, T. B. Knoblock, N. P. Mendler, P. Panagaden, J. T. Sasaki, and S. F. Smith. Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall International, 1986.
8. Thierry Coquand. An analysis of Girard’s paradox. In Symposium on Logic in Computer Science, pages 227–236, IEEE Computer Society Press, 1986.
9. Thierry Coquand and Gèrard Huet. The calculus of constructions. Information and Computation, 76:95–120, 1988.
10. Andrzej Borzyszkowski et al. Towards a Set-Theoretic Type Theory. Technical Report, Polish Academy of Sciences, Institute of Computer Science, Gdańsk, 1988.
11. Michael P. Fourman. The logic of topoi. In J. Barwise, editor, Handbook of Mathematical Logic, pages 1053–1090, North-Holland, 1977.
12. Jean-Yves Girard. Proofs and Types. Cambridge University Press, 1989. Translated by Yves LaFont and Paul Taylor.
13. Kurt Gödel. Russell’s mathematical logic. In Paul Benacerraf and Hilary Putnam, editors, Philosophy of Mathematics: Selected Readings, Cambridge University Press, 1983. Essay first published in 1944.
14. Michael J. C. Gordon. HOL: a proof generating system for higher-order logic. In Graham Birtwistle and P. A. Subrahmanyam, editors, VLSI Specification, Verification and Synthesis, pages 73–128, Kluwer Academic Publishers, 1988.
15. William S. Hatcher. The Logical Foundations of Mathematics. Pergammon Press, 1982.
16. J. Roger Hindley and Jonathon P. Seldin. Introduction to Combinators and λ-Calculus. Cambridge University Press, 1986.
17. G. P. Huet. A unification algorithm for typed λ-calculus. Theoretical Computer Science, 1:27–57, 1975.
18. Gérard Huet. Induction principles formalized in the Calculus of Constructions. In Programming of Future Generation Computers, pages 205–216, Elsevier, 1988.
19. J. Lambek and P. J. Scott. Introduction to Higher Order Categorical Logic. Cambridge University Press, 1986.
20. A. C. Leisenring. Mathematical Logic and Hilbert’s ε-Symbol. Mac Donald, 1969.
21. Per Martin-Löf. Constructive mathematics and computer programming. In C. A. R. Hoare and J. C. Shepherdson, editors, Mathematical Logic and Programming Languages, pages 167–184, Prentice-Hall International, 1985.
22. Thomas F. Melham. Automating recursive type definitions in higher order logic. In Graham Birtwistle and P. A. Subrahmanyam, editors, Current Trends in Hardware Verification and Automated Theorem Proving, pages 341–386, Springer-Verlag, 1989.
23. G. Nadathur. A Higher-Order Logic as the Basis for Logic Programming. PhD thesis, University of Pennsylvania, 1987.
24. Philippe Noël. Experimenting with Isabelle in ZF Set Theory. Technical Report, University of Cambridge Computer Laboratory, 1989. Preprint.
25. Bengt Nordström, Kent Petersson, and Jan Smith. Programming in Martin-Löf’s type theory. An introduction. Oxford University Press, 1989. In press.
26. Lawrence C. Paulson. Constructing recursion operators in intuitionistic type theory. Journal of Symbolic Computation, 2:325–355, 1986.
27. Lawrence C. Paulson. The foundation of a generic theorem prover. Journal of Auiomaied Reasoning, 5:363–397, 1989.
28. Lawrence C. Paulson. Isabelle: the next 700 theorem provers. In P. Odifreddi, editor, Logic and Computer Science, Academic Press, 1989? In press.
29. Lawrence C. Paulson. Logic and Computation: Interactive proof with Cambridge LCF. Cambridge University Press, 1987.
30. Lawrence C. Paulson. Verifying the unification algorithm in LCF. Science of Computer Programming, 5:143–170, 1985.
31. Anne Salvesen. On Information Discharging and Retrieval in Martin-Löf’s Type Theory. PhD thesis, University of Oslo, 1989. Report 803, Norwegian Computing Center, Oslo.
32. Dana Scott. Identity and existence in intuitionistic logic. In M. P. Fourman, editor, Applications of Sheaves, pages 660–696, Springer-Verlag, 1979. Lecture Notes in Mathematics 753.
33. Stefan Sokołowski. Soundness of Hoare’s logic: an automatic proof using LCF. ACM Transactions on Programming Languages and Systems, 9:100–120, 1987.
34. J. M. Spivey. Understanding Z: A Specification Language and its Formal Semantics. Cambridge University Press, 1988.
35. Patrick Suppes. Axiomatic Set Theory. Dover, 1972.
36. A. N. Whitehead and B. Russell. Principia Mathematica. Cambridge University Press, 1962. Paperback edition to *56, abridged from the 2nd edition (1927).