Winskel is (almost) Right: Towards a Mechanized Semantics Textbook

Formal Aspects of Computing

Volumn 10, Issue 2, 1998, Pages 171-186

  Nipkow, Tobias ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Higher order logic; HOL; Isabelle; Programming language; Semantics; Theorem proving

Indexed keywords

EID: 0013135170     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001650050009     Document Type: Article

References (26)

1. Apt, K.R. and Olderog, E.-R.: Verification of Sequential and Concurrent Programs. Springer-Verlag, 1991.
2. Bertot, Y. and Fraer, R.: Reasoning with executable specifications. In TAPSOFT '95: Theory and Practice of Software Development, volume 915 of Lect. Notes in Comp. Sci., pages 531-545. Springer-Verlag, 1995.
3. Devillers, M., Griffioen, D. and Müller, O.: Possibly infinite sequences in theorem provers: A comparative study. In E.L. Gunter and A. Felty, editors, Theorem Proving in Higher Order Logics, volume 1275 of Lect. Notes in Comp. Sci., pages 89-104. Springer-Verlag, 1997.
4. Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall, 1976.
5. Gordon, M.J.C. and Melham, T.F.: Introduction to HOL: a theorem-proving environment for higher order logic. Cambridge University Press, 1993.
6. Gordon, M.C.J.: Programming Language Theory and its Implementation. Prentice-Hall, 1988.
7. Gordon, M.C.J.: Mechanizing programming logics in higher order logic. In G. Birtwistle and P.A. Subrahmanyam, editors, Current Trends in Hardware Verification and Automated Theorem Proving. Springer-Verlag, 1989.
8. Homeier, P.V. and Martin, D.F.: A mechanically verified verification condition generator. The Computer Journal, 38:131-141, 1995.
9. Hudak, P., Peyton Jones, S. and Wadler, P.: Report on the programming language Haskell: A non-strict, purely functional language. ACM SIGPLAN Notices, 27(5), May 1992. Version 1.2.
10. Jones, M.P.: Qualified Types: Theory and Practice. Cambridge University Press, 1994.
11. Lötzbeyer, H. and Sandner, R.: Proof of the equivalence of the operational and denotational semantics of IMP in Isabelle/ZF. Project report, Institut für Informatik, TU München, 1994.
12. Müller, O. and Nipkow, T.: Traces of I/O automata in Isabelle/HOLCF. In M. Bidoit and M. Dauchet, editors, TAPSOFT'97: Theory and Practice of Software Development, volume 1214 of Lect. Notes in Comp. Sci., pages 580-594. Springer-Verlag, 1997.
13. Müller, O., Nipkow, T., Oheimb, D. von and Slotosch, O.: HOLCF = HOL + LCF. Submitted for publication, 1998.
14. Müller, O.: I/O automata and beyond - temporal logic and abstraction in Isabelle. In J. Grundy and M. Newey, editors, Theorem Proving in Higher Order Logics (TPHOLs'98), volume ? of Lect. Notes in Comp. Sci. Springer-Verlag, 1998. To appear.
15. Müller, O.: A Verification Environment for I/O-Automata Based on Formalized Meta-Theory. PhD thesis, Institut für Informatik, Techn. Univ. München, 1998. Forthcoming.
16. Nipkow, T.: Winskel is (almost) right: Towards a mechanized semantics textbook. In V. Chandru and V. Vinay, editors, Foundations of Software Technology and Theoretical Computer Science, volume 1180 of Lect. Notes in Comp. Sci., pages 180-192. Springer-Verlag, 1996.
17. light is type-safe - definitely. In Proc. 25th ACM Symp. Principles of Programming Languages, pages 161-170. ACM Press, 1998.
18. Oheimb, D. von and Nipkow, T.: Machine-checking the Java specification: Proving type-safety. In Jim Alves-Foss, editor, Formal Syntax and Semantics of Java, volume ? of Lect. Notes in Comp. Sci. Springer-Verlag, 1998. To appear.
19. Paulson, L.C.: Logic and Computation. Cambridge University Press, 1987.
20. Paulson, L.C.: Isabelle: A Generic Theorem Prover, volume 828 of Lect. Notes in Comp. Sci. Springer-Verlag, 1994.
21. Paulson, L.C.: Generic automatic proof tools. In R. Veroff, editor, Automated Reasoning and its Applications. MIT Press, 1997. Also Report 396, Computer Laboratory, University of Cambridge.
22. Regensburger, F.: HOLCF: Eine konservative Erweiterung von HOL um LCF. PhD thesis, Technische Universität München, 1994.
23. Regensburger, F.: HOLCF: Higher Order Logic of Computable Functions. In E.T. Schubert, P.J. Windley, and J. Alves-Foss, editors, Higher Order Logic Theorem Proving and its Applications, volume 971 of Lect. Notes in Comp. Sci., pages 293-307. Springer-Verlag, 1995.
24. Benthem Jutting, L.S. van: Checking Landau's "Grundlagen" in the AUTOMATH System. PhD thesis, Eindhoven University of Technology, 1977.
25. Wenzel, M.: Type classes and overloading in higher-order logic. In E.L. Gunter and A. Felty, editors, Theorem Proving in Higher Order Logics, volume 1275 of Lect. Notes in Comp. Sci., pages 307-322. Springer-Verlag, 1997.
26. Winskel, G.: The Formal Semantics of Programming Languages. MIT Press, 1993.