Collection of concepts/ideas/terminology that I come across everyday while learning haskell & functional programming!
algebra = set of objects + operations on those objects that create new objects. In programming, the objects are data types (Int, Bool, String, etc) and the operations used to combine them are:
- multiplication:
data Point = Point Int Intwhere both Ints are required to create the new data typePoint - addition:
data Person = Person String | Person Intwhere a Person is represented by either a String or an Int, but not both!
Refers to a class of problems that are hard to find solutions for, however, a solution would be easily verifiable in nondeterministic polynomial time (NP refers to nondeterministic polynomial) https://www.ics.uci.edu/~eppstein/161/960312.html
As in Partial function application, which refers to creating a new function by fixing one or more arguments of another function. For example: take 2 "hello" => "he" then we can define a new function takeTwo = take 2 and we say takeTwo "hello" => "he"
Refers to a style of programming where we don't write the function arguments on both sides of the function definition. This style is prefered since it's more common to write functions in terms of other functions (function composition) and it looks more compact this way without the arguments. (The composition operator . has nothing to do with this name!)
Property of programs, it means we can substitute the right-hand side of a function (function definition) with the left (function name) anywhere in the program and it will always evaluate the same.