A formalised first-order confluence proof for the \(\lambda\)-calculus using one-sorted variable names. (Q1401936): Difference between revisions
From MaRDI portal
Latest revision as of 08:57, 6 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A formalised first-order confluence proof for the \(\lambda\)-calculus using one-sorted variable names. |
scientific article |
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
