A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation

ACM Transactions on Computational Logic

Volumn 3, Issue 3, 2002, Pages 383-401

  Aehlig, Klaus ^a   Schwichtenberg, Helmut ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

Complexity; lambda calculus; Languages; linear logic; Theory

Indexed keywords

EID: 33646745305     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/507382.507386     Document Type: Article

References (20)

1. Aehlig, K. and Schwichtenberg, H. 2000. A syntactical analysis of non-size-increasing polynomial time computation. In Proceedings of the 15th Symposium on Logic in Computer Science (LICS 2000). IEEE Computer Science Press, Los Alamitos, CA, 84-91
2. Beckmann, A. and Weiermann, A. 2000. Characterizing the elementary recursive functions by a fragment of Godel's T. Arch. Math. Logic 39, 7 (Oct.), 475-492
3. Bellantoni, S. and Cook, S. 1992. A new recursion-theoretic characterization of the polytime functions. Computat. Complex. 2, 97-110
4. Bellantoni, S., Niggl, K.-H., and Schwichtenberg, H. 2000. Higher type recursion, ramification and polynomial time. Ann. Pure Appl. Logic 104, 17-30
5. Caseiro, V.-H. 1997. Equations for defining poly-time functions. Ph.D. thesis, Department of Computer Science, University of Oslo, Oslon, Norway.
6. Cook, S. A. 1971. Characterizations of push-down machines in terms of time bounded computers. Journal of the ACM 18, 4-18
7. Godel, K. 1958. Uber eine bisher noch nicht bentltzte Erweiterung des finiten Standpunkts. Dialectica 12, 280-287
8. Hofmann, M. 1998. Typed lambda calculi for polynomial-time computation. Habilitation thesis, Mathematisches Institut, TU Darmstadt, Germany.
9. Hofmann, M. 1999. Linear types and non-size-increasing polynomial time computation. In Proceedings of the 14th Symposium on Logic in Computer Science (LICS'99). IEEE Computer Science Press, Los Alamitos, CA, 464-473
10. Hofmann, M. 2000a. Linear types and non-size-increasing polynomial time computation. Theoret. Comput. Sci. To appear
11. Hofmann, M. 2000b. A type system for bounded space and functional in-place update. Nordic J. Comput. 7, 4 (Winter), 258-289
12. Hofmann, M. 2001. The strength of non size-increasing computation. In Proceedings of the 3rd International Workshop on Implicit Computational Complexity (ICC ‘01) Aarhus, Denmark, May 20-21, 2001), M. Hofmann, Ed. Number NS-01-3 in Notes Series. BRICS, Department of Computer Science, University of Aarhus, Aarhus, Denmark, 19-35
13. Joachimski, F. and Matthes, R. 1999. Short proofs of normalisation for the simply-typed À-calculus, permutative conversions and Giidel's T. Arch. Math. Logic, To appear
14. Jones, N. D. 1997. Computability and Complexity from a Programming Perspective. MIT Press, Cambridge, MA
15. Jones, N. D. 1999. LOGSPACE and PTIME characterized by programming languages. Theoret. Comput. Sci. 228, 1-2 (Oct.), 151-174
16. Jones, N. D. 2001. The expressive power of higher-order types or, life without CONS. J. Funct. Program. 11, 1, 55-94
17. Leivaant, D. 1991. A foundational delineation of computational feasibility. In Proceedings of the 6th Symposium on Logic in Computer Science (LICS'91). IEEE Computer Science Press, Los Alamitos, CA, 2-11
18. Leivaant, D. 1999. Applicative control and computational complexity. In Proceedings of the 13th International Workshop on Computer Science Logic (CSL ‘99), J. Flum and M. Rodriguez-Artalejo, Eds. Lecture Notes in Computer Science, Vol. 1683, Springer Verlag, Berlin, Germany, 82-95
19. Leivant, D. and Marion, J.-Y. 1993. Lambda calculus characterization of poly-time. Fundamenta Informaticae 19, 1/2 (Sep./Oct.), 167-184
20. Simmons, H. 1988. The realm of primitive recursion. Arch. Math. Logic 27, 2 (Oct.), 177-188