Categorical Combinators form a formal system similar to Curry's Combinatory Logic. The original system was developed by Curien [4] inspired by the equivalence of the theories of typed λ-calculus and Cartesian Closed Categories as shown by Lambek [6] and Scott [13]. A new system for Categorical Combinators was introduced in [9]. This system uses a more compact notation for the code and needs a smaller set of rewriting rules. In this paper we introduce a new set of categorical combinators which is more efficient than the previous ones, in terms of compilation and execution complexity.


Categorical Combinaotrs lambda calculus functional programming complexity 


  1. 1.
    H.P.Barendregt, The Lambda Calculus Its Syntax and Semantics, North Holland (1984).Google Scholar
  2. 2.
    N.G. DeBruijn, Lambda Calculus Notation with Nameless Dummies, a Tool for Automatic Formula Manipulation, Indag.Math. 34, 381–392 (1972).Google Scholar
  3. 3.
    G.Cousineau, P-L.Curien, & M.Mauny, The Categorical Abstract Machine, Functional Programming Languages and Computer Architecture, ed. J-P.Jouannaud, SLNCS 201.Google Scholar
  4. 4.
    P-L.Curien, Categorical Combinators, Sequential Algorithms and Functional Programming, Research Notes in Theoretical Computer Science, Pitman Publishing Ltd., (1986).Google Scholar
  5. 5.
    R.J.M.Hughes, The Design and Implementation of Programming Languages, Ph.D. Thesis, Oxford Univ. Comp.Lab., July 1983.Google Scholar
  6. 6.
    J.Lambek, From Lambda-calculus to Cartesian Closed Categories, in To H.B.Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism, ed J.P.Seldin and J.R.Hindley, Academic Press (1980).Google Scholar
  7. 7.
    P.J.Landin, The Mechanical Evaluation of Expressions, Comput.J.6, (1963–4)Google Scholar
  8. 8.
    S.J.Leviseur & R.D.Lins, On The Efficiency of Categorical Combinators & Multi-Combinators, in preparation.Google Scholar
  9. 9.
    R.D.Lins, A New Formula for The Execution of Categorical Combinators, Proceedings of 8th. International Conference on Automated Deduction, Oxford, England, July 1986, LNCS 230, p 89–98, Springer Verlag.Google Scholar
  10. 10.
    R.D.Lins, On the Efficiency of Categorical Combinators in Applicative Languages, Ph.D. Thesis, The University of Kent at Canterbury, October 1986.Google Scholar
  11. 11.
    R.D.Lins, On the Efficiency of Categorical Combinators as a Rewriting system, to appear in Software Practice & Experience, (1987).Google Scholar
  12. 12.
    R.D.Lins, Implementing SASL using Categorical Multi-Combinators, in preparation.Google Scholar
  13. 13.
    D.Scott, Relating Theories of the Lambda-Calculus, in To H.B.Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism, ed. J.P.Seldin and J.R.Hindley, Academic Press (1980).Google Scholar
  14. 14.
    D.A. Turner, A New Implementation Technique for Applicative Languages, Software Practice and Experience, Vol 9, 31–49 (1979).Google Scholar
  15. 15.
    C.P.Wadsworth, Semantics and Pragmatics of the Lambda Calculus, Oxford Univ. D.Phil. Thesis, 1971.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Rafael D.Lins
    • 1
    • 2
  1. 1.Computing LaboratoryThe University of KentCanterburyEngland
  2. 2.Chesf — Comp. Hidro Elétrica do São FranciscoRecife-PEBrazil

Personalised recommendations