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

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

Documents Related by Co-Citation

497 Introduction to HOL – A theorem proving environment for higher order logic – M J C Gordon, T F Melham - 1993
845 A Formulation of the Simple Theory of Types – A Church - 1940
264 Constructive mathematics and computer programming – P Martin-Löf - 1979
87 Edinburgh LCF: A Mechanised Logic – M J C Gordon, R Milner, C P Wadsworth - 1979
418 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
33 Order-sorted polymorphism in isabelle – Tobias Nipkow, Tu München - 1993
68 Type Classes and Overloading in Higher-Order Logic – Markus Wenzel, Technische Universität München - 1997
28 A Package for Inductive Relation Definitions in HOL – Thomas Melham - 1992
935 A theory of type polymorphism in programming – Robin Milner - 1978
69 Edinburgh LCF, A Mechanized Logic – M Gordon, R Milner, C Wadsworth - 1979
22 Exploring abstract algebra in constructive type theory – Paul B Jackson - 1994
1559 The Definition of Standard ML – Robin Milner, Mads Tofte - 1990
22 Inductive definitions: automation and application – J Harrison - 1995
88 Why higher-order logic is a good formalism for specifying and verifying hardware – M J C Gordon - 1985
6 Lazy techniques for fully expansive theorem proving – Richard J Boulton - 1993
48 A type-theoretical alternative to ISWIM – D S Scott - 1993
70 HOL Light: A tutorial introduction – John Harrison - 1996
27 A Mizar Mode for HOL – John Harrison - 1996