A semantic approach to order-sorted rewriting
From MaRDI portal
Publication:5055784
DOI10.1007/978-3-662-21551-7_5OpenAlexW1605841142MaRDI QIDQ5055784FDOQ5055784
Authors: Andreas Werner
Publication date: 9 December 2022
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-21551-7_5
Recommendations
- A semantic approach to order-sorted rewriting
- Semantics of order-sorted specifications
- Order-Sorted Rewriting and Congruence Closure
- Partial order reduction for rewriting semantics of programming languages
- Currying of order-sorted term rewriting systems
- Semantics and expressiveness of ordered SOS
- A generalization of ordered-pair semantics
- Order-sorted equational unification revisited
- Completeness and confluence of order-sorted term rewriting
- scientific article; zbMATH DE number 176122
Cites Work
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Completion of rewrite systems with membership constraints
- Order-sorted completion: The many-sorted way
- Semantics of order-sorted specifications
- A note on a canonical theory with undecidable unification and matching problem
- Completeness and confluence of order-sorted term rewriting
- A semantic approach to order-sorted rewriting
- Title not available (Why is that?)
Cited In (17)
- Abstract domains for reordering CLP(RLin) programs
- A semantic approach to order-sorted rewriting
- Currying of order-sorted term rewriting systems
- Partial order semantics and read arcs
- Title not available (Why is that?)
- A generalization of ordered-pair semantics
- Could orders be captured by term rewriting systems?
- Compatibility of order-sorted rewrite rules
- Order-sorted termination: the unsorted way
- Dynamically-typed computations for order-sorted equational presentations
- Completeness and confluence of order-sorted term rewriting
- On the Completeness of Context-Sensitive Order-Sorted Specifications
- On the Expressivity of Optimality Theory versus Ordered Rewrite Rules
- Semantics of MML query -- ordering
- A study of evaluation order semantics in expressions with side effects
- Order-Sorted Rewriting and Congruence Closure
- Bi-rewriting, a term rewriting technique for monotonic order relations
This page was built for publication: A semantic approach to order-sorted rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055784)