Mechanising \(\lambda\)-calculus using a classical first order theory of terms with permutations (Q853738): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10990-006-8745-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1981019433 / rank | |||
Normal rank | |||
Revision as of 22:48, 19 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
