An algebraic structure for derivations in rewriting systems
From MaRDI portal
DOI10.1016/0304-3975(88)90039-4zbMATH Open0657.68025OpenAlexW2088527413MaRDI QIDQ1111012FDOQ1111012
Authors: Yury Velinov 
Publication date: 1988
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(88)90039-4
Recommendations
Formal languages and automata (68Q45) Abstract data types; algebraic specification (68Q65) Foundations, relations to logic and deductive systems (18A15)
Cites Work
- Polycategories
- Semantics of context-free languages
- Title not available (Why is that?)
- Some remarks on derivations in general rewriting systems
- Syntax and semantics: A categorical view
- The parsing for general phrase-structure grammars
- The basic algebraic structures in categories of derivations
- Title not available (Why is that?)
- Algebraic properties of derivation words
- Title not available (Why is that?)
- Derivation languages and syntactical categories
Cited In (8)
- Complete algebraic semantics for second-order rewriting systems based on abstract syntax with variable binding
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rewriting modulo isotopies in pivotal linear \((2,2)\)-categories
- Title not available (Why is that?)
- Confluence of algebraic rewriting systems
- An Automated Confluence Proof for an Infinite Rewrite System Parametrized over an Integro-Differential Algebra
- Title not available (Why is that?)
This page was built for publication: An algebraic structure for derivations in rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111012)
