Currying (English Wikipedia)

Originally published as Reynolds, John C. (1 August 1972). "Definitional interpreters for higher-order programming languages". In Shields, Rosemary (ed.). Proceedings of the ACM annual conference - ACM '72. Vol. 2. ACM Press. pp. 717–740. doi:10.1145/800194.805852. ISBN 9781450374927. S2CID 163294. In the last line we have used a trick called Currying (after the logician H. Curry) to solve the problem of introducing a binary operation into a language where all functions must accept a single argument. (The referee comments that although "Currying" is tastier, "Schönfinkeling" might be more accurate.) Republished as Reynolds, John C. (1998). "Definitional Interpreters for Higher-Order Programming Languages". Higher-Order and Symbolic Computation. 11 (4). Boston: Kluwer Academic Publishers: 363–397. doi:10.1023/A:1010027404223. 13 – via Syracuse University: College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects.

archive.org (Global: 6^th place; English: 6^th place)

Frege, Gottlob (1893). "§ 36". Grundgesetze der arithmetik (in German). Book from the collections of University of Wisconsin - Madison, digitized by Google on 26 August 2008. Jena: Hermann Pohle. pp. 54–55.

arxiv.org (Global: 49^th place; English: 31^st place)

Baez, John C.; Stay, Mike (6 June 2009). "Physics, Topology, Logic and Computation: A Rosetta Stone". In Coecke, Bob (ed.). New Structures for Physics (PDF). Lecture Notes in Physics. Vol. 813: New Structures for Physics. Berlin, Heidelberg: Springer (published 5 July 2010). pp. 95–172. arXiv:0903.0340. doi:10.1007/978-3-642-12821-9_2. ISBN 978-3-642-12821-9. S2CID 115169297. Archived from the original (PDF) on 5 December 2022.
Abramsky, Samson; Coecke, Bob (5 March 2007). "A categorical semantics of quantum protocols". Logic in Computer Science (LICS 2004): Proceedings, 19th Annual IEEE Symposium, Turku, Finland, 2004]. IEEE Computer Society Press. pp. 415–425. arXiv:quant-ph/0402130. doi:10.1109/LICS.2004.1319636. ISBN 978-0-7695-2192-3.

books.google.com (Global: 3^rd place; English: 3^rd place)

Rotman, Joseph Jonah (1988). "Chapter 11". An introduction to algebraic topology. Graduate texts in mathematics; 119. New York: Springer-Verlag. ISBN 978-0-387-96678-6. OCLC 17383909.
Mac Lane, Saunders; Moerdijk, Ieke (1992). "Chapter I. Categories of Functors; sections 7. Propositional Calculus, 8. Heyting Algebras, and 9. Quantifiers as Adjoints". Sheaves in Geometry and Logic: A First Introduction to Topos Theory. New York: Springer-Verlag, part of Springer Science & Business Media. pp. 48–57. ISBN 978-0-387-97710-2.

brown.edu (Global: 2,455^th place; English: 1,451^st place)

cs.brown.edu

Heim, Irene; Kratzer, Angelika (January 2, 1998). Semantics in Generative Grammar (PDF). Malden, Massachusetts: Blackwell Publishers, an imprint of Wiley. ISBN 0-631-19712-5.

c2.com (Global: low place; English: low place)

wiki.c2.com

"Currying Schonfinkelling". Portland Pattern Repository Wiki. Cunningham & Cunningham, Inc. 6 May 2012.

chalmers.se (Global: low place; English: low place)

cse.chalmers.se

Barendregt, Henk; Barendsen, Erik (March 2000) [December 1998]. Introduction to Lambda Calculus (PDF) (Revised ed.). p. 8.

computer-programming-forum.com (Global: low place; English: low place)

Turner, David (1 Jun 1997). "Programming language, Currying, or Schonfinkeling?, #9 / 14". Computer Programming Language Forum. Archived from the original on 3 March 2022. Retrieved 3 March 2022.

doi.org (Global: 2^nd place; English: 2^nd place)

