Moses Schönfinkel (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Moses Schönfinkel" in English language version.

refsWebsite

Global rank English rank

2^nd place

11^th place

8^th place

low place

69^th place

59^th place

low place

low place

26^th place

20^th place

5^th place

arxiv.org

Kline & Anovskaa 1951. Kline, G.L.; Anovskaa, S. A. (1951). "Review of Foundations of mathematics and mathematical logic by S. A. Yanovskaya". Journal of Symbolic Logic. 16 (1): 46–48. doi:10.2307/2268665. JSTOR 2268665. S2CID 119004002.
Strachey 2000, There is a device originated by Schönfinkel, for reducing operators with several operands to the successive application of single operand operators.. Strachey, Christopher (2000). "Fundamental Concepts in Programming Languages". Higher-Order and Symbolic Computation. 13: 11–49. doi:10.1023/A:1010000313106. S2CID 14124601. (Reprinted lecture notes from 1967.)
Reynolds 1998, 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.). Reynolds, John C. (1998). "Definitional Interpreters for Higher-Order Programming Languages". Higher-Order and Symbolic Computation. 11 (4): 374. doi:10.1023/A:1010027404223. S2CID 43352033.

Kline & Anovskaa 1951. Kline, G.L.; Anovskaa, S. A. (1951). "Review of Foundations of mathematics and mathematical logic by S. A. Yanovskaya". Journal of Symbolic Logic. 16 (1): 46–48. doi:10.2307/2268665. JSTOR 2268665. S2CID 119004002.

Kline & Anovskaa 1951. Kline, G.L.; Anovskaa, S. A. (1951). "Review of Foundations of mathematics and mathematical logic by S. A. Yanovskaya". Journal of Symbolic Logic. 16 (1): 46–48. doi:10.2307/2268665. JSTOR 2268665. S2CID 119004002.
Strachey 2000, There is a device originated by Schönfinkel, for reducing operators with several operands to the successive application of single operand operators.. Strachey, Christopher (2000). "Fundamental Concepts in Programming Languages". Higher-Order and Symbolic Computation. 13: 11–49. doi:10.1023/A:1010000313106. S2CID 14124601. (Reprinted lecture notes from 1967.)
Reynolds 1998, 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.). Reynolds, John C. (1998). "Definitional Interpreters for Higher-Order Programming Languages". Higher-Order and Symbolic Computation. 11 (4): 374. doi:10.1023/A:1010027404223. S2CID 43352033.

Wolfram 2021a. Wolfram, Stephen (2021a). "Where Did Combinators Come From? Hunting the Story of Moses Schönfinkel". Combinators: A Centennial View. Wolfram Research. pp. 213–277 (Addendum 281–294). ISBN 978-1-57955-043-1. A celebration of the development of combinators, a hundred years after they were introduced by Schönfinkel (1924) (eBook: ISBN 978-1-57955-044-8)

Willard Van Orman Quine: Introduction to "Bausteine der mathematischen Logik" (Schönfinkel (1967)) Schönfinkel, Moses (1967) [1924]. Van Heijenoort, Jean (ed.). Über die Bausteine der mathematischen Logik [On the building blocks of mathematical logic]. From Frege to Gödel: A Source Book in Mathematical Logic, 1879-1931. Translated by Bauer-Mengelberg, Stefan. Cambridge, MA, USA: Harvard University Press. pp. 355–366. ISBN 978-0674324497. OCLC 503886453.