Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 232,788,159 papers from all fields of science
Search
Sign In
Create Free Account
Graph reduction
Known as:
Combinator graph reduction
, Reduction
In computer science, graph reduction implements an efficient version of non-strict evaluation, an evaluation strategy where the arguments to a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
Clean
Computer science
Data structure
David Turner (computer scientist)
Expand
Broader (1)
Graph rewriting
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
Inferring disease causing genes and their pathways: A mathematical perspective
Jeethu V. Devasia
,
P. Chandran
arXiv.org
2016
Corpus ID: 1982175
A system level view of cellular processes for human and several organisms can be cap- tured by analyzing molecular interaction…
Expand
2012
2012
A Depth-First Search Algorithm for Optimal Triangulation of Bayesian Network
C. Li
,
M. Ueno
2012
Corpus ID: 16816601
Finding the triangulation of a Bayesian network with minimum total table size reduces the computational cost for probabilistic…
Expand
2007
2007
Trunk Packing Revisited
Ernst Althaus
,
Tobias Baumann
,
E. Schömer
,
Kai Werth
Workshop on Engineering Applications
2007
Corpus ID: 7487412
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with…
Expand
1999
1999
Experiments with the Auction Algorithm for the Shortest Path Problem
J. Larsen
,
Ib Pedersen
Nordic Journal of Computing
1999
Corpus ID: 15039344
The auction approach for the shortest path problem (SPP) as introduced by Bertsekas is tested experimentally. Parallel algorithms…
Expand
1994
1994
Partitioning non-strict languages for multi-threaded code generation
S. Coorg
1994
Corpus ID: 28887901
In a non-strict language, functions may return values before their arguments are available, and data structures may be defined…
Expand
1994
1994
A fully abstract semantics for concurrent graph reduction
A. Jeffrey
Proceedings Ninth Annual IEEE Symposium on Logic…
1994
Corpus ID: 46481987
This paper presents a fully abstract semantics for a variant of the untyped /spl lambda/-calculus with recursive [Bdeclarations…
Expand
1993
1993
Local Speculative Evaluation for Distributed Graph Reduction
J. S. Mattson
,
W. Griswold
Functional Programming
1993
Corpus ID: 13995033
In a parallel graph reduction system, speculative evaluation can increase parallelism by performing potentially useful…
Expand
1990
1990
Real-time functional programming systems
S. Winter
,
Derek R. Wilson
,
D. F. Neale
Microprocessing and Microprogramming
1990
Corpus ID: 62165593
1988
1988
Statistics on graph reduction of SASL programs
P. Hartel
,
A. Veen
Software, Practice & Experience
1988
Corpus ID: 16369049
The execution has been studied of four small and four medium‐sized SASL programs, when interpreted by a variant of Turner's…
Expand
1986
1986
Implementing logical variables on a graph reduction architecture
G. Lindstrom
Graph Reduction
1986
Corpus ID: 39415308
Logical variables offer a semantic meeting ground between functional and logic programming languages. That is, if functional…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE