Lambda calculus characterizations of poly-time

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

Volumn 664 LNCS, Issue , 1993, Pages 274-288

  Leivant, Daniel ^a   Marion, Jean Yves ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; BIOMINERALIZATION; CALCULATIONS; PATHOLOGY;

DISCRIMINATOR FUNCTION; INPUT AND OUTPUTS; LAMBDA CALCULUS; LAMBDA-CALCULI; SIMPLE TYPES; TIME FUNCTION;

DIFFERENTIATION (CALCULUS);

EID: 24644467626     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0037112     Document Type: Conference Paper

References (31)

1. Bar80 Hendrick P. Barendregt, The Lambda-Calculus: Its Syntax and Semantics, North-Holland, 1980.
2. BB85 Corrado Böhm and Allessandro Berarducci, Automalic synlhesis of typed λ-programs on term algebras, Theoretical Computer Science 39 (1985) 135-154.
3. BC92 Stephen Bellantoni and Stephen Cook, A new recursion-theoretic characterization of the poly-time functions, to appear in Computational Complexity 1992.
4. Blo92 Stephen Bloch, Functional characterizations of uniform log-depth and polylog-depth circuit families, to appear in the Proceedings of the 1992 IEEE Conference on Structure in Complexity.
5. Bus86 Samuel Buss, Bounded Arithmetic, Bibliopolis, Naples, 1986.
6. Cob65 A. Cobham, The intrinsic computational difficulty of functions, in Y. Bar-Hillel (ed.), Proceedings of the International Conference on Logic, Methodology, and Philosophy of Science, North-Holland, Amsterdam (1962) 24-30.
7. FLO83 Steven Fortune, Daniel Leivant, and Michael O’Donnell, The expressiveness of szmple and second order type structures, Journal of the ACM 30 (1983), pp 151-185.
8. For79 Steven Fortune, Topics in Computational Complexity, PhD Dissertation, Cornell University, Ithaca, NY, 1979.
9. Gir72 Jean-Yves Girard, Interprétation fonctionellc et élimination des coupures dans l’arithmétique d’ordre superieur, These de Doctorat d’Etat, 1972, Paris.
10. Grz53 A. Grzegoczyk, Some classes of recursive functions, Rozprawy Mate. IV, Warsaw, 1953.
11. GS86 Yuri Gurevich and Saharon Shelah, Fixed-point extensions of first-order logic, Annals of Pure and Applied Logic 32 (1986) 265-280.
12. Gur83 Yuri Gurevich, Algebras of feasible functions, Twenty Fourth Symposium on Foundations of Computer Science, IEEE Computer Society Press, 1983, 210-214.
13. Imm86 Neil Immerman, Relational queries computable in polynomial time, Information and Control 68 (1986) 86-104. Preliminary report in Fourteenth ACM Symposium on Theory of Computing (1982) 147-152.
14. Imm87 Neil Immerman, Languages which capture complexity classes, SIAM Journal of Computing 16 (1987) 760-778.
15. Lei90 Daniel Leivant, Subrecursion and lambda representation over free algebras (Preliminary Summary), in Samuel Buss & Philip Scott (eds.), Feasible Mathematics, Perspectives in Computer Science, Birkhauser-Boston, New York (1990) 281-291.
16. Lei90a Daniel Leivant, Inductive definitions over finite structures, Information and Computation 89 (1990) 95-108.
17. Lei91 Daniel Leivant, A foundational delineation of computational feasiblity, in Proceedings of the Sixth IEEE Conference on Logic in Computer Science (Amsterdam), IEEE Computer Society Press, Washington, D.C., 1991.
18. Lei91a Daniel Leivant, Finitely stratified polymorphism, Information and Computation, 1991.
19. Lei93 Daniel Leivant, A foundational delineation of poly-time, Information and Computation, 1993.
20. Lei93a Daniel Leivant, Stratified functional programs and computational complexity,Conference Record of the Twentieth Annual ACM Symposium on Principles of Programming Languages, 1993.
21. Mai92 Harry Mairson, A simple proof of a theorem of Statman, to appear in Theoretical Computer Science, 1992.
22. ODo79 Michael O’Donnell, A programming language theorem whzch is independent of Peano Arithemtic, Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, ACM, New York, 1979, 176-188.
23. Pap85 Christos Papadimitriou, A note on the expressive power of PROLOG,Bull. EATCS 26 (June 1985) 21-23.
24. Pet66 Rósza Péter, Rekursive Punktionen, Akadémiai Kiadó, Budapest, 1966. English translation: Reeursive Functions, Academic Press, New York, 1967.
25. Pra65 Dag Prawitz, Natural Deduction, Almqvist and Wiskel, Uppsala, 1965.
26. Rey74 John Reynolds, Towards a theory of type structures, in J. Loeckx (ed.), Conference on Porgramming, Springer-Verlag (LNCS #19), Berlin, 1974, pp. 408-425.
27. Saz80 Vladimir Sazonov, Polynomial computability and recursivity in finite domains,Electronische Informationsverarbeltung und Kybernetik 7 (1980) 319-323.
28. Sch76 Helmut Schwichtenberg, Definierbare Funktionen im Lambda-Kalkul mit Typen, Archly f. Logik u. Grundlagenforsch. 17 (1976) 113-114.
29. Sta79 Richard Statman, The typed λ-calculus is not elementary recursive, Theoretical Computer Science 9 (1979) 73-81.
30. Var82 Moshe Vardi, Complexity and relational query languages, Fourteenth ACM Symposium on Theory of Computing (1982) 137-146.
31. Zai87 Marek Zaionc, Word operatzons definable in typed λ-calculus, Theoretical Computer Science 52 (1987).