Jump to content

Haskell Curry

From Wikipedia, the free encyclopedia
(Redirected from Haskell B. Curry)
Haskell Brooks Curry
Born(1900-09-12)September 12, 1900
Millis, Massachusetts, US
DiedSeptember 1, 1982(1982-09-01) (aged 81)
State College, Pennsylvania, US
Alma mater
Known forCombinatory logic
Curry–Howard correspondence
Curry's paradox
Formalism in the philosophy of mathematics
Scientific career
FieldsMathematics
Logic
computer science
InstitutionsPennsylvania State University
University of Amsterdam
Doctoral advisorDavid Hilbert

Haskell Brooks Curry (/ˈhæskəl/ HAS-kəl; September 12, 1900 – September 1, 1982) was an American mathematician, logician and computer scientist. Curry is best known for his work in combinatory logic, whose initial concept is based on a paper by Moses Schönfinkel,[1] for which Curry did much of the development. Curry is also known for Curry's paradox and the Curry–Howard correspondence. Named for him are three programming languages: Haskell, Brook, and Curry, and the concept of currying, a method to transform functions, used in mathematics and computer science.

Life

[edit]

Curry was born on (1900-09-12)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 Massachusetts Institute of Technology (MIT), he returned to Harvard to study physics, earning a Master of Arts (M.A.) in 1924. Curry's interest in mathematical logic began 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 Doctor of Philosophy (Ph.D.) in mathematics. While he was directed by George David 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 University of 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.[2]

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–1932 under a National Research Fellowship and one year in 1938–1939 at the Institute for Advanced Study in Princeton. In 1942 he took a leave of absence to do applied mathematics for the United States government during World War II, notably at the Frankford Arsenal. 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(1982-09-01) (aged 81), 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 Alonzo Church (a system which had the lambda calculus as a consistent subsystem) and Curry's own system.[2] 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."[3]

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 are quite similar to that of the lambda calculus of Church, and the latter formalism has tended to predominate in recent decades.

During World War II, Curry worked at the Frankford Arsenal, where he developed a steepest descent algorithm, based on work by Cauchy. [4] This became a foundational example of modern gradient descent methods.

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.[5]

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 logic and its history and philosophy of exact sciences at the University of Amsterdam, the successor of Evert Willem Beth.[6]

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]
  • "Grundlagen der Kombinatorischen Logik" [Foundations of combinatorial logic]. American Journal of Mathematics (in German). 52 (3). The Johns Hopkins University Press: 509–536. 1930. doi:10.2307/2370619. JSTOR 2370619.
  • A theory of formal deducibility. University of Notre Dame Press. 1950.[7]
    • A theory of formal deducibility (2nd ed.). University of Notre Dame Press. 1957.
  • Outlines of a formalist philosophy of mathematics. Amsterdam: Elsevier Science. 1951. ISBN 0444533680. Retrieved 23 July 2012.
  • Leçons de logique algébrique (in French). Paris: Gauthier-Villars. 1952.[8]
  • Curry, Haskell Brooks; Feys, Robert (1958). Combinatory Logic. Vol. I. Amsterdam: North Holland Publishing Company. ISBN 0-7204-2208-6.
  • Foundations of Mathematical Logic. Mcgraw Hill. 1963.
  • Curry, Haskell Brooks; Hindley, J. Roger; Seldin, Jonathan P. (1972). Combinatory Logic. Vol. II. Amsterdam: North Holland. ISBN 0-7204-2208-6.

Notes

[edit]
  1. ^ Schönfinkel 1924.
  2. ^ a b Seldin 2008.
  3. ^ Barendregt 1984, p. 4.
  4. ^ Curry, Haskell B. (1944). "The method of steepest descent for non-linear minimization problems". Quarterly of Applied Mathematics. 2 (3): 258–261. doi:10.1090/qam/10667. ISSN 0033-569X. Retrieved 7 November 2024.
  5. ^ Knuth & Pardo 1976, p. 22.
  6. ^ University of Amsterdam 2023.
  7. ^ Nelson 1952.
  8. ^ Marcus 1952.

Further reading

[edit]

References

[edit]
[edit]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Haskell_Curry&oldid=1256052032"