|
|
A Reference Version of HOL
– John Harrison, Konrad Slind
|
|
1
|
HOL Light Tutorial (for version 2.20). http://www.cl.cam.ac.uk/ jrh13/hol-light/tutorial 220.pdf
– John Harrison
|
|
10
|
Towards Self-verification of HOL Light
– John Harrison
- 2006
|
|
8
|
Verifying the Unification Algorithm in LCF
– Lawrence C. Paulson
- 1985
|
|
51
|
Natural Deduction as Higher-Order Resolution
– Lawrence C Paulson
- 1986
|
|
46
|
Metatheory and Reflection in Theorem Proving: A Survey and Critique
– John Harrison
- 1995
|
|
7
|
HOL Light Tutorial (for version 2.20
– John Harrison
- 2006
|
|
|
Model Existence for Higher Order Logic
– Christoph Benzmüller, Michael Kohlhase
- 2000
|
|
|
A Challenge for Mechanized Deduction
– Christoph Benzmüller, Manfred Kerber
|
|
6
|
Higher-Order Automated Theorem Proving for Natural Language Semantics
– Michael Kohlhase, Michael Kohlhase, Karsten Konrad, Karsten Konrad
- 1998
|
|
1
|
Higher-Order Order-Sorted Resolution
– Michael Kohlhase
- 1994
|
|
|
Unification in a Sorted λ-Calculus with Term Declarations and Function Sorts
– Michael Kohlhase
- 1994
|
|
2
|
Integrating TPS with ΩMEGA
– Christoph Benzmüller, Volker Sorge
- 1998
|
|
2
|
A Lost Proof
– Christoph Benzmüller, Manfred Kerber
- 2001
|
|
10
|
Extensional higher-order resolution
– Christoph Benzmüller, Michael Kohlhase
- 1998
|
|
52
|
Unification of simply typed lambda-terms as logic programming
– Dale Miller
- 1991
|
|
41
|
A Resolution Theorem Prover for Intuitionistic Logic
– Tanel Tammet
- 1996
|
|
5
|
Higher-Order Automated Theorem Proving
– Michael Kohlhase
- 1998
|
|
145
|
Higher-order logic programming
– Gopalan Nadathur, Dale Miller
|
