Towards a domain theory for termination proofs

DOI10.1007/3-540-59200-8_60zbMath1503.68120OpenAlexW1590111582MaRDI QIDQ5055834

Stefan Kahrs

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59200-8_60

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40) Monoidal categories, symmetric monoidal categories (18M05)

Related Items (6)

Higher-order superposition for dependent types ⋮ Size-based termination of higher-order rewriting ⋮ Higher-order rewrite systems and their confluence ⋮ Higher-order narrowing with convergent systems ⋮ The variable containment problem ⋮ The practice of logical frameworks

Uses Software

• Automath

Cites Work

• Total termination of term rewriting
• The Clausal Theory of Types
• Unnamed Item
• Unnamed Item

This page was built for publication: Towards a domain theory for termination proofs