Stratified functional programs and computational complexity

Synopsis. We develop two notions of stratified recur

[1]  Stephen A. Bloch.  Functional characterizations of uniform log-depth and polylog-depth circuit families , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[2]  Daniel Leivant,et al.  A foundational delineation of computational feasibility , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[3]  Daniel Leivant,et al.  A Foundational Delineation of Poly-time , 1994, Inf. Comput..

[4]  Daniel Leivant.  Predicative Recurrence in Finite Types , 1994, LFCS.

[5]  Rozsa Peter.  Review: Andrzej Grzegorczyk, Some Classes of Recursive Functions , 1955 .

[6]  Daniel Leivant.  Discrete polymorphism , 1990, LISP and Functional Programming.

[7]  Claude Laflamme,et al.  An Algebra and a Logic for NC¹ , 1990, Inf. Comput..

[8]  Christos H. Papadimitriou,et al.  A note the expressive power of Prolog , 1985, Bull. EATCS.

[9]  Daniel Leivant,et al.  Descriptive Characterizations of Computational Complexity , 1989, J. Comput. Syst. Sci..

[10]  Daniel Leivant,et al.  Lambda Calculus Characterizations of Poly-Time , 1993, Fundam. Informaticae.

[11]  Vladimir Yu. Sazonov.  Polynomial Computability and Recursivity in Finite Domains , 1980, J. Inf. Process. Cybern..

[12]  Daniel Leivant,et al.  Subrecursion and lambda representation over free algebras , 1990 .

[13]  Jon L. White.  Proceedings of the 1992 ACM conference on LISP and functional programming , 1992 .

[14]  A. Grzegorczyk.  Some classes of recursive functions , 1964 .