Mechanising \(\lambda\)-calculus using a classical first order theory of terms with permutations (Q853738): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10990-006-8745-7 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10990-006-8745-7 / rank | |||
Normal rank | |||
Latest revision as of 11:09, 9 December 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
0 references
