CS441 Exam 2 Chapter 8

Currying

Transforming multi-argument function into sequence of single-argument functions

Uncurrying

Converting curried function back to multi-argument function

Curried form

Function structured as nested single-argument functions

Uncurried form

Function taking multiple arguments at once rather than sequentially

Partial function application

Fixing some arguments to create function with fewer parameters

Higher-order function

Function that takes functions as arguments or returns functions

Type signature

Declaration specifying function input and output types

Type inference

Automatic type deduction by compiler

Type class

Haskell construct for functions implemented differently per type

Closure

Function with captured environment from enclosing scope

First-class function

Function treated as value: assigned, passed, returned

Lexical closure

Closure capturing variables from lexically enclosing scope

Functional mapping

Applying function to each element of collection

Map

HOF applying function to each list element, producing new list

Functional composition

Combining functions where output of one becomes input of another

Composition operator

Operator for composing functions

Foldl

HOF processing list left to right with combining function and base value

Foldr

HOF processing list right to left with combining function and base value

Recursive pattern

Common structure in recursive functions abstracted into HOFs

Modular programming

Dividing program into separate, independent modules

Reconfigurable program

Program using composable functions for easy modification and extension

Functional abstraction

Creating general, reusable functions hiding implementation details

Conciseness

Expressing functionality compactly using HOFs and composition

Reusability

Using same function in multiple contexts without modification

Composability

Functions can be combined to create complex functionality

Atomic functions

Small, single-purpose functions as building blocks

Function application

Invoking function with arguments to produce result

Fold

HOF family reducing list to single value with combining function and base case

Helper function

Auxiliary function supporting primary function implementation

Base value

Initial value in recursive operations or fold functions

Accumulator

Variable accumulating result during recursive or iterative computation

Programming abstraction

Managing complexity by hiding details and exposing essential features