CSC 351 - Chapter 15 Flashcards
1
Q
Functional Languages
A
- based on mathematical functions
- simple semantics, simple syntax
2
Q
Lambda Expressions
A
- describe nameless functions (anonymous functions)
3
Q
Functional Form
A
- takes functions as parameters, or returns a function as a result. Or both.
4
Q
Referential Transparency
A
- evaluation of a function always produces the same result given the same parameters
5
Q
Tail Recursive
A
- a recursive call is the last operation of a function
6
Q
Currying
A
- replaces a function with more than one parameter with a function with one parameter that returns a function that takes the other parameters
7
Q
Lazy Evaluation
A
- only computes the values that are necessary
