Abstracting models of strong normalization for classical calculi (Q2291828): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jlamp.2019.100512 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2995413974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical Call-by-Need and Duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4490745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The duality of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Duality of Computation under Focus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why the usual candidates of reducibility do not work for the symmetric $\lambda\mu$-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Duality of Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structures for structural recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform strong normalization for multi-discipline calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form / rank
 
Normal rank
Property / cites work
 
Property / cites work: A call-by-name lambda-calculus machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical \(F_{\omega}\), orthogonality and symmetric candidates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizability interpretation and normalization of typed call-by-need \(\lambda\)-calculus with control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Focalisation and Classical Realisability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric polymorphism and operational equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call-by-name, call-by-value and the \(\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parametric lambda calculus. A metamodel for computation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intensional interpretations of functionals of finite type I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call-by-value is dual to call-by-name / rank
 
Normal rank
Property / cites work
 
Property / cites work: A syntactic approach to type soundness / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126532454 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JLAMP.2019.100512 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:45, 17 December 2024

scientific article
Language Label Description Also known as
English
Abstracting models of strong normalization for classical calculi
scientific article

    Statements

    Abstracting models of strong normalization for classical calculi (English)
    0 references
    0 references
    0 references
    0 references
    31 January 2020
    0 references
    strong normalization
    0 references
    calling convention
    0 references
    biorthogonality
    0 references
    symmetric candidates
    0 references
    sequent calculus
    0 references

    Identifiers

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