LCF Examples in HOL (1994)

Cached

Download Links

by Sten Agerholm , Sten Agerholm
Venue:The Computer Journal
Citations:12 - 4 self

Documents Related by Co-Citation

23 A HOL basis for reasoning about functional programs – Sten Agerholm - 1994
167 Logic and Computation: Interactive Proof with Cambridge LCF – L C Paulson - 1987
8 Domain Theory in HOL – S Agerholm - 1993
5 Graph Model of LAMBDA in Higher Order Logic – K D Petersen - 1993
422 The Foundation of a Generic Theorem Prover – Lawrence C. Paulson - 1989
3 and Mart n Musicante. An Action Semantics for ML Concurrency Primitives – RS-94-20 Peter D Mosses - 1994
3 Local Model Checking and Traces – RS-94-17 Allan Cheng - 1994
11 Count(q) does not imply Count(p) – Søren Riis - 1994
5 Automatic Verification of Real-Timed Systems Using EPSILON – Jens Chr. Godskesen, Kim G. Larsen, Arne Skou - 1994
267 Semantics of Programming Languages: Structures and Techniques. Foundations of Computing Series – C Gunter - 1992
58 eds.): Introduction to HOL: a theorem proving environment for higher order logic – M J C Gordon, T Melham - 1993
239 Formal Semantics of Programming Languages – Glynn Winskel
502 Introduction to HOL: A theorem proving environment for higher-order logic – Michael J C Gordon, Thomas F Melham - 1993
169 The category-theoretic solution of recursive domain equations – M B Smyth, G D Plotkin - 1982
74 Automating Recursive Type Definitions in Higher Order Logic – Thomas Melham - 1988
51 Winskel is (almost) Right - Towards a Mechanized Semantics Textbook – Tobias Nipkow - 1998
5 External-storage data structures for plane-sweep algorithms – L Arge - 1994
2 Theoretische Grundlagen von Programmiersprachen und – R Berghammer - 1996
305 Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS – Sam Owre, John Rushby, Natarajan Shankar, Friedrich Von Henke - 1995