Baez, John C.; Stay, Mike (6 June 2009). "Physics, Topology, Logic and Computation: A Rosetta Stone". In Coecke, Bob (ed.). New Structures for Physics (PDF). Lecture Notes in Physics. Vol. 813: New Structures for Physics. Berlin, Heidelberg: Springer (published 5 July 2010). pp. 95–172. arXiv:0903.0340. doi:10.1007/978-3-642-12821-9_2. ISBN 978-3-642-12821-9. S2CID 115169297. Archived from the original (PDF) on 5 December 2022.
Schönfinkel, Moses (September 1924) [Presented at the Mathematischen Gesellschaft (Mathematical Society) in Göttingen on 7 December 1920. Received by Mathematische Annalen on 15 March 1924.]. "Über die Bausteine der mathematischen Logik" [On the building blocks of mathematical logic] (PDF). Mathematische Annalen. 92 (3–4). Berlin: Springer: 305–316. doi:10.1007/BF01448013. S2CID 118507515.
Strachey, Christopher (April 2000) [This paper forms the substance of a course of lectures given at the International Summer School in Computer Programming at Copenhagen in August, 1967.]. "Fundamental Concepts in Programming Languages". Higher-Order and Symbolic Computation. 13: 11–49. CiteSeerX 10.1.1.332.3161. doi:10.1023/A:1010000313106. ISSN 1573-0557. S2CID 14124601. There is a device originated by Schönfinkel, for reducing operators with several operands to the successive application of single operand operators. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Originally published as Reynolds, John C. (1 August 1972). "Definitional interpreters for higher-order programming languages". In Shields, Rosemary (ed.). Proceedings of the ACM annual conference - ACM '72. Vol. 2. ACM Press. pp. 717–740. doi:10.1145/800194.805852. ISBN 9781450374927. S2CID 163294. In the last line we have used a trick called Currying (after the logician H. Curry) to solve the problem of introducing a binary operation into a language where all functions must accept a single argument. (The referee comments that although "Currying" is tastier, "Schönfinkeling" might be more accurate.) Republished as Reynolds, John C. (1998). "Definitional Interpreters for Higher-Order Programming Languages". Higher-Order and Symbolic Computation. 11 (4). Boston: Kluwer Academic Publishers: 363–397. doi:10.1023/A:1010027404223. 13 – via Syracuse University: College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects.
Curry, Haskell B. (1980). Barwise, Jon; Keisler, H. Jerome; Kunen, Kenneth (eds.). "Some Philosophical Aspects of Combinatory Logic". The Kleene Symposium: Proceedings of the Symposium Held June 18-24, 1978 at Madison, Wisconsin, U.S.A. (Studies in Logic and the Foundations of Mathematics). Studies in Logic and the Foundations of Mathematics. 101. North-Holland Publishing Company, imprint of Elsevier: 85–101. doi:10.1016/S0049-237X(08)71254-0. ISBN 9780444853455. ISSN 0049-237X. S2CID 117179133. Some contemporary logicians call this way of looking at a function "currying", because I made extensive use of it; but Schönfinkel had the idea some 6 years before I did.{{cite journal}}: CS1 maint: periodical has ISBN (link)
Tillotson, J.; Booth, Peter I. (March 1980) [Received 2 October 1978, revised 29 June 1979, published 1 May 1980]. Written at Memorial University of Newfoundland. "Monoidal closed, Cartesian closed and convenient categories of topological spaces" (PDF). Pacific Journal of Mathematics. 88 (1). Berkeley, California: Mathematical Sciences Publishers: 35–53. doi:10.2140/pjm.1980.88.35. eISSN 1945-5844. ISSN 0030-8730.
Abramsky, Samson; Coecke, Bob (5 March 2007). "A categorical semantics of quantum protocols". Logic in Computer Science (LICS 2004): Proceedings, 19th Annual IEEE Symposium, Turku, Finland, 2004]. IEEE Computer Society Press. pp. 415–425. arXiv:quant-ph/0402130. doi:10.1109/LICS.2004.1319636. ISBN 978-0-7695-2192-3.

lambda-the-ultimate.org (Global: low place; English: low place)

cdiggins (24 May 2007). "Currying != Generalized Partial Application?!". Lambda the Ultimate: The Programming Languages Weblog.

lmu.de (Global: low place; English: low place)

cip.ifi.lmu.de

Schönfinkel, Moses (September 1924) [Presented at the Mathematischen Gesellschaft (Mathematical Society) in Göttingen on 7 December 1920. Received by Mathematische Annalen on 15 March 1924.]. "Über die Bausteine der mathematischen Logik" [On the building blocks of mathematical logic] (PDF). Mathematische Annalen. 92 (3–4). Berlin: Springer: 305–316. doi:10.1007/BF01448013. S2CID 118507515.

