Modular reasoning in isabelle

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1831, Issue , 2000, Pages 99-114

  Kammüller, Florian ^a  

^a FRAUNHOFER FIRST   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; THEOREM PROVING;

ABSTRACT ALGEBRA; DEPENDENT TYPES; ISABELLE; ISABELLE/HOL; MECHANICAL PROOF; MODULAR REASONING; REAL POWER;

AUTOMATION;

EID: 84937393619     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/10721959_7     Document Type: Conference Paper

References (21)

1. Bai98. A. Bailey. The Machine-Checked Literate Formalisation of Algebra in Type Theory. PhD thesis, University of Manchester, 1998.
2. D+93. Gilles Dowek et al. The Coq proof assistant user's guide. Technical Report 154, INRIA-Rocquencourt, 1993
3. dB80. N. G. de Bruijn. A Survey of the Project AUTOMATH. In Seldin and Hindley [SH80], pages 579-606.
4. Dow90. G. Dowek. Naming and Scoping in a Mathematical Vernacular. Technical Report 1283, INRIA, Rocquencourt, 1990.
5. FGT93. W. M. Farmer, J. D. Guttman, and F. J. Thayer. imps: an Interactive Mathematical Proof System. Journal of Automated Reasoning, 11: 213-248, 1993.
6. GM93. M. J. C. Gordon and T. F. Melham, editors. Introduction to HOL, a The-orem Proving Environment for Higher Order Logic. Cambridge University Press, 1993.
7. Gun89. E. L. Gunter. Doing Algebra in Simple Type Theory. Technical Report MS-CIS-89-38, Dep. of Computer and Information Science, University of Pennsylvania, 1989.
8. Gun90. E. L. Gunter. The Implementation and Use of Abstract Theories in HOL. In Third HOL Users Meeting, Aarhus University, 1990.
9. How80. W.A. Howard. The formulae-As-Types notion of construction. In Seldin and Hindley [SH80], pages 479-490.
10. JM93. B. Jacobs and T. F. Melham. Translating Dependent Type Theory into Higher Order Logic. In M. Bezem and J. F. Groote, editors, Typed Lambda Calculi and Applications, number 664 in LNCS. Springer, 1993.
11. Kam99a. F. Kammüller. Modular Reasoning in Isabelle. PhD thesis, University of Cambridge, 1999. Technical Report 470.
12. Kam99b. F. Kammüller. Modular Structures as Dependent Types in Isabelle. In Types for Proofs and Programs, volume 1657 of LNCS. Springer, 1999.
13. KP99. F. Kammüller and L. C. Paulson. A Formal Proof of Sylow's First Theorem -An Experiment in Abstract Algebra with Isabelle HOL. Journal of Automated Reasoning, 23 (3-4) : 235-264, 1999.
14. KWP99. F. Kammüller, M. Wenzel, and L. C. Paulson. Locales -A Sectioning Concept for Isabelle. In Theorem Proving in Higher Order Logics, TPHOLs'99, volume 1690 of LNCS. Springer, 1999.
15. LP92. Z. Luo and R. Pollack. Lego proof development system: User's manual. Technical Report ECS-LFCS-92-211, University of Edinburgh, 1992.
16. Mac86. D. B. MacQueen. Using Dependant Types to Express Modular Structures. In Proc. 13th ACM Symp. Principles Programming Languages.ACM Press, 1986.
17. OSRSC98. S. Owre, N. Shankar, J.M. Rushby, and D.W.J. Stringer-Calvert. PVS Language Reference. Part of the PVS Manual. Available on the Web as http://www.csl.sri.com/pvsweb/manuals.html, September 1998.
18. Pau94. L. C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of LNCS. Springer, 1994.
19. SH80. J.P. Seldin and J.R. Hindley, editors. To H. B. Curry: Essays on Combi-natory Logic, Academic Press Limited, 1980.
20. Try93. A. Trybulec. Some Features of the Mizar Language. 1993. Available from Mizar user's group.
21. Yu90. Y. Yu. Computer Proofs in Group Theory. Journal of Automated Reason-ing, 6: 251-286, 1990.