Pages that link to "Item:Q853738"
From MaRDI portal
The following pages link to Mechanising \(\lambda\)-calculus using a classical first order theory of terms with permutations (Q853738):
Displaying 7 items.
- Nominal techniques in Isabelle/HOL (Q928672) (← links)
- A formalized general theory of syntax with bindings (Q1687739) (← links)
- A formalized general theory of syntax with bindings: extended version (Q1984791) (← links)
- Machine-checked proof of the Church-Rosser theorem for the lambda calculus using the Barendregt variable convention in constructive type theory (Q2333314) (← links)
- On the Role of Names in Reasoning about λ-tree Syntax Specifications (Q2804945) (← links)
- Mechanised Computability Theory (Q3088013) (← links)
- Reasoning about Constants in Nominal Isabelle or How to Formalize the Second Fixed Point Theorem (Q3100205) (← links)
