Flashcards
Functional Programming
Cards in this deck (8)
- 1RecursionWhen a function passes itself (which means it is a higher order function)
- 2First Class Objects must be able to?They must be able to:
Appear in expressions
Be assigned to a variable
Be assigned as arguments
Be returned in function calls - 3Higher order functionAny function that either:
Uses a function as an argument
and/or
Returns another function - 4Base CaseNecessary in recursion to prevent the function calling itself forever.
i.e. prevents Stack Overflow Error - 5Recursive CaseThe part of the function that calls itself in recursion
- 6Expression of FunctionsExpressed as
f: A --> B
where f is the function
A is the domain
B is the co-domain - 7Composition of FunctionsCombinations of functions to make new functions.
Done with the o operator - 8Three types of recursive, higher-order functionsMap, Fold, Filter
Information
- Description
- A level IT (4.12) Flashcards on Functional Programming, created by Ethan Fidzinski on 11/06/2026.
- Created by
- Ethan Fidzinski
- Views
- 0
- Rating