Pages that link to "Item:Q4463991"
From MaRDI portal
The following pages link to Type-based termination of recursive definitions (Q4463991):
Displayed 24 items.
- Map fusion for nested datatypes in intensional type theory (Q627204) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- Type-based termination of generic programs (Q923883) (← links)
- Inductive and Coinductive Components of Corecursive Functions in Coq (Q2873661) (← links)
- Probabilistic Termination by Monadic Affine Sized Typing (Q2988649) (← links)
- Mixed Inductive/Coinductive Types and Strong Normalization (Q3498444) (← links)
- Polarised subtyping for sized types (Q3535676) (← links)
- The Computability Path Ordering: The End of a Quest (Q3540166) (← links)
- Type-Based Termination with Sized Products (Q3540199) (← links)
- Using Structural Recursion for Corecursion (Q3638255) (← links)
- Implementing a normalizer using sized heterogeneous types (Q3638918) (← links)
- On the Relation between Sized-Types Based Termination and Semantic Labelling (Q3644746) (← links)
- Size-based termination of higher-order rewriting (Q4577817) (← links)
- Termination checking with types (Q4659886) (← links)
- (Q5020623) (← links)
- The Recursion Scheme from the Cofree Recursive Comonad (Q5166625) (← links)
- A Tutorial on Type-Based Termination (Q5191089) (← links)
- (Q5216302) (← links)
- Well-founded recursion with copatterns and sized types (Q5371960) (← links)
- Interactive programming in Agda – Objects and graphical user interfaces (Q5372002) (← links)
- Compositional Coinduction with Sized Types (Q5739446) (← links)
- Partiality and recursion in interactive theorem provers – an overview (Q5741556) (← links)
- Is sized typing for Coq practical? (Q6099202) (← links)
- A sound strategy to compile general recursion into finite depth pattern matching (Q6113899) (← links)