Regular substitution sets: A means of controlling E-unification

DOI10.1007/3-540-59200-8_71zbMath1503.68093arXiv1404.1201OpenAlexW1482664385MaRDI QIDQ5055844

Jochen Burghardt

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.1201

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Computational aspects of an order-sorted logic with term declarations
• Foundations of equational logic programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Regular substitution sets: A means of controlling E-unification