Haskell Curry | Academic Influence

Haskell Curry's AcademicInfluence.com Rankings

Haskell Curry

Mathematics

#364

Historical Rank

mathematics Degrees

Haskell Curry

Philosophy

#368

Historical Rank

Logic

#54

Historical Rank

philosophy Degrees

Download Badge

Mathematics
Philosophy

Haskell Curry's Degrees

PhD Mathematics University of Göttingen

Why Is Haskell Curry Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Haskell Brooks Curry was an American mathematician and logician. Curry is best known for his work in combinatory logic, which initial concept is based on a paper by Moses Schönfinkel, 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.

(See a Problem?)

Haskell Curry's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism (1980) (733)
Foundations of Mathematical Logic (1964) (502)
On Pólya frequency functions IV: The fundamental spline functions and their limits (1966) (436)
PURE MOTOR HEMIPLEGIA OF VASCULAR ORIGIN. (1965) (356)
The method of steepest descent for non-linear minimization problems (1944) (309)
Combinatory Logic, Volume I (1959) (301)
The inconsistency of certain formal logics (1942) (266)
Functionality in Combinatory Logic. (1934) (240)
Combinatory Logic, Volume I. (1961) (199)
Some logical aspects of grammatical structure (1961) (159)
Outlines of a formalist philosophy of mathematics (1951) (97)
A Theory Of Formal Deducibility (1950) (78)
THEORY AND EXPERIENCE1 (1953) (64)
The elimination theorem when modality is present (1952) (57)
Modified basic functionality in combinatory logic (1969) (50)
The combinatory foundations of mathematical logic (1942) (45)
An Analysis of Logical Substitution (1929) (44)
The paradox of Kleene and Rosser (1941) (33)
Some Additions to the Theory of Combinators (1932) (26)
A Formalization of Recursive Arithmetic (1941) (24)
The permutability of rules in the classical inferential calculus (1952) (24)
Apparent Variables From the Standpoint of Combinatory Logic (1933) (23)
Some Properties of Equality and Implication in Combinatory Logic (1934) (22)
Some aspects of the problem of mathematical rigor (1941) (22)
A note on the reduction of Gentzen's calculus $LJ$ (1939) (22)
II.—MATHEMATICS, SYNTACTICS AND LOGIC1 (1953) (19)
Angiokeratoma corporis diffusum--a case report. (1961) (19)
Some Philosophical Aspects of Combinatory Logic (1980) (18)
The Universal Quantifier in Combinatory Logic (1931) (15)
The system LD (1952) (14)
The consistency of a system of combinatory restricted generality (1973) (13)
Some Advances in the Combinatory Theory of Quantification. (1942) (13)
REMARKS ON THE DEFINITION AND NATURE OF MATHEMATICS (1954) (12)
First Properties of Functionality in Combinatory Logic (1935) (12)
On the definition of substitution, replacement and allied notions in a abstract formal system (1952) (12)
CALCULUSES AND FORMAL SYSTEMS (1958) (11)
A revision of the fundamental rules of combinatory logic (1941) (10)
On the definition of negation by a fixed proposition in inferential calculus (1952) (9)
The Inconsistency of Certain Formal Logic (1942) (9)
Language, Metalanguage, and Formal System (1950) (9)
Consistency and completeness of the theory of combinators (1941) (8)
A Philosophy of Mathematics. (1948) (8)
A new proof of the church–rosser theorem (1952) (6)
A STUDY OF INVERSE INTERPOLATION OF THE ENIAC (1946) (6)
Early history of the Association for Symbolic Logic (1962) (6)
Combinatory recursive objects of all finite types (1964) (5)
The Undecidability of λK-Conversion (1969) (5)
On the use of dots as brackets in logical expressions (1937) (5)
The Heaviside Operational Calculus (1943) (4)
Camphor poisoning; report of case occurring during pregnancy. (1957) (4)
A Deduction Theorem for Inferential Predicate Calculus (1968) (4)
A MATHEMATICAL TREATMENT OF THE RULES OF THE SYLLOGISM (1936) (4)
Review: Alonzo Church, The Weak Theory of Implication (1953) (3)
A study of generalized standardization in combinatory logic (1975) (3)
Basic Verifiability in the Combinatory Theory of Restricted Generality (1970) (3)
Mathematical Teaching and National Defense (1942) (3)
ON A POLYNOMIAL REPRESENTATION OF λβ NORMAL FORMS (1978) (2)
Note on iterations with convergence of higher degree (1951) (2)
Philosophy of mathematics: Remarks on the definition and nature of mathematics (1984) (2)
Review: Alfred Tarski, Introduction to Logic and to the Methodology of Deductive Sciences (1942) (1)
Review: Roger Hindley, Axioms for Strong Reduction in Combinatory Logic; Bruce Lercher, The Decidability of Hindley's Axioms for Strong Reduction (1971) (1)
Book Review: Introduction to Logic and to the Methodology of Deductive Sciences (1942) (1)
Review: J. B. Rosser, Logic for mathematicians (1954) (1)
Phoenix in flight. All systems go. (1972) (1)
Introduction to mathematical logic: Vol. I, by Alonzo Church. 376 pages, 6 × 9 in. Princeton, Princeton University Press, 1956. Price, $7.50 (1957) (1)
Computability theory. (1966) (1)
Bernays Paul. Logical calculus . Notes on lectures at the Institute for Advanced Study 1935–36, prepared with the assistance of F. A. Ficken. Mimeographed. Institute for Advanced Study, Princeton, N. J., 1936, 125 pp. (1938) (0)
Review: Alonzo Church, Mathematical Logic (1937) (0)
Chapter II: The Finite Positive Connectives (1966) (0)
Calculuses and Formaly Systems (1960) (0)
Outlines of a Formalist Philosophy of Mathematics.Lecons de Logique Algebrique (1953) (0)
Certain Basic Theorems on Linear Differential Equations (1949) (0)
Review: Albert A. Bennett and Charles A. Baylis, Formal Logic (1941) (0)
Febrile convulsions. (1980) (0)
Hindley Roger. Axioms for strong reduction in combinatory logic. The journal of symbolic logic, vol. 32 (1967), pp. 224–236.Lercher Bruce. The decidability of Hindley's axioms for strong reduction. The journal of symbolic logic, vol. 32 (1967), pp. 237–239. (1971) (0)
Two examples of algorithms (1964) (0)
A note on the associative law in logical algebras (1936) (0)
Chapter IV: Negation (1966) (0)
Addendum to early history of the Association for Symbolic Logic (1963) (0)
Louisiana Heron in Centre County, Pennsylvania (1933) (0)
Review: Paul Bernays, Logical Calculus (1938) (0)
Chapter I: Formal Systems and Formal Reasoning (1950) (0)
Gadwall in Center County, Pennsylvania (1942) (0)
Memories of S. S. Curry (1959) (0)
Chapter V: Modalities (1966) (0)
Richardson's Owl in Vermont in Summer (0)
Logic as Mathematical Science (1963) (0)
Computability Theory: Enumerability, Decidability, and Computability . By Hans Hermes, translated by G. T. Herman and O. Plassmann. Academic Press, New York; Springer, Berlin, 1965. 255 pp., $9.75. (1966) (0)
Title and Copyright Pages (1966) (0)
Computability Theory. (Physics, Mathematics, and Engineering: Enumerability, Decidability, and Computability) (1966) (0)

This paper list is powered by the following services:

Other Resources About Haskell Curry

en.wikipedia.org

What Schools Are Affiliated With Haskell Curry?

Haskell Curry is affiliated with the following schools:

Image Attributions

Image Source for Haskell Curry