|
728
|
A formulation of the simple theory of types
– A Church
- 1940
|
|
163
|
Introduction to Lambda Calculus
– Henk Barendregt, Erik Barendsen
- 1994
|
|
5
|
The Coq Proof Assistant User’s Guide, version 6.1. INRIA-Rocquencourt et CNRSENS
– C Cornes, J Courant, J-C Filliâtre, G Huet, P Manoury, C Muñoz
- 1996
|
|
190
|
PVS: Combining Specification, Proof Checking, and Model Checking
– S. Owre, S. Rajan, J. M. Rushby, N. Shankar, M. Srivas
- 1996
|
|
184
|
Melham, editors. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic
– M J C Gordon, T F
- 1993
|
|
58
|
Type Classes and Overloading in Higher-Order Logic
– Markus Wenzel, Technische Universität München
- 1997
|
|
253
|
Interpretation fonctionelle et elimination des coupures de l’arithmetique d’ordre superieur. These d’Etat
– J Girard
- 1972
|
|
417
|
The calculus of constructions
– Coquand, G Huet
- 1988
|
|
4
|
Compagnoni A. [1996], Subtyping dependent types
– D Aspinall
|
|
2
|
Dekkers [1993] Systems of illative combinatory logic complete for first order propositional and predicate calculus, to appear in The Journal of Symbolic Logic
– H P Barendregt, M Bunder, W
|
|
2
|
Smetsers [1997] Uniqueness typing for functional languages with graph rewriting semantics
– E Barendsen, J E W
|
|
15
|
Can programming be liberated from the von Neuman style? A functional style and its algebra of programs
– J Backus
- 1978
|
|
3
|
Discriminating Coded Lambda Terms
– Henk Barendregt
- 1994
|
|
54
|
Zum Hilbertschen Aufbau der reellen Zahlen
– W Ackermann
- 1928
|
|
237
|
Foundations of Constructive Mathematics
– M J Beeson
- 1985
|
|
595
|
Compiling with Continuations
– Andrew Appel
- 1992
|
|
67
|
Conventional and Uniqueness Typing in Graph Rewrite Systems (Extended Abstract)
– Erik Barendsen, Sjaak Smetsers
- 1993
|
|
1
|
A.[1940].Aformulation of the simple theory oftypes, The
– Church
|
|
1
|
1992]. On the adequacy of representing higher order intuitionistic logic as a pure type system, Annals of Pure and Applied Logic 57
– K Fujita, H Tonino
|
