Mechanising \(\lambda\)-calculus using a classical first order theory of terms with permutations (Q853738): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:23, 5 March 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
