In programming languages and type theory, polymorphism (from Greek πολύς, polys, "many, much" and μορφή, morphē, "form, shape") is the provision of a single interface to entities of different types.
Map (higher-order function)
In many programming languages, map is the name of a higher-order function that applies a given function to each element of a list, returning a list of results in the same order.
Partial application
In computer science, partial application (or partial function application) refers to the process of fixing a number of arguments to a function, producing another function of smaller arity.
Hope (programming language)
Hope is a small functional programming language developed in the 1970s at Edinburgh University.
Miranda (programming language)
Miranda is a lazy, purely functional programming language designed by David Turner as a successor to his earlier programming languages SASL and KRC, using some concepts from ML and Hope.
Regular number
Regular numbers are numbers that evenly divide powers of 60 (or, equivalently powers of 30).
Frenetic (programming language)
Frenetic is a domain-specific language for programming software-defined networks (SDNs).
Functional logic programming
Functional logic programming is the combination, in a single programming language, of the paradigms of functional programming (including higher-order programming) and logic programming (non-deterministic programming, unification).
SequenceL
SequenceL is a general purpose functional programming language and auto-parallelizing (Parallel computing) tool set, whose primary design objectives are performance on multi-core processor hardware, ease of programming, platform portability/optimization, and code clarity and readability.
A-normal form
In computer science, A-normal form (abbreviated ANF) is an intermediate representation of programs in functional compilers introduced by Sabry and Felleisen in 1992 as a simpler alternative to continuation-passing style (CPS).
Quark Framework
The Quark Framework (Open Quark) consists of a non-strict functional language and runtime for the Java platform.
Thunk
In computer programming, a thunk is a subroutine that is created, often automatically, to assist a call to another subroutine.
Type class
In computer science, a type class is a type system construct that supports ad hoc polymorphism.
Continuation-passing style
In functional programming, continuation-passing style (CPS) is a style of programming in which control is passed explicitly in the form of a continuation.