Functional programming

programming paradigm based on applying and composing functions

thumb|A short introduction to Wikifunctions by Denny Vrandečić

in programming languages and type theory, accessing different types using a common interface

function definition that is not bound to an identifier

additional effect of a function in a procedural programming language besides returning a value

design pattern in functional programming to build generic types

mathematical function that takes one or more functions as an input or that outputs a function

programming language construct for processing data conditionally on its structure

In mathematics and computer science, currying is the technique of translating a function that takes multiple arguments into a sequence of families of functions, each taking a single argument.

functional package manager for installed software packages and versions

object whose state cannot be modified after it is created

British computer scientist

in computer programming, a type formed by combining other types

programming language feature that allows manipulating functions like other values

cross-platform package manager

numbers that evenly divide powers of 60

In computer programming, '''' ( or ) is a fundamental function in most dialects of the Lisp programming language. constructs memory objects which hold two values or pointers to two values. These objects are referred to as (cons) cells, conses, non-atomic s-expressions ("NATSes"), or (cons) pairs. In Lisp jargon, the expression "to cons x onto y" means to construct a new object with (cons x y). The resulting pair has a left half, referred to as the (the first element, or contents of the address part of register), and a right half, referred to as the (the second element, or contents of the decre

Dutch computer scientist

encapsulation of an optional value in programming or type theory

American computer scientist

in programming, function that does not interact with global state

programming style

interpretation of intuitionistic logic

thumb|The commutative diagram, which defines a property required by morphisms of the original Category (mathematics)|category, so that they can be morphisms of the newly defined category of F-algebras.

programming paradigm that combines logic programming with functional programming

In narrative theory, an actant in the actantial model of semiotic narrative analysis is a type of role that a character may have in a narrative. Bruno Latour writes,

In functional programming, the concept of catamorphism (from the Ancient Greek: "downwards" and "form, shape") denotes the unique homomorphism from an initial algebra into some other algebra.

type system construct for ad-hoc polymorphism

programming paradigm that treats all computation as the evaluation of mathematical functions

In computer science, corecursion is a type of operation that is dual to (structural) recursion. Whereas recursion consumes a data structure by first handling the topmost layer before descending into its inner parts, corecursion produces a data structure by first defining the topmost layer before defining its inner parts. Corecursion is a particularly important in total languages, as it allows encoding potentially non-terminating computations in a context where every function must terminate. It is supported by theorem provers Agda and Rocq.

American computer scientist (1952-2015)

technique of representing an aggregate data structure so that it is convenient for writing programs that traverse the structure arbitrarily and update its contents

functional programming

Concept in functional programming

In computer science, coinduction is a technique for defining and proving properties of systems of concurrent interacting objects.