On multiset orderings

DOI10.1016/0020-0190(82)90107-7MaRDI QIDQ1165004zbMATH OpenOpenAlexWikidataFDO

Authors Jean-Pierre Jouannaud, Pierre Lescanne

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

Dershowitz-Manna orderinglack of monotonicityterm rewriting systemstermination of programswell-founded orderings on multisets

Mathematics Subject Classification ID

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

Cites work

• Proving termination with multiset orderings

Cited in

(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
• What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
• Confluence by decreasing diagrams
• A verified implementation of algebraic numbers in Isabelle/HOL
• scientific article; zbMATH DE number 3821100 (Why is no real title available?)
• scientific article; zbMATH DE number 3926235 (Why is no real title available?)
• On multiset ordering
• Generic top-down discrimination for sorting and partitioning in linear time
• An induction principle for pure type systems
• Leanest quasi-orderings
• Equational completion in order-sorted algebras

This page was built for publication: On multiset orderings

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