Functional programming

In computer science, functional programming is a programming paradigm—a style of building the structure and elements of computer programs—that treats computation as the evaluation of mathematical functions and avoids changing-state and mutable data. ^[1]

Academy

An academy (Attic Greek: Ἀκαδήμεια; Koine Greek Ἀκαδημία) is an institution of secondary education, higher learning, research, or honorary membership.

New!!: Functional programming and Academy · See more »

Agda (programming language)

Agda is a dependently typed functional programming language originally developed by Ulf Norell at Chalmers University of Technology with implementation described in his PhD thesis.

New!!: Functional programming and Agda (programming language) · See more »

Algebraic data type

In computer programming, especially functional programming and type theory, an algebraic data type is a kind of composite type, i.e., a type formed by combining other types.

New!!: Functional programming and Algebraic data type · See more »

Anamorphism

In category theory, the anamorphism (from the Greek ἀνά "upwards" and μορφή "form, shape") of a coinductive type denotes the assignment of a coalgebra to its unique morphism to the final coalgebra of an endofunctor.

New!!: Functional programming and Anamorphism · See more »

Anonymous function

In computer programming, an anonymous function (function literal, lambda abstraction, or lambda expression) is a function definition that is not bound to an identifier.

New!!: Functional programming and Anonymous function · See more »

APL (programming language)

APL (named after the book A Programming Language) is a programming language developed in the 1960s by Kenneth E. Iverson.

New!!: Functional programming and APL (programming language) · See more »

Array data structure

In computer science, an array data structure, or simply an array, is a data structure consisting of a collection of elements (values or variables), each identified by at least one array index or key.

New!!: Functional programming and Array data structure · See more »

Array programming

In computer science, array programming languages (also known as vector or multidimensional languages) generalize operations on scalars to apply transparently to vectors, matrices, and higher-dimensional arrays.

New!!: Functional programming and Array programming · See more »

Arthur Whitney (computer scientist)

Arthur Whitney (born October 24, 1957) is a Canadian computer scientist most notable for developing three programming languages inspired by APL: A+, K, and Q, and for cofounding the U.S. company Kx Systems.

New!!: Functional programming and Arthur Whitney (computer scientist) · See more »

Assembly language

An assembly (or assembler) language, often abbreviated asm, is a low-level programming language, in which there is a very strong (but often not one-to-one) correspondence between the assembly program statements and the architecture's machine code instructions.

New!!: Functional programming and Assembly language · See more »

Assignment (computer science)

In computer programming, an assignment statement sets and/or re-sets the value stored in the storage location(s) denoted by a variable name; in other words, it copies a value into the variable.

New!!: Functional programming and Assignment (computer science) · See more »

Association for Computing Machinery

The Association for Computing Machinery (ACM) is an international learned society for computing.

New!!: Functional programming and Association for Computing Machinery · See more »

Associative array

In computer science, an associative array, map, symbol table, or dictionary is an abstract data type composed of a collection of (key, value) pairs, such that each possible key appears at most once in the collection.

New!!: Functional programming and Associative array · See more »

Électricité de France

Électricité de France S.A. (EDF; Electricity of France) is a French electric utility company, largely owned by the French state.

New!!: Functional programming and Électricité de France · See more »

Binary heap

A binary heap is a heap data structure that takes the form of a binary tree.

New!!: Functional programming and Binary heap · See more »

C (programming language)

C (as in the letter ''c'') is a general-purpose, imperative computer programming language, supporting structured programming, lexical variable scope and recursion, while a static type system prevents many unintended operations.

New!!: Functional programming and C (programming language) · See more »

C Sharp (programming language)

C# (/si: ʃɑːrp/) is a multi-paradigm programming language encompassing strong typing, imperative, declarative, functional, generic, object-oriented (class-based), and component-oriented programming disciplines.

New!!: Functional programming and C Sharp (programming language) · See more »

C Sharp 3.0

The programming language C# version 3.0 was released on 19 November 2007 as part of.NET Framework 3.5.

New!!: Functional programming and C Sharp 3.0 · See more »

C++11

C++11 is a version of the standard for the programming language C++.

New!!: Functional programming and C++11 · See more »

Cambridge University Press

Cambridge University Press (CUP) is the publishing business of the University of Cambridge.

New!!: Functional programming and Cambridge University Press · See more »

Catamorphism

In category theory, the concept of catamorphism (from the Greek: κατά "downwards" and μορφή "form, shape") denotes the unique homomorphism from an initial algebra into some other algebra.

New!!: Functional programming and Catamorphism · See more »

Category theory

Category theory formalizes mathematical structure and its concepts in terms of a labeled directed graph called a category, whose nodes are called objects, and whose labelled directed edges are called arrows (or morphisms).

New!!: Functional programming and Category theory · See more »

Cayenne (programming language)

Cayenne is a dependently typed functional programming language created by Lennart Augustsson in 1998, making it one of the earliest dependently type programming language (as opposed to proof assistant or logical framework).

New!!: Functional programming and Cayenne (programming language) · See more »

Central processing unit

A central processing unit (CPU) is the electronic circuitry within a computer that carries out the instructions of a computer program by performing the basic arithmetic, logical, control and input/output (I/O) operations specified by the instructions.

New!!: Functional programming and Central processing unit · See more »

Chris Okasaki

Chris Okasaki, Ph.D. is an associate professor of computer science at the United States Military Academy.

New!!: Functional programming and Chris Okasaki · See more »

Class (computer programming)

In object-oriented programming, a class is an extensible program-code-template for creating objects, providing initial values for state (member variables) and implementations of behavior (member functions or methods).

New!!: Functional programming and Class (computer programming) · See more »

Clean (programming language)

Clean is a general-purpose purely functional computer programming language.

New!!: Functional programming and Clean (programming language) · See more »

Clojure

Clojure (like "closure") is a dialect of the Lisp programming language.

New!!: Functional programming and Clojure · See more »

Closure (computer programming)

In programming languages, a closure (also lexical closure or function closure) is a technique for implementing lexically scoped name binding in a language with first-class functions.

New!!: Functional programming and Closure (computer programming) · See more »

