Order-sorted termination: the unsorted way

DOI10.1007/3-540-61735-3_6MaRDI QIDQ2956715zbMATH OpenOpenAlexFDO

Authors Peter Csaba Ölveczky, Olav Lysne

Publication date 19 January 2017

Published in Algebraic and Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61735-3_6

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Termination of term rewriting: Interpretation and type elimination
• A semantic approach to order-sorted rewriting
• scientific article; zbMATH DE number 3930339
• Completeness and confluence of order-sorted term rewriting
• A semantic approach to order-sorted rewriting

Cited in

(8)

• An order-sorted resolution in theory and practice
• Automatic synthesis of logical models for order-sorted first-order theories
• Methods for proving termination of rewriting-based programming languages by transformation
• Strong and weak operational termination of order-sorted rewrite theories
• MTT: The Maude Termination Tool (System Description)
• mu-term: Verify Termination Properties Automatically (System Description)
• Operational termination of membership equational programs: the order-sorted way
• Completeness and confluence of order-sorted term rewriting

This page was built for publication: Order-sorted termination: the unsorted way

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