Skip to main content
Springer Nature Link
Log in

A fast algorithm for translating combinator expressions with BC-chains

  • Regular Papers
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

A fast algorithm is presented for translating lambda expressions to combinator trees with BC-chains. The time complexity of this algorithm is O (n log n) in the worst case, where n is the length of an input expression. Furthermore it requires only O (n log n) working space. This result achieves a substantial improvement to the previously known algorithm having the quadratic complexity. The basic idea of the algorithm may be applied to practical processing systems, whether they use BC-chains or not.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Aho, A., Hoperoft, J. and Ullman, J.,The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.

  2. Burton, F. W., “A Linear Space Representation of Functional Programs to Turner Combinators”,Information Processing Letters, 14, pp. 201–204, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  3. Kennaway, I. R., “The Complexity of a Translation of Lambda-Calculus to Combinators”,Report of School of computing Studies and Accountancy, University of East Anglia, Norwich, 1982.

    Google Scholar 

  4. Kennaway, J. R. and Sleep, M. R., “Variable Abstraction in O (n log n) Space”,Information Processing Letters, 24, pp. 343–349, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  5. Noshita, K., “Translation of Turner Combinators in O (n log n) Space”,Information Processing Letters, 20, pp. 71–74, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  6. Noshita, K. and Hikita, T., The BC-Chain Method for Representing Combinators in Linear Space”,New Generation Computing, 3, pp. 131–144, 1985.

    Article  MATH  Google Scholar 

  7. Rivest, R. L. and Vuillemin, J., “On Recognizing Graph Properties from Adjacency Matrices”,Theoretical Computer Science, 3, pp. 371–384, 1976.

    Article  MathSciNet  Google Scholar 

  8. Turner, D. A., “Another Algorithm for Bracket Abstraction”,Journal of Symbolic Logic, 44, pp. 267–270, 1979.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Chuo University, Kasuga, Bunkyo, 112, Tokyo, Japan

    Kohei Noshita

  2. Department of Information Sciences, University of Tokyo, Hongo, Bunkyo, 112, Tokyo, Japan

    Xiao -Xun He

Authors
  1. Kohei Noshita
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Xiao -Xun He
    View author publications

    You can also search for this author inPubMed Google Scholar

About this article

Cite this article

Noshita, K., He, X.X. A fast algorithm for translating combinator expressions with BC-chains. New Gener Comput 5, 249–257 (1987). https://doi.org/10.1007/BF03037465

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037465

Keywords