Skip to main content

Questions tagged [higher-order-functions]

Higher-order functions are functions which either take functions as arguments or return them as output (or both). They are a cornerstone of functional programming.

Filter by
Sorted by
Tagged with
2 votes
4 answers
676 views

I am teaching a beginners course on JavaScript programming and web development. Passing a function as a value into another function is a very common thing in JS from the very beginning. As the ...
lishaak's user avatar
  • 467
-1 votes
1 answer
200 views

I'm interested in designing a high level function in Python, (I.E. a function that takes other functions as arguments) but I don't know of any good conventions for documenting such a function. For ...
Visipi's user avatar
  • 109
10 votes
5 answers
9k views

Let's say, for example, that I have a function makeFoo that makes another function foo: function makeFoo(string) { return () => string } const foo = makeFoo('bar'); I know that makeFoo is a ...
Splox's user avatar
  • 209
0 votes
3 answers
647 views

I am asking here something that is really haunting for years (for real !). I guess in a "perfect world", we would have programs made of data models and functions, and those functions manipulate data ...
ibi0tux's user avatar
  • 241
3 votes
3 answers
709 views

I'm trying to design a theoretical programming language and I'm facing a problem with high order functions. The language is strong-typed, so the way to define a standard function is like so : ...
ibi0tux's user avatar
  • 241
1 vote
1 answer
190 views

In Javascript, I have seen a code like: const getSomeMapper = (param1, param2, param3) (param4, param5, param6) => { // uses all these params and returns a promise } interface ...
Craftein's user avatar
  • 113
0 votes
2 answers
1k views

For clarification, let's review the following example: Consider that we have the following array of Ints: let array = [1, 2, 3, 4, 5] and we've been asked to generate a new array from array ...
Ahmad F's user avatar
  • 101
3 votes
2 answers
896 views

The Short (Original) Version How are function objects, sometimes called "functors" in C++ and other OO languages, where they make sense different from classes symptomatic of the poltergeist anti-...
Greg Kramida's user avatar
1 vote
2 answers
886 views

In order words, what's the advantage of writing this: Listing 1 var sortBy = function sortBy(p) { return function (a, b) { return a[p] > b[p]; }; }; Compared to this? Listing 2 var ...
alex's user avatar
  • 383
7 votes
2 answers
273 views

I've found that there isn't a concept similar to "arity-based subtyping" in many languages that I've programmed in, where higher-order functions could consume functions of lower arity than their ...
concat's user avatar
  • 517
3 votes
1 answer
291 views

Using the Tree representation(mentioned below), typedef enum {Running, Warning, Critical}Status; struct TreeNode; typedef struct List{ int childCount; struct treeNode **childList; }List; ...
overexchange's user avatar
  • 2,325
1 vote
2 answers
345 views

I have a function function name(src, dest, remove) { copy(src, dest); if (remove) { delete(src); } } What name should I give to that function? Alternatively higher order function ...
jcubic's user avatar
  • 143
1 vote
1 answer
141 views

I'm writing javascript object that wraps REST requests. For every operation on the server there is a method that accepts the parameters for the request and a callback that will receive the results. (...
Kasper van den Berg's user avatar
2 votes
6 answers
848 views

I'm new to compiled languages. I'm learning C. I'm used to coding in python. I was wondering if there was any equivalent, or replacement method in compiled langues for functions able to create a ...
loxaxs's user avatar
  • 147
4 votes
1 answer
1k views

I have been working for a few weeks on a new web project and I am realizing that all I am doing is basically calculations and transformations on data, and that most of my classes do not contain any ...
Carlos Rodriguez's user avatar
1 vote
4 answers
14k views

I'm having a hard time understanding exactly what is happening in the code here and how this script is changing other functions. This is taken from eloquentjavascript.net chapter 5 on higher order ...
user213229's user avatar
2 votes
1 answer
897 views

In languages that support currying, I can't think of many cases where using a tuple as function input parameters would be better than breaking the tuple apart into multiple parameters, which then ...
xji's user avatar
  • 791
1 vote
3 answers
154 views

Total no: of filters possible is M . User can select m filters where m <= M . A typical example is files from a folder , he could say modified between so and so date , start with so and so and so ...
Nishant's user avatar
  • 585
0 votes
2 answers
246 views

I'm trying to find a language construct equivalent to higher order functions in the top 10 languages from TIOBE index. Here are my results so far: C - function pointers Java - anonymous methods, ...
Grzegorz Sławecki's user avatar
0 votes
0 answers
121 views

Say you have arguments A1 >: A2 (contra-variant), and return types B1 <: B2 (covariant). The corresponding functions are such that: A1 => B1 <: A2 => B2 Sometimes, this makes sense to me - ...
tunesmith's user avatar
  • 121
2 votes
1 answer
908 views

this is not a question on how to write unit tests this is not a question on what to test this is a question on reducing the typing needed overall for a personal testing framework I know you can send ...
user2738698's user avatar
20 votes
1 answer
14k views

The following Scala code works and can be passed to a Java method expecting a function. Is there a cleaner way to do this? Here's my first pass: val plusOne = new java.util.function.Function[Int,...
GlenPeterson's user avatar
26 votes
3 answers
10k views

Is there a naming convention for higher order functions? That is, functions which return other functions. An example in Javascript: function onlyDivisibleBy(div) { // <-- higher order function ...
nickf's user avatar
  • 637
11 votes
1 answer
1k views

Some higher-order functions for operating on lists or arrays have been repeatedly adopted or reinvented. The functions map, fold[l|r], and filter are found together in several programming ...
Heatsink's user avatar
  • 306
9 votes
2 answers
1k views

I've come to understand that long before Haskell, O'Caml or LISP, higher order functions were an academic research subject and in mathematics, Schönfinkel (in 1967) and Haskell Curry (in 1968) already ...
Abel's user avatar
  • 932
5 votes
2 answers
545 views

I'm a bit surprised by a sentence found in the book "Clojure Programming" (1st [and only as I write this!?] edition), page 78: It should be obvious that it's impossible to deterministically test a ...
Cedric Martin's user avatar
9 votes
4 answers
3k views

I've been reading articles on Functional programming everyday and been trying to apply some practices as much as possible. But I don't understand what is unique in currying or partial application. ...
Vigneshwaran's user avatar
6 votes
3 answers
1k views

I'm learning Scala and am a little bewildered by all the methods (higher-order functions) available on the collections. Which ones produce more results than the original collection, which ones ...
GlenPeterson's user avatar