Advertisement

The complexity of β-reduction in low orders

  • Aleksy Schubert
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2044)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AG98]
    Andrea Asperti and Stefano Guerrini, The optimal implementation of functional programming languages, Cambridge University Press, 1998.Google Scholar
  2. [AL93]
    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.Google Scholar
  3. [Bar92]
    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.Google Scholar
  4. [Bus87]
    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.Google Scholar
  5. [HK96]
    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.Google Scholar
  6. [Lam90]
    John Lamping, An algorithm for optimal lambda calculus reductions, Proceedings of 17th ACM Symposium on Principles of Programming Languages, 1990, pp. 16–30.Google Scholar
  7. [Mai92]
    H. Mairson, A simple proof of a theorem of statman, Theoretical Computer Science (1992), no. 103, 213–226.Google Scholar
  8. [Pap95]
    Ch. H. Papadimitriou, Computational complexity, Addison-Wesley, 1995.Google Scholar
  9. [Sch91]
    H. Schwichtenberg, An upper bound for reduction sequences in the typed λ-calculus, Archive for Mathematical Logic (1991), no. 30, 405–408.Google Scholar
  10. [Sta79]
    R. Statman, The typed λ-calculus is not elementary recursive, Theoretical Computer Science (1979), no. 9, 73–81.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Aleksy Schubert
    • 1
  1. 1.Institute of InformaticsWarsaw UniversityWarsaw

Personalised recommendations