HOLCF = HOL + LCF

Journal of Functional Programming

Volumn 9, Issue 2, 1999, Pages 191-223

  Müller, Olaf ^a   Nipkow, Tobias ^a   Von Oheimb, David ^a   Slotosch, Oscar ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033437276     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S095679689900341X     Document Type: Article

References (33)

1. Agerholm, S. (1994a) Formalising a model of the λ-calculus in HOL-ST. Technical Report 354, University of Cambridge Computer Laboratory.
2. Agerholm, S. (1994b) A HOL basis for reasoning about functional programs. PhD thesis, Department of Computer Science, University of Aarhus. (BRICS report RS-94-44.)
3. Agerholm, S. (1995) LCF examples in HOL. The Computer J., 38, 121-130.
4. Audebaud, P. (1991) Partial objects in the calculus of constructions. 6th IEEE Symp. Logic in Computer Science, pp. 86-95. IEEE Press.
5. Bartels, F., Dold, A., von Henke, F., Pfeifer, H. and Rueß, H. (1996) Formalizing fixed-point theory in PVS. Technical Report, Universität Ulm.
6. Constable, R. and Smith, S. (1987) Partial objects in constructive type theory. 2nd IEEE Symp. Logic in Computer Science, pp. 183-193. IEEE Press.
7. Constable, R. L. et al. (1986) Implementing Mathematics with the NURPL Proof Development System. Prentice-Hall.
8. Crary, K. (1998) Admissibility of fixpoint induction over partial types. In: Kirchner, C. and Kirchner, H. (eds), Automated Deduction - CADE-15: Lecture Notes in Computer Science 1421, pp. 270-285. Springer-Verlag.
9. Devillers, M., Griffioen, D. and Müller, O. (1997) Possibly infinite sequences in theorem provers: A comparative study. In: Gunter, E. L. and Felty, A. (eds), Theorem Proving in Higher Order Logics: Lecture Notes in Computer Science 1275, pp. 89-104. Springer-Verlag.
10. Gordon, M. C. J., Milner, R. and Wadsworth, C. P. (1979) Edinburgh LCF: a mechanised logic of computation : Lecture Notes in Computer Science 78. Springer-Verlag.
11. Gordon, M. J. C. and Melham, T. F. (eds). (1993) Introduction to HOL: A theorem-proving environment for higher order logic. Cambridge University Press.
12. Hudak, P., Peyton Jones, S. and Wadler, P. (1992) Report on the programming language Haskell: A non-strict, purely functional language. ACM SIGPLAN Notices, 27(5).
13. Lynch, N. and Tuttle, M. (1989) An introduction to Input/Output automata. CWI Quarterly, 2(3), 219-246.
14. Müller, O. (1998a) I/O automata and beyond - temporal logic and abstraction in Isabelle. In: Grundy, J. and Newey, M. (eds), Theorem Proving in Higher Order Logics (TPHOLs'98): Lecture Notes in Computer Science 1479, pp. 1-18. Springer-Verlag.
15. Müller, O. (1998b) A verification environment for I/O-automata based on formalized meta-theory. PhD thesis, Institut für Informatik, Technical Universität München.
16. Müller, O. and Nipkow, T. (1997) Traces of I/O automata in Isabelle/HOLCF. In: Bidoit, M. and Dauchet, M. (eds), Tapsoft'97: Theory and practice of software development: Lecture Notes in Computer Science 1214, pp. 580-594. Springer-Verlag.
17. Nipkow, T. (1993) Order-sorted polymorphism in Isabelle. In: Huet, G. and Plotkin, G. (eds), Logical Environments, pp. 164-188. Cambridge University Press.
18. Nipkow, T. (1996) Winskel is (almost) right: Towards a mechanized semantics textbook. In: Chandru, V. and Vinay, V. (eds), Foundations of Software Technology and Theoretical Computer Science: Lecture Notes in Computer Science 1180, pp. 180-192. Springer-Verlag.
19. Nipkow, T. (1998a) Isabelle/HOL. The Tutorial. Unpublished Manuscript. (Available at www.in.tum.de/~nipkow/pubs/HOL.html.)
20. Nipkow, T. (1998b) Winskel is (almost) right: Towards a mechanized semantics textbook. Formal Aspects of Computing, 10, 171-186.
21. Nipkow, T. and Slind, K. (1995) I/O automata in Isabelle/HOL. In: Dybjer, P., Nordström, B. and Smith, J. (eds), Types for Proofs and Programs: Lecture Notes in Computer Science 996, pp. 101-119. Springer-Verlag.
22. Oheimb, D. von. (1995) Datentypspezifikationen in Higher-Order LCF. MPhil thesis, Technische Universität München.
23. Paulson, L. C. (1985) Verifying the unification algorithm in LCF. Science of Computer Programming, 5, 143-169.
24. Paulson, L. C. (1987) Logic and Computation. Cambridge University Press.
25. Paulson, L. C. (1994) Isabelle: A generic theorem prover: Lecture Notes in Computer Science 828. Springer-Verlag.
26. Paulson, L. C. (1997) Generic automatic proof tools. In: Veroff, R. (ed), Automated reasoning and its applications. MIT Press. (Also Report 396, Computer Laboratory, University of Cambridge.)
27. Regensburger, F. (1994) HOLCF: Eine konservative Erweiterung von HOL um LCF. PhD thesis, Technische Universität München.
28. Regensburger, F. (1995) HOLCF: Higher Order Logic of Computable Functions. In: Schubert, E. T., Windley, P. J. and Alves-Foss, J. (eds), Higher Order Logic Theorem Proving and its Applications: Lecture Notes in Computer Science 971, pp. 293-307. Springer-Verlag.
29. Slind, K. (1996) Function definition in higher order logic. In: von Wright, J., Grundy, J. and Harrison, J. (eds), Theorem Proving in Higher Order Logics: Lecture Notes in Computer Science 1125, pp. 381-397. Springer-Verlag.
30. Slotosch, O. (1997a) Higher order quotients and their implementation in isabelle hol. In: Gunter, E. L. and Felty, A. (eds), Theorem proving in higher order logics: Lecture Notes in Computer Science 1275, pp 291-306. Springer-Verlag.
31. Slotosch, O. (1997b) Refinements in HOLCF: Implementation of interactive systems. PhD thesis, Institut für Informatik, TU München.
32. Wenzel, M. (1997) Type classes and overloading in higher-order logic. In: Gunter, E. L. and Felty, A. (eds), Theorem Proving in Higher Order Logics: Lecture Notes in Computer Science, pp. 307-322. Springer-Verlag.
33. Winskel, G. (1993) The Formal Semantics of Programming Languages. MIT Press.