Coinduction

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

New!!: Functional programming and Coinduction · See more »

Combinatory logic

Combinatory logic is a notation to eliminate the need for quantified variables in mathematical logic.

New!!: Functional programming and Combinatory logic · See more »

Common Lisp

Common Lisp (CL) is a dialect of the Lisp programming language, published in ANSI standard document ANSI INCITS 226-1994 (R2004) (formerly X3.226-1994 (R1999)).

New!!: Functional programming and Common Lisp · See more »

Comparison of programming paradigms

This article attempts to set out the various similarities and differences between the various programming paradigms as a summary in both graphical and tabular format with links to the separate discussions concerning these similarities and differences in extant Wikipedia articles.

New!!: Functional programming and Comparison of programming paradigms · See more »

CompCert

CompCert is a formally verified optimizing compiler for a large subset of the C99 programming language which currently targets 32-bit PowerPC, ARM, x86 and x86-64 architectures.

New!!: Functional programming and CompCert · See more »

Compiler

A compiler is computer software that transforms computer code written in one programming language (the source language) into another programming language (the target language).

New!!: Functional programming and Compiler · See more »

Computability

Computability is the ability to solve a problem in an effective manner.

New!!: Functional programming and Computability · See more »

Computation

Computation is any type of calculation that includes both arithmetical and non-arithmetical steps and follows a well-defined model, for example an algorithm.

New!!: Functional programming and Computation · See more »

Computer program

A computer program is a collection of instructions for performing a specific task that is designed to solve a specific class of problems.

New!!: Functional programming and Computer program · See more »

Computer science

Computer science deals with the theoretical foundations of information and computation, together with practical techniques for the implementation and application of these foundations.

New!!: Functional programming and Computer science · See more »

Computer simulation

Computer simulation is the reproduction of the behavior of a system using a computer to simulate the outcomes of a mathematical model associated with said system.

New!!: Functional programming and Computer simulation · See more »

Consistency

In classical deductive logic, a consistent theory is one that does not contain a contradiction.

New!!: Functional programming and Consistency · See more »

Constructive proof

In mathematics, a constructive proof is a method of proof that demonstrates the existence of a mathematical object by creating or providing a method for creating the object.

New!!: Functional programming and Constructive proof · See more »

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.

New!!: Functional programming and Continuation-passing style · See more »

Control flow

In computer science, control flow (or flow of control) is the order in which individual statements, instructions or function calls of an imperative program are executed or evaluated.

New!!: Functional programming and Control flow · See more »

Coq

In computer science, Coq is an interactive theorem prover.

New!!: Functional programming and Coq · See more »

Curry–Howard correspondence

In programming language theory and proof theory, the Curry–Howard correspondence (also known as the Curry–Howard isomorphism or equivalence, or the proofs-as-programs and propositions- or formulae-as-types interpretation) is the direct relationship between computer programs and mathematical proofs.

New!!: Functional programming and Curry–Howard correspondence · See more »

Currying

In mathematics and computer science, currying is the technique of translating the evaluation of a function that takes multiple arguments (or a tuple of arguments) into evaluating a sequence of functions, each with a single argument.

New!!: Functional programming and Currying · See more »

D (programming language)

D is an object-oriented, imperative, multi-paradigm system programming language created by Walter Bright of Digital Mars and released in 2001.

New!!: Functional programming and D (programming language) · See more »

Data structure

In computer science, a data structure is a data organization and storage format that enables efficient access and modification.

New!!: Functional programming and Data structure · See more »

Database

A database is an organized collection of data, stored and accessed electronically.

New!!: Functional programming and Database · See more »

David Turner (computer scientist)

David A. Turner (born 1946) is a British computer scientist.

New!!: Functional programming and David Turner (computer scientist) · See more »

Declarative programming

In computer science, declarative programming is a programming paradigm—a style of building the structure and elements of computer programs—that expresses the logic of a computation without describing its control flow.

New!!: Functional programming and Declarative programming · See more »

Deforestation (computer science)

In the theory of programming languages in computer science, deforestation (also known as fusion) is a program transformation to eliminate intermediate lists or tree structures that are created and then immediately consumed by a program.

New!!: Functional programming and Deforestation (computer science) · See more »

Denotational semantics

In computer science, denotational semantics (initially known as mathematical semantics or Scott–Strachey semantics) is an approach of formalizing the meanings of programming languages by constructing mathematical objects (called denotations) that describe the meanings of expressions from the languages.

New!!: Functional programming and Denotational semantics · See more »

Dependent type

In computer science and logic, a dependent type is a type whose definition depends on a value.

New!!: Functional programming and Dependent type · See more »

Derivative

The derivative of a function of a real variable measures the sensitivity to change of the function value (output value) with respect to a change in its argument (input value).

New!!: Functional programming and Derivative · See more »

Device driver

In computing, a device driver is a computer program that operates or controls a particular type of device that is attached to a computer.

New!!: Functional programming and Device driver · See more »

Differential operator

In mathematics, a differential operator is an operator defined as a function of the differentiation operator.

New!!: Functional programming and Differential operator · See more »

Domain-specific language

A domain-specific language (DSL) is a computer language specialized to a particular application domain.

New!!: Functional programming and Domain-specific language · See more »

Donald D. Chamberlin

Donald D. Chamberlin (born 21 December 1944) is an American computer scientist who is best known as one of the principal designers of the original SQL language specification with Raymond Boyce.

New!!: Functional programming and Donald D. Chamberlin · See more »

Dylan (programming language)

Dylan is a multi-paradigm programming language that includes support for functional and object-oriented programming, and is dynamic and reflective while providing a programming model designed to support efficient machine code generation, including fine-grained control over dynamic and static behaviors.

New!!: Functional programming and Dylan (programming language) · See more »

Eager evaluation

In computer programming, eager evaluation, also known as strict evaluation or greedy evaluation, is the evaluation strategy used by most traditional programming languages.

New!!: Functional programming and Eager evaluation · See more »

Effect system

In computing, an effect system is a formal system which describes the computational effects of computer programs, such as side effects.

