Skip to main content
Log in

A solution to Curry and Hindley’s problem on combinatory strong reduction

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

It has often been remarked that the metatheory of strong reduction \(\succ\), the combinatory analogue of βη-reduction \({\twoheadrightarrow_{\beta\eta}}\) in λ-calculus, is rather complicated. In particular, although the confluence of \(\succ\) is an easy consequence of \({\twoheadrightarrow_{\beta\eta}}\) being confluent, no direct proof of this fact is known. Curry and Hindley’s problem, dating back to 1958, asks for a self-contained proof of the confluence of \(\succ\) , one which makes no detour through λ-calculus. We answer positively to this question, by extending and exploiting the technique of transitivity elimination for ‘analytic’ combinatory proof systems, which has been introduced in previous papers of ours. Indeed, a very short proof of the confluence of \(\succ\) immediately follows from the main result of the present paper, namely that a certain analytic proof system G e [\(\mathbb {C}\)] , which is equivalent to the standard proof system CL ext of Combinatory Logic with extensionality, admits effective transitivity elimination. In turn, the proof of transitivity elimination—which, by the way, we are able to provide not only for G e [\(\mathbb {C}\)] but also, in full generality, for arbitrary analytic combinatory systems with extensionality—employs purely proof-theoretical techniques, and is entirely contained within the theory of combinators.

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

Access this article

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. Barendregt H.P.: The Lambda Calculus, its Syntax and Semantics, Revised edn. North-Holland, Amsterdam (1984)

    Google Scholar 

  2. Curry H.B., Feys R.: Combinatory Logic, vol. I. North-Holland, Amsterdam (1958)

    Google Scholar 

  3. Curry H.B., Hindley J.R., Seldin J.P.: Combinatory Logic, vol. II. North-Holland, Amsterdam (1972)

    MATH  Google Scholar 

  4. Hindley J.R.: Axioms for strong reduction in combinatory logic. J. Symb. Log. 32, 224–236 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  5. Hindley, R.: Review of Loewen [12], [13], [14]. MR0248022 (40 #1279a), MR0248023 (40 #1279b), MR0248024 (40 #1279c)

  6. Hindley, R.: Problem # 1, TLCA (Typed Lambda Calculi and Applications) List of Open Problems. http://tlca.di.unito.it/opltlca/

  7. Hindley R., Lercher B.: A short proof of Curry’s normal form theorem. Proc. Am. Math. Soc. 24, 808–810 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  8. Hindley J.R., Lercher B., Seldin J.P.: Introduction to Combinatory Logic. Cambridge University Press, London (1972)

    MATH  Google Scholar 

  9. Hindley J.R., Seldin J.P.: Lambda-Calculus and Combinators, an Introduction. Cambridge University Press, London (2008)

    MATH  Google Scholar 

  10. Lercher B.: Strong reduction and normal forms in combinatory logic. J. Symb. Log. 32, 213–223 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  11. Lercher B.: The decidability of Hindley’s axioms for strong reduction. J. Symb. Log. 32, 237–239 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  12. Loewen K.: A standardization theorem for strong reduction. Notre Dame J. Formal Logic 9, 271–283 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  13. Loewen K.: Modified strong reduction in combinatory logic. Notre Dame J. Formal Logic 9, 265–270 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  14. Loewen K.: The Church Rosser theorem for strong reduction in combinatory logic. Notre Dame J. Formal Logic 9, 299–302 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  15. Minari P.: Analytic combinatory calculi and the elimination of transitivity. Arch. Math. Logic 43, 159–191 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  16. Minari, P.: Proof-theoretical methods in combinatory logic and λ-calculus. In: Cooper, S.B., Löwe, B., Torenvliet, L., CiE 2005: New Computational Paradigms, pp. 148–157. ILLC X-2005-01, Amsterdam (2005)

  17. Minari P.: Analytic proof systems for λ-calculus: the elimination of transitivity, and why it matters. Arch. Math. Logic 46, 385–424 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  18. Stenlund S.: Combinators, Lambda Terms, and Proof Theory. Reidel, Dordrecht (1972)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pierluigi Minari.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Minari, P. A solution to Curry and Hindley’s problem on combinatory strong reduction. Arch. Math. Logic 48, 159–184 (2009). https://doi.org/10.1007/s00153-008-0109-z

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-008-0109-z

Keywords

Mathematics Subject Classification (2000)

Navigation