Pages that link to "Item:Q5371961"
From MaRDI portal
The following pages link to Efficiency of lambda-encodings in total type theory (Q5371961):
Displaying 5 items.
- From realizability to induction via dependent intersection (Q2636522) (← links)
- Non finitely generated types and λ-terms combinatoric representation cost (Q4522149) (← links)
- Optimized encodings of fragments of type theory in first order logic (Q4647585) (← links)
- Monotone recursive types and recursive data representations in Cedille (Q5076393) (← links)
- The calculus of dependent lambda eliminations (Q5372010) (← links)