Haskell Curry

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Haskell Brooks Curry
Born September 12, 1900 (1900-09-12)
Millis, Massachusetts
Died September 1, 1982(1982-09-01) (aged 81)
State College, Pennsylvania
Nationality American
Fields Mathematics
Logic
Institutions Penn State
Universiteit van Amsterdam
Alma mater Harvard University
Doctoral advisor David Hilbert
Doctoral students Maarten Bunder
Edward Cogan
Bruce Lercher
Hilbert Levitz
Kenneth Lowen
Luis Sanchis
Jonathan Seldin
Known for Combinatory logic
Curry–Howard correspondence
Curry's paradox
Influences Alfred North Whitehead
Bertrand Russell
Moses Schönfinkel

Haskell Brooks Curry (/ˈhæskəl ˈkɜri/; September 12, 1900 – September 1, 1982) was an American mathematician and logician. Curry is best known for his work in combinatory logic; while the initial concept of combinatory logic was based on a single paper by Moses Schönfinkel, much of the development was done by Curry. Curry is also known for Curry's paradox and the Curry–Howard correspondence. There are three programming languages named after him, Haskell, Brooks and Curry, as well as the concept of currying, a technique used for transforming functions in mathematics and computer science.

Life[edit]

Curry was born on September 12, 1900, in Millis, Massachusetts, to Samuel Silas Curry and Anna Baright Curry, who ran a school for elocution. He entered Harvard University in 1916 to study medicine but switched to mathematics before graduating in 1920. After two years of graduate work in electrical engineering at MIT, he returned to Harvard to study physics, earning a MA in 1924. Curry's interest in mathematical logic started during this period when he was introduced to the Principia Mathematica, the attempt by Alfred North Whitehead and Bertrand Russell to ground mathematics in symbolic logic. Remaining at Harvard, Curry pursued a Ph.D. in mathematics. While he was directed by George Birkhoff to work on differential equations, his interests continued to shift to logic. In 1927, while an instructor at Princeton University, he discovered the work of Moses Schönfinkel in combinatory logic. Schönfinkel's work had anticipated much of Curry's own research, and as a consequence, he moved to Göttingen where he could work with Heinrich Behmann and Paul Bernays, who were familiar with Schönfinkel's work. Curry was supervised by David Hilbert and worked closely with Bernays, receiving a Ph.D. in 1930 with a dissertation on combinatory logic.[1]

In 1928, before leaving for Göttingen, Curry married Mary Virginia Wheatley. The couple lived in Germany while Curry completed his dissertation, then, in 1929, moved to State College, Pennsylvania where Curry accepted a position at Pennsylvania State College. They had two children, Anne Wright Curry (July 27, 1930) and Robert Wheatley Curry (July 6, 1934). Curry remained at Penn State for the next 37 years. He spent one year at University of Chicago in 1931–32 under a National Research Fellowship and one year in 1938–39 at the Institute for Advanced Study in Princeton. In 1942 he took a leave of absence to do applied mathematics for the US government during World War II. Immediately after the war he worked on the ENIAC project, in 1945 and 1946. Under a Fulbright fellowship, he collaborated with Robert Feys in Louvain, Belgium. After retiring from Penn State in 1966, Curry accepted a position at the University of Amsterdam. In 1970, after finishing the second volume of his treatise on the combinatory logic, Curry retired from the University of Amsterdam and returned to State College, Pennsylvania.

Haskell Curry died on September 1, 1982 in State College, Pennsylvania.

Work[edit]

The focus of Curry's work were attempts to show that combinatory logic could provide a foundation for mathematics. Towards the end of 1933, he learned of the Kleene–Rosser paradox from correspondence with John Rosser. The paradox, developed by Rosser and Stephen Kleene had proved the inconsistency of a number of related formal systems including one proposed by Church (a system which had the lambda calculus as a consistent subsystem) and Curry's own system.[1] However, unlike Church, Kleene, and Rosser, Curry did not give up on the foundational approach, saying that he did not want to "run away from paradoxes."[2]

By working in the area of Combinatory Logic for his entire career, Curry essentially became the founder and biggest name in the field. Combinatory logic is the foundation for one style of functional programming language. The power and scope of combinatory logic is quite similar to that of the lambda calculus of Alonzo Church, and the latter formalism has tended to predominate in recent decades.

In 1947 Curry also described one of the first high-level programming languages and provided the first description of a procedure to convert a general arithmetic expression into a code for one-address computer. [3]

He taught at Harvard, Princeton, and from 1929 to 1966, at the Pennsylvania State University. In 1942, he published Curry's paradox. In 1966 he became professor of mathematics at the Universiteit van Amsterdam.

Curry also wrote and taught mathematical logic more generally; his teaching in this area culminated in his 1963 Foundations of Mathematical Logic. His preferred philosophy of mathematics was formalism (cf. his 1951 book), following his mentor Hilbert, but his writings betray substantial philosophical curiosity and a very open mind about intuitionistic logic.

Major publications[edit]

  • Curry, Haskell Brooks (1930). "Grundlagen der Kombinatorischen Logik" [Foundations of combinatorial logic]. American Journal of Mathematics (in German) (The Johns Hopkins University Press) 52 (3): 509–536. doi:10.2307/2370619. Retrieved 23 July 2012. 
  • Curry, Haskell B. (1950, 2nd edn. 1957). A theory of formal deducibility. University of Notre Dame Press.  Check date values in: |date= (help)[4]
  • Curry, Haskell B. (1951). Outlines of a formalist philosophy of mathematics. Amsterdam: Elsevier Science. ISBN 0444533680. Retrieved 23 July 2012. 
  • Curry, Haskell B. (1952). Leçons de logique algébrique (in French). Paris: Gauthier-Villars. [5]
  • Curry, Haskell; Feys, Robert (1958). Combinatory Logic Volume I. Amsterdam: North-Holland Publishing Company. 
  • Curry, Haskell (1963). Foundations of Mathematical Logic. Mcgraw Hill. 
  • Curry, Haskell B. (1972). Combinatory Logic Volume II. Amsterdam: North-Holland Publishing Company. ISBN 0720422086. 

See also[edit]

References[edit]

  1. ^ a b Seldin, Jonathan. "The Logic of Curry and Church". 
  2. ^ Barendregt, H.P. The Lambda Calculus: Its Syntax and Semantics. Elsevier. p. 4. 
  3. ^ Knuth, Donald E.; Pardo, Luis Trabb (1976). "Early development of programming languages". Stanford University, Computer Science Department, p. 22
  4. ^ Nelson, D. (1952). "Review: A theory of formal deducibility, by H. B. Curry". Bull. Amer. Math. Soc. 58 (3): 415–417. doi:10.1090/s0002-9904-1952-09596-3. 
  5. ^ Marcus, R. Barcan (1952). "Review: Leçons de logique algébrique, by H. B. Curry". Bull. Amer. Math. Soc. 58 (2): 673–674. doi:10.1090/s0002-9904-1952-09657-9. 

Further reading[edit]

  • Seldin, J.P., and Hindley, J.R., eds., 1980. To H.B. Curry: Essays on combinatory logic, lambda calculus, and formalism. Academic Press. Includes biographical essay.

External links[edit]