The following pages link to Termination checking with types (Q4659886):
Displaying 13 items.
- Flow analysis of lazy higher-order functional programs (Q879358) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- A compact kernel for the calculus of inductive constructions (Q1040007) (← links)
- Dependent types for program termination verification (Q1850960) (← links)
- Probabilistic Termination by Monadic Affine Sized Typing (Q2988649) (← links)
- The Computability Path Ordering: The End of a Quest (Q3540166) (← links)
- Implementing a normalizer using sized heterogeneous types (Q3638918) (← links)
- (Q4261071) (← links)
- Size-based termination of higher-order rewriting (Q4577817) (← links)
- Heterogeneous Substitution Systems Revisited (Q4580223) (← links)
- The Recursion Scheme from the Cofree Recursive Comonad (Q5166625) (← links)
- A Tutorial on Type-Based Termination (Q5191089) (← links)
- Logic Programming (Q5191484) (← links)