Pages that link to "Item:Q2392480"
From MaRDI portal
The following pages link to Strongly typed term representations in Coq (Q2392480):
Displaying 11 items.
- Mechanizing type environments in weak HOAS (Q897934) (← links)
- Programs Using Syntax with First-Class Binders (Q2988654) (← links)
- (Q3384910) (← links)
- Mechanizing proofs with logical relations – Kripke-style (Q4691187) (← links)
- A type- and scope-safe universe of syntaxes with binding: their semantics and proofs (Q5019018) (← links)
- Deep Generation of Coq Lemma Names Using Elaborated Terms (Q5048996) (← links)
- POPLMark reloaded: Mechanizing proofs by logical relations (Q5110924) (← links)
- Initial Semantics for higher-order typed syntax in Coq (Q5195243) (← links)
- A case study in programming coinductive proofs: Howe’s method (Q5236557) (← links)
- Semantic analysis of normalisation by evaluation for typed lambda calculus (Q5889884) (← links)
- A linear algebra approach to linear metatheory (Q6657791) (← links)