Modular structures as dependent types in isabelle

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

Volumn 1657, Issue , 1999, Pages 121-133

  Kammüller, Florian ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FORMAL LOGIC; LATTICE THEORY; STRUCTURE (COMPOSITION);

ABSTRACT ALGEBRA; ALGEBRAIC STRUCTURES; APPLICATION EXAMPLES; DEPENDENT TYPES; HIGHER ORDER LOGIC; MODULAR STRUCTURES; NATURAL PROOFS; THEOREM PROVERS;

ALGEBRA;

EID: 84937424205     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48167-2_9     Document Type: Conference Paper

References (18)

1. Bur90. R. Burstall. Computer Assisted Proof for Mathematics: an Introduction using the LEGO Proof System. Technical Report ECS-LFCS-91-132, University of Edinburgh, 1990. 131.
2. Chu40. A. Church. A Formulation of the Simple Theory of Types. Journal of Symbolic Logic, pages 56-68, 1940. 125.
3. 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. 121, 122, 123.
4. GH93. John V. Guttag and James J. Horning, editors. Larch: Languages and Tools for Formal Specification. Texts and Monographs in Computer Science. Springer-Verlag, 1993. With Stephen J. Garland, Kevin D. Jones, Andrés Modet, and Jeannette M. Wing. 121, 123.
5. Hey56. A. Heyting. Intuitionism: An Introduction. North Holland, Amsterdam, 1956. 125.
6. 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, 1999. To appear. 121.
7. KW98. F. Kammüller and M. Wenzel. Locales - a Sectioning Concept for Isabelle. Technical Report 449, University of Cambridge, Computer Laboratory, 1998. 131.
8. LP92. Z. Luo and R. Pollack. Lego proof development system: User’s manual. Technical Report ECS-LFCS-92-211, University of Edinburgh, 1992. 131.
9. Luo90a. Z. Luo. A Higher-order Calculus and Theory Abstraction. Information and Computation, 90(1), 1990. 131.
10. Luo90b. Z. Luo. An Extended Calculus of Constructions. PhD thesis, University of Edinburgh, 1990. Also as Report CST-65-90. 131.
11. Mac86. D. B. MacQueen. Using Dependant Types to Express Modular Structures. In Proc. 13th ACM Symp. Principles Programming Languages. ACM Press, 1986. 131.
12. NPS90. B. Nordström, K. Petersson, and J. M. Smith. Programming in Martin-Löf ’s Type Theory - An Introduction. Oxford Science Publications. Clarendon Press, Oxford, 1990. 125.
13. NW98. W. Naraschewski and M. Wenzel. Object-oriented Verification based on Record Subtyping in Higher-Order Logic. In 11th International Conference on Theorem Proving in Higher Order Logics, volume 1479 of LNCS, ANU, Canberra, Australia, 1998. Springer-Verlag. 121, 123.
14. OSR93. S. Owre, N. Shankar, and J. M. Rushby. The PVS Specification Language (Beta Release). Technical report, SRI International, 1993. 121, 123.
15. Pol90. R. Pollack. The Tarski Fixpoint Theorem. e-mail to: proof-sci@se.chalmers.cs, 1990. 131.
16. Polar, R. Pollack. Theories in Type Theory. Slides, available on the Web as http://www.brics.dk/pollack, unknown year. 132.
17. SB83. D. T. Sannella and R. M. Burstall. Structured Theories in LCF. In CAAP’83: Trees in Algebra and Programming, volume 159 of LNCS, pages 377-91. Springer-Verlag, 1983. 131.
18. Tar55. Alfred Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5:285-309, 1955. 130.