Similarities between Functional programming and Pure (programming language)
Functional programming and Pure (programming language) have 13 things in common (in Unionpedia): C (programming language), David Turner (computer scientist), Declarative programming, Eager evaluation, Fibonacci number, Haskell (programming language), Lazy evaluation, Lisp (programming language), Memoization, Miranda (programming language), Programming language, Scope (computer science), Tail call.
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.
C (programming language) and Functional programming · C (programming language) and Pure (programming language) ·
David Turner (computer scientist)
David A. Turner (born 1946) is a British computer scientist.
David Turner (computer scientist) and Functional programming · David Turner (computer scientist) and Pure (programming language) ·
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.
Declarative programming and Functional programming · Declarative programming and Pure (programming language) ·
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.
Eager evaluation and Functional programming · Eager evaluation and Pure (programming language) ·
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.
Fibonacci number and Functional programming · Fibonacci number and Pure (programming language) ·
Haskell (programming language)
Haskell is a standardized, general-purpose compiled purely functional programming language, with non-strict semantics and strong static typing.
Functional programming and Haskell (programming language) · Haskell (programming language) and Pure (programming language) ·
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).
Functional programming and Lazy evaluation · Lazy evaluation and Pure (programming language) ·
Lisp (programming language)
Lisp (historically, LISP) is a family of computer programming languages with a long history and a distinctive, fully parenthesized prefix notation.
Functional programming and Lisp (programming language) · Lisp (programming language) and Pure (programming language) ·
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.
Functional programming and Memoization · Memoization and Pure (programming language) ·
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.
Functional programming and Miranda (programming language) · Miranda (programming language) and Pure (programming language) ·
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.
Functional programming and Programming language · Programming language and Pure (programming language) ·
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.
Functional programming and Scope (computer science) · Pure (programming language) and Scope (computer science) ·
Tail call
In computer science, a tail call is a subroutine call performed as the final action of a procedure.
Functional programming and Tail call · Pure (programming language) and Tail call ·
The list above answers the following questions
- What Functional programming and Pure (programming language) have in common
- What are the similarities between Functional programming and Pure (programming language)
Functional programming and Pure (programming language) Comparison
Functional programming has 229 relations, while Pure (programming language) has 60. As they have in common 13, the Jaccard index is 4.50% = 13 / (229 + 60).
References
This article shows the relationship between Functional programming and Pure (programming language). To access each article from which the information was extracted, please visit: