|
242
|
Programming in Martin-Löf’s Type Theory. An Introduction
– Bengt Nordström, Kent Petersson, Jan Smith
- 1990
|
|
26
|
Terminating General Recursion
– Bengt Nordström
- 1988
|
|
506
|
A Computational Logic
– Robert S Boyer, J Strother Moore
- 1979
|
|
27
|
Do-it-yourself type theory
– R Backhouse, P Chisholm, G Malcolm, E Saaman
- 1989
|
|
98
|
Computation and reasoning. A type theory for computer science., volume 11
– Z Luo
- 1994
|
|
92
|
The ALF proof editor and its proof engine
– Lena Magnusson, Bengt Nordström
- 1994
|
|
235
|
Constructive mathematics and computer programming
– Per Martin-Lof
- 1982
|
|
81
|
Proving Properties of Programs by Structural Induction
– R. M. Burstall
- 1969
|
|
16
|
Pattern matching with dependent types. In Proceeding from the logical framework workshop at B*astad
– Thierry Coquand
- 1992
|
|
35
|
A formalization of the strong normalization proof for System F
– Thorsten Altenkirch
- 1993
|
|
33
|
Waldinger: Deductive Synthesis of the Unification Algorithm
– Z Manna, R
- 1981
|
|
64
|
Constructions: A higher order proof system for mechanizing mathematics. volume 203
– T Coquand, G Huet
- 1985
|
|
123
|
Intuitionistic type theory. Bibliopolis
– Per Martin-Löf
- 1984
|
|
41
|
Enhancing the Nuprl Proof Development System and Applying it to Computational Abstract Algebra
– Paul Bernard Jackson
- 1995
|
|
66
|
Infinite Objects in Type Theory
– Thierry Coquand
|
|
88
|
Type Theory and Functional Programming
– Simon Thompson, C Simon Thompson
- 1991
|
|
417
|
The calculus of constructions
– Coquand, G Huet
- 1988
|
|
474
|
Lambda Calculi with Types
– Henk Barendregt, S. Abramsky, D. M. Gabbay, T. S. E. Maibaum, H. P. Barendregt
- 1992
|
|
145
|
LEGO proof development system: User’s manual
– Z Luo, R Pollack
- 1992
|
