Normal form (abstract rewriting)

Known as: Normal form, Normal form (formal languages), Normal form (term rewriting)

In abstract rewriting, an object is in normal form if it cannot be rewritten any further. Depending on the rewriting system and the object, several…

Papers overview

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

2015

A new technique is presented to prove non-termination of term rewriting. The basic idea is to find a non-empty regular language…

2007

2007

2001

OLAP queries involve a lot of aggregations on a large amount of data in data warehouses. To process expensive OLAP queries…

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…

1992

Modular properties of term rewriting systems, i.e. properties which are preserved under disjoint unions, have attracted an…

Highly Cited

1989

Highly Cited

1989

In this paper we prove that the property of having unique normal forms is preserved under disjoint union. We show that two…

1989

The application of rewriting techniques to enumerate cosets of subgroups in groups is investigated. Given a class of groups…

1981

Many important problems in computer science can be reduced to the problem of using a set of equations to simplify a term. For…

1981

A term rewriting system is a finite set of axiom schemata of the form A@@@@B where A and B are terms that contain variables. An…