Programming in equational logic: Beyond strong sequentiality (Q689097)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Programming in equational logic: Beyond strong sequentiality |
scientific article; zbMATH DE number 439988
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Programming in equational logic: Beyond strong sequentiality |
scientific article; zbMATH DE number 439988 |
Statements
Programming in equational logic: Beyond strong sequentiality (English)
0 references
2 January 1995
0 references
The authors present a solution to the problem of normalizing a given term \(wrt\) a rewriting system which is not strongly sequential. Their solution is optimal in the sense that it minimizes the wasteful reductions and it is also lazy on the strongly sequential parts.
0 references
term rewriting systems
0 references
strong sequentiality
0 references
necessary redexes
0 references
0 references
0.9203128
0 references
0.9133433
0 references
0 references
0 references
0.8976282
0 references
