Axiomatizing permutation equivalence (Q4715673): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A theory of binding structures and applications to rewriting / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Petri nets are monoids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An algebraic semantics for structured transition systems and its application to logic programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equational type logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatory reduction systems: Introduction and survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Conditional rewriting logic as a unified model of concurrency / rank | |||
Normal rank |
Latest revision as of 14:43, 24 May 2024
scientific article; zbMATH DE number 946745
Language | Label | Description | Also known as |
---|---|---|---|
English | Axiomatizing permutation equivalence |
scientific article; zbMATH DE number 946745 |
Statements
Axiomatizing permutation equivalence (English)
0 references
18 November 1996
0 references
rewriting systems
0 references
semantics
0 references
equivalences between derivations
0 references
permutation equivalence
0 references
Church-Rosser theorem
0 references
algebraic structure of terms
0 references
\(\lambda\)-calculus with explicit substitutions
0 references
orthogonal combinatory reduction systems
0 references
0 references