In Memoriam: Haskell Brooks Curry

  • Jonathan P. Seldin


Haskell Brooks Curry died on 1 September 1982 at the age of 81. He will be remembered as one of the founders of mathematical logic in the United States. In particular, he did much to develop combinatory logic, with which his name will always be associated.


Combinatory Theory Universal Quantifier Combinatory Logic High Order Logic Lambda Calculus 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Church, A. (1932), A set of postulates for the foundation of logic, Ann. of Math. (2) 33, 346–366.CrossRefMathSciNetGoogle Scholar
  2. Church, A. (1940), A formulation of the simple theory of types, J. Symbolic Logic 5, 56–68.MATHCrossRefMathSciNetGoogle Scholar
  3. Curry, H.B.1 (1930), Grundlagen de kombinatorischen Logik (Inauguraldissertation), Amer. J. Math. 52, 509–536, 789–834.MATHCrossRefMathSciNetGoogle Scholar
  4. Curry, H.B. (1934a), Some properties of equality and implication in combinatory logic, Ann. of Math. (2) 35, 849–860.CrossRefMathSciNetGoogle Scholar
  5. Curry, H.B. (1934b), Foundations of the theory of abstract sets from the standpoint of combinatory logic (Abstract), Bull. Amer. Math. Soc. 40, 654.MATHGoogle Scholar
  6. Curry, H.B. (1939), Remarks on the definition and nature of mathematics, J. Unified Science 9, 164–169.Google Scholar
  7. Curry, H.B. (1942a), The inconsistency of certain formal logics, J. Symbolic Logic 7, 115–117.MATHCrossRefMathSciNetGoogle Scholar
  8. Curry, H.B. (1942b), Some advances in the combinatory theory of quantification, Proc. Nat. Acad. Sci. U.S.A. 28, 564–569.MATHCrossRefMathSciNetGoogle Scholar
  9. Curry, H.B. (1950), A Theory of Formal Deducibility, Notre Dame Math. Lectures No. 6, Notre Dame, Indiana.MATHGoogle Scholar
  10. Curry, H.B. (1951), Outlines of a Formalist Philosophy of Mathematics, North-Holland, Amsterdam.MATHGoogle Scholar
  11. Curry, H.B. (1952), Leçons de Logique Algebrique, Gauthier-Villars, Paris and Nauwe-laerts, Louvain.MATHGoogle Scholar
  12. Curry, H.B. (1960), The deduction theorem in the combinatory theory of restricted generality, Logique et Analyse 3, 15–39.Google Scholar
  13. Curry, H.B. (1961), Basic verifiability in the combinatory theory of restricted generality, In Essays on the Foundations of Mathematics, Magnes Press of Hebrew University, Jerusalem, pp. 165–189.Google Scholar
  14. Curry, H.B. (1963), Foundations of Mathematical Logic, McGraw-Hill, New York.MATHGoogle Scholar
  15. Curry, H.B. and Feys, R. (1958), Combinatory Logic, Vol. I, North-Holland, Amsterdam.MATHGoogle Scholar
  16. Curry, H.B., Hindley, J.R., and Seldin, J.P. (1972), Combinatory Logic, Vol. II, North-Holland, Amsterdam.MATHGoogle Scholar
  17. Curry, H.B., Hindley, J.R., and Seldin, J.P. (1984), Beta strong reduction in combinatory logic: Preliminary report (Abstract), J. Symbolic Logic 49, 688.Google Scholar
  18. Gaber, A.M. (1949), Profile: Dr. Haskell B. Curry, typescript of 8 pages filed by Curry under the date 11 April 1949.Google Scholar
  19. Hindley, J.R. and Seldin, J.P. (eds.) (1980), To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press, London.MATHGoogle Scholar
  20. Kleene, S.C. and Rosser, J.B. (1935), The inconsistency of certain formal logics, Ann. of Math. (2) 36, 630–636.CrossRefMathSciNetGoogle Scholar
  21. Reid, C. (1970), Hilbert, Springer-Verlag, New York and Berlin.MATHGoogle Scholar
  22. Schönfinkel, M. (1924), Über die Bausteine der mathematischen Logik, Math. Ann. 92, 305–316.MATHCrossRefMathSciNetGoogle Scholar
  23. Seldin, J.P. (1980), Curry’s program, in Hindley and Seldin, (1980), pp. 3–33.Google Scholar
  24. Whitehead, A.N. and Russell, B. (1910–1913), Principia Mathematica, 3 vols., Cambridge University Press, Cambridge, UK.MATHGoogle Scholar

Copyright information

© Birkhäuser Boston 2008

Authors and Affiliations

  • Jonathan P. Seldin
    • 1
  1. 1.Department of MathematicsConcordia UniversityMontréalCanada

Personalised recommendations