Pages that link to "Item:Q5178760"
From MaRDI portal
The following pages link to Parametric higher-order abstract syntax for mechanized semantics (Q5178760):
Displaying 19 items.
- Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax (Q438569) (← links)
- Mechanizing type environments in weak HOAS (Q897934) (← links)
- A formalized general theory of syntax with bindings (Q1687739) (← links)
- Canonical HybridLF: extending Hybrid with dependent types (Q1744412) (← links)
- Combining deep and shallow embedding of domain-specific languages (Q1749137) (← links)
- A formalized general theory of syntax with bindings: extended version (Q1984791) (← links)
- Rensets and renaming-based recursion for syntax with bindings (Q2104549) (← links)
- Mechanized metatheory revisited (Q2323447) (← links)
- Formal meta-level analysis framework for quantum programming languages (Q2333324) (← links)
- Mechanizing focused linear logic in Coq (Q2333326) (← links)
- Strongly typed term representations in Coq (Q2392480) (← links)
- Formalized meta-theory of sequent calculi for linear logics (Q2424887) (← links)
- Programs Using Syntax with First-Class Binders (Q2988654) (← links)
- Mechanizing the Metatheory of mini-XQuery (Q3100214) (← links)
- A Functional Abstraction of Typed Invocation Contexts (Q5043596) (← links)
- A presheaf model of parametric type theory (Q5971392) (← links)
- Is Impredicativity Implicitly Implicit (Q6079240) (← links)
- Rensets and renaming-based recursion for syntax with bindings extended version (Q6111524) (← links)
- A strong call-by-need calculus (Q6135746) (← links)
