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

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

Documents Related by Co-Citation

264 Constructive mathematics and computer programming – P Martin-Lof - 1982
20 Computational Foundations of Basic Recursive Function Theory – Robert L. Constable, Scott Fraser Smith - 1988
56 A Non-Type-Theoretic Semantics for Type-Theoretic Language – S Allen - 1987
445 The formulae-as-types notion of construction – W A Howard - 1980
473 The Calculus of Constructions – T Coquand, G Huet - 1988
156 An intuitionistic theory of types: predicative part – P Martin-Löf - 1975
33 The MetaPRL Logical Programming Environment – J J Hickey - 2001
74 Implementing Mathematics with the Nuprl Development System – R L Constable - 1986
533 A Computational Logic – R BOYER, J MOORE - 1979
22 Type-Theoretic Methodology For Practical Programming Languages – Karl Fredrick Crary - 1998
159 Simple Type-Theoretic Foundations for Object-Oriented Programming – Benjamin C. Pierce, David N. Turner - 1993
96 Type Theory and Functional Programming – Simon Thompson, C Simon Thompson - 1991
29 Semantic Foundations for Embedding HOL in Nuprl – Douglas J. Howe - 1996
13 Foundations for the Implementation of Higher-Order Subtyping – Karl Crary - 1997
29 Formal Objects in Type Theory Using Very Dependent Types – Jason J. Hickey - 1996
32 A non-type-theoretic definition of Martin-Lof's types – S Allen - 1987
13 Constructive mathematics as a programming logic i: some principles of theory – R Constable - 1985
93 Computability and Complexity from a Programming Perspective. Foundations of Computing – Neil D Jones - 1997
162 Constructivism and Proof Theory – A. S. Troelstra - 2003