|
530
|
A framework for defining logics
– Harper, Honsell, et al.
- 1993
|
|
479
|
On the unity of logic
– Girard
- 1993
|
|
464
|
Introduction to HOL: A Theorem Proving Environment for Higher-Order Logic,” Cambridge
– Gordon, Melham
- 1993
|
|
444
|
Lambda calculi with types
– Barendregt
- 1991
|
|
399
|
Institutions: Abstract Model Theory for Specification and Programming
– Goguen, Burstall
- 1992
|
|
378
|
Untersuchungen über das logische Schliessen
– Gentzen
- 1934
|
|
356
|
The formulas-as-types notion of construction
– Howard
- 1980
|
|
261
|
Natural semantics
– Kahn
- 1987
|
|
225
|
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem
– Bruijn
- 1972
|
|
223
|
Logic programming with focusing proofs in linear logic
– Andreoli
- 1992
|
|
213
|
Constructive mathematics and computer programming
– Martin-Löf
- 1979
|
|
188
|
A linear logical framework
– Cervesato, Pfenning
- 1996
|
|
178
|
A unification algorithm for typed -calculus
– Huet
- 1975
|
|
134
|
Rewriting logic as a logical and semantic framework
– Oliet, Meseguer
- 1993
|
|
131
|
Proving and applying program transformations expressed with second-order patterns
– Huet, Lang
- 1978
|
|
109
|
The undecidability of the secondorder unification problem
– Goldfarb
- 1981
|
|
106
|
An algorithm for testing conversion in type theory
– Coquand
- 1991
|
|
105
|
Introduction to Higher-Order Categorical Logic
– Lambek, Scott
- 1986
|
|
104
|
Primitive recursion for higher-order abstract syntax
– Schürmann, Despeyroux, et al.
|
|
98
|
The ALF proof editor and its proof engine
– Magnusson, Nordström
- 1994
|
|
94
|
A Survey of the Project AUTOMATH
– Bruijn
- 1980
|
|
88
|
On the meanings of the logical constants and the justifications of the logical laws
– Martin-Löf
- 1985
|
|
80
|
A unification algorithm for typed λ-calculus
– Huet
- 1975
|
|
77
|
An Overview of ELAN
– Borovansk´y, Kirchner, et al.
|
|
70
|
The semantics of reflected proof
– Allen, Constable, et al.
- 1990
|
|
66
|
Reflective metalogical frameworks
– Basin, Clavel, et al.
- 2004
|
|
62
|
Specifying theorem provers in a higher-order logic programming language
– Felty, Miller
- 1988
|
|
60
|
The mathematical language Automath: Its usage and some of its extensions
– deBruijn
|
|
56
|
On equivalence and canonical forms in the LF type theory
– Harper, Pfenning
- 1999
|
|
50
|
Some properties of conversion
– Church, Rosser
- 1936
|
|
50
|
Specifying and Implementing Theorem Provers in a Higher-Order Logic Programming Language
– Felty
- 1989
|
|
45
|
The Coq proof assistant user's guide. Rapport Technique 154
– Dowek, Felty, et al.
|
|
41
|
Proof Theoretic Approach to Specification Languages
– Chirimar
- 1995
|
|
36
|
Grundlagen der Mathematik I
– Hilbert, Bernays
- 1934
|
|
36
|
The Implementation of ALF--A Proof Editor Based on MartinL"of 's Monomorphic Type Theory with Explicit Substitution
– Magnusson
- 1995
|
|
36
|
The Coq Proof Assistant User’s Guide
– Dowek, Felty, et al.
- 1993
|
|
33
|
A predicative analysis of structural recursion
– Abel, Altenkirch
- 2000
|
|
32
|
eine der arithmetischen nachgebildete Formelsprache des reinen Denkens
– Frege
|
|
27
|
Investigating a Proof-Theoretic Meta-Language for Functional Programs
– Hannan
- 1991
|
|
25
|
Extensions and Applications of Higher-Order Unification
– Elliott
- 1990
|
|
25
|
The Church-Rosser property for fij-reduction in typed -calculi
– Geuvers
- 1992
|
|
24
|
Representing Logics in Type Theory
– Gardner
- 1992
|
|
22
|
A finitary version of the calculus of partial inductive definitions
– Eriksson
- 1991
|
|
22
|
Encoding a dependent-type -calculus in a logic programming language
– Felty, Miller
- 1990
|
|
22
|
A module system for a programming language based on the LF logical framework
– Harper, Pfenning
- 1992
|
|
19
|
The undecidability of unification in third order logic
– Huet
- 1973
|
|
18
|
Extended natural semantics
– Hannan
- 1993
|
|
18
|
Essays on Combinatory Logic, Lambda Calculus, and Formalism
– Curry
- 1980
|
|
16
|
Higher-order abstract syntax with induction in Coq
– Despeyroux, Hirschowitz
- 1994
|
|
16
|
Lambda calculus with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem
– Bruijn
- 1972
|
