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
Created claim: Wikidata QID (P12): Q113317509, #quickstatements; #temporary_batch_1706974288397 |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Agda / rank | |||
Normal rank | |||
Revision as of 17:54, 29 February 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
