Confluence results for the pure strong categorical logic CCL. λ-calculi as subsystems of CCL

This publication has 9 references indexed in Scilit:

• Lambda Calculus Notation with Nameless Dummies, a Tool for Automatic Formula Manipulation, with Application to the Church-Rosser Theorem
  Published by Elsevier ,1994
• Categorical Combinators, Sequential Algorithms, and Functional Programming
  Published by Springer Nature ,1993
• Proof of termination of the rewriting system subst on CCL
  Theoretical Computer Science, 1986
• A new implementation technique for applicative languages
  Software: Practice and Experience, 1979
• Lambda calculus with namefree formulas involving symbols that represent reference transforming mappings
  Indagationes Mathematicae, 1978
• Pairing Without Conventional Restraints
  Mathematical Logic Quarterly, 1974
• Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem
  Indagationes Mathematicae, 1972
• Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.
  Published by Elsevier ,1970
• Combinatory Logic. By H. B. Curry and R. Feys. Pp. 417. 42s. 1958. (North Holland Publishing Co., Amsterdam)
  The Mathematical Gazette, 1960