Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus-Reference-Cited by-同舟云学术

Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus

Published:2014 Issue: Volume: Page:151-163
ISSN:0302-9743
Container-title:Advanced Information Systems Engineering
language:
Short-container-title:

Author:

Baillot Patrick,De Benedetti Erika,Ronchi Della Rocca Simona

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-44602-7_13

Reference22 articles.

1. Baillot, P.: Stratified coherence spaces: a denotational semantics for light linear logic. Theor. Comput. Sci. 318(1-2), 29–55 (2004)

2. Lecture Notes in Computer Science;P. Baillot,2011

3. Baillot, P., De Benedetti, E., Ronchi Della Rocca, S.: Characterizing polynomial and exponential complexity classes in elementary lambda-calculus. Tech. rep., 31 pages (2014), http://hal.archives-ouvertes.fr/hal-01015171

4. Bellantoni, S., Cook, S.A.: A new recursion-theoretic characterization of the polytime functions. Computational Complexity 2, 97–110 (1992)

5. Coppola, P., Dal Lago, U., Ronchi Della Rocca, S.: Light logics and the call-by-value lambda-calculus. Logical Methods in Computer Science 4(4) (2008)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Combining linear logic and size types for implicit complexity;Theoretical Computer Science;2020-04

2. Characterizing polynomial and exponential complexity classes in elementary lambda-calculus;Information and Computation;2018-08

3. Call-by-Value, Elementary Time and Intersection Types;Foundational and Practical Aspects of Resource Analysis;2016