About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 117. Chapters: Functional programming, Logic programming, Currying, Frame problem, Unification, Graph reduction machine, Warren Abstract Machine, Monad, Belief revision, Constraint logic programming, Anonymous function, Stable model semantics, Quark Framework, First-class function, Default logic, Circumscription, Regular number, Situation calculus, Defeasible reasoning, Continuation-passing style, Immutable object, Answer set programming, Scientific community metaphor, Algebraic data type, Polymorphism, Constraint programming, Arrow, Concurrent constraint logic programming, Corecursion, Event calculus, Generalized algebraic data type, Indeterminacy in concurrent computation, SLD resolution, Production system, Type class, Guarded Command Language, Zipper, Closed world assumption, Initial algebra, Higher-order function, Yale shooting problem, Higher-order abstract syntax, Simon Peyton Jones, Brouwer-Heyting-Kolmogorov interpretation, Negation as failure, Actant, Append, Pure function, Autoepistemic logic, Lout, Philip Wadler, F-algebra, Clause, Open world assumption, Clausal normal form, List of functional programming topics, Prince XML, Purely functional, Coinduction, Total functional programming, Erik Meijer, Substitution, International Conference on Functional Programming, Advice taker, Cut, Journal of Functional Programming, Functional reactive programming, Well-founded semantics, Administrative normal form, Occurs check, Ramification problem, International Symposium on Logic-based Program Synthesis and Transformation, Defeasible logic, Qualification problem, Conflict resolution strategy, Type variable, Supercombinator. Excerpt: In functional programming, a monad is a programming structure that represents computations. Monads are a kind of abstract data type constructor that encapsulate program logic instead of data in the doma...
