Pages that link to "Item:Q3613430"
From MaRDI portal
The following pages link to A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL (Q3613430):
Displayed 13 items.
- Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax (Q438569) (← links)
- Nominal techniques in Isabelle/HOL (Q928672) (← links)
- A formalized general theory of syntax with bindings: extended version (Q1984791) (← links)
- Rensets and renaming-based recursion for syntax with bindings (Q2104549) (← links)
- A Simple Nominal Type Theory (Q2804939) (← links)
- Nominal Equational Logic (Q2864152) (← links)
- Reasoning about Constants in Nominal Isabelle or How to Formalize the Second Fixed Point Theorem (Q3100205) (← links)
- Formalising FinFuns – Generating Code for Functions as Data from Isabelle/HOL (Q3183537) (← links)
- Formalization of metatheory of the Lambda Calculus in constructive type theory using the Barendregt variable convention (Q5022932) (← links)
- Formal SOS-Proofs for the Lambda-Calculus (Q5178966) (← links)
- Abstract Syntax: Substitution and Binders (Q5262926) (← links)
- Rensets and renaming-based recursion for syntax with bindings extended version (Q6111524) (← links)
- Nominal Sets in Agda - A Fresh and Immature Mechanization (Q6118749) (← links)