An ordinal calculus for proving termination in term rewriting
From MaRDI portal
Publication:5878912
DOI10.1007/3-540-61064-2_40MaRDI QIDQ5878912
Publication date: 23 February 2023
Published in: Trees in Algebra and Programming — CAAP '96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61064-2_40
68Q42: Grammars and rewriting systems
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
Related Items
Size-based termination of higher-order rewriting, An ordinal measure based procedure for termination of functions, Ordinal recursive bounds for Higman's theorem
Cites Work