λν, a calculus of explicit substitutions which preserves strong normalisation (Q3125228): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: ON STEPWISE EXPLICIT SUBSTITUTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: An abstract framework for environment machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Categorical combinators / 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: Explicit substitutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3857730 / rank
 
Normal rank

Latest revision as of 11:52, 27 May 2024

scientific article
Language Label Description Also known as
English
λν, a calculus of explicit substitutions which preserves strong normalisation
scientific article

    Statements

    λν, a calculus of explicit substitutions which preserves strong normalisation (English)
    0 references
    0 references
    0 references
    0 references
    29 April 1997
    0 references
    0 references
    \(\lambda\sigma\)-calculus
    0 references
    \(\lambda\)-calculus
    0 references