A HOL Basis for Reasoning about Functional Programs (1994)

by Sten Agerholm , Sten Agerholm , Ny Munkegade
Citations:23 - 6 self

Active Bibliography

3 Formalising a Model of the lambda-calculus in HOL-ST – Sten Agerholm - 1994
32 Extensible Denotational Language Specifications – Robert Cartwright, Matthias Felleisen - 1994
8 A Mechanized Theory of the pi-calculus in HOL – T. F. Melham - 1992
External Examiner – Weng Kin Ho, Dr. Martín Escardó - 2006
2 Non-primitive Recursive Function Definitions – Sten Agerholm, Sten Agerholm - 1995
12 LCF Examples in HOL – Sten Agerholm, Sten Agerholm - 1994
39 Experience with embedding hardware description languages in HOL – Richard Boulton, Andrew Gordon, Mike Gordon, John Harrison, John Herbert, John Van Tassel - 1992
24 HOLCF: Higher Order Logic of Computable Functions – Franz Regensburger - 1995
1 A Framework for Programming Denotational Semantics in C++ – Nikolaos S. Papaspyrou - 1996
15 Universal Profinite Domains – Carl A. Gunter - 1987
41 Mechanizing Coinduction and Corecursion in Higher-order Logic – Lawrence C. Paulson - 1997
2 Resolution in the Smyth Powerdomain – Guo-qiang Zhang, William C. Rounds - 1998
1 Building continuous webbed models for System F – S. Berardi, C. Berline - 2000
Minimal lambda-theories by ultraproducts – Alberto Carraro, Antonino Salibra, Università Ca, Foscari Venezia, Antonio Bucciarelli
4 Recursive Types in Games: Axiomatics and Process Representation (Extended Abstract) – Marcelo Fiore, Kohei Honda - 1998
3 Stable computational semantics of conflict-free rewrite systems (Draft). Available at http://www.sys.uea.ac.uk/~zurab – Zurab Khasidashvili, John Glauert - 2000
19 Higher Order Logic – Daniel Leivant - 1994
23 Correspondence between Operational and Denotational Semantics – C. -h. L. Ong - 1995
5 Machine-Assisted Theorem-Proving for Software Engineering – Andrew Martin - 1994