Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation

DOI10.1007/978-3-540-89439-1_47zbMATH Open1182.68093OpenAlexW1569900092MaRDI QIDQ5505589FDOQ5505589

Authors: John P. Gallagher, Mads Rosendahl 

Publication date: 27 January 2009

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89439-1_47

Recommendations

• scientific article; zbMATH DE number 1118018
• Decidable approximations of term rewriting systems
• Approximation and normalization results for typeable term rewriting systems
• scientific article; zbMATH DE number 4074536
• Term rewriting: Some experimental results
• scientific article; zbMATH DE number 3890721
• scientific article; zbMATH DE number 4053071
• An account of implementing applicative term rewriting
• Term rewriting systems in logic programming and in functional programming
• scientific article; zbMATH DE number 4090779

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (5)

• Equational approximations for tree automata completion
• Characterizing conclusive approximations by logical formulae
• A Human-Oriented Term Rewriting System
• Proving semantic properties as first-order satisfiability
• Horn clauses as an intermediate representation for program analysis and transformation

This page was built for publication: Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505589)