Skip to main content
SpringerLink
Log in

The BC-chain method for representing combinators in linear space

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

Abstract

Turner’s combinator implementation (1979) of functional programs requires the memory space of size Ω(n 2) in the worst case for translating given lambda expressions of lengthn to combinator graphs. In this paper a new idea named the BC-chain method for transferring actual arguments to variables is presented. We show that the BC-chain method requires onlyO(n) space for the translation. The basic idea is to group together into a single entity a sequence of combinatorsB, B′, C andC′, for a variable, which appear consecutively along a path in the combinator graph. We formulate two reduction algorithms in the new representation. The first algorithm naively simulates the original normal order reduction, while the second algorithm simulates it in constant time per unit operation of the original reduction. Another reduction method is also suggested, and a technique for practical implementation is briefly mentioned.

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

Access this article

Log in via an institution

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

References

  1. Abdali, S. K., “An abstraction algorithm for combinatory logic,”J. Symbolic Logic, 41, pp. 222–224, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  2. Burton, F. W., “A linear space representation of functional programs to Turner combinators,”Inform. Process. Lett., 14, pp. 201–204, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  3. Hikita, T., “On the average size of Turner’s translation to combinator programs,”J. Inform. Process., 7, 3, pp. 164–169, 1984.

    MATH  MathSciNet  Google Scholar 

  4. Hughes, R. J. M., “Super-Combinators,”Conf. Rec. of the 1982 ACM Symp. on LISP and Functional Programming, pp. 1–10, 1982.

  5. Kennaway, J. R., “The complexity of a translation of λ-calculus to combinators,” School of Computing Studies and Accountancy, Univ. of East Anglia, Norwich, 1982.

    Google Scholar 

  6. Kennaway, J. R. and Sleep, M. R., “Efficiency of counting director strings,”typescript, 1983.

  7. Noshita, K., “Translation of Turner combinators inO(nlogn) space,”Inform. Process. Lett., 20, pp. 71–74, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  8. Turner, D. A., “Another algorithm for bracket abstraction,”J. Symbolic Logic., 44, pp. 267–270, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  9. Turner, D. A., “A new implementation technique for applicative languages,”Softw. Pract. Exper., 9, pp. 31–49, 1979.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Denkitusin University, Chofu, 182, Tokyo, Japan

    Kohei Noshita

  2. Department of Mathematics, Tokyo Metropolitan University, Setagaya, 158, Tokyo, Japan

    Teruo Hikita

Authors
  1. Kohei Noshita
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Teruo Hikita
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The second author was partially supported by the Grant-in-Aid for Scientific Research, No. 59580027, of the Ministry of Education.

About this article

Cite this article

Noshita, K., Hikita, T. The BC-chain method for representing combinators in linear space. NGCO 3, 131–144 (1985). https://doi.org/10.1007/BF03037065

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation