HOLCF: Higher order logic of computable functions

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

Volumn 971, Issue , 1995, Pages 294-307

  Regensburger, Franz ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957872744     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60275-5_72     Document Type: Conference Paper

References (15)

1. Sten Agerholm. A HOL Basis for Reasoning about Functional Programs. PhD thesis, University of Aarhus, BRICS Departement of Computer Science, 1994. BRICS Report Series RS-94-44.
2. Manfred Broy, Frank Dederichs, Claus Dendorfer, Max Fuchs, Thomas Gritzner, and Ruiner Weber. The Design of Distributed Systems: An Introduction to FOCUS. Technical Report TUM-I9202-2, Institut für Informatik, Technische Universität Mfinchen, 1993.
3. H.D. Ehrich, M. Gogolla, and U.W. Lippeck. Algebraische Spezifikation abstrakter Datentypen. Teubner, 1989.
4. M.J.C. Gordon and T.F. Melham. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, 1993.
5. M. Gordon, R. Milner, and C. Wadsworth. Edinburgh LCF: A Mechanised Logic of Computation, volume 78 of LNCS. Springer, 1979.
6. Carl A. Gunter. Semantics of Programmin of Languages: Structures and Techniques. The MIT Press, 1992.
7. Tobias Nipkow. Order-Sorted Polymorphism in Isabelle. In G. Huet, G. Plotkin, and C. Jones, editors, Proc. 2nd Workshop on Logical Frameworks, pages 307-321, 1991.
8. Tobias Nipkow and Christian Prehofer. Type checking type classes. In Proc. 20th ACM Symp. Principles of Programmin of Languages, pages 409-418, 1993.
9. L.C. Paulson. Deriving Structural Induction in LCF, volume 173 of LNCS, pages 197-214. Springer, 1984.
10. L.C. Paulson. Logic and Computation, Interactive Proof with Cambridge LCF, volume 2 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1987.
11. L.C. Paulson. The foundation of a generic theorem prover. Journal of Automated Reasoning, 5(3):363-397, 1989.
12. L.C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of LNCS. Springer, 1994.
13. Andrew Pitts. A co-induction principle for recursively defined domains. Technical Report 252, University of Cambridge, Computer Laboratory, 1992.
14. Franz Regensburger. HOLCF: Eine konservative Erweiterung yon HOL am LCF, 1994. Dissertation, Technische Universität München.
15. G. Winskel. The Formal Semantics of Programming Languages. The MIT Press, 1993.