The following pages link to (Q2778886):
Displaying 8 items.
- Mechanising \(\lambda\)-calculus using a classical first order theory of terms with permutations (Q853738) (← links)
- A formalised first-order confluence proof for the \(\lambda\)-calculus using one-sorted variable names. (Q1401936) (← links)
- Nominal logic, a first order theory of names and binding (Q1887151) (← links)
- Machine-checked proof of the Church-Rosser theorem for the lambda calculus using the Barendregt variable convention in constructive type theory (Q2333314) (← links)
- A first-order syntax for the \(\pi\)-calculus in Isabelle/HOL using permutations (Q2841231) (← links)
- The mechanisation of Barendregt-style equational proofs (the residual perspective) (Q2841232) (← links)
- More SPASS with Isabelle (Q2914754) (← links)
- Automated Deduction – CADE-19 (Q5900715) (← links)
