|
16
|
Higher Order Logic
– Daniel Leivant
- 1994
|
|
|
Contents
– The Phragmén-lindelöf Theorem
- 2006
|
|
7
|
Designing a Theorem Prover
– Lawrence C Paulson
- 1990
|
|
2
|
Proof-search in type-theoretic languages: an introduction
– Didier Galmiche, David J. Pym
- 2000
|
|
203
|
A Linear Logical Framework
– Iliano Cervesato, Frank Pfenning
- 1996
|
|
24
|
Extensions and Applications of Higher-order Unification
– Conal M. Elliott
- 1990
|
|
51
|
Natural Deduction as Higher-Order Resolution
– Lawrence C Paulson
- 1986
|
|
334
|
Uniform proofs as a foundation for logic programming
– Dale Miller, Gopalan Nadathur , Frank Pfenning , Andre Scedrov
- 1991
|
|
271
|
A logic programming language with lambda-abstraction, function variables, and simple unification
– Dale Miller
- 1990
|
|
109
|
Unification under a mixed prefix
– Dale Miller
- 1992
|
|
|
Abstract An Extension to ML to Handle Bound Variables in Data Structures: Preliminary Report
– Dale Miller
|
|
9
|
Program Development Schemata as Derived Rules
– Penny Anderson, David Basin
- 2000
|
|
88
|
The Proof-Theory and Semantics of Intuitionistic Modal Logic
– Alex K. Simpson
- 1994
|
|
64
|
tps: A theorem proving system for classical type theory
– Peter B. Andrews, Matthew Bishop, Sunil Issar, Dan Nesmith, Frank Pfenning, Hongwei Xi
- 1996
|
|
54
|
Higher-Order Horn Clauses
– Gopalan Nadathur, Dale Miller
- 1990
|
|
4
|
Formalization of the Development Process
– David Basin, Bernd Krieg-Brückner
- 1998
|
|
70
|
Elf: A Language for Logic Definition and Verified Metaprogramming
– Frank Pfenning
- 1989
|
|
|
Preliminary Report
– Dale Miller, Linc Lab, Dale Miller, Dale Miller
- 1990
|
|
|
A Preliminary User's Manual for Isabelle
– Lawrence C Paulson
|