New!!: Functional programming and Effect system · See more »

Elixir (programming language)

Elixir is a functional, concurrent, general-purpose programming language that runs on the Erlang virtual machine (BEAM).

New!!: Functional programming and Elixir (programming language) · See more »

Embedded software

Embedded software is computer software, written to control machines or devices that are not typically thought of as computers.

New!!: Functional programming and Embedded software · See more »

Entscheidungsproblem

In mathematics and computer science, the Entscheidungsproblem (German for "decision problem") is a challenge posed by David Hilbert in 1928.

New!!: Functional programming and Entscheidungsproblem · See more »

Epigram (programming language)

Epigram is a functional programming language with dependent types.

New!!: Functional programming and Epigram (programming language) · See more »

Ericsson

Ericsson (Telefonaktiebolaget L. M. Ericsson) is a Swedish multinational networking and telecommunications company headquartered in Stockholm.

New!!: Functional programming and Ericsson · See more »

Erlang (programming language)

Erlang is a general-purpose, concurrent, functional programming language, as well as a garbage-collected runtime system.

New!!: Functional programming and Erlang (programming language) · See more »

Expression (computer science)

An expression in a programming language is a combination of one or more constants, variables, operators, and functions that the programming language interprets (according to its particular rules of precedence and of association) and computes to produce ("to return", in a stateful environment) another value.

New!!: Functional programming and Expression (computer science) · See more »

F Sharp (programming language)

F# (pronounced F sharp) is a strongly typed, multi-paradigm programming language that encompasses functional, imperative, and object-oriented programming methods.

New!!: Functional programming and F Sharp (programming language) · See more »

Facebook

Facebook is an American online social media and social networking service company based in Menlo Park, California.

New!!: Functional programming and Facebook · See more »

Fibonacci number

In mathematics, the Fibonacci numbers are the numbers in the following integer sequence, called the Fibonacci sequence, and characterized by the fact that every number after the first two is the sum of the two preceding ones: Often, especially in modern usage, the sequence is extended by one more initial term: By definition, the first two numbers in the Fibonacci sequence are either 1 and 1, or 0 and 1, depending on the chosen starting point of the sequence, and each subsequent number is the sum of the previous two.

New!!: Functional programming and Fibonacci number · See more »

Filter (higher-order function)

In functional programming, filter is a higher-order function that processes a data structure (usually a list) in some order to produce a new data structure containing exactly those elements of the original data structure for which a given predicate returns the boolean value true.

New!!: Functional programming and Filter (higher-order function) · See more »

Finitary relation

In mathematics, a finitary relation has a finite number of "places".

New!!: Functional programming and Finitary relation · See more »

First-class function

In computer science, a programming language is said to have first-class functions if it treats functions as first-class citizens.

New!!: Functional programming and First-class function · See more »

First-order logic

First-order logic—also known as first-order predicate calculus and predicate logic—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science.

New!!: Functional programming and First-order logic · See more »

Fold (higher-order function)

In functional programming, fold (also termed reduce, accumulate, aggregate, compress, or inject) refers to a family of higher-order functions that analyze a recursive data structure and through use of a given combining operation, recombine the results of recursively processing its constituent parts, building up a return value.

New!!: Functional programming and Fold (higher-order function) · See more »

Formal system

A formal system is the name of a logic system usually defined in the mathematical way.

New!!: Functional programming and Formal system · See more »

Formal verification

In the context of hardware and software systems, formal verification is the act of proving or disproving the correctness of intended algorithms underlying a system with respect to a certain formal specification or property, using formal methods of mathematics.

New!!: Functional programming and Formal verification · See more »

Fortran

Fortran (formerly FORTRAN, derived from Formula Translation) is a general-purpose, compiled imperative programming language that is especially suited to numeric computation and scientific computing.

New!!: Functional programming and Fortran · See more »

Foundations of mathematics

Foundations of mathematics is the study of the philosophical and logical and/or algorithmic basis of mathematics, or, in a broader sense, the mathematical investigation of what underlies the philosophical theories concerning the nature of mathematics.

New!!: Functional programming and Foundations of mathematics · See more »

FP (programming language)

FP (short for Function Programming) is a programming language created by John Backus to support the function-level programming Backus' 1977 Turing Award lecture paradigm.

New!!: Functional programming and FP (programming language) · See more »

Function (mathematics)

In mathematics, a function was originally the idealization of how a varying quantity depends on another quantity.

New!!: Functional programming and Function (mathematics) · See more »

Function application

In mathematics, function application is the act of applying a function to an argument from its domain so as to obtain the corresponding value from its range.

New!!: Functional programming and Function application · See more »

Function-level programming

In computer science, function-level programming refers to one of the two contrasting programming paradigms identified by John Backus in his work on programs as mathematical objects, the other being value-level programming.

New!!: Functional programming and Function-level programming · See more »

Functional reactive programming

Functional reactive programming (FRP) is a programming paradigm for reactive programming (asynchronous dataflow programming) using the building blocks of functional programming (e.g. map, reduce, filter).

New!!: Functional programming and Functional reactive programming · See more »

Generalized algebraic data type

In functional programming, a generalized algebraic data type (GADT, also first-class phantom type, guarded recursive datatype, or equality-qualified type) is a generalization of parametric algebraic data types.

New!!: Functional programming and Generalized algebraic data type · See more »

Glasgow Haskell Compiler

Glasgow Haskell Compiler, less commonly known as The Glorious Glasgow Haskell Compilation System or simply GHC, is an open source native code compiler for the functional programming language Haskell.

New!!: Functional programming and Glasgow Haskell Compiler · See more »

Global variable

In computer programming, a global variable is a variable with global scope, meaning that it is visible (hence accessible) throughout the program, unless shadowed.

New!!: Functional programming and Global variable · See more »

GNU Compiler Collection

The GNU Compiler Collection (GCC) is a compiler system produced by the GNU Project supporting various programming languages.

New!!: Functional programming and GNU Compiler Collection · See more »

Graph reduction

In computer science, graph reduction implements an efficient version of non-strict evaluation, an evaluation strategy where the arguments to a function are not immediately evaluated.

