Object-oriented verification based on record subtyping in higher-order logic

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

Volumn 1479, Issue , 1998, Pages 349-366

  Naraschewski, Wolfgang ^a   Wenzel, Markus ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FORMAL LANGUAGES; FORMAL LOGIC;

EXTENSIBLE RECORDS; GENERIC FUNCTIONS; HIGHER ORDER LOGIC; LATE BINDINGS; OBJECT-ORIENTED SPECIFICATIONS; OBJECT-ORIENTED VERIFICATION; PARAMETRIC POLYMORPHISM; SPECIFIC PROPERTIES;

THEOREM PROVING;

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

References (13)

1. P. B. Andrews. An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof. Academic Press, 1986.
2. A. Church. A formulation of the simple theory of types. Journal of Symbolic Logic, pages 56-68, 1940.
3. M. J. C. Gordon and T. F. Melham (editors). Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press, 1993.
4. U. Hensel, M. Huisman, B. Jacobs, and H. Tews. Reasoning about classes in objectoriented languages: Logical models and tools. In Proceedings of ESOP/ETAPS, volume 1381 of Lecture Notes in Computer Science. Springer-Verlag, 1998.
5. M. Hofmann, W. Naraschewski, M. Steffen, and T. Stroup. Inheritance of proofs. Theory and Practice of Object Systems, Special Issue on Third Workshop on Foundations of Object-Oriented Languages (FOOL 3), 4(1):51-69, 1998.
6. L. Lamport and L. C. Paulson. Should your specification language be typed? Technical Report 425, University of Cambridge Computer Laboratory, 1997.
7. J. C. Mitchell and G. D. Plotkin. Abstract types have existential type. ACM Trans. Prog. Lang. Syst., 10(3):470-502, July 1988.
8. W. Naraschewski. Object-Oriented Proof Principles using the Proof-Assistant Lego. Diplomarbeit, Universit~it Erlangen, 1996.
9. W. Naraschewski. Towards an object-oriented progification language. In E. L. Gunter and A. Felty, editors, Theorem Proving in Higher Order Logics: lOth International Conference, TPHOLs'97, volume 1275 of Lecture Notes in Computer Science, pages 215-230. Springer-Verlag, 1997.
10. L. C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of Lecture Notes in Computer Science. Springer-Verlag, 1994.
11. B. C. Pierce and D. N. Turner. Simple type-theoretic foundations for objectoriented programming. Journal of Functional Programming, 4(2):207-247, 1994.
12. A. Pitts. The HOL logic. In Gordon and Melham [3], pages 191-232.
13. M. Wenzel. Type classes and overloading in higher-order logic. In E. L. Gunter and A. Felty, editors, Theorem Proving in Higher Order Logics: lOth International Conference, TPHOLs'97, volume 1275 of Lecture Notes in Computer Science, pages 307-322. Springer-Verlag, 1997.