Efficient Combinator Code

@article{Joy1985EfficientCC,
  title={Efficient Combinator Code},
  author={Mike S. Joy and Victor J. Rayward-Smith and F. Warren Burton},
  journal={Comput. Lang.},
  year={1985},
  volume={10},
  pages={211-224}
}
-Some combinatory logics are examined as object code for functional programs. The worst-case performances of certain algorithms for abstracting variables from combinatory expressions are analysed. A lower bound on the performance of any abstraction algorithm for a finite set of combinators is given. Using the combinators S, K, I, B, C, S', B', C' and Y, the problem of finding an optimal abstraction algorithm is shown to be NP-complete. Some methods of improving abstraction algorithms for those… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS
13 Citations
11 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 11 references

On the efficient implementation of combinators as an object code for functional programs

  • M S.Joy
  • Ph.D. Thesis, University of East Anglia
  • 1985

Director strings as combinators

  • J R.Kennaway
  • Internal Note, School of Computing Studies and…
  • 1982
1 Excerpt

The complexity of a translation of lambda-calculus to combinators

  • J R.Kennaway
  • Internal Report CS/82/023/E,
  • 1982
1 Excerpt

Essays on Combinatory Logic, Lambda Calculus and Formalism

  • Seldin J.P., Hindley, To H.B. Curry
  • Academic Press, London
  • 1980
1 Excerpt

A . , A new implementation technique for applicative languages

  • D. Turner
  • Software Pract . Exper .
  • 1979

A Guide to the Theory of NP-Completeness

  • Garey M.R., Johnson D.S., Computers, Intractability
  • W. H. Freeman, San Francisco, California
  • 1979

Similar Papers

Loading similar papers…