msp.org (Global: low place; English: low place)

Tillotson, J.; Booth, Peter I. (March 1980) [Received 2 October 1978, revised 29 June 1979, published 1 May 1980]. Written at Memorial University of Newfoundland. "Monoidal closed, Cartesian closed and convenient categories of topological spaces" (PDF). Pacific Journal of Mathematics. 88 (1). Berkeley, California: Mathematical Sciences Publishers: 35–53. doi:10.2140/pjm.1980.88.35. eISSN 1945-5844. ISSN 0030-8730.

ncatlab.org (Global: low place; English: low place)

"compactly generated topological space". nLab. 28 May 2023.
"convenient category of topological spaces". nLab. 11 August 2023.

nott.ac.uk (Global: low place; English: low place)

cs.nott.ac.uk

Hutton, Graham; Jones, Mark P., eds. (November 2002). "Frequently Asked Questions for comp.lang.functional, 3. Technical topics, 3.2. Currying". University of Nottingham Computer Science.

preterhuman.net (Global: low place; English: low place)

cdn.preterhuman.net

Slonneger, Kenneth; Kurtz, Barry L. (1995). "Curried Functions, 5.1: Concepts and Examples, Chapter 5: The Lambda Calculus". Formal Syntax and Semantics of Programming Languages: A Laboratory Based Approach (PDF). Addison-Wesley Publishing Company. p. 144. ISBN 0-201-65697-3.

psu.edu (Global: 299^th place; English: 159^th place)

citeseerx.ist.psu.edu

Strachey, Christopher (April 2000) [This paper forms the substance of a course of lectures given at the International Summer School in Computer Programming at Copenhagen in August, 1967.]. "Fundamental Concepts in Programming Languages". Higher-Order and Symbolic Computation. 13: 11–49. CiteSeerX 10.1.1.332.3161. doi:10.1023/A:1010000313106. ISSN 1573-0557. S2CID 14124601. There is a device originated by Schönfinkel, for reducing operators with several operands to the successive application of single operand operators. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Baez, John C.; Stay, Mike (6 June 2009). "Physics, Topology, Logic and Computation: A Rosetta Stone". In Coecke, Bob (ed.). New Structures for Physics (PDF). Lecture Notes in Physics. Vol. 813: New Structures for Physics. Berlin, Heidelberg: Springer (published 5 July 2010). pp. 95–172. arXiv:0903.0340. doi:10.1007/978-3-642-12821-9_2. ISBN 978-3-642-12821-9. S2CID 115169297. Archived from the original (PDF) on 5 December 2022.
Schönfinkel, Moses (September 1924) [Presented at the Mathematischen Gesellschaft (Mathematical Society) in Göttingen on 7 December 1920. Received by Mathematische Annalen on 15 March 1924.]. "Über die Bausteine der mathematischen Logik" [On the building blocks of mathematical logic] (PDF). Mathematische Annalen. 92 (3–4). Berlin: Springer: 305–316. doi:10.1007/BF01448013. S2CID 118507515.
Strachey, Christopher (April 2000) [This paper forms the substance of a course of lectures given at the International Summer School in Computer Programming at Copenhagen in August, 1967.]. "Fundamental Concepts in Programming Languages". Higher-Order and Symbolic Computation. 13: 11–49. CiteSeerX 10.1.1.332.3161. doi:10.1023/A:1010000313106. ISSN 1573-0557. S2CID 14124601. There is a device originated by Schönfinkel, for reducing operators with several operands to the successive application of single operand operators. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Originally published as Reynolds, John C. (1 August 1972). "Definitional interpreters for higher-order programming languages". In Shields, Rosemary (ed.). Proceedings of the ACM annual conference - ACM '72. Vol. 2. ACM Press. pp. 717–740. doi:10.1145/800194.805852. ISBN 9781450374927. S2CID 163294. In the last line we have used a trick called Currying (after the logician H. Curry) to solve the problem of introducing a binary operation into a language where all functions must accept a single argument. (The referee comments that although "Currying" is tastier, "Schönfinkeling" might be more accurate.) Republished as Reynolds, John C. (1998). "Definitional Interpreters for Higher-Order Programming Languages". Higher-Order and Symbolic Computation. 11 (4). Boston: Kluwer Academic Publishers: 363–397. doi:10.1023/A:1010027404223. 13 – via Syracuse University: College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects.
Curry, Haskell B. (1980). Barwise, Jon; Keisler, H. Jerome; Kunen, Kenneth (eds.). "Some Philosophical Aspects of Combinatory Logic". The Kleene Symposium: Proceedings of the Symposium Held June 18-24, 1978 at Madison, Wisconsin, U.S.A. (Studies in Logic and the Foundations of Mathematics). Studies in Logic and the Foundations of Mathematics. 101. North-Holland Publishing Company, imprint of Elsevier: 85–101. doi:10.1016/S0049-237X(08)71254-0. ISBN 9780444853455. ISSN 0049-237X. S2CID 117179133. Some contemporary logicians call this way of looking at a function "currying", because I made extensive use of it; but Schönfinkel had the idea some 6 years before I did.{{cite journal}}: CS1 maint: periodical has ISBN (link)

