A Functional Programming View of Type Theory
Download:
|
|
by Thorsten Altenkirch, Thierry Coquand
http://www.tcs.informatik.uni-muenchen.de/~alti/ALF/alf++.ps
Add To MetaCart
Abstract:
This paper suggests a method for the design of proof system based on type theory. We design first a partial type theory, which can be viewed as a functional programming language with dependent types and which has types as first class
Citations
| 162 | The Formal Semantics of Programming Languages: An Introduction – Winskel - 1993 |
| 149 | LEGO Proof Development System: User’s Manual – Luo, Pollack - 1992 |
| 121 | Inductive Definitions in the System Coq: Rules and Properties – Paulin-Mohring - 1993 |
| 98 | The ALF proof editor and its proof engine – Magnusson, Nordström - 1994 |
| 78 | Constable et al. Implementing Mathematics with the NuPrl Proof Development System – L - 1986 |
| 54 | Infinite objects in Type Theory – Coquand - 1993 |
| 52 | Inductive families – Dybjer - 1994 |
| 50 | Codifying guarded definitions with recursion schemes – Giménez - 1994 |
| 35 | A User's Guide to ALF – Altenkirch, Gaspes, et al. - 1994 |
| 10 | Universes and a general notion of simultaneous inductive-recursive definition in type theory – Dybjer - 1992 |
| 7 | A polymorphic lambda calculus with type:type – Cardelli - 1986 |
| 6 | Mode and termination analysis for higher-order logic programs – Rohwedder - 1996 |
| 1 | Description of a Simple Programming Language – Nordstrom - 1984 |
