Computational Complexity and Induction for Partial Computable Functions in Type Theory (1999)

by Robert L. Constable , Karl Crary
Venue:In Preprint
Citations:12 - 7 self

Documents Related by Co-Citation

280 Constructive mathematics and computer programming – P Martin-Löf - 1982
497 The calculus of constructions – T Coquand, G P Huet - 1988
469 The formulae-as-types notion of construction – W Howard - 1980
21 Computational Foundations of Basic Recursive Function Theory – Robert L Constable, Scott F Smith - 1988
172 An intuitionistic theory of types: predicative part, logic colloquium '73 , Rose and Shepherdson (eds – P Martin-Lof - 1973
929 A Theory of Objects – Luca Cardelli, Martín Abadi - 1996
56 A Non-Type-Theoretic Semantics for Type-Theoretic Language – Stuart F Allen - 1987
165 Simple Type-Theoretic Foundations for Object-Oriented Programming – Benjamin C. Pierce, David N. Turner - 1993
548 A Computational Logic – R S Boyer, J S Moore - 1979