Computational adequacy for recursive types in models of intuitionistic set theory (Q1886324): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q685385
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Alex K. Simpson / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094544397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3937387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatic Domain Theory in Categories of Partial Maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4362914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domains in \(H\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3978971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensional PERs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3671978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3978973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tripos theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantics of weakening and contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Categorical logic and type theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A presentation of the initial lift-algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4853985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3727946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A uniform approach to domain theory in realizability models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4296744 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sheaves in geometry and logic: a first introduction to topos theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Building domains from graph models / rank
 
Normal rank
Property / cites work
 
Property / cites work: From term models to domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relational properties of domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: LCF considered as a programming language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3657409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General synthetic domain theory – a logical approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational adequacy for recursive types in models of intuitionistic set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Category-Theoretic Solution of Recursive Domain Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4243759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axioms and (counter)examples in synthetic domain theory / rank
 
Normal rank

Latest revision as of 15:20, 7 June 2024

scientific article
Language Label Description Also known as
English
Computational adequacy for recursive types in models of intuitionistic set theory
scientific article

    Statements

    Computational adequacy for recursive types in models of intuitionistic set theory (English)
    0 references
    18 November 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Domain theory
    0 references
    Algebraic compactness
    0 references
    FPC
    0 references
    interpretation of recursive types
    0 references
    categorical models of intuitionistic set theory
    0 references
    recursively typed lambda-calculus
    0 references
    0 references
    0 references