Set theory, higher order logic or both

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

Volumn 1125, Issue , 1996, Pages 191-201

  Gordon, Mike ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; SET THEORY; THEOREM PROVING;

EFFICIENT TREATMENT; HIGHER ORDER LOGIC; PROOF ASSISTANT; TYPECHECKING;

COMPUTER CIRCUITS;

EID: 84956867059     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0105405     Document Type: Conference Paper

References (24)

1. S. Agerholm. Formalising a model of the A-calculus in HOL-ST. Technical Report 354, University of Cambridge Computer Laboratory, 1994.
2. S. Agerholm and M.J.C. Gordon. Experiments with ZF Set Theory in HOL and Isabelle. In E. T. Schubert, P. J. Windley, and J. Alves-Foss, editors, Higher Order Logic Theorem Proving and Its Applications: 8th International Workshop, volume 971 of Lecture Notes in Computer Science, pages 32-45. Springer-Verlag, September 1995.
3. Jackson Paul B. Exploring abstract algebra in constructive type theory. In A. Bundy, editor, 12th Conference on Automated Deduction, Lecture Notes in Artificial Intelligence. Springer, June 1994.
4. R. J. Boulton, A. D. Gordon, M. J. C. Gordon, J. R. Harrison, J. M. J. Herbert, and J. Van Tassel. Experience with embedding hardware description languages in HOL. In V. Stavridou, T. F. Melham, and R. T. Boute, editors, Theorem Provers in Circuit Design: Theory, Practice and Experience: Proceedings of the IFIP TC10/WG 10.2 International Conference, IFIP Transactions A-10, pages 129-156. North-Holland, June 1992.
5. A. Church. A formulation of the simple theory of types. The Journal of Symbolic Logic, 5:56-68, 1940.
6. R. L. Constable et al. Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall, 1986.
7. Thierry Coquand. An analysis of Girard's paradox. In Proceedings, Symposium on Logic in Computer Science, pages 227-236, Cambridge, Massachusetts, 16-18 June 1986. IEEE Computer Society.
8. Francisco Corella. Mechanizing set theory. Technical Report 232, University of Cambridge Computer Laboratory, August 1991.
9. G. Dowek, A. Felty, H. Herbelin, G. Huet, C. Murthy, C. Parent, C. Paulin-Mohring, and B. Werner. The Coq proof assistant user's guide - version 5.8. Technical Report 154, INRIA-Rocquencourt, 1993.
10. W. M. Farmer, J. D. Guttman, and F. Javier Thayer. IMPS: An interactive mathematical proof system. Journal of Automated Reasoning, 11(2):213-248, 1993.
11. S. Finn and M. P. Fourman. L2 - The LAMBDA Logic. Abstract Hardware Limited, September 1993. In LAMBDA 4.3 Reference Manuals.
12. M. J. C. Gordon. Merging HOL with set theory. Technical Report 353, University of Cambridge Computer Laboratory, November 1994.
13. M. J. C. Gordon and T. F. Melham, editors. Introduction to HOL: A Theorem-proving Environment for Higher-Order Logic. Cambridge University Press, 1993.
14. F. K. Hanna, N. Daeche, and M. Longley. Veritas+: a specification language based on type theory. In M. Leeser and G. Brown, editors, Hardware specification, verification and synthesis: mathematical aspects, volume 408 of Lecture Notes in Computer Science, pages 358-379. Springer-Verlag, 1989.
15. C. B. Jones. Systematic Software Development using VDM. Prentice Hall International, 1990.
16. L. Lamport and S. Merz. Specifying and verifying fault-tolerant systems. In Proceedings of FTRTFT'94, Lecture Notes in Computer Science. Springer-Verlag, 1994. See also: http://www.research.digital.com/SRC/tla/papers.html#TLA+.
17. Z. Luo and R. Pollack. LEGO proof development system: User's manual. Technical Report ECS-LFCS-92-211, University of Edinburgh, LFCS, Computer Science Department, University of Edinburgh, The King's Buildings, Edinburgh, EH9 3JZ, May 1992.
18. L. Magnusson and B. Nordstrom. The ALF proof editor and its proof engine. In Types for Proofs and Programs: International Workshop TYPES '93, pages 213-237. Springer, published 1994. LNCS 806.
19. P. M. Melliar-Smith and John Rushby. The enhanced HDM system for specification and verification. In Proc. Verkshop III, volume 10 of ACM Software Engineering Notes, pages 41-43. Springer-Verlag, 1985.
20. R. P. Nederpelt, J. H. Geuvers, and R. C. De Vrijer, editors. Selected Papers on Automath, volume 133 of Studies in Logic and The Foundations of Mathematics. North Holland, 1994.
21. L. C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of Lecture Notes in Computer Science. Springer-Verlag, 1994.
22. PVS Web page, http://www.csl.sri.com/pvs/overview.html.
23. Piotr Rudnicki. An Overview of the MIZAR Project. Unpublished manuscript; but available by anonymous FTP from menaik.cs.ualberta.cainthedirectory pub/Mizar/Mizar_0ver.tar. Z, 1992.
24. J. M. Spivey. The Z Notation: A Reference Manual. Prentice Hall International Series in Computer Science, 2nd edition, 1992.