Expressing computational complexity in constructive type theory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 960, Issue , 1995, Pages 131-144

  Constable, Robert L ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FORMAL LANGUAGES; RECONFIGURABLE HARDWARE; SEMANTICS;

COMPUTATIONAL COMPLEXITY MEASURE; CONSTRUCTIVE PROOF; CONSTRUCTIVE TYPE THEORY; INDUCTIVE DEFINITIONS; INTERNAL DEFINITIONS; NATURAL FEATURES; PROGRAMMING LOGIC; RESOURCE-BOUNDED;

COMPUTATIONAL COMPLEXITY;

EID: 84957617938     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60178-3_82     Document Type: Conference Paper

References (29)

1. S. F. Allen, R. L. Constable, D. J. Howe, and W. Aitken. The Semantics of Reflected Proof. In Proc. of Fifth Symp. on Logic in Comp. Sci., pages 95-197. IEEE, June 1990.
2. J. L. Bates and R. L. Constable. Proofs as programs. ACM Trans. Program. Lang, and Syst., 7(1):53-71, 1985.
3. S. Bellantoni and S. Cook. A new recursion-theoretic characterization of the poly-time functions. Computational Complexity, 2:97-110, 1992.
4. M. Blum. A machine independent theory of computational complexity. J. ACM, 14:322-336, 1967.
5. S. Buss. The polynomial hierarchy and intuitionistic bounded arithmetic. In Structure in Complexity Theory, Lecture Notes in Computer Science No. 223, pages 77-103. Springer-Verlag, 1986.
6. nt- Congress for Logic, Methodology, and Phil, of Sci., pages 24-30, North-Holland, 1965.
7. R. L. Constable. Type two computational complexity. In Proc. 5th ACM Symp., Theory of Computing, pages 108-121, 1973.
8. R. L. Constable, S. F. Allen, H. Bromley, W. Cleaveland, J. Cremer, R. Harper, D. J. Howe, T. Knoblock, N. Mendler, P. Panangaden, J. T. Sasaki, and S. F. Smith. Implementing Mathematics with the Nuprl Development System. Prentice-Hall, NJ, 1986.
9. R. L. Constable and N. Mendler. Recursive Definitions in Type Theory. In Proc. of Logics of Prog. Conf., pages 61-78, January 1985. (Cornell TR 85-659).
10. R. L. Constable and D. Zlatin. The type theory of PL/CV3." ACM Trans, on Prog. Lang, and Systems, 6(1):94-117, January, 1984.
11. S. Cook and A. Urquhart. Functional interpretations of feasibly constructive arithmetic. In Proceedings of 21st Symposium on the Theory of Computing, pages 107-112. ACM, 1989. To appear in Annals of Pure and Applied Logic.
12. S. A. Cook and B. M. Kapron. Characterizations of the basic feasible functionals of finite type. In S. Buss and P. Scott, editors, Proceedings of MSI Workshop on Feasible Mathematics, pages 71-95, New York, 1990. Birkhāuser-Boston.
13. N. G. deBruijn. The mathematical language Automath, its usage and some of its extensions. In Symp. on Automatic Demonstration, Lecture Notes in Mathematics, Vol. 125, pages 29-61. Springer-Verlag, 1970.
14. P. Dybjer. Inductive sets and families in Martin-Löf's type theory and their set-theoretic semantics. In G. Huet and G. Plotkin, editors, Logical Frameworks, pages 280-306. Cambridge University Press, 1991.
15. S. Feferman. A language and axioms for explicit mathematics. In Algebra and Logic, Lecture Notes in Mathematics, pages 87-139. Springer-Verlag, 1975.
16. J.-Y. Girard, A. Scedrov, and P. J. Scott. Bounded linear logic. Theoretical Computer Science, 97(1):1-66, 1992.
17. A. Grzegorczyk. Recursive objects in all finite types. Fundamenta Mathe- maticae, 54:73-93, 1964.
18. J. Hartmanis and R. Stearns. On the computational complexity of algorithms. Transactions of the American Mathematics Society, 117:285-306, 1965.
19. W. Howard. The formulas-as-types notion of construction. In To H.B. Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism, pages 479-490. Academic Press, NY, 1980.
20. D. J. Howe. On computational open-endedness in Martin-Löf's type theory. In Proc. of Sixth Symp. on Logic in Comp. Sci., pages 162-172. IEEE Computer Society, 1991.
21. S. C. Kleene. Introduction to Metamathematics. D. Van Nostrand, Princeton, 1952.
22. D. Leivant. Functions over free algebras definable in the simply typed lambda calculus. Theoretical Computer Science, 121:309-321,1993.
23. D. Leivant. Stratified functional programs and computational complexity. In Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 325-333, Charleston, SC, January 1993. ACM, ACM Press.
24. P. Martin-Löf. Intuitionistic Type Theory, Studies in Proof Theory, Lecture Notes. Bibliopolis, Napoli, 1984.
25. K. Mehlhorn. Polynomial and abstract subrecursive classes. Journal of Computer and System Sciences, pages 148-176, 1976.
26. F. Pfenning and C. Paulin-Mohring. Inductively defined types in the calculus of constructions. In Mathematical Foundations of Program Semantics, 5th International Conference, Lecture Notes in Computer Science, Vol. 442, pages 209-228. Springer-Verlag, 1989.
27. D. Scott. Data types as lattices. SIAM J. Comput., 5:522-87, 1976
28. S. Smith and R. L. Constable. Partial objects in constructive type theory. In Proc. of Second Symp. on Logic in Comp. Sci., pages 183-93. IEEE, Washington, D.C., 1987.
29. K. Weihrauch. A simple and powerful approach for studying constructivity, computability and complexity. In J. Myers and M. O'Donnell, editors, Constructivity in Computer Science, Logic in Computer Science 613, pages 228-246. Springer-Verlag, 1991.