Quantitative models and implicit complexity

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

Volumn 3821 LNCS, Issue , 2005, Pages 189-200

  Lago, Ugo Dal ^a   Hofmann, Martin ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABLE FUNCTIONS; POLYMORPHISM; POLYNOMIALLY BOUNDED COMPUTATIONS; RESOURCE-BOUNDED COMPUTATIONS;

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; DATABASE SYSTEMS; FUNCTION EVALUATION; MATHEMATICAL MODELS; NUMERICAL METHODS; SEMANTICS;

COMPUTATIONAL COMPLEXITY;

EID: 33744920588     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (15)

1. Andrea Asperti and Luca Roversi. Intuitionistic light affine logic. ACM Transactions on Computational Logic, 3(1):137-175, 2002.
2. Patrick Baillot and Virgile Mogbil. Soft lambda-calculus: a language for polynomial time computation. In Proceedings of the 7th International Conference on Foundations of Software Science and Computational Structures, 2004.
3. Stephen Bellantoni, Karl Heinz Niggl, and Helmut Schwichtenberg. Higher type recursion, ramification and polynomial time. Annals of Pure and Applied Logic, 104:17-30, 2000.
4. Stephen Cook and Alasdair Urquhart. Functional interpretations of feasible constructive arithmetic. Annals of Pure and Applied Logic, 63(2):103-200, 1993.
5. Paolo Coppola and Simone Martini. Typing lambda terms in elementary logic with linear constraints. In Proceedings of the 6th International Conference on Typed Lambda-Calculus and Applications, pages 76-90, 2001.
6. John Crossley, Gerald Mathai, and Robert Seely. A logical calculus for polynomial-time realizabllity. Journal of Methods of Logic in Computer Science, 3:279-298, 1994.
7. Ugo Dal Lago and Martin Hofmann. Quantitative models and implicit complexity. Arxiv Preprint. Available from http://arxiv.org/cs.LO/0506079, 2005.
8. Jean-Yves Girard. Light linear logic. Information and Computation, 143(2):175-204, 1998.
9. Martin Hofmann. Linear types and non-size-increasing polynomial time computation. In Proceedings of the 14th IEEE Syposium on Logic in Computer Science, pages 464-473, 1999.
10. Martin Hofmann. Safe recursion with higher types and BCK-algebra. Annals of Pure and Applied Logic, 104:113-166, 2000.
11. Martin Hofmann and Philip Scott. Readability models for BLL-like languages. Theoretical Computer Science, 318(1-2):121-137, 2004.
12. Georg Kreisel. Interpretation of analysis by means of constructive functions of finite types. In Arend Heyting, editor, Constructivity in Mathematics, pages 101-128. North-Holland, 1959.
13. Yves Lafont. Soft linear logic and polynomial time. Theoretical Computer Science, 318:163-180, 2004.
14. Peter van Emde Boas. Machine models and simulation. In Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, pages 1-66. Elsevier, 1990.
15. Hongwei Xi and Frank Pfenning. Dependent types in practical programming. In Proceedings of the 26th ACM SIGPLAN Symposium on Principles of Programming Languages, pages 214-227, 1999.