Go on. Explore!

lvl 0 • 0 xp

lvl 1

Home Market Decks Interests

Haskell Standard Prelude

memorize.ai (lvl 286)

Section 1

Preview this deck

type

Front

1 / 33

Haskell

0.0

0 reviews

5			0
4			0
3			0
2			0
1			0

Active users

All-time users

Favorites

Last updated

1 year ago

Date created

Mar 14, 2020

Cards (33)

Section 1

(33 cards)

type

Front

synonym for an existing type

Back

Lisp

Front

(2) funcitonal language with some influence from lambda calculus allowed variable assignment

Back

data

Front

define new algebraic data type from scratch

Back

Haskell

Front

(7) lazy pure functional programming language

Back

takeWhile

Front

selects elements from a list while a predicate holds

Back

product

Front

returns the product of all elements of a list

Back

zip

Front

takes 2 list and returns a list of pairs

Back

ISWIM

Front

(3) pure functional language

Back

FD

Front

(4) functional w/ emphasis on higher order functions

Back

Pure

Front

immutable data (altering of values is not allowed) and referential transparency (expressions always yield the same value)

Back

reverse

Front

reverses a list

Back

Miranda

Front

(6) lazy functional languages

Back

all

Front

takes as input a predict and a list and returns a True or False if all elements of the list satisfy the predicate

Back

Lambda calculus

Front

(1) inspiration for haskell

Back

map

Front

takes a function and performs the function on the list and returns the list

Back

Lazy

Front

only evaluates arguments when necessary

Back

take n

Front

returns the first n elements

Back

newtype

Front

a restricted form of data

Back

tail

Front

returns a list with the head removed

Back

any

Front

takes a predicate and a list and returns True if any element in the list satisfies the predicate

Back

length

Front

returns the length of a list

Back

++

Front

appends 2 lists

Back

drop n

Front

returns a list with the first n elements removed

Back

ML

Front

(5) modern functional with type and polymorphic types

Back

head

Front

returns first element of a list

Back

dropWhile

Front

remove elements from a list while a predicate holds

Back

filter

Front

takes a predicate and a list as arguments and returns a list of elements that satisfy the predicate

Back

Functional

Front

application of functions to arguments

Back

or

Front

takes a list of bools and returns True if any element is True, False otherwise

Back

!!

Front

[ ] !! n - returns the nth element of the list

Back

filterOut

Front

returns a list of elements that do not satisfy the predicate argument

Back

and

Front

takes a list of bools and returns True if all elements are True, False otherwise

Back

(.)

Front

returns the composition of two functions as a single argument

Back