New!!: Functional programming and Graph reduction · See more »

Halting problem

In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running (i.e., halt) or continue to run forever.

New!!: Functional programming and Halting problem · See more »

Hash table

In computing, a hash table (hash map) is a data structure that implements an associative array abstract data type, a structure that can map keys to values.

New!!: Functional programming and Hash table · See more »

Haskell (programming language)

Haskell is a standardized, general-purpose compiled purely functional programming language, with non-strict semantics and strong static typing.

New!!: Functional programming and Haskell (programming language) · See more »

Herbert A. Simon

Herbert Alexander Simon (June 15, 1916 – February 9, 2001) was an American economist and political scientist whose primary interest was decision-making within organizations and is best known for the theories of "bounded rationality" and "satisficing".

New!!: Functional programming and Herbert A. Simon · See more »

Higher-order function

In mathematics and computer science, a higher-order function (also functional, functional form or functor) is a function that does at least one of the following.

New!!: Functional programming and Higher-order function · See more »

Higher-Order Perl

Higher-Order Perl: Transforming Programs with Programs, is a book about the Perl programming language written by Mark Jason Dominus with the goal to teach Perl programmers with a strong C and Unix background how to use techniques with roots in functional programming languages like Lisp that are available in Perl as well.

New!!: Functional programming and Higher-Order Perl · See more »

Hindley–Milner type system

In type theory and functional programming, Hindley–Milner (HM), also known as Damas–Milner or Damas–Hindley–Milner, is a classical type system for the lambda calculus with parametric polymorphism, first described by J. Roger Hindley and later rediscovered by Robin Milner.

New!!: Functional programming and Hindley–Milner type system · See more »

History of the Scheme programming language

The history of the Scheme programming language begins with the development of earlier members of the Lisp family of languages during the second half of the twentieth century, the process of design and development during which language designers Guy L. Steele and Gerald Jay Sussman released an influential series of MIT AI Memos known as the Lambda Papers (1975–1980), the growth in popularity of the language, and the era of standardization (1990 onwards).

New!!: Functional programming and History of the Scheme programming language · See more »

Hoare logic

Hoare logic (also known as Floyd–Hoare logic or Hoare rules) is a formal system with a set of logical rules for reasoning rigorously about the correctness of computer programs.

New!!: Functional programming and Hoare logic · See more »

Hope (programming language)

Hope is a small functional programming language developed in the 1970s at the University of Edinburgh.

New!!: Functional programming and Hope (programming language) · See more »

Immutable object

In object-oriented and functional programming, an immutable object (unchangeable object) is an object whose state cannot be modified after it is created.

New!!: Functional programming and Immutable object · See more »

Imperative programming

In computer science, imperative programming is a programming paradigm that uses statements that change a program's state.

New!!: Functional programming and Imperative programming · See more »

Implementation of mathematics in set theory

This article examines the implementation of mathematical concepts in set theory.

New!!: Functional programming and Implementation of mathematics in set theory · See more »

Inductive programming

Inductive programming (IP) is a special area of automatic programming, covering research from artificial intelligence and programming, which addresses learning of typically declarative (logic or functional) and often recursive programs from incomplete specifications, such as input/output examples or constraints.

New!!: Functional programming and Inductive programming · See more »

Information Processing Language

Information Processing Language (IPL) is a programming language created by Allen Newell, Cliff Shaw, and Herbert A. Simon at RAND Corporation and the Carnegie Institute of Technology at about 1956.

New!!: Functional programming and Information Processing Language · See more »

Inline expansion

In computing, inline expansion, or inlining, is a manual or compiler optimization that replaces a function call site with the body of the called function.

New!!: Functional programming and Inline expansion · See more »

Intuitionistic type theory

Intuitionistic type theory (also known as constructive type theory, or Martin-Löf type theory) is a type theory and an alternative foundation of mathematics.

New!!: Functional programming and Intuitionistic type theory · See more »

Iteration

Iteration is the act of repeating a process, to generate a (possibly unbounded) sequence of outcomes, with the aim of approaching a desired goal, target or result.

New!!: Functional programming and Iteration · See more »

J (programming language)

The J programming language, developed in the early 1990s by Kenneth E. Iverson and Roger Hui, is a synthesis of APL (also by Iverson) and the FP and FL function-level languages created by John Backus.

New!!: Functional programming and J (programming language) · See more »

Java (programming language)

Java is a general-purpose computer-programming language that is concurrent, class-based, object-oriented, and specifically designed to have as few implementation dependencies as possible.

New!!: Functional programming and Java (programming language) · See more »

Java version history

The Java language has undergone several changes since JDK 1.0 as well as numerous additions of classes and packages to the standard library.

New!!: Functional programming and Java version history · See more »

JavaScript

JavaScript, often abbreviated as JS, is a high-level, interpreted programming language.

New!!: Functional programming and JavaScript · See more »

John Backus

John Warner Backus (December 3, 1924 – March 17, 2007) was an American computer scientist.

New!!: Functional programming and John Backus · See more »

John McCarthy (computer scientist)

John McCarthy (September 4, 1927 – October 24, 2011) was an American computer scientist and cognitive scientist.

New!!: Functional programming and John McCarthy (computer scientist) · See more »

Julia (programming language)

Julia is a high-level dynamic programming language designed to address the needs of high-performance numerical analysis and computational science, without the typical need of separate compilation to be fast, while also being effective for general-purpose programming, web use or as a specification language.

New!!: Functional programming and Julia (programming language) · See more »

K (programming language)

K is a proprietary array processing programming language developed by Arthur Whitney and commercialized by Kx Systems.

New!!: Functional programming and K (programming language) · See more »

Kenneth E. Iverson

Kenneth Eugene Iverson (17 December 1920 – 19 October 2004) was a Canadian computer scientist noted for the development of the programming language APL.

New!!: Functional programming and Kenneth E. Iverson · See more »

Kleene's recursion theorem

In computability theory, Kleene's recursion theorems are a pair of fundamental results about the application of computable functions to their own descriptions.

New!!: Functional programming and Kleene's recursion theorem · See more »

