Lambda calculus and Pure (programming language)

Shortcuts: Differences, Similarities, Jaccard Similarity Coefficient, References.

Difference between Lambda calculus and Pure (programming language)

Lambda calculus vs. Pure (programming language)

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. Pure, successor to the equational language Q, is a dynamically typed, functional programming language based on term rewriting.

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 Lambda calculus · C (programming language) and Pure (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.

Eager evaluation and Lambda calculus · Eager evaluation and Pure (programming language) · See more »

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.

Functional programming and Lambda calculus · Functional programming and Pure (programming language) · See more »

Haskell (programming language)

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

Haskell (programming language) and Lambda calculus · Haskell (programming language) and Pure (programming language) · 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).

Lambda calculus and Lazy evaluation · Lazy evaluation and Pure (programming language) · See more »

Library (computing)

In computer science, a library is a collection of non-volatile resources used by computer programs, often for software development.

Lambda calculus and Library (computing) · Library (computing) and Pure (programming language) · 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.

Lambda calculus and Lisp (programming language) · Lisp (programming language) and Pure (programming language) · 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.

Lambda calculus and Miranda (programming language) · Miranda (programming language) and Pure (programming language) · 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.

Lambda calculus and Programming language · Programming language and Pure (programming language) · See more »

Rewriting

In mathematics, computer science, and logic, rewriting covers a wide range of (potentially non-deterministic) methods of replacing subterms of a formula with other terms.

Lambda calculus and Rewriting · Pure (programming language) and Rewriting · 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.

Lambda calculus and Scope (computer science) · Pure (programming language) and Scope (computer science) · See more »

Thunk

In computer programming, a thunk is a subroutine used to inject an additional calculation into another subroutine.

Lambda calculus and Thunk · Pure (programming language) and Thunk · See more »