Abstract Reduction Systems and Idea of Knuth-Bendix Completion Algorithm
Educational content for abstract reduction systems concerning reduction, convertibility, normal forms, divergence and convergence, Church- Rosser property, term rewriting systems, and the idea of the Knuth-Bendix Completion Algorithm. The theory is based on [1].
Uloženo v:
| Vydáno v: | Formalized mathematics Ročník 22; číslo 1; s. 37 - 56 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Bialystok
Sciendo
30.03.2014
De Gruyter Brill Sp. z o.o., Paradigm Publishing Services |
| Témata: | |
| ISSN: | 1898-9934, 1426-2630, 1898-9934 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | Educational content for abstract reduction systems concerning reduction, convertibility, normal forms, divergence and convergence, Church- Rosser property, term rewriting systems, and the idea of the Knuth-Bendix Completion Algorithm. The theory is based on [1]. |
|---|---|
| Bibliografie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 1898-9934 1426-2630 1898-9934 |
| DOI: | 10.2478/forma-2014-0005 |