Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

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… 
Highly Cited
2012
Highly Cited
2012
Shape optimization for viscous flows by reduced basis methods and free‐form deformation
In this paper, we further develop an approach previously introduced in Lassila and Rozza, 2010, for shape optimization that… 
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… 
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… 
Review
2004
Review
2004
Some Lambda Calculus and Type Theory Formalized
We survey a substantial body of knowledge about lambda calculus and Pure Type Systems, formally developed in a constructive type… 
Highly Cited
2002
Highly Cited
2002
Context-Sensitive Rewriting Strategies
Contex-sensitive rewriting is a simple rewriting restriction which is formalized by imposing fixed restrictions on replacements… 
Highly Cited
1996
Highly Cited
1996
The Barendregt Cube with Definitions and Generalised Reduction
In this paper, we propose to extend the Barendregt Cube by generalisings-reduction and by adding definition mechanisms… 
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… 
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… 
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… 
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)