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

Active Bibliography

8 A Mechanized Theory of the pi-calculus in HOL – T. F. Melham - 1992
Desiderata for Interactive Verification Systems – Konrad Slind, Christian Prehofer - 1994
32 The Rho Cube – Horatiu Cirstea, Claude Kirchner, Luigi Liquori - 2001
24 From LCF to HOL: a short history – Mike Gordon - 2000
5 A Comparative Study of Coq and HOL – Vincent Zammit - 1997
11 Translating Dependent Type Theory into Higher Order Logic – Bart Jacobs, Tom Melham - 1993
5 Studying the ML Module System in HOL – Elsa Gunter, Savi Maharaj - 1994
2 Non-primitive Recursive Function Definitions – Sten Agerholm, Sten Agerholm - 1995
53 Types, Abstraction, and Parametric Polymorphism, Part 2 – QingMing Ma, John C. Reynolds - 1991
14 Hybrid Interactive Theorem Proving using Nuprl and HOL – Amy P. Felty, Douglas J. Howe - 1997
11 A thread of HOL development – Michael Norrish, Konrad Slind
3 Automatic Proof and Disproof in Isabelle/HOL – Jasmin Christian Blanchette, Lukas Bulwahn, Tobias Nipkow - 2011
Lambda-Calculus and Functional Programming – Jonathan P. Seldin
1 Subset Types and Partial Functions – Aaron Stump - 2003
Completeness Results for . . . – Mark Kaminski - 2006
5 A paraconsistent higher order logic – Jørgen Villadsen, Jørgen Villadsen - 2004
1 Supra-Logic: Using Transfinite Type Theory with Type Variables for Paraconsistency – Jørgen Villadsen
Artificial Intelligence and Symbolic Computation — AISC 2004 c ○ Springer-Verlag LNCS A Paraconsistent Higher Order Logic – Jørgen Villadsen
19 Higher Order Logic – Daniel Leivant - 1994