Abstract
This paper presents the complexity of β-reduction for redexes of order 1; 2 and 3. It concludes with the following results — evaluation of Boolean expressions can be reduced to β-reduction of order 1 and β-reduction of order 1 is in O(n log n), β-reduction of order 2 is complete for PTIME, and β-reduction of order 3 is complete for PSPACE.
This work was partly supported by KBN grant no 8 T11C 035 14.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andrea Asperti and Stefano Guerrini, The optimal implementation of functional programming languages, Cambridge University Press, 1998.
Andrea Asperti and Cosimo Laneve, Interaction Systems II: the practice of optimal reductions, Tech. Report UBLCS-93-12, Laboratory for Computer Science, Università di Bologna, 1993.
H. P. Barendregt, Lambda calculi with types, Handbook of Logic in Computer Science (S. Abramsky, D. M. Gabbay, and T. S. E. Mainbaum, eds.), vol. 2, Oxford University Press, 1992, pp. 117–309.
S.R. Buss, The boolean formula value problem is in ALOGTIME, Proceedings of the 19th Annual ACM Symposium on Theory of Computing, ACM Press, 1987, pp. 123–131.
G. Hillebrand and P. Kanellakis, On the expressive power of simply typed and let-polymorphic lambda calculi, Proceedings of the 11th IEEE Conference on Logic in Computer Science, 1996, pp. 253–263.
John Lamping, An algorithm for optimal lambda calculus reductions, Proceedings of 17th ACM Symposium on Principles of Programming Languages, 1990, pp. 16–30.
H. Mairson, A simple proof of a theorem of statman, Theoretical Computer Science (1992), no. 103, 213–226.
Ch. H. Papadimitriou, Computational complexity, Addison-Wesley, 1995.
H. Schwichtenberg, An upper bound for reduction sequences in the typed λ-calculus, Archive for Mathematical Logic (1991), no. 30, 405–408.
R. Statman, The typed λ-calculus is not elementary recursive, Theoretical Computer Science (1979), no. 9, 73–81.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schubert, A. (2001). The complexity of β-reduction in low orders. In: Abramsky, S. (eds) Typed Lambda Calculi and Applications. TLCA 2001. Lecture Notes in Computer Science, vol 2044. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45413-6_31
Download citation
DOI: https://doi.org/10.1007/3-540-45413-6_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41960-0
Online ISBN: 978-3-540-45413-7
eBook Packages: Springer Book Archive