|
11
|
Higher-Order Abstract Syntax
– J Despeyroux, A Felty, A Hirschowitz
- 1995
|
|
4
|
de Bruijn. -Calculus Notation with Nameless Dummies, A Tool for Automatic Formula Manipulation
– N G
- 1972
|
|
6
|
Coq en Coq
– B Barras
- 1996
|
|
7
|
Primitive recursion for higher order abstract syntax
– Joëlle Despeyroux, Frank Pfenning, Carsten Schürmann
- 1996
|
|
10
|
Residual theory in -calculus: a complete Gallina development
– G Huet
- 1994
|
|
29
|
Checking Algorithms for Pure Type Systems
– L.S. van Benthem Jutting, J. McKinna, R. Pollack
- 1993
|
|
49
|
Five axioms of alpha-conversion
– Andrew D. Gordon, Tom Melham
- 1996
|
|
64
|
Constructions: A higher order proof system for mechanizing mathematics. volume 203
– T Coquand, G Huet
- 1985
|
|
29
|
From semantics to rules: A machine assisted analysis
– Catarina Coquand
- 1999
|
|
9
|
A Formalization of the Strong Normalisation Proof for System F
– T Altenkirch
- 1993
|
|
99
|
Inductively defined types
– T Coquand, C Paulin
- 1988
|
|
84
|
Reasoning with higher-order abstract syntax in a logical framework
– R McDowell, D Miller
- 2002
|
|
67
|
Natural Deduction
– D Prawitz
- 1965
|
|
172
|
Logic Programming in the LF Logical Framework
– Frank Pfenning
- 1991
|
|
36
|
Pure type systems formalized
– James Mckinna, Robert Pollack
- 1993
|
|
242
|
Programming in Martin-Löf’s Type Theory. An Introduction
– Bengt Nordström, Kent Petersson, Jan Smith
- 1990
|
|
997
|
The Lambda Calculus: its Syntax and Semantics
– H P Barendregt
- 1984
|
|
209
|
Investigations into logical deduction
– G Gentzen
- 1969
|