Kotlin (programming language)

Kotlin is a statically typed programming language that runs on the Java virtual machine and also can be compiled to JavaScript source code or use the LLVM compiler infrastructure.

New!!: Functional programming and Kotlin (programming language) · See more »

Lambda calculus

Lambda calculus (also written as λ-calculus) is a formal system in mathematical logic for expressing computation based on function abstraction and application using variable binding and substitution.

New!!: Functional programming and Lambda calculus · See more »

Lazy evaluation

In programming language theory, lazy evaluation, or call-by-need is an evaluation strategy which delays the evaluation of an expression until its value is needed (non-strict evaluation) and which also avoids repeated evaluations (sharing).

New!!: Functional programming and Lazy evaluation · See more »

Lex (software)

Lex is a computer program that generates lexical analyzers ("scanners" or "lexers").

New!!: Functional programming and Lex (software) · See more »

Lisp (programming language)

Lisp (historically, LISP) is a family of computer programming languages with a long history and a distinctive, fully parenthesized prefix notation.

New!!: Functional programming and Lisp (programming language) · See more »

List of functional programming topics

This is a list of functional programming topics.

New!!: Functional programming and List of functional programming topics · See more »

Local variable

In computer science, a local variable is a variable that is given local scope.

New!!: Functional programming and Local variable · See more »

Logarithm

In mathematics, the logarithm is the inverse function to exponentiation.

New!!: Functional programming and Logarithm · See more »

Logic programming

Logic programming is a type of programming paradigm which is largely based on formal logic.

New!!: Functional programming and Logic programming · See more »

Logic Theorist

Logic Theorist is a computer program written in 1955 and 1956 by Allen Newell, Herbert A. Simon and Cliff Shaw.

New!!: Functional programming and Logic Theorist · See more »

Lua (programming language)

Lua (from meaning moon) is a lightweight, multi-paradigm programming language designed primarily for embedded use in applications.

New!!: Functional programming and Lua (programming language) · See more »

Macintosh

The Macintosh (pronounced as; branded as Mac since 1998) is a family of personal computers designed, manufactured, and sold by Apple Inc. since January 1984.

New!!: Functional programming and Macintosh · See more »

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.

New!!: Functional programming and Map (higher-order function) · See more »

Massachusetts Institute of Technology

The Massachusetts Institute of Technology (MIT) is a private research university located in Cambridge, Massachusetts, United States.

New!!: Functional programming and Massachusetts Institute of Technology · See more »

Mathematical proof

In mathematics, a proof is an inferential argument for a mathematical statement.

New!!: Functional programming and Mathematical proof · See more »

Matrix (mathematics)

In mathematics, a matrix (plural: matrices) is a rectangular array of numbers, symbols, or expressions, arranged in rows and columns.

New!!: Functional programming and Matrix (mathematics) · See more »

Memoization

In computing, memoization or memoisation is an optimization technique used primarily to speed up computer programs by storing the results of expensive function calls and returning the cached result when the same inputs occur again.

New!!: Functional programming and Memoization · See more »

Memory leak

In computer science, a memory leak is a type of resource leak that occurs when a computer program incorrectly manages memory allocations in such a way that memory which is no longer needed is not released.

New!!: Functional programming and Memory leak · See more »

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.

New!!: Functional programming and Miranda (programming language) · See more »

ML (programming language)

ML (Meta Language) is a general-purpose functional programming language.

New!!: Functional programming and ML (programming language) · See more »

Monad (functional programming)

In functional programming, a monad is a design pattern that defines how functions, actions, inputs, and outputs can be used together to build generic types, with the following organization.

New!!: Functional programming and Monad (functional programming) · See more »

Morgan Kaufmann Publishers

Morgan Kaufmann Publishers is a Burlington, Massachusetts (San Francisco, California until 2008) based publisher specializing in computer science and engineering content.

New!!: Functional programming and Morgan Kaufmann Publishers · See more »

Natural number

In mathematics, the natural numbers are those used for counting (as in "there are six coins on the table") and ordering (as in "this is the third largest city in the country").

New!!: Functional programming and Natural number · See more »

Nested function

In computer programming, a nested function (or nested procedure or subroutine) is a function which is defined within another function, the enclosing function.

New!!: Functional programming and Nested function · See more »

Normalization property (abstract rewriting)

In mathematical logic and theoretical computer science, a rewrite system has the (strong) normalization property or is terminating if every term is strongly normalizing; that is, if every sequence of rewrites eventually terminates with an irreducible term, also called a normal form.

New!!: Functional programming and Normalization property (abstract rewriting) · See more »

Nortel

Nortel Networks Corporation, formerly known as Northern Telecom Limited, Northern Electric and sometimes known simply as Nortel, was a multinational telecommunications and data networking equipment manufacturer headquartered in Mississauga, Ontario, Canada.

New!!: Functional programming and Nortel · See more »

NPL (programming language)

NPL is a functional programming language with pattern matching designed by Rod Burstall and John Darlington in 1977.

New!!: Functional programming and NPL (programming language) · See more »

Object-oriented programming

Object-oriented programming (OOP) is a programming paradigm based on the concept of "objects", which may contain data, in the form of fields, often known as attributes; and code, in the form of procedures, often known as methods. A feature of objects is that an object's procedures can access and often modify the data fields of the object with which they are associated (objects have a notion of "this" or "self").

New!!: Functional programming and Object-oriented programming · See more »

OCaml

OCaml, originally named Objective Caml, is the main implementation of the programming language Caml, created by Xavier Leroy, Jérôme Vouillon, Damien Doligez, Didier Rémy, Ascánder Suárez and others in 1996.

New!!: Functional programming and OCaml · See more »

Opal (programming language)

OPAL (OPtimized Applicative Language) is a functional programming language first developed at the Technical University of Berlin.

New!!: Functional programming and Opal (programming language) · See more »

Open standard

An open standard is a standard that is publicly available and has various rights to use associated with it, and may also have various properties of how it was designed (e.g. open process).

New!!: Functional programming and Open standard · See more »

Operational semantics

