Constructor equivalent term rewriting systems are strongly sequential: A direct proof (Q1338780): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(94)00122-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1995788030 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Constructor equivalent term rewriting systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4297316 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sequentiality in orthogonal term rewriting systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Classes of equational programs that compile into efficient machine code / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the correspondence between two classes of reduction systems / rank | |||
Normal rank | |||
Latest revision as of 10:27, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructor equivalent term rewriting systems are strongly sequential: A direct proof |
scientific article |
Statements
Constructor equivalent term rewriting systems are strongly sequential: A direct proof (English)
0 references
20 November 1994
0 references
term rewriting systems
0 references
