The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type (Q5111301)

From MaRDI portal
Revision as of 09:04, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
scientific article; zbMATH DE number 7204425
Language Label Description Also known as
English
The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type
scientific article; zbMATH DE number 7204425

    Statements

    0 references
    26 May 2020
    0 references
    reducibility method
    0 references
    restricted reducibility theorem
    0 references
    sum type
    0 references
    type-directed expansion
    0 references
    strong normalization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type (English)
    0 references

    Identifiers