Operational semantics is a category of formal programming language semantics in which certain desired properties of a program, such as correctness, safety or security, are verified by constructing proofs from logical statements about its execution and procedures, rather than by attaching mathematical meanings to its terms (denotational semantics).

New!!: Functional programming and Operational semantics · See more »

Parallel computing

Parallel computing is a type of computation in which many calculations or the execution of processes are carried out concurrently.

New!!: Functional programming and Parallel computing · See more »

Parameter (computer programming)

In computer programming, a parameter (often called formal parameter or formal argument) is a special kind of variable, used in a subroutine to refer to one of the pieces of data provided as input to the subroutine.

New!!: Functional programming and Parameter (computer programming) · See more »

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.

New!!: Functional programming and Partial application · See more »

Pascal (programming language)

Pascal is an imperative and procedural programming language, which Niklaus Wirth designed in 1968–69 and published in 1970, as a small, efficient language intended to encourage good programming practices using structured programming and data structuring. It is named in honor of the French mathematician, philosopher and physicist Blaise Pascal. Pascal was developed on the pattern of the ALGOL 60 language. Wirth had already developed several improvements to this language as part of the ALGOL X proposals, but these were not accepted and Pascal was developed separately and released in 1970. A derivative known as Object Pascal designed for object-oriented programming was developed in 1985; this was used by Apple Computer and Borland in the late 1980s and later developed into Delphi on the Microsoft Windows platform. Extensions to the Pascal concepts led to the Pascal-like languages Modula-2 and Oberon.

New!!: Functional programming and Pascal (programming language) · See more »

Per Martin-Löf

Per Erik Rutger Martin-Löf (born May 8, 1942) is a Swedish logician, philosopher, and mathematical statistician.

New!!: Functional programming and Per Martin-Löf · See more »

Perl

Perl is a family of two high-level, general-purpose, interpreted, dynamic programming languages, Perl 5 and Perl 6.

New!!: Functional programming and Perl · See more »

Perl 6

Perl 6 is a member of the Perl family of programming languages.

New!!: Functional programming and Perl 6 · See more »

PHP

PHP: Hypertext Preprocessor (or simply PHP) is a server-side scripting language designed for Web development, but also used as a general-purpose programming language.

New!!: Functional programming and PHP · See more »

Prentice Hall

Prentice Hall is a major educational publisher owned by Pearson plc.

New!!: Functional programming and Prentice Hall · See more »

Principia Mathematica

The Principia Mathematica (often abbreviated PM) is a three-volume work on the foundations of mathematics written by Alfred North Whitehead and Bertrand Russell and published in 1910, 1912, and 1913.

New!!: Functional programming and Principia Mathematica · See more »

Principle of compositionality

In mathematics, semantics, and philosophy of language, the principle of compositionality is the principle that the meaning of a complex expression is determined by the meanings of its constituent expressions and the rules used to combine them.

New!!: Functional programming and Principle of compositionality · See more »

Programming language

A programming language is a formal language that specifies a set of instructions that can be used to produce various kinds of output.

New!!: Functional programming and Programming language · See more »

Programming paradigm

Programming paradigms are a way to classify programming languages based on their features.

New!!: Functional programming and Programming paradigm · See more »

Proof assistant

In computer science and mathematical logic, a proof assistant or interactive theorem prover is a software tool to assist with the development of formal proofs by human-machine collaboration.

New!!: Functional programming and Proof assistant · See more »

Pure function

In computer programming, a function or expression is considered pure if its evaluation has no side effect, such as mutation of objects or output to I/O devices.

New!!: Functional programming and Pure function · See more »

Purely functional programming

In computer science, purely functional programming usually designates a programming paradigm—a style of building the structure and elements of computer programs—that treats all computation as the evaluation of mathematical functions.

New!!: Functional programming and Purely functional programming · See more »

Python (programming language)

Python is an interpreted high-level programming language for general-purpose programming.

New!!: Functional programming and Python (programming language) · See more »

Q (programming language from Kx Systems)

Q is a programming language for array processing, developed by Arthur Whitney.

New!!: Functional programming and Q (programming language from Kx Systems) · See more »

R (programming language)

R is a programming language and free software environment for statistical computing and graphics that is supported by the R Foundation for Statistical Computing.

New!!: Functional programming and R (programming language) · See more »

Racket (programming language)

Racket (formerly PLT Scheme) is a general-purpose, multi-paradigm programming language in the Lisp-Scheme family.

New!!: Functional programming and Racket (programming language) · See more »

Raymond F. Boyce

Raymond F. Boyce (1947–1974) was an American computer scientist who was known for his research in relational databases.

New!!: Functional programming and Raymond F. Boyce · See more »

Recursion

Recursion occurs when a thing is defined in terms of itself or of its type.

New!!: Functional programming and Recursion · See more »

Recursion (computer science)

Recursion in computer science is a method of solving a problem where the solution depends on solutions to smaller instances of the same problem (as opposed to iteration).

New!!: Functional programming and Recursion (computer science) · See more »

Referential transparency

Referential transparency and referential opacity are properties of parts of computer programs.

New!!: Functional programming and Referential transparency · See more »

Return statement

In computer programming, a return statement causes execution to leave the current subroutine and resume at the point in the code immediately after where the subroutine was called, known as its return address.

New!!: Functional programming and Return statement · See more »

Robin Milner

Arthur John Robin Gorell Milner (13 January 1934 – 20 March 2010), known as Robin Milner or A. J. R. G. Milner, was a British computer scientist, and a Turing Award winner.

New!!: Functional programming and Robin Milner · See more »

Robot

A robot is a machine—especially one programmable by a computer— capable of carrying out a complex series of actions automatically.

New!!: Functional programming and Robot · See more »

Roger Hui

Roger Hui (born 1953) is a computer scientist and codeveloper of the programming language J. In 1953, he was born in Hong Kong.

New!!: Functional programming and Roger Hui · See more »

SASL (programming language)

SASL (from St Andrews Static Language, alternatively St Andrews Standard Language) is a purely functional programming language developed by David Turner at the University of St Andrews in 1972, based on the applicative subset of ISWIM.

New!!: Functional programming and SASL (programming language) · See more »

