Faster access than browser!
17 relations: Association for Computing Machinery, Associative property, Combinatory logic, Computer science, Data structure, David Turner (computer scientist), Directed acyclic graph, Directed graph, Eager evaluation, Evaluation strategy, Functional programming, Graph reduction machine, Lazy evaluation, SASL (programming language), SECD machine, Simon Peyton Jones, Tree (data structure).
Association for Computing Machinery
The Association for Computing Machinery (ACM) is an international learned society for computing.
New!!: Graph reduction and Association for Computing Machinery · See more »
Associative property
In mathematics, the associative property is a property of some binary operations.
New!!: Graph reduction and Associative property · See more »
Combinatory logic
Combinatory logic is a notation to eliminate the need for quantified variables in mathematical logic.
New!!: Graph reduction and Combinatory logic · 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!!: Graph reduction and Computer science · See more »
Data structure
In computer science, a data structure is a data organization and storage format that enables efficient access and modification.
New!!: Graph reduction and Data structure · See more »
David Turner (computer scientist)
David A. Turner (born 1946) is a British computer scientist.
New!!: Graph reduction and David Turner (computer scientist) · See more »
Directed acyclic graph
In mathematics and computer science, a directed acyclic graph (DAG), is a finite directed graph with no directed cycles.
New!!: Graph reduction and Directed acyclic graph · See more »
Directed graph
In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is a set of vertices connected by edges, where the edges have a direction associated with them.
New!!: Graph reduction and Directed graph · 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!!: Graph reduction and Eager evaluation · See more »
Evaluation strategy
Evaluation strategies are used by programming languages to determine when to evaluate the argument(s) of a function call (for function, also read: operation, method, or relation) and what kind of value to pass to the function.
New!!: Graph reduction and Evaluation strategy · 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.
New!!: Graph reduction and Functional programming · See more »
Graph reduction machine
A graph reduction machine is a special-purpose computer built to perform combinator calculations by graph reduction.
New!!: Graph reduction and Graph reduction machine · 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!!: Graph reduction and Lazy evaluation · 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!!: Graph reduction and SASL (programming language) · See more »
SECD machine
The SECD machine is a highly influential (See: #Landin's contribution) virtual machine and abstract machine intended as a target for functional programming language compilers.
New!!: Graph reduction and SECD machine · See more »
Simon Peyton Jones
Simon Peyton Jones (born 18 January 1958) is a British computer scientist who researches the implementation and applications of functional programming languages, particularly lazy functional programming.
New!!: Graph reduction and Simon Peyton Jones · See more »
Tree (data structure)
In computer science, a tree is a widely used abstract data type (ADT)—or data structure implementing this ADT—that simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node, represented as a set of linked nodes.
New!!: Graph reduction and Tree (data structure) · See more »
