Machine-checked proof of the Church-Rosser theorem for the lambda calculus using the Barendregt variable convention in constructive type theory (Q2333314): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.entcs.2018.10.006 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ENTCS.2018.10.006 / rank | |||
Normal rank | |||
Latest revision as of 01:22, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Machine-checked proof of the Church-Rosser theorem for the lambda calculus using the Barendregt variable convention in constructive type theory |
scientific article |
Statements
Machine-checked proof of the Church-Rosser theorem for the lambda calculus using the Barendregt variable convention in constructive type theory (English)
0 references
12 November 2019
0 references
lambda calculus
0 references
formal metatheory
0 references
type theory
0 references
0 references
0 references
