Transfinite reductions in orthogonal term rewriting systems (Q5055744): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3900995 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The lambda calculus. Its syntax and semantics. Rev. ed. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: REDEX CAPTURING IN TERM GRAPH REWRITING / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3918095 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4692880 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tree-Manipulating Systems and Church-Rosser Theorems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3721784 / rank | |||
Normal rank |
Latest revision as of 01:57, 31 July 2024
scientific article; zbMATH DE number 7631152
Language | Label | Description | Also known as |
---|---|---|---|
English | Transfinite reductions in orthogonal term rewriting systems |
scientific article; zbMATH DE number 7631152 |
Statements
Transfinite reductions in orthogonal term rewriting systems (English)
0 references
9 December 2022
0 references
orthogonal term-rewriting systems
0 references
infinitary rewriting
0 references
strong converging reductions
0 references
infinite Church-Rosser properties
0 references
normal forms
0 references
Böhm trees
0 references
head normal forms
0 references
non-unifiable term-rewriting systems
0 references