Pages that link to "Item:Q3612438"
From MaRDI portal
The following pages link to A Formalisation of a Dependently Typed Language as an Inductive-Recursive Family (Q3612438):
Displaying 11 items.
- Strongly typed term representations in Coq (Q2392480) (← links)
- Extensible and Efficient Automation Through Reflective Tactics (Q2802496) (← links)
- Type theory should eat itself (Q2804938) (← links)
- Denotational cost semantics for functional languages with inductive types (Q2981951) (← links)
- Dependently Typed Grammars (Q3575266) (← links)
- Normalization by Evaluation for Typed Weak lambda-Reduction (Q5091147) (← links)
- POPLMark reloaded: Mechanizing proofs by logical relations (Q5110924) (← links)
- Pure type systems with explicit substitutions (Q5371956) (← links)
- Idris, a general-purpose dependently typed programming language: Design and implementation (Q5398331) (← links)
- Normalization by evaluation for modal dependent type theory (Q6065506) (← links)
- For Finitary Induction-Induction, Induction is Enough (Q6079233) (← links)