Isar—a generic interpretative approach to readable formal proof documents

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

Volumn 1690, Issue , 1999, Pages 167-183

  Wenzel, Markus ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; COMPUTATIONAL LINGUISTICS; FORMAL LANGUAGES; FORMAL LOGIC; SEMANTICS;

AUTOMATED PROOFS; AUTOMATED REASONING; HUMAN COMMUNICATIONS; INTERACTIVE PROOF DEVELOPMENT; INTERACTIVE THEOREM PROVING; LEVEL OF ABSTRACTION; NATURAL DEDUCTION PROOFS; THEOREM PROVING SYSTEMS;

THEOREM PROVING;

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

References (22)

1. K. Arkoudas. Deduction vis-a-vis computation: The need for a formal language for proof engineering. The MIT Express project, http://www.ai.mit.edu/projects/express/, June 1998.
2. C. Benzmüller, L. Cheikhrouhou, D. Fehrer, A. Fiedler, X. Huang, M. Kerber, M. Kohlhase, K. Konrad, E. Melis, A. Meier, W. Schaarschmidt, J. Siekmann, and V. Sorge. Mega: Towards a mathematical assistant. In W. McCune, editor, 14th International Conference on Automated Deduction | CADE-14, volume 1249 of LNAI. Springer, 1997.
3. Y. Bertot and L. Théry. A generic approach to building user interfaces for theorem provers. Journal of Symbolic Computation, 11, 1996.
4. R. Boulton, K. Slind, A. Bundy, and M. Gordon. An interface between CLAM and HOL. In J. Grundy and M. Newey, editors, Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics, volume 1479 of LNCS. Springer, 1998.
5. R. Burstall. Teaching people to write proofs: a tool. In CafeOBJ Symposium, Numazu, Japan, April 1998.
6. A. Church. A formulation of the simple theory of types. Journal of Symbolic Logic, pages 56-68, 1940.
7. C. Cornes, J. Courant, J.-C. Filliâtre, G. Huet, P. Manoury, and C. Muñoz. The Coq Proof Assistant User's Guide, version 6.1. INRIA-Rocquencourt et CNRSENS Lyon, 1996.
8. Y. Coscoy, G. Kahn, and L. Théry. Extracting text from proofs. In Typed Lambda Calculus and Applications, volume 902 of LNCS. Springer, 1995.
9. B. I. Dahn and A. Wolf. A calculus supporting structured proofs. Journal of Information Processing and Cybernetics (EIK), 30(1-6):261-276, 1994. Akademie Verlag Berlin.
10. M. J. C. Gordon and T. F. Melham (editors). Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press, 1993.
11. J. Harrison. A Mizar mode for HOL. In J. 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 LNCS, pages 203-220. Springer, 1996.
12. T. Nipkow. More Church-Rosser proofs (in Isabelle/HOL). In M. McRobbie and J. K. Slaney, editors, 13th International Conference on Automated Deduction | CADE-13, volume 1104 of LNCS, pages 733-747. Springer, 1996.
13. T. Nipkow. Winskel is (almost) right: Towards a mechanized semantics textbook. In V. Chandru, editor, Foundations of Software Technology and Theoretical Computer Science, volume 1180 of LNCS, pages 180-192. Springer, 1996.
14. ℓight is type-safe | definitely. In Proc. 25th ACM Symp. Principles of Programming Languages, pages 161-170. ACM Press, New York, 1998.
15. S. Owre, S. Rajan, J. M. Rushby, N. Shankar, and M. Srivas. PVS: combining specification, proof checking, and model checking. In R. Alur and T. A. Henzinger, editors, Computer Aided Verification, volume 1102 of LNCS. Springer, 1996.
16. L. C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of LNCS. Springer, 1994.
17. L. C. Paulson. Generic automatic proof tools. In R. Veroff, editor, Automated Reasoning and its Applications. MIT Press, 1997.
18. L. C. Paulson. A generic tableau prover and its integration with Isabelle. In CADE-15 Workshop on Integration of Deductive Systems, 1998.
19. P. Rudnicki. An overview of the MIZAR project. In 1992 Workshop on Types for Proofs and Programs. Chalmers University of Technology, Bastad, 1992.
20. D. Syme. DECLARE: A prototype declarative proof system for higher order logic. Technical Report 416, University of Cambridge Computer Laboratory, 1997.
21. D. Syme. Declarative Theorem Proving for Operational Semantics. PhD thesis, University of Cambridge, 1998. Submitted.
22. A. Trybulec. Some features of the Mizar language. Presented at a workshop in Turin, Italy, 1993.