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… (More)
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.
Highly Cited
2007
Highly Cited
2007
iTasks: executable specifications of interactive work flow systems for the web
In this paper we introduce the iTask system: a set of combinators to specify work flows in a pure functional language at a very… (More)
  • figure 2
  • figure 1
  • figure 3
Is this relevant?
2007
2007
Matching of Bigraphs
We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of… (More)
  • table 1
  • figure 4
  • figure 5
  • figure 6
  • figure 4
Is this relevant?
2006
2006
An Invariant Cost Model for the Lambda Calculus
We de ne a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed… (More)
  • table 1
  • table 2
Is this relevant?
2006
2006
BASS: boxed ambients with safe sessions
We define BASS, a typed boxed ambients calculus with safe sessions. Sessions offer the possibility of using the same channel to… (More)
  • table 3
  • table 1
  • table 2
  • table 8
  • table 9
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Pure bigraphs: Structure and dynamics
Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
Axiomatic Rewriting Theory I: A Diagrammatic Standardization Theorem
Machine translation // λσ-calculus interpretation // λ-calculus Formally, the λσ-calculus contains two classes of objects: terms… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Refocusing in Reduction Semantics
The evaluation function of a reduction semantics (i.e., a small-step operational semantics with an explicit representation of the… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 7
  • figure 8
Is this relevant?
1997
1997
Complete and Partial Redex Trails of Functional Computations
 
Is this relevant?
1997
1997
Call by Need Computations to Root-Stable Form
The following theorem of Huet and Lévy forms the basis of all results on optimal reduction strategies for orthogonal term… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
- calculus , internal mobility , and agent-passing calculi
  • Davide SangiorgiINRIA-Sophia Antipolis
  • 1995
The-calculus is a process algebra which originates from CCS and permits a natural modelling of mobility (i.e., dynamic… (More)
Is this relevant?