A formalised first-order confluence proof for the \(\lambda\)-calculus using one-sorted variable names. (Q1401936)
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: A formalised first-order confluence proof for the \(\lambda\)-calculus using one-sorted variable names. |
scientific article; zbMATH DE number 1967126
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A formalised first-order confluence proof for the \(\lambda\)-calculus using one-sorted variable names. |
scientific article; zbMATH DE number 1967126 |
Statements
A formalised first-order confluence proof for the \(\lambda\)-calculus using one-sorted variable names. (English)
0 references
19 August 2003
0 references
\({\lambda}\)-Calculus
0 references
Structural induction and recursion
0 references
Confluence
0 references
Theorem proving
0 references
Barendregt's Variable Convention
0 references
0 references
0 references
0.87278473
0 references
0.8663324
0 references
0 references
0.86212474
0 references
