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
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.entcs.2018.10.006 / rank
Normal rank
 
Property / cites work
 
Property / cites work: The lambda calculus. Its syntax and semantics. Rev. ed. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alpha-structural induction and recursion for the lambda calculus in constructive type theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688389 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanising \(\lambda\)-calculus using a classical first order theory of terms with permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nominal logic, a first order theory of names and binding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alpha-structural recursion and induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel reductions in \(\lambda\)-calculus / rank
 
Normal 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
    0 references
    0 references
    0 references
    12 November 2019
    0 references
    lambda calculus
    0 references
    formal metatheory
    0 references
    type theory
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references