The HOL logic extended with quantification over type variables (1993)

Cached

Download Links

by Thomas F. Melham
Venue:Formal Methods in System Design, 3(1--2):7--24
Citations:18 - 0 self

Documents Related by Co-Citation

468 Introduction to HOL: A Theorem Proving Environment for Higher Order Logic – M Gordon, T Melham - 1993
728 A formulation of the simple theory of types – A Church - 1940
235 Constructive mathematics and computer programming – Per Martin-Lof - 1982
82 Edinburgh LCF: A Mechanised Logic – M J C Gordon, R Milner, C P Wadsworth - 1979
387 The Foundation of a Generic Theorem Prover – Lawrence C. Paulson - 1989
11 Translating Dependent Type Theory into Higher Order Logic – Bart Jacobs, Tom Melham - 1993
32 Order-sorted polymorphism in Isabelle – T Nipkow - 1993
58 Type Classes and Overloading in Higher-Order Logic – Markus Wenzel, Technische Universität München - 1997
27 A Package for Inductive Relation Definitions in HOL – Thomas Melham - 1992
874 A theory of type polymorphism in programming – Robin Milner - 1978
21 Exploring abstract algebra in constructive type theory – Paul B Jackson - 1994
69 Edinburgh LCF: A Mechanized Logic – Michael J Gordon, Robin Milner, Christopher P Wadsworth - 1979
1497 The Definition of Standard ML – Robin Milner, Mads Tofte, Robert Harper - 1990
85 Why higher-order logic is a good formalism for specifying and verifying hardware – M Gordon - 1985
6 Lazy techniques for fully expansive theorem proving – R J Boulton - 1993
43 A type-theoretical alternative to ISWIM – D Scott - 1993
52 HOL Light: A tutorial introduction – John Harrison - 1996
24 A Mizar mode for HOL – J Harrison - 1996
34 Locales and locale expressions in Isabelle/Isar – Clemens Ballarin - 2004