Scala (programming language)

Scala is a general-purpose programming language providing support for functional programming and a strong static type system.

New!!: Functional programming and Scala (programming language) · See more »

Scheme (programming language)

Scheme is a programming language that supports multiple paradigms, including functional programming and imperative programming, and is one of the two main dialects of Lisp.

New!!: Functional programming and Scheme (programming language) · See more »

Scope (computer science)

In computer programming, the scope of a name binding – an association of a name to an entity, such as a variable – is the region of a computer program where the binding is valid: where the name can be used to refer to the entity.

New!!: Functional programming and Scope (computer science) · See more »

Separation of concerns

In computer science, separation of concerns (SoC) is a design principle for separating a computer program into distinct sections, such that each section addresses a separate concern.

New!!: Functional programming and Separation of concerns · See more »

SequenceL

SequenceL is a general purpose functional programming language and auto-parallelizing (Parallel computing) compiler and tool set, whose primary design objectives are performance on multi-core processor hardware, ease of programming, platform portability/optimization, and code clarity and readability.

New!!: Functional programming and SequenceL · See more »

Side effect (computer science)

In computer science, a function or expression is said to have a side effect if it modifies some state outside its scope or has an observable interaction with its calling functions or the outside world besides returning a value.

New!!: Functional programming and Side effect (computer science) · See more »

Software design pattern

In software engineering, a software design pattern is a general, reusable solution to a commonly occurring problem within a given context in software design.

New!!: Functional programming and Software design pattern · See more »

Source code

In computing, source code is any collection of code, possibly with comments, written using a human-readable programming language, usually as plain text.

New!!: Functional programming and Source code · See more »

SQL

SQL (S-Q-L, "sequel"; Structured Query Language) is a domain-specific language used in programming and designed for managing data held in a relational database management system (RDBMS), or for stream processing in a relational data stream management system (RDSMS).

New!!: Functional programming and SQL · See more »

Standard ML

Standard ML (SML; "Standard Meta Language") is a general-purpose, modular, functional programming language with compile-time type checking and type inference.

New!!: Functional programming and Standard ML · See more »

State (computer science)

In information technology and computer science, a program is described as stateful if it is designed to remember preceding events or user interactions; the remembered information is called the state of the system.

New!!: Functional programming and State (computer science) · See more »

Statement (computer science)

In computer programming, a statement is a syntactic unit of an imperative programming language that expresses some action to be carried out.

New!!: Functional programming and Statement (computer science) · See more »

Strategy pattern

In computer programming, the strategy pattern (also known as the policy pattern) is a behavioral software design pattern that enables selecting an algorithm at runtime.

New!!: Functional programming and Strategy pattern · See more »

Structure and Interpretation of Classical Mechanics

Structure and Interpretation of Classical Mechanics (SICM) is a classical mechanics textbook written by Gerald Jay Sussman and Jack Wisdom with Meinhard E. Mayer.

New!!: Functional programming and Structure and Interpretation of Classical Mechanics · See more »

Structure and Interpretation of Computer Programs

Structure and Interpretation of Computer Programs (SICP) is a textbook aiming to teach the principles of computer programming, such as abstraction in programming, metalinguistic abstraction, recursion, interpreters, and modular programming.

New!!: Functional programming and Structure and Interpretation of Computer Programs · See more »

Subroutine

In computer programming, a subroutine is a sequence of program instructions that performs a specific task, packaged as a unit.

New!!: Functional programming and Subroutine · See more »

Successor function

In mathematics, the successor function or successor operation is a primitive recursive function S such that S(n).

New!!: Functional programming and Successor function · See more »

Sweden

Sweden (Sverige), officially the Kingdom of Sweden (Swedish), is a Scandinavian country in Northern Europe.

New!!: Functional programming and Sweden · See more »

Syntax (programming languages)

In computer science, the syntax of a computer language is the set of rules that defines the combinations of symbols that are considered to be a correctly structured document or fragment in that language.

New!!: Functional programming and Syntax (programming languages) · See more »

Tail call

In computer science, a tail call is a subroutine call performed as the final action of a procedure.

New!!: Functional programming and Tail call · See more »

Tcl

Tcl (pronounced "tickle" or tee cee ell) is a high-level, general-purpose, interpreted, dynamic programming language.

New!!: Functional programming and Tcl · See more »

Telescope

A telescope is an optical instrument that aids in the observation of remote objects by collecting electromagnetic radiation (such as visible light).

New!!: Functional programming and Telescope · See more »

Test-driven development

Test-driven development (TDD) is a software development process that relies on the repetition of a very short development cycle: requirements are turned into very specific test cases, then the software is improved to pass the new tests, only.

New!!: Functional programming and Test-driven development · See more »

The Computer Language Benchmarks Game

The Computer Language Benchmarks Game (formerly called The Great Computer Language Shootout) is a free software project for comparing how a given subset of simple algorithms can be implemented in various popular programming languages.

New!!: Functional programming and The Computer Language Benchmarks Game · See more »

Thread safety

Thread safety is a computer programming concept applicable to multi-threaded code.

New!!: Functional programming and Thread safety · See more »

Total functional programming

Total functional programming (also known as strong functional programming, to be contrasted with ordinary, or weak functional programming) is a programming paradigm that restricts the range of programs to those that are provably terminating.

New!!: Functional programming and Total functional programming · See more »

Turing Award

The ACM A.M. Turing Award is an annual prize given by the Association for Computing Machinery (ACM) to an individual selected for contributions "of lasting and major technical importance to the computer field".

New!!: Functional programming and Turing Award · See more »

Turing completeness

