lists, types, typeclasses

what makes a function a higher-order function? select one

it only operates on lists

it can take functions as arguments or return a function as a result

it modifies global variables

it must return an integer or string

it can take functions as arguments or return a function as a result

which of the following are typically involved in implementing a recursive function? select all that apply

base case

repeated iteration

recursive call

terminating condition

continuous memory allocation

base case

which statement best explains why purely functional programming languages like haskell avoid mutable states? select one

a mutable state is inefficient because it prevents lazy evaluation from working correctly

avoiding mutable states ensures the same result for the same inputs (referential transparency), making code easier to reason about

purely functional languages do not support any form of state manipulation, making them unsuitable for for real-world applications

higher-order functions in functional programming languages cannot operate on values thats involve mutable states

avoiding mutable states ensures the same result for the same inputs (referential transparency), making code easier to reason about

a