Towards a domain theory for termination proofs

DOI10.1007/3-540-59200-8_60MaRDI QIDQ5055834zbMATH OpenOpenAlexFDO

Authors Stefan Michael 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)

Cites work

• scientific article; zbMATH DE number 3212886 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• The Clausal Theory of Types
• Total termination of term rewriting

Cited in

(10)

• The practice of logical frameworks
• Higher-order proof by consistency
• The variable containment problem
• Higher-order rewrite systems and their confluence
• Size-based termination of higher-order rewriting
• A proof-theoretic study of abstract termination principles
• On the Computational Content of Termination Proofs
• Interactive Termination Proofs Using Termination Cores
• Higher-order superposition for dependent types
• Higher-order narrowing with convergent systems

Describes a project that uses

Uses Software

• Automath

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

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