In computability theory, a system of data-manipulation rules (such as a computer's instruction set, a programming language, or a cellular automaton) is said to be Turing complete or computationally universal if it can be used to simulate any Turing machine.

New!!: Functional programming and Turing completeness · See more »

Type inference

Type inference refers to the automatic detection of the data type of an expression in a programming language.

New!!: Functional programming and Type inference · See more »

Type system

In programming languages, a type system is a set of rules that assigns a property called type to the various constructs of a computer program, such as variables, expressions, functions or modules.

New!!: Functional programming and Type system · See more »

Typed lambda calculus

A typed lambda calculus is a typed formalism that uses the lambda-symbol (\lambda) to denote anonymous function abstraction.

New!!: Functional programming and Typed lambda calculus · See more »

Undecidable problem

In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is known to be impossible to construct a single algorithm that always leads to a correct yes-or-no answer.

New!!: Functional programming and Undecidable problem · See more »

Uniqueness type

In computing, a unique type guarantees that an object is used in a single-threaded way, with at most a single reference to it.

New!!: Functional programming and Uniqueness type · See more »

Universal algebra

Universal algebra (sometimes called general algebra) is the field of mathematics that studies algebraic structures themselves, not examples ("models") of algebraic structures.

New!!: Functional programming and Universal algebra · See more »

University of Edinburgh

The University of Edinburgh (abbreviated as Edin. in post-nominals), founded in 1582, is the sixth oldest university in the English-speaking world and one of Scotland's ancient universities.

New!!: Functional programming and University of Edinburgh · See more »

University of Kent

The University of Kent (formerly the University of Kent at Canterbury), abbreviated as UKC, is a semi-collegiate public research university based in Kent, United Kingdom.

New!!: Functional programming and University of Kent · See more »

University of St Andrews

The University of St Andrews (informally known as St Andrews University or simply St Andrews; abbreviated as St And, from the Latin Sancti Andreae, in post-nominals) is a British public research university in St Andrews, Fife, Scotland.

New!!: Functional programming and University of St Andrews · See more »

Visitor pattern

In object-oriented programming and software engineering, the visitor design pattern is a way of separating an algorithm from an object structure on which it operates.

New!!: Functional programming and Visitor pattern · See more »

Visual Basic

Visual Basic is a third-generation event-driven programming language and integrated development environment (IDE) from Microsoft for its Component Object Model (COM) programming model first released in 1991 and declared legacy during 2008.

New!!: Functional programming and Visual Basic · See more »

Von Neumann architecture

The von Neumann architecture, which is also known as the von Neumann model and Princeton architecture, is a computer architecture based on the 1945 description by the mathematician and physicist John von Neumann and others in the First Draft of a Report on the EDVAC.

New!!: Functional programming and Von Neumann architecture · See more »

Well-founded relation

In mathematics, a binary relation, R, is called well-founded (or wellfounded) on a class X if every non-empty subset S ⊆ X has a minimal element with respect to R, that is an element m not related by sRm (for instance, "s is not smaller than m") for any s ∈ S. In other words, a relation is well founded if Some authors include an extra condition that R is set-like, i.e., that the elements less than any given element form a set.

New!!: Functional programming and Well-founded relation · See more »

WhatsApp Messenger is a freeware and cross-platform messaging and Voice over IP (VoIP) service owned by Facebook.

New!!: Functional programming and WhatsApp · See more »

Wolfram Language

The Wolfram Language is a general multi-paradigm programming language developed by Wolfram Research and is the programming language of the mathematical symbolic computation program Mathematica and the Wolfram Programming Cloud.

New!!: Functional programming and Wolfram Language · See more »

Wolfram Mathematica

Wolfram Mathematica (usually termed Mathematica) is a modern technical computing system spanning most areas of technical computing — including neural networks, machine learning, image processing, geometry, data science, visualizations, and others.

New!!: Functional programming and Wolfram Mathematica · See more »

XML

In computing, Extensible Markup Language (XML) is a markup language that defines a set of rules for encoding documents in a format that is both human-readable and machine-readable.

New!!: Functional programming and XML · See more »

XQuery

XQuery (XML Query) is a query and functional programming language that queries and transforms collections of structured and unstructured data, usually in the form of XML, text and with vendor-specific extensions for other data formats (JSON, binary, etc.). The language is developed by the XML Query working group of the W3C.

New!!: Functional programming and XQuery · See more »

XSLT

XSLT (Extensible Stylesheet Language Transformations) is a language for transforming XML documents into other XML documents, or other formats such as HTML for web pages, plain text or XSL Formatting Objects, which may subsequently be converted to other formats, such as PDF, PostScript and PNG.

New!!: Functional programming and XSLT · See more »

Yacc

Yacc (Yet Another Compiler-Compiler) is a computer program for the Unix operating system developed by Stephen C. Johnson.

New!!: Functional programming and Yacc · See more »

Redirects here:

Comparison of imperative programming and functional programming, Enigmatic programming, Functional (programming), Functional Language, Functional Programming, Functional computing language, Functional language, Functional languages, Functional paradigm, Functional program, Functional programming language, Functional programming languages, Functionalprogramming, Pure functional programming.

References

[1] https://en.wikipedia.org/wiki/Functional_programming

Unionpedia is a concept map or semantic network organized like an encyclopedia – dictionary. It gives a brief definition of each concept and its relationships.

This is a giant online mental map that serves as a basis for concept diagrams. It's free to use and each article or document can be downloaded. It's a tool, resource or reference for study, research, education, learning or teaching, that can be used by teachers, educators, pupils or students; for the academic world: for school, primary, secondary, high school, middle, technical degree, college, university, undergraduate, master's or doctoral degrees; for papers, reports, projects, ideas, documentation, surveys, summaries, or thesis. Here is the definition, explanation, description, or the meaning of each significant on which you need information, and a list of their associated concepts as a glossary. Available in English, Spanish, Portuguese, Japanese, Chinese, French, German, Italian, Polish, Dutch, Russian, Arabic, Hindi, Swedish, Ukrainian, Hungarian, Catalan, Czech, Hebrew, Danish, Finnish, Indonesian, Norwegian, Romanian, Turkish, Vietnamese, Korean, Thai, Greek, Bulgarian, Croatian, Slovak, Lithuanian, Filipino, Latvian, Estonian and Slovenian. More languages soon.

All the information was extracted from Wikipedia, and it's available under the Creative Commons Attribution-ShareAlike License.

Unionpedia is not endorsed by or affiliated with the Wikimedia Foundation.

Google Play, Android and the Google Play logo are trademarks of Google Inc.