Pages that link to "Item:Q1850960"
From MaRDI portal
The following pages link to Dependent types for program termination verification (Q1850960):
Displaying 5 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)
- Termination checking with types (Q4659886) (← links)
