Mechanising \(\lambda\)-calculus using a classical first order theory of terms with permutations (Q853738): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Nominal Isabelle / rank | |||
Normal rank | |||
Revision as of 13:14, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Mechanising \(\lambda\)-calculus using a classical first order theory of terms with permutations |
scientific article |
Statements
Mechanising \(\lambda\)-calculus using a classical first order theory of terms with permutations (English)
0 references
17 November 2006
0 references
Barendregt variable convention
0 references
