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.

2018

We study the termination problem for probabilistic term rewrite systems. We prove that the interpretation method is sound and…

2017

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

2014

machines for higher-order term sharing

2010

A weakly normalizing term is one such that there is a reduction sequence which terminates in a normal form. An example (from the…

2002

For a terminating rewrite system R, and a ground term t1, two players alternate in doing R-reductions t1 ? R t2 ? R t3 ? R…

1998

1998

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…

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…

1996

In Part I [5], we proposed an approach to formally describe and compare functional languages implementations. We focused on call…

1996

Rewriting is a computational process in which one term is derived from another by replacing a subterm with another subterm in…