Decidable call-by-need computations in term rewriting (Q1763429)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2136298
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decidable call-by-need computations in term rewriting |
scientific article; zbMATH DE number 2136298 |
Statements
Decidable call-by-need computations in term rewriting (English)
0 references
22 February 2005
0 references
Term rewriting
0 references
Strategies
0 references
Call-by-need
0 references
Tree automata
0 references
0 references
0 references
0.8692899942398071
0 references
0.830445408821106
0 references
0.8298631310462952
0 references
0.8230246305465698
0 references
