On the implementation of an extensible declarative proof language?

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

Volumn 1690, Issue , 1999, Pages 185-202

  Zammit, Vincent ^a  

^a SHARP LABORATORIES OF EUROPE LTD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; FORMAL LOGIC; GROUP THEORY; MACHINERY; MECHANIZATION; SEMANTICS;

DECLARATIVE LANGUAGES; FORMAL PROOFS; HOL SYSTEM; INFORMAL PROOFS; MECHANISATION; PROOF PROCEDURES;

THEOREM PROVING;

EID: 84957804169     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48256-3_13     Document Type: Conference Paper

References (17)

1. Bruno Barras et al. The Coq Proof Assistant Reference Manual. Projet Coq|INRIA-Rocquencourt, CNRS-ENS Lyons, November 1996. (Version 6.1).
2. Anatoli Degtyarev and Andrei Voronkov. What you always wanted to know about rigid E-unification. Journal of Automated Reasoning, 20(1):47-80, 1998.
3. M. J. C. Gordon and T. F. Melham. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, 1993.
4. Elsa Gunter. The implementation and use of abstract theories in HOL. In Proceedings of the Third HOL Users Meeting, Computer Science Department, Aarhus University, Ny Munkegade, Building 540, DK-8000 Aarhus C, Denmark, October 1990. Technical Report DAIMI PB - 340 (December 1990).
5. J. Harrison. A Mizar mode for HOL. In von Wright et al. [16], pages 203-220.
6. I.N. Herstein. Topics in Algebra. John Wiley & Sons, New York, 2nd edition, 1975.
7. L. Laibinis. Using lattice theory in higher order logic. In von Wright et al. [16], pages 315-330.
8. David A. Plaisted. Equational reasoning and term rewriting systems. In D. Gabbay, C. Hogger, J. A. Robinson, and J. Siekmann, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 1, chapter 5, pages 273-364. Oxford University Press, Oxford, 1993.
9. Piotr Rudnicki. An overview of the MIZAR project. Available by ftp from menaik.cs.ualberta.ca as pub/Mizar/Mizar_Over.tar.Z., June 1992.
10. Piotr Rudnicki and Andrzej Trybulec. On equivalents of well-foundedness. Available on the web at http://www.cs.ualberta.ca/~piotr/Mizar/Wfnd/, January 1997.
11. Konrad Slind. Object language embedding in Standard ML of New Jersey. In Proceedings of the Second ML Workshop held at Carnegie Mellon University, Pittsburgh, Pennsylvania, Septermber 26-27, 1991, CMU SCS Technical Report, November 1991.
12. Don Syme. DECLARE: A prototype declarative proof system for higher order logic. Technical Report 416, University of Cambridge Computer Laboratory, New Museums Site, Pembroke Street, Cambridge, CB2 3QG, UK, 1997.
13. Don Syme. Proving Java type soundness. Technical Report 427, University of Cambridge Computer Laboratory, New Museums Site, Pembroke Street, Cambridge, CB2 3QG, UK, 1997.
14. Donald Syme. Declarative Theorem Proving for Operating Semantics. PhDthesis, University of Cambridge, 1998. Submitted for Examination.
15. A. Trybulec. The Mizar-QC/6000 logic information language. Bulletin of the Association for Literary and Linguistic Computing, 6:136-140, 1978.
16. J. von Wright, J. Grundy, and J. Harrison, editors. Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics (TPHOLs'96), volume 1125 of Lecture Notes in Computer Science, Turku, Finland, August 1996. Springer.
17. Vincent Zammit. On the Readability of Machine Checkable Formal Proofs. PhD thesis, University of Kent at Canterbury, October 1998. Submitted for Publication. (Currently available on the world wide web at the url: http://www.cs.ukc.ac.uk/people/rpg/vz1/thesis.ps.gz).