Intro to Functional Programming

Intro to Functional Programming

memorize.aimemorize.ai (lvl 286)
Section 1

Preview this deck

Not capable of or susceptible to change

Front

Star 0%
Star 0%
Star 0%
Star 0%
Star 0%

0.0

0 reviews

5
0
4
0
3
0
2
0
1
0

Active users

0

All-time users

0

Favorites

0

Last updated

6 years ago

Date created

Mar 1, 2020

Cards (21)

Section 1

(21 cards)

Not capable of or susceptible to change

Front

If something is immutable it is ...

Back

map

Front

The ________ method creates a new array with the results of calling a provided function on every element in the calling array.

Back

mutable

Front

A/An ____________ object is any object which can be modified after it's created.

Back

reduce and reduceRight

Front

The _____________ and ______________ functions can be used to transform an array into any value, including a number, string, boolean, object, function, or even another array.

Back

Currying

Front

__________ is a process to reduce functions of more than one argument to functions of one argument with the help of lambda calculus.

Back

expression

Front

A/An ___________ is a piece of code which evaluates to some value. Examples include: 2 * 2 and Math.max(4, 3, 2).

Back

Declarative

Front

_________________ programs abstract the flow control process, and instead spend lines of code describing the data flow: What to do. The how gets abstracted away.

Back

immutable

Front

A/An ____________ object is an object that can't be modified after it's created.

Back

reduce

Front

The _________ method applies a function against an accumulator and each element in the array (from left to right) to reduce it to a single value.

Back

filter

Front

The _________ method creates a new array with all elements that pass the test implemented by the provided function.

Back

Functional programming

Front

_____________ is the process of building software by composing pure functions while avoiding shared state, mutable data, and side-effects.

Back

statement

Front

A/An ____________ is a piece of code which performs some action. Examples include: for, if, switch, throw, etc.

Back

Immutability

Front

___________ implies that once some data structure is initialized, you cannot modify (mutate) the data structure or any data it contains

Back

Transducers

Front

________ are composable and efficient data transformation functions which don't create intermediate collections.

Back

higher-order functions

Front

Functions that operate on other functions by taking them as arguments, returning them, or both are called ______________.

Back

forEach

Front

The ________ method executes a provided function once for each array element.

Back

referential transparency

Front

In functional programming, __________ is when an expression may be replaced by its value (or anything having the same value) without changing the result of the program.

Back

Shared state

Front

____________ is any variable, object, or memory space that exists in a shared scope, or as the property of an object being passed between scopes.

Back

Imperative

Front

________________ programs spend lines of code describing the specific steps used to achieve the desired results - the flow control: How to do things.

Back

pure

Front

A _________ function is a function which given the same input will always return the same output and produces no side effects.

Back

first-class member

Front

A function is considered a ____________________ when it can be declared as a variable and sent to functions as an argument.

Back