A short proof that adding some permutation rules to \(\beta \) preserves SN (Q631758): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1763375386 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1011.1335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normalization without reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call-by-Value  -calculus and LJQ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Postponement, conservation and preservation of strong normalization for generalized reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3202991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Terminating and Confluent Linear Lambda Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: An equivalence between lambda- terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delayed Substitutions / rank
 
Normal rank

Latest revision as of 21:35, 3 July 2024

scientific article
Language Label Description Also known as
English
A short proof that adding some permutation rules to \(\beta \) preserves SN
scientific article

    Statements

    A short proof that adding some permutation rules to \(\beta \) preserves SN (English)
    0 references
    0 references
    14 March 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    lambda calculus
    0 references
    strong normalization
    0 references
    permutation rules
    0 references
    0 references
    0 references