The following pages link to (Q4268477):
Displayed 12 items.
- On the confluence of lambda-calculus with conditional rewriting (Q987976) (← links)
- Recursive programming with proofs (Q1190480) (← links)
- The Inf function in the system \(F\) (Q1346636) (← links)
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485) (← links)
- Strong storage operators and data types (Q1805408) (← links)
- Minimality in a Linear Calculus with Iteration (Q2873683) (← links)
- (Q5020623) (← links)
- Monotone recursive types and recursive data representations in Cedille (Q5076393) (← links)
- Some Remarks on Type Systems for Course-of-value Recursion (Q5178964) (← links)
- A Tutorial on Type-Based Termination (Q5191089) (← links)
- Efficiency of lambda-encodings in total type theory (Q5371961) (← links)
- The calculus of dependent lambda eliminations (Q5372010) (← links)