Domain interpretations of Martin-Löf's partial type theory (Q916656): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Recursive models for constructive set theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3787462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domain theoretic models of polymorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive mathematics and computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precision of double sampling estimators for comparing two probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: LCF considered as a programming language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664454 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interpretation of Martin-Löf's type theory in a type-free theory of propositions / 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: On the syntax of Martin-Löf's type theories / rank
 
Normal rank

Latest revision as of 09:52, 21 June 2024

scientific article
Language Label Description Also known as
English
Domain interpretations of Martin-Löf's partial type theory
scientific article

    Statements

    Domain interpretations of Martin-Löf's partial type theory (English)
    0 references
    0 references
    1990
    0 references
    The Martin-Löf type theory considered is a monomorphic version, i.e. all type information is included in the terms, with the intensional identity type and containing a fixed point operator but not containing universes. On the domain side, the category DOM is considered, consisting of consistently complete algebraic cpo's with projection pairs as morphisms or, rather, effective such in terms of recursive enumeration theory. Each context \(\Gamma\) is interpreted as an effective domain \([[\Gamma]]\), each (dependent) type A in the context \(\Gamma\) is interpreted as an effective continuous functor \([[A]]_{\Gamma}: [[\Gamma]]\to DOM\) and each element \(a\in A\) in the context \(\Gamma\) is interpreted as an effective continuous function \([[a]]_{\Gamma}\) over \([[A]]_{\Gamma}\). Equality is interpreted as set theoretic equality. Two interpretations are given, one of which is shown to be adequate for the operational semantics of type theory in the sense that a closed term a terminates iff \([[a]]=\perp\). The interpretation has been modified and extended to type theory including universes in another paper of the first author [A domain interpretation of Martin-Löf's partial type theory with one universe, U.U.D.M. Report (1989)].
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    partial type theory
    0 references
    Martin-Löf type theory
    0 references
    consistently complete algebraic cpo's
    0 references
    effective domain
    0 references
    effective continuous functor
    0 references
    effective continuous function
    0 references
    operational semantics of type theory
    0 references
    0 references