|
553
|
A framework for defining logics
– Harper, Honsell, et al.
- 1993
|
|
488
|
Light linear logic
– Girard
- 1998
|
|
411
|
A syntactic approach to type soundness
– Wright, Felleisen
- 1994
|
|
366
|
Isabelle: A Generic Theorem Prover
– Paulson
- 1994
|
|
339
|
Uniform proofs as a foundation for logic programming
– Miller, Nadathur, et al.
- 1991
|
|
298
|
D.: Logic Programming in a Fragment of Intuitionistic Linear Logic
– Hodas, Miller
- 1994
|
|
268
|
A logic programming language with lambda-abstraction, function variables, and simple unification
– Miller
- 1991
|
|
233
|
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem
– Bruijn
- 1972
|
|
217
|
Higher-order abstract syntax
– PFENNING, ELLIOTT
- 1988
|
|
214
|
Constructive mathematics and computer programming
– Martin-Löf
- 1982
|
|
213
|
Programming in MartinLöf’s Type Theory, an introduction
– Nordström, Petersson, et al.
- 1990
|
|
192
|
An overview of Prolog
– Nadathur, Miller
- 1988
|
|
186
|
Logic programming in the LF logical framework
– Pfenning
- 1991
|
|
179
|
A unification algorithm for typed *-calculus
– Huet
- 1975
|
|
135
|
Rewriting logic as a logical and semantic framework
– Mart'i-Oliet, Meseguer
- 1993
|
|
117
|
de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation
– G
- 1972
|
|
115
|
Higher-order critical pairs
– Nipkow
- 1991
|
|
113
|
Type inference for polymorphic references
– Tofte
- 1990
|
|
101
|
types can change the world
– Linear
- 1990
|
|
99
|
The ALF proof editor and its proof engine
– Magnusson, Nordström
- 1994
|
|
97
|
Contraction-free sequent calculi for intuitionistic logic
– Dyckhoff
- 1992
|
|
95
|
A Multiple-Conclusioned Meta-Logic
– Miller
- 1994
|
|
92
|
On the meanings of the logical constants and the justifications of the logical laws
– Martin-Lof
- 1996
|
|
87
|
Using Typed Lambda Calculus to Implement Formal Systems on a Machine
– Honsell, Pollack
- 1992
|
|
82
|
A Unification Algorithm for Typed λ-Calculus
– Huet
- 1975
|
|
75
|
Partial polymorphic type inference and higher-order uni cation
– Pfenning
- 1988
|
|
72
|
Elf: A language for logic definition and verified metaprogramming
– Pfenning
- 1989
|
|
68
|
The Theory of LEGO: A Proof Checker for the Extended Calculus of Constructions
– Pollack
- 1994
|
|
68
|
An Overview of λProlog
– Nadathur, Miller
- 1988
|
|
67
|
Reflective metalogical frameworks
– Basin, Clavel, et al.
|
|
63
|
Implementing tactics and tacticals in a higher-order logic programming language
– Felty
- 1993
|
|
63
|
Specifying theorem provers in a higher-order logic programming language
– Felty, Miller
- 1988
|
|
58
|
Unification and anti-unification in the Calculus of Constructions
– Pfenning
- 1991
|
|
55
|
Efficient resource management for linear logic proof search
– Cervesato, Hodas, et al.
- 1996
|
|
50
|
Specifying and Implementing Theorem Provers in a Higher-Order Logic Programming Language
– Felty
- 1989
|
|
47
|
Constable et al. Implementing Mathematics with the NuPrl Proof Development System
– Robert
- 1986
|
|
47
|
The Coq proof assistant user’s guide. Rapport Technique 154
– DOWEK, FELTY, et al.
- 1993
|
|
46
|
Types in Logic Programming
– Pfenning, editor
- 1992
|
|
45
|
Structural Cut-Elimination
– Pfenning
- 1995
|
|
44
|
Natural semantics and some of its meta-theory in Elf
– Michaylov, Pfenning
- 1991
|
|
44
|
Refinement types for logical frameworks
– Pfenning
- 1993
|
|
42
|
Natural deduction as higher-order resolution
– Paulson
- 1986
|
|
41
|
Proof Theoretic Approach to Specification Languages
– Chirimar
- 1995
|
|
41
|
Elf: A meta-language for deductive systems
– Pfenning
- 1994
|
|
41
|
A mechanical proof of the Church-Rosser theorem
– Shankar
- 1988
|
|
39
|
Set theory for verification: I. From foundations to functions
– Paulson
- 1993
|
|
36
|
LDS - Labelled Deductive Systems (Volume 1 - Foundations
– Gabbay
- 1996
|
|
36
|
Compiler verification in LF
– Hannan, Pfenning
- 1992
|
|
36
|
The Implementation of ALF—A Proof Editor Based on Martin-Löf’s Monomorphic Type Theory with Explicit Substitution
– Magnusson
- 1995
|
|
36
|
Solving Higher-Order Equations: From Logic to Programming
– Prehofer
- 1995
|
|
