Peter B. Andrews, Dale A. Miller, Eve Longini Cohen, Frank Pfenning, "Automating HigherOrder Logic," in Automated Theorem Proving: After 25 Years, edited by W. W. Bledsoe and D. W. Loveland, Contemporary Mathematics series, vol. 29, American Mathematical Society, 1984, 169-192. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents
An Equational Re-Engineering of Set Theories - Formisano, Omodeo (1998) (Correct)
A Formulation of the Simple Theory of Types (for Isabelle) - Paulson (1989) (Correct)
Designing a Theorem Prover - Lawrence Paulson Computer (1990) (9 citations) (Correct)
Natural Deduction as Higher-Order Resolution - Paulson (1986) (32 citations) (Correct)
Set Theory as a Computational Logic: - From Foundations To (Correct)
Discoveries and Experiments in the Automation of Mathematical.. - Shults (2002) (Correct)
Unification in a Sorted λ-Calculus with Term Declarations .. - Kohlhase (1994) (Correct)
HOL - A Machine Oriented Formulation of Higher Order Logic - Gordon (2001) (45 citations) (Correct)
The Foundation of a Generic Theorem Prover - Paulson (1989) (113 citations) (Correct)
Model Existence for Higher Order Logic - Benzmüller, Kohlhase (2000) (Correct)
Discoveries and Experiments in the Automation of Mathematical.. - Shults (1997) (Correct)
Higher-Order Order-Sorted Resolution - Kohlhase (1994) (1 citation) (Correct)
A Resolution Theorem Prover for Intuitionistic Logic - Tammet (1996) (23 citations) (Correct)
Unification in a Sorted λ-Calculus with Term Declarations .. - Kohlhase (1994) (Correct)
Desiderata for Interactive Verification Systems - Slind, Prehofer (1994) (Correct)
Higher-Order Rigid E-Unification - Goubault (Correct)
Higher Order Logic - Leivant (1994) (9 citations) (Correct)
Set Theory for Verification: I. From Foundations to Functions - Paulson (1998) (2 citations) (Correct)
An Equational Re-Engineering of Set Theories - Formisano, Omodeo (1998) (Correct)
A Combinator-based Order-sorted Higher-order Unification Algorithm - Johann (1993) (1 citation) (Correct)
Higher-order Unification with Dependent Function Types - Elliott (1989) (12 citations) (Correct)
Unification in an Extensional Lambda Calculus with Ordered.. - Johann, Kohlhase (1993) (1 citation) (Correct)
TPS: A Theorem Proving System for Classical Type Theory - Andrews, Bishop, Issar.. (1994) (43 citations) Self-citation (Andrews Pfenning) (Correct)
TPS: A Theorem-Proving System for Classical Type Theory - Andrews, Bishop, Issar.. (1996) (43 citations) Self-citation (Andrews Pfenning) (Correct)
Some Uses of Higher-Order Logic in Computational Linguistics - Miller, Nadathur (1986) (11 citations) Self-citation (Miller) (Correct)
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC