Go on. Explore!

lvl 0 • 0 xp

lvl 1

Home Market Decks Interests

Chapter 15 - Programming Language

memorize.ai (lvl 286)

(0)

16 cards

()

Section 1

Preview this deck

The design of the imperative languages is based directly on the . is the primary concern, rather than the suitability of the language for . The design of the functional languages is based on . A solid theoretical basis that is also closer to the user, but relatively unconcerned with the on which programs will run

Front

1 / 16

Go R Programming Language

0.0

0 reviews

5			0
4			0
3			0
2			0
1			0

Active users

All-time users

Favorites

Last updated

5 years ago

Date created

Mar 1, 2020

Cards (16)

Section 1

(16 cards)

The design of the imperative languages is based directly on the . is the primary concern, rather than the suitability of the language for . The design of the functional languages is based on . A solid theoretical basis that is also closer to the user, but relatively unconcerned with the on which programs will run

Front

von Neumann architecture, efficiency, software development, mathematical functions, architecture of the machines

Back

One common kind of functional form is function composition, which takes s and yields a function whose ________________________

Front

two functions as a parameter, values is the first actual parameter function applied to the application of the second

Back

A mathematical function is a of one set, called the , to another set, called

Front

mapping of members, domain set, range set

Back

The mapping of a function contains no s, where a bound parameter is a name for a . Every occurrence of a parameter is bound to a value from the and is a during evaluation

Front

unbound parameter, particular value, domain set, constant

Back

apply-to-all is a functional form that and ____________

Front

takes a single function as a parameter, yields a list of values obtained by applying the given function to each element of a list of parameters

Back

Nonstrict languages can use an evaluation form called ____________, which means that expressions are evaluated only if and when their values are needed

Front

lazy evaluation

Back

A programming language is strict if it requires ____________________________________, which ensures that the value of a function does not depend on the order in which the parameters are evaluated

Front

all actual parameters to be fully evaluated

Back

Polymorphic programming language allows ____________________________________

Front

routines to use variables of different types at different times

Back

There are three characteristics of Haskell: (1) functions in Haskell can be (2) s used in Haskell (3) Haskell is a pure functional programming language, meaning it has no s, no s and no s of any kind

Front

overloaded, nonstrict semantic, variable, assignment statement, side effect

Back

Lambda expressions describe s, and they are applied to (s) by placing the (s) after the expression ((x) x x x)(2)

Front

nameless function, parameter, parameter

Back

A language is nonstrict if it does not have the strict requirement. Nonstrict languages are generally more ____________

Front

efficient

Back

What is referential transparency?

Front

In a functional programming language, the evaluation of a function always produces the same result given the same parameters

Back

A higher-order function or , is one that either or ____________, or both

Front

functional form, takes functions as parameters, yields a function as its result

Back

One of the fundamental characteristics of mathematical functions is that the evaluation order of their mapping expressions is controlled by and , rather than by the sequencing and iterative repetition that are common to programs written in the imperative programming languages

Front

recursion, conditional expression

Back

A ____________ specifies the parameter(s) and the mapping of a function

Front

lambda expression

Back

The objective of the design of a functional programming language is to ________________________ to the greatest extent possible

Front

mimic mathematical functions

Back

Chapter 15 - Programming Language

Preview this deck

0.0

Cards (16)

von Neumann architecture, efficiency, software development, mathematical functions, architecture of the machines

One common kind of functional form is function composition, which takes ________________________s and yields a function whose ________________________________________________

two functions as a parameter, values is the first actual parameter function applied to the application of the second

A mathematical function is a ____________ of one set, called the ____________, to another set, called ____________

mapping of members, domain set, range set

The mapping of a function contains no ____________s, where a bound parameter is a name for a ____________. Every occurrence of a parameter is bound to a value from the ____________ and is a ____________ during evaluation

unbound parameter, particular value, domain set, constant

apply-to-all is a functional form that ____________________________________ and ________________________________________________

takes a single function as a parameter, yields a list of values obtained by applying the given function to each element of a list of parameters

Nonstrict languages can use an evaluation form called ____________, which means that expressions are evaluated only if and when their values are needed

lazy evaluation

A programming language is strict if it requires ____________________________________, which ensures that the value of a function does not depend on the order in which the parameters are evaluated

all actual parameters to be fully evaluated

Polymorphic programming language allows ____________________________________

routines to use variables of different types at different times

There are three characteristics of Haskell: (1) functions in Haskell can be ____________ (2) ____________s used in Haskell (3) Haskell is a pure functional programming language, meaning it has no ____________s, no ____________s and no ____________s of any kind

overloaded, nonstrict semantic, variable, assignment statement, side effect

Lambda expressions describe ____________s, and they are applied to ____________(s) by placing the ____________(s) after the expression ((x) x x x)(2)

nameless function, parameter, parameter

A language is nonstrict if it does not have the strict requirement. Nonstrict languages are generally more ____________

efficient

What is referential transparency?

In a functional programming language, the evaluation of a function always produces the same result given the same parameters

A higher-order function or ____________, is one that either ________________________ or ________________________, or both

functional form, takes functions as parameters, yields a function as its result

recursion, conditional expression

A ____________ specifies the parameter(s) and the mapping of a function

lambda expression

The objective of the design of a functional programming language is to ________________________ to the greatest extent possible

mimic mathematical functions

One common kind of functional form is function composition, which takes s and yields a function whose ________________________

A mathematical function is a of one set, called the , to another set, called

The mapping of a function contains no s, where a bound parameter is a name for a . Every occurrence of a parameter is bound to a value from the and is a during evaluation

apply-to-all is a functional form that and ____________

There are three characteristics of Haskell: (1) functions in Haskell can be (2) s used in Haskell (3) Haskell is a pure functional programming language, meaning it has no s, no s and no s of any kind

Lambda expressions describe s, and they are applied to (s) by placing the (s) after the expression ((x) x x x)(2)

A higher-order function or , is one that either or ____________, or both