Anonymous function | Function (mathematics), Subroutine, Name binding, Identifier, Alonzo Church, Lambda calculus, Anonymous recursion, Alan Turing

Frederic P. Miller (u. a.)

ISBN 10: 6130814364 / ISBN 13: 9786130814366

Published by OmniScriptum, 2026

About this Item

Anonymous function | Function (mathematics), Subroutine, Name binding, Identifier, Alonzo Church, Lambda calculus, Anonymous recursion, Alan Turing | Frederic P. Miller (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130814366 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.

Seller Inventory # 113248092

Bibliographic Details

• Title: Anonymous function | Function (mathematics), Subroutine, Name binding, Identifier, Alonzo Church, Lambda calculus, Anonymous recursion, Alan Turing
• Publisher: OmniScriptum
• Publication Date: 2026
• Language: English
• ISBN 10: 6130814364
• ISBN 13: 9786130814366
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 12D millimeters 220 millimeters width by 150 millimeters height by 12 millimeters depth
• Weight: 298 grams
• Seller catalogs:
  • Bücher

About this title

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computing, an anonymous function is a function (or a subroutine) defined, and possibly called, without being bound to an identifier. Anonymous functions originate in the work of Alonzo Church in his invention of the lambda calculus in 1936 (prior to electronic computers), in which all functions are anonymous. The Y combinator can be utilised in these circumstances to provide anonymous recursion, which Church used to show that some mathematical questions are unsolvable by computation. (Note: this result was disputed at the time, and one year later his student Alan Turing provided a proof that was more generally accepted.)