Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Related topics

Related topics

4 relations
Immediately-invoked function expressionLambda calculusReduction strategy (lambda calculus)Thunk

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Linearized Stochastic Scheduling of Interconnected Energy Hubs Considering Integrated Demand Response and Wind Uncertainty
In the context of the Energy Internet, customers are supplied by energy hubs (EH), while the EHs are interconnected through an… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2012
2012
Constraint-aware Schema Transformation
Data schema transformations occur in the context of software evolution, refactoring, and cross-paradigm data mappings. When… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2012
2012
Deep into Optimality Complexity and correctness of sharing implementation of bounded logics ( Extended abstract )
Sharing graphs are a tool for the implementation of graph rewriting systems whose rules may require the duplication, the… Expand
Is this relevant?
2009
2009
Infinitary Combinatory Reduction Systems: Confluence
We study confluence in the setting of higher-order infinitary rewriting, in particular for infinitary Combinatory Reduction… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems
A reachability problem is a problem used to decide whether s is reachable to tby Ror not for a given two terms s, tand a term… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2007
Highly Cited
2007
A call-by-name lambda-calculus machine
  • J. Krivine
  • High. Order Symb. Comput.
  • 2007
    • Corpus ID: 18158499
Abstract We present a particularly simple lazy lambda-calculus machine, which was introduced twenty-five years ago. It has been… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Normalisation in lambda calculus and its relation to type inference
rewriting system, 16 irreflexive, 33 weakly irreflexive, 33 with typing, 37, 40 with very weak typing, 40 with weak typing, 40… Expand
  • table 10.1
  • table 12.1
  • table 13.1
  • table 13.2
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Basic Paramodulation
We introduce a class of restrictions for the ordered paramodulation and superposition calculi (inspired by the basic strategy for… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Graph Pattern Matching in PROGRES
The work reported here is part of the PROGRES (PROgrammed Graph Rewriting Systems) project. PROGRES is a very high level multi… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Residual Theory in lambda-Calculus: A Formal Development
  • G. Huet
  • J. Funct. Program.
  • 1994
    • Corpus ID: 6259731
We present the complete development, in Gallina, of the residual theory of b-reduction in pure l-calculus. The main result is the… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE