Pages that link to "Item:Q1850960"
From MaRDI portal
The following pages link to Dependent types for program termination verification (Q1850960):
Displaying 11 items.
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- Adapting functional programs to higher order logic (Q1029815) (← links)
- Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs (Q2331068) (← links)
- Probabilistic Termination by Monadic Affine Sized Typing (Q2988649) (← links)
- The Computability Path Ordering: The End of a Quest (Q3540166) (← links)
- Type-Based Termination with Sized Products (Q3540199) (← 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)
- A Tutorial on Type-Based Termination (Q5191089) (← links)
- Well-founded recursion with copatterns and sized types (Q5371960) (← links)
