Linear types and non-size-increasing polynomial time computation

Information and Computation

Volumn 183, Issue 1, 2003, Pages 57-85

  Hofmann, Martin ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

Complexity theory; Higher order function; Linear types; Resources; Type system

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA REDUCTION; POLYNOMIALS; RECURSIVE FUNCTIONS;

INDUCTIVE DATATYPES;

LINEAR SYSTEMS;

EID: 0038147468     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(03)00009-9     Document Type: Article

References (15)

1. K. Aehlig, H. Schwichtenberg, A syntactical analysis of non-size-increasing polynomial time computation, in: Proceedings of die Fifteenth IEEE Symposium on Logic in Computer Science (LICS '00), Santa Barbara, 2000.
2. S. Bellantoni, K.-H. Niggl, H. Schwichtenberg, Ramification, modality, and linearity in higher type recursion, Ann. Pure Appl. Logic, check.
3. S. Bellantoni, S. Cook, New recursion-theoretic characterization of the polytime functions, Comput. Complexity 2 (1992) 97-110.
4. V.-H. Caseiro, Equations for defining poly-time functions, Ph.D. Thesis, University of Oslo, available by ftp from 〈ftp.ifi.uio.no/pub/vuokko/0adm.ps〉, 1997.
5. J.-Y. Girard, Light linear logic, Inform. Comput. (1998) 143.
6. M. Hofmann, Linear types and non size-increasing polynomial time computation, in: Logic in Computer Science (LICS), IEEE, Computer Society Press, Los Alamitos, CA, 1999, pp. 464-476.
7. M. Hofmann, Typed lambda calculi for polynomial-time computation, Habilitation Thesis, TU Darmstadt, Germany. Edinburgh University LFCS Technical Report, ECS-LFCS-99-406, 1999.
8. M. Hofmann, Safe recursion with higher types and BCK-algebra, Ann. Pure Appl. Logic, check.
9. M. Hofmann, A type system for bounded space and functional in-place update, in: G. Smolka (Ed.), Programming Languages and Systems, Lecture Notes in Computer Science, Springer, Berlin, 2000, pp. 165-179.
10. M. Hofmann, The strength of non size-increasing computation, Proc. ACM Symp. on Principles of Programming Language (POPL), Portland, Oregon, 2002.
11. D. Leivant, Stratified functional programs and computational complexity, in: Proc. 20th IEEE Symp. on Principles of Programming Languages, 1993.
12. D. Leivant, J.-Y. Marion, Ramified recurrence and computational complexity II: substitution and poly-space, in: J. Tiuryn, L. Pacholski (Eds.), Proc. CSL '94, Kazimierz, Poland, Lecture Notes in Computer Science, vol. 933, Springer, Berlin, 1995, pp. 4486-4500.
13. P. O'Hearn, Doubly closed categories, resource interpretations, and the αλ-calculus, in: Typed Lambda Calculi and Applications (TCLA '99), Lecture Notes in Computer Science, Springer, Berlin.
14. M. Tofte, J.-P. Talpin, Region-based memory management, Inform. Comput. 132 (1999) 109-176.
15. M. Hofmann, S. Jost, Static prediction of heap space usage for first-order functional programs, Proc. 30th ACM Symp. on Principles of Programming Languages. New Orleans, 2003.