Combining Typing and Size Constraints for Checking the Termination of Higher-Order Conditional Rewrite Systems
From MaRDI portal
Publication:5387887
DOI10.1007/11916277_8zbMath1165.68389OpenAlexW1573947311MaRDI QIDQ5387887
Publication date: 27 May 2008
Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00084837v2/file/main.pdf
Related Items (7)
Size-based termination of higher-order rewriting ⋮ Mixed Inductive/Coinductive Types and Strong Normalization ⋮ Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility ⋮ Well-founded recursion with copatterns and sized types ⋮ Type-Based Termination with Sized Products ⋮ On the Values of Reducibility Candidates ⋮ On the Relation between Sized-Types Based Termination and Semantic Labelling
This page was built for publication: Combining Typing and Size Constraints for Checking the Termination of Higher-Order Conditional Rewrite Systems
