Mechanising \(\lambda\)-calculus using a classical first order theory of terms with permutations (Q853738)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Mechanising \(\lambda\)-calculus using a classical first order theory of terms with permutations |
scientific article; zbMATH DE number 5073693
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Mechanising \(\lambda\)-calculus using a classical first order theory of terms with permutations |
scientific article; zbMATH DE number 5073693 |
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
0.89530414
0 references
0 references
0.8601111
0 references
0 references
0.85475564
0 references
