Haskell Curry

Haskell Brooks Curry ( born September 12, 1900 in Millis, Massachusetts, USA, † September 1, 1982 in State College, Pennsylvania, USA) was an American logician and mathematician.


As the son of an educator Samuel Silas Curry born, Curry studied at Harvard University and a doctorate in 1930 in Göttingen with David Hilbert. He taught at Harvard, Princeton and, from 1929 to 1966, at the Pennsylvania State University. In 1966 he became professor of mathematics at the University of Amsterdam.


In his time in Göttingen Curry read the published version of Moses Beautifully Finkel Lecture from 1920 to combinatorial logic. This turned out to be a fateful event in his career, he wrote his doctoral thesis on combinatorial logic and developed from it by and by an extended theory. Today he is considered the essential Ausgestalter this theory. Combinatorial logic is one of the foundations of functional programming languages ​​. Possibilities and effects of the combinational logic are very similar to the lambda calculus of Alonzo Church, which has become more accepted in recent decades.

In 1942 he published a negation -free version of Russell's antinomy, which is now named after him and is known as Curry's paradox.

Curry taught and worked mainly in the area of ​​mathematical logic, was published in 1963 his book Foundations of Mathematical Logic. He dealt with a lot of philosophical problems of mathematics and the latter taking a strong formalist point of view, shaped by his supervisor Hilbert, but also had an openness intuitionistic logic recognize.

Curry is the namesake of the Haskell programming language, and the currying process as well as the co-discoverer of the Curry - Howard isomorphism ( with William Alvin Howard).


  • With Robert Feys Combinatory Logic, North Holland, 2 volumes, 1958, 1972
  • Foundations of mathematical logic, McGraw Hill 1963, Dover 1977
  • Theory of formal deducibility, Notre Dame 1950
  • Outlines of a formalist philosophy of mathematics, North Holland 1970

Related Topics

  • Combinatorial logic and currying
  • Functional Programming
  • Haskell
  • The lambda calculus