On multiset orderings

DOI10.1016/0020-0190(82)90107-7zbMath0486.68041OpenAlexW2090541423WikidataQ60164218 ScholiaQ60164218MaRDI QIDQ1165004

Pierre Lescanne, Jean-Pierre Jouannaud

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(82)90107-7

zbMATH Keywords

term rewriting systemsDershowitz-Manna orderinglack of monotonicitytermination of programswell-founded orderings on multisets

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of computing (68Q99)

Related Items (16)

Termination of rewriting ⋮ Path of subterms ordering and recursive decomposition ordering revisited ⋮ History and basic features of the critical-pair/completion procedure ⋮ Extension functions for multiset orderings ⋮ On termination of the direct sum of term-rewriting systems ⋮ A geometrical approach to multiset orderings ⋮ Leanest quasi-orderings ⋮ Equational completion in order-sorted algebras ⋮ What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory ⋮ Generic top-down discrimination for sorting and partitioning in linear time ⋮ Unnamed Item ⋮ On multiset ordering ⋮ Unnamed Item ⋮ An induction principle for pure type systems ⋮ A verified implementation of algebraic numbers in Isabelle/HOL ⋮ Confluence by decreasing diagrams

Cites Work

• Proving termination with multiset orderings

This page was built for publication: On multiset orderings