Parallel Beta Reduction Is Not Elementary Recursive-Reference-Cited by-同舟云学术

Parallel Beta Reduction Is Not Elementary Recursive

Published:2001-10 Issue:1 Volume:170 Page:49-80
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Asperti Andrea,Mairson Harry G.

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference36 articles.

1. Linear logic, comonads, and optimal reductions;Asperti;Fund. Inform.,1994

2. Asperti, A.1996, On the complexity of beta-reduction, inProceedings, 1996 ACM Symposium on Principles of Programming Languages pp. 110–118.

3. Asperti, A, and, Guerrini, S. 1999, The Optimal Implementation of Functional Programming Languages, Cambridge Tracts in Theoretical Computer Science, Cambridge Univ. Press, Cambridge, UK.

4. Paths, computations, and labels in the λ-calculus;Asperti;Theoret. Comput. Sci.,1995

5. Barendregt, H. 1984, The Lambda Calculus: Its Syntax and Semantics, North-Holland, Amsterdam.

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

1. Strong Call-by-Value is Reasonable, Implosively;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29

2. A Compositional Cost Model for the λ-calculus;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29

3. Linear dependent types in a call-by-value scenario;Science of Computer Programming;2014-05

4. The Cost of Usage in the ?-Calculus;2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science;2013-06

5. Light logics and optimal reduction: Completeness and complexity;Information and Computation;2011-02