ISBN: 9786130707828 - higher-order function: higher-order function, mathematics, computer science, functional (mathematics), function (mathematics), operator, derivative, calculus, lambda calculus, typed lambda calculus (3 résultats)

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 120 pp. Englisch.

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online.In mathematics andcomputer science, higher-order functions, functional forms, orfunctionals are functions which do at least one of the following:takeone or more functions as an input, output a function. In mathematicsthese are also known as operators or functionals. The derivative incalculus is a common example, since it maps a function to anotherfunction.In the untyped lambda calculus, all functions are higher-order;in a typed lambda calculus, from which most functional programminglanguages are derived, higher-order functions are generally those withtypes containing more than one arrow. In functional programminghigher-order functions that return other functions are said to becurried.The map function found in many functional programming languagesis one example of a higher-order function. It takes as arguments afunction f and a list of elements, and as result, returns a new listwith f applied to each element from the list. …

Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online.In mathematics andcomputer science, higher-order functions, functional forms, orfunctionals are functions which do at least one of the following:takeone or more functions as an input, output a function. In mathematicsthese are also known as operators or functionals. The derivative incalculus is a common example, since it maps a function to anotherfunction.In the untyped lambda calculus, all functions are higher-order;in a typed lambda calculus, from which most functional programminglanguages are derived, higher-order functions are generally those withtypes containing more than one arrow. In functional programminghigher-order functions that return other functions are said to becurried.The map function found in many functional programming languagesis one example of a higher-order function. It takes as arguments afunction f and a list of elements, and as result, returns a new listwith f applied to each element from the list.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 120 pp. Englisch. …