Dependency pairs termination in dependent type theory modulo rewriting
From MaRDI portal
(Redirected from Publication:5089009)
Recommendations
Cites work
- scientific article; zbMATH DE number 108365 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- A framework for defining logics
- A general formulation of simultaneous inductive-recursive definitions in type theory
- Calculating sized types
- Chain-complete posets and directed sets with applications
- Combinatory reduction systems: Introduction and survey
- Definitions by rewriting in the Calculus of Constructions
- Developing developments
- Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
- Enhancing dependency pair method using strong computability in simply-typed term rewriting
- Higher-order rewrite systems and their confluence
- Logic for Programming, Artificial Intelligence, and Reasoning
- Mechanizing and improving dependency pairs
- Programming Languages and Systems
- Refinement types as higher-order dependency pairs
- Rewriting Techniques and Applications
- Size-based termination of higher-order rewriting
- Termination of dependently typed rewrite rules
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility
- Termination of term rewriting using dependency pairs
- The size-change principle and dependency pairs for termination of term rewriting
- The size-change principle for program termination
- The size-change termination principle for constructor based languages
- Tyrolean termination tool: techniques and features
Cited in
(5)
This page was built for publication: Dependency pairs termination in dependent type theory modulo rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089009)