slid.es (Global: low place; English: low place)

Lee, G. Kay (15 May 2013). "Functional Programming in 5 Minutes". Slides.

syr.edu (Global: 1,643^rd place; English: 794^th place)

surface.syr.edu

Originally published as Reynolds, John C. (1 August 1972). "Definitional interpreters for higher-order programming languages". In Shields, Rosemary (ed.). Proceedings of the ACM annual conference - ACM '72. Vol. 2. ACM Press. pp. 717–740. doi:10.1145/800194.805852. ISBN 9781450374927. S2CID 163294. In the last line we have used a trick called Currying (after the logician H. Curry) to solve the problem of introducing a binary operation into a language where all functions must accept a single argument. (The referee comments that although "Currying" is tastier, "Schönfinkeling" might be more accurate.) Republished as Reynolds, John C. (1998). "Definitional Interpreters for Higher-Order Programming Languages". Higher-Order and Symbolic Computation. 11 (4). Boston: Kluwer Academic Publishers: 363–397. doi:10.1023/A:1010027404223. 13 – via Syracuse University: College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects.

uchicago.edu (Global: 226^th place; English: 199^th place)

math.uchicago.edu

May, Jon Peter (1999). A concise course in algebraic topology (PDF). Chicago lectures in mathematics. Chicago, Ill.: University of Chicago Press. pp. 39–55. ISBN 0-226-51183-9. OCLC 41266205.

ucr.edu (Global: 1,400^th place; English: 754^th place)

math.ucr.edu

Baez, John C.; Stay, Mike (6 June 2009). "Physics, Topology, Logic and Computation: A Rosetta Stone". In Coecke, Bob (ed.). New Structures for Physics (PDF). Lecture Notes in Physics. Vol. 813: New Structures for Physics. Berlin, Heidelberg: Springer (published 5 July 2010). pp. 95–172. arXiv:0903.0340. doi:10.1007/978-3-642-12821-9_2. ISBN 978-3-642-12821-9. S2CID 115169297. Archived from the original (PDF) on 5 December 2022.

uncarved.com (Global: low place; English: low place)

"Partial Function Application is not Currying". The Uncarved Block. 7 August 2020. Archived from the original on 23 October 2016.

web.archive.org (Global: 1^st place; English: 1^st place)

"Partial Function Application is not Currying". The Uncarved Block. 7 August 2020. Archived from the original on 23 October 2016.
Baez, John C.; Stay, Mike (6 June 2009). "Physics, Topology, Logic and Computation: A Rosetta Stone". In Coecke, Bob (ed.). New Structures for Physics (PDF). Lecture Notes in Physics. Vol. 813: New Structures for Physics. Berlin, Heidelberg: Springer (published 5 July 2010). pp. 95–172. arXiv:0903.0340. doi:10.1007/978-3-642-12821-9_2. ISBN 978-3-642-12821-9. S2CID 115169297. Archived from the original (PDF) on 5 December 2022.
Turner, David (1 Jun 1997). "Programming language, Currying, or Schonfinkeling?, #9 / 14". Computer Programming Language Forum. Archived from the original on 3 March 2022. Retrieved 3 March 2022.

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Strachey, Christopher (April 2000) [This paper forms the substance of a course of lectures given at the International Summer School in Computer Programming at Copenhagen in August, 1967.]. "Fundamental Concepts in Programming Languages". Higher-Order and Symbolic Computation. 13: 11–49. CiteSeerX 10.1.1.332.3161. doi:10.1023/A:1010000313106. ISSN 1573-0557. S2CID 14124601. There is a device originated by Schönfinkel, for reducing operators with several operands to the successive application of single operand operators. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Curry, Haskell B. (1980). Barwise, Jon; Keisler, H. Jerome; Kunen, Kenneth (eds.). "Some Philosophical Aspects of Combinatory Logic". The Kleene Symposium: Proceedings of the Symposium Held June 18-24, 1978 at Madison, Wisconsin, U.S.A. (Studies in Logic and the Foundations of Mathematics). Studies in Logic and the Foundations of Mathematics. 101. North-Holland Publishing Company, imprint of Elsevier: 85–101. doi:10.1016/S0049-237X(08)71254-0. ISBN 9780444853455. ISSN 0049-237X. S2CID 117179133. Some contemporary logicians call this way of looking at a function "currying", because I made extensive use of it; but Schönfinkel had the idea some 6 years before I did.{{cite journal}}: CS1 maint: periodical has ISBN (link)
May, Jon Peter (1999). A concise course in algebraic topology (PDF). Chicago lectures in mathematics. Chicago, Ill.: University of Chicago Press. pp. 39–55. ISBN 0-226-51183-9. OCLC 41266205.
Tillotson, J.; Booth, Peter I. (March 1980) [Received 2 October 1978, revised 29 June 1979, published 1 May 1980]. Written at Memorial University of Newfoundland. "Monoidal closed, Cartesian closed and convenient categories of topological spaces" (PDF). Pacific Journal of Mathematics. 88 (1). Berkeley, California: Mathematical Sciences Publishers: 35–53. doi:10.2140/pjm.1980.88.35. eISSN 1945-5844. ISSN 0030-8730.
Rotman, Joseph Jonah (1988). "Chapter 11". An introduction to algebraic topology. Graduate texts in mathematics; 119. New York: Springer-Verlag. ISBN 978-0-387-96678-6. OCLC 17383909.

Currying (English Wikipedia)

acm.org (Global: 1,200th place; English: 821st place)

portal.acm.org

archive.org (Global: 6th place; English: 6th place)

arxiv.org (Global: 49th place; English: 31st place)

books.google.com (Global: 3rd place; English: 3rd place)

brown.edu (Global: 2,455th place; English: 1,451st place)

cs.brown.edu

c2.com (Global: low place; English: low place)

wiki.c2.com

chalmers.se (Global: low place; English: low place)

cse.chalmers.se

computer-programming-forum.com (Global: low place; English: low place)

doi.org (Global: 2nd place; English: 2nd place)

lambda-the-ultimate.org (Global: low place; English: low place)

lmu.de (Global: low place; English: low place)

cip.ifi.lmu.de

msp.org (Global: low place; English: low place)

ncatlab.org (Global: low place; English: low place)

nott.ac.uk (Global: low place; English: low place)

cs.nott.ac.uk

preterhuman.net (Global: low place; English: low place)

cdn.preterhuman.net

psu.edu (Global: 299th place; English: 159th place)

citeseerx.ist.psu.edu

semanticscholar.org (Global: 15th place; English: 8th place)

api.semanticscholar.org

slid.es (Global: low place; English: low place)

syr.edu (Global: 1,643rd place; English: 794th place)

surface.syr.edu

uchicago.edu (Global: 226th place; English: 199th place)

math.uchicago.edu

ucr.edu (Global: 1,400th place; English: 754th place)

math.ucr.edu

uncarved.com (Global: low place; English: low place)

web.archive.org (Global: 1st place; English: 1st place)

worldcat.org (Global: 4th place; English: 4th place)

search.worldcat.org

acm.org (Global: 1,200^th place; English: 821^st place)

archive.org (Global: 6^th place; English: 6^th place)

arxiv.org (Global: 49^th place; English: 31^st place)

books.google.com (Global: 3^rd place; English: 3^rd place)

brown.edu (Global: 2,455^th place; English: 1,451^st place)

doi.org (Global: 2^nd place; English: 2^nd place)

psu.edu (Global: 299^th place; English: 159^th place)

semanticscholar.org (Global: 15^th place; English: 8^th place)

syr.edu (Global: 1,643^rd place; English: 794^th place)

uchicago.edu (Global: 226^th place; English: 199^th place)

ucr.edu (Global: 1,400^th place; English: 754^th place)

web.archive.org (Global: 1^st place; English: 1^st place)

worldcat.org (Global: 4^th place; English: 4^th place)