A semantic approach to order-sorted rewriting

DOI10.1006/JSCO.1997.0188zbMATH Open0983.68088OpenAlexW2044004199MaRDI QIDQ1264441FDOQ1264441

Authors: Andreas Werner 

Publication date: 21 April 2002

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/add039526af1248c138a428e39ad110737f68cca

Recommendations

• A semantic approach to order-sorted rewriting
• Completeness and confluence of order-sorted term rewriting
• Semantics of order-sorted specifications
• Order-sorted completion: The many-sorted way

zbMATH Keywords

order-sorted rewritingrange unique signatures

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (19)

• 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?)
• 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
• 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
• Semantics of order-sorted specifications
• A study of evaluation order semantics in expressions with side effects
• Title not available (Why is that?)
• 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 Q1264441)