Skip to search formSkip to main contentSkip to account menu

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

Related topics

Related topics

11 relations
Abstract rewriting systemCombinatory logicDisjunctive normal formDivergence (computer science)

Broader (1)

Computability theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2005
2005
Skew and ω-Skew Confluence and Infinite Normal Forms
The notion of skew confluence was introduced to characterize non-confluent term rewriting systems that had unique infinite normal… 
2002
2002
A Counterexample to the Modularity of Unicity of Normal Forms for Join Conditional Term Rewriting Systems
In [1], Middeldorp proved that unicity of normal forms is a modular property for semi-equational conditional term rewriting… 
Review
2002
Review
2002
A Survey of Some Variants of P Systems
In this paper we give a brief survey of some variants of P systems and their computational capacity. An improvement of a known… 
1998
1998
Axiomatic Rewriting Theory Iv a Stability Theorem in Rewriting Theory
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
1997
Unique Normal Forms for Nonlinear Term Rewriting Systems: Root Overlaps
Programming language interpreters, proving theorems of the form A = B, abstract data types, and program optimization can all be… 
1994
1994
A new proof of Chew's theorem
We present a new proof of Chew's theorem, which states that normal forms are unique up to conversion in compatible term rewriting… 
1990
1990
Unique normal forms for disjoint unions of conditional term rewriting systems
1990
1990
Proofs and computations in conditional equational theories
Conditional equations arise naturally in the algebraic specification of data types. They also provide an elegant computational… 
1989
1989
A method for enumerating cosets of a group presented by a canonical system
The application of rewriting techniques to enumerate cosets of subgroups in groups is investigated. Given a class of groups… 
1981
1981
Unique normal forms in term rewriting systems with repeated variables
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… 
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)