Efficient First Order Functional Program Interpreter with Time Bound Certifications-Reference-Cited by-同舟云学术

Efficient First Order Functional Program Interpreter with Time Bound Certifications

Published: Issue: Volume: Page:25-42
ISSN:
Container-title:Logic for Programming and Automated Reasoning
language:
Short-container-title:

Author:

Jean-Yves Marion,Moyen J.-Y.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44404-1_3.pdf

Reference34 articles.

1. Aehlig, K., and Schwichtenberg, H. A syntactical analysis of non-sizeincreasing polynomial time computation. In Proceedings of the Fifteenth IEEE Symposium on Logic in Computer Science (LICS’ 00) (2000), pp. 84–91. 26, 34

2. Basin, D., and Ganzinger, H. Automated complexity analysis based on ordered resolution. Journal of the ACM (2000). To appear. 26

3. Bellantoni, S., and Cook, S. A new recursion-theoretic characterization of the poly-time functions. Computational Complexity 2 (1992), 97–110. 26, 32, 33, 35, 37, 37

4. Bellantoni, S., Niggl, K.-H., and Schwichtenberg, H. Higher type recursion, ramification and polynomial time. Annals of Pure and Applied Logic 104, 1–3 (2000), 17–30. 26

5. Benzinger, R. Automated complexity analysis of NUPRL extracts. PhD thesis, Cornell University, 1999. 25

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

1. On quasi-interpretations, blind abstractions and implicit complexity;Mathematical Structures in Computer Science;2012-02-02

2. A type system for PSPACE derived from light linear logic;Electronic Proceedings in Theoretical Computer Science;2012-01-01

3. Bounded Linear Logic, Revisited;Logical Methods in Computer Science;2010-12-18

4. Bounded Linear Logic, Revisited;Lecture Notes in Computer Science;2009

5. On Constructor Rewrite Systems and the Lambda-Calculus;Automata, Languages and Programming;2009