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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

The time delay estimation (TDE) of some known waveforms from sampled data is of great interest in the area of signal processing…

2015

In this paper, we propose a new attribute reduction strategy based on rough sets and grey wolf optimization (GWO). Rough sets…

2012

We present a PLT Redex model of a substantial portion of the Racket virtual machine and bytecode verifier (formerly known as…

2012

Sharing graphs are a tool for the implementation of graph rewriting systems whose rules may require the duplication, the…

2006

The last few years have seen the development of the rewriting calculus (also called rho-calculus or ρ-calculus) that uniformly…

1997

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…

1997

We present a type-based flow analysis for simply typed lambda calculus with booleans, data-structures and recursion. The analysis…

1994

Confluent term rewriting systems can be seen as a model for functional computations, in which redexes corresponding to instances…

1993

We design a normalizing strategy for orthogonal term rewriting systems (OTRSs), which is a generalization of the call-by-need…

1993

A graded sequence of examples—presented in a uniform framework—spotlights stages in the development of methods for proving…