Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,976,809 papers from all fields of science
Search
Sign In
Create Free Account
Reduction strategy (code optimization)
Known as:
Redex
, Reducible expression
, Reduction strategy
In code optimization during the translation of computer programs into an executable form, and in mathematical reduction generally, a reduction…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Immediately-invoked function expression
Lambda calculus
Reduction strategy (lambda calculus)
Thunk
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Off-the-Grid Compressive Time Delay Estimation via Manifold-Based Optimization
Wei Zhang
,
Feng Yu
IEEE Communications Letters
2017
Corpus ID: 6897819
The time delay estimation (TDE) of some known waveforms from sampled data is of great interest in the area of signal processing…
Expand
2014
2014
Abstract machines for higher-order term sharing
Connor Smith
2014
Corpus ID: 8798999
machines for higher-order term sharing
2012
2012
Deep into Optimality Complexity and correctness of sharing implementation of bounded logics ( Extended abstract )
S. Guerrini
,
Thomas Leventis
,
M. Solieri
2012
Corpus ID: 140075412
Sharing graphs are a tool for the implementation of graph rewriting systems whose rules may require the duplication, the…
Expand
2005
2005
The HasCasl Prologue : Categorical Syntax and Semantics of the Partial λ-Calculus
Lutz Schröder
2005
Corpus ID: 15672881
We develop the semantic foundations of the specification language HasCasl, which combines algebraic specification and functional…
Expand
1999
1999
A general method to prove the normalization theorem for first and second order typed λ-calculi
1999
Corpus ID: 260604515
1998
1998
Axiomatic Rewriting Theory Iv a Stability Theorem in Rewriting Theory
Paul-Andr
,
Melli Es Lfcs
1998
Corpus ID: 14823818
One key property of the-calculus is that there exists a minimal computation (the head-reduction) M e ?! V from a-term M to the…
Expand
1997
1997
A New Parallel Closed Condition for Church-Rosser of Left-Linear Term Rewriting Systems
Yoshikatsu Ohta
1997
Corpus ID: 268080173
G.Huet (1980) showed that a left-linear term-rewriting system (TRS) is Church-Rosser (CR) if P ! j Q for every critical pair < P…
Expand
1996
1996
A Taxonomy of Functional Language Implementations Part II : Call-by-Name, Call-by-Need and Graph Reduction
Rémi Douence
,
Pascal Fradet
1996
Corpus ID: 14769380
In Part I [5], we proposed an approach to formally describe and compare functional languages implementations. We focused on call…
Expand
1993
1993
On the equivalence of persistent term rewriting systems and recursive program schemes
Z. Khasidashvili
[] The 2nd Israel Symposium on Theory and…
1993
Corpus ID: 2298320
The author introduces persistent term rewriting systems (PTRSs) by restricting redex-creation during reductions in orthogonal…
Expand
1977
1977
The equivalence of complete reductions
R. Hindley
1977
Corpus ID: 123419947
This paper is about two properties of the X/3-calculus and combinatory reduction, namely (E): all complete reductions p and a of…
Expand