The strength of the subset type in Martin-Lof's type theory (1988) [7 citations — 1 self]
Download:
|
|
by Anne Salvesen, Jan M. Smith
In Third Annual Symposium on Logic in Computer Science
ftp://ftp.cs.chalmers.se/pub/cs-reports/papers/smith/LICS.ps.gz
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Salvesen88thestrength,author = {Anne Salvesen and Jan M. Smith},
title = {The strength of the subset type in Martin-Lof's type theory},
booktitle = {In Third Annual Symposium on Logic in Computer Science},
year = {1988},
pages = {384--391},
publisher = {IEEE}
}
Years of Citing Articles
Abstract:
A program satisfying a specification in Martin-Lof's type theory may have parts which never will be used when computing the program. The reason for this is that the interpretation of propositions as types
Citations
| 280 | Intuitionistic Type Theory – Martin-Lof - 1984 |
| 216 | Constructive mathematics and computer programming – Martin-Lof - 1982 |
| 215 | Programming in Martin-Löf’s Type Theory: an introduction – Nordstrom, Petersson, et al. - 1990 |
| 167 | Intensional Interpretation of Functionals of Finite Type – Tait - 1967 |
| 116 | An intuitionistic theory of types: predicative part – Martin-Lof - 1975 |
| 104 | Metamathematical Investigation of Intuitionistic Arithmetic and Analysis – Troelstra - 1973 |
| 10 | Concerning formulas of the types A ! B C; A ! (Ex)B(x) in intuitionistic formal systems – Harrop - 1960 |
| 6 | Types and specifications – Nordström, Petersson - 1983 |
| 5 | On a Nonconstructive Type Theory and Program Derivation. To appear – Smith - 1986 |
| 2 | Types and specificat ions – Nordstrom, Petersson - 1983 |
| 2 | Stable propositions in Martin-Lof's extensional type theory – Salvesen - 1989 |
| 2 | Notions of Realizability – Troelstra - 1971 |
