Domain interpretations of Martin-Löf's partial type theory
DOI10.1016/0168-0072(90)90044-3zbMATH Open0704.03041OpenAlexW2067618205MaRDI QIDQ916656FDOQ916656
Viggo Stoltenberg-Hansen, Erik Palmgren
Publication date: 1990
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(90)90044-3
Recommendations
- Remarks on Martin-Löf's partial type theory
- A type theoretic interpretation of constructive domain theory
- scientific article; zbMATH DE number 3853066
- scientific article; zbMATH DE number 1302058
- On the syntax of Martin-Löf's type theories
- An interpretation of Martin-Löf's type theory in a type-free theory of propositions
- An information system interpretation of Martin-Löf's partial type theory with universes
- Kripke Semantics for Martin-Löf’s Extensional Type Theory
- Kripke Semantics for Martin-L\"of's Extensional Type Theory
- Characterizing the interpretation of set theory in Martin-Löf type theory
consistently complete algebraic cpo'seffective continuous functioneffective continuous functoreffective domainoperational semantics of type theorypartial type theoryMartin-Löf type theory
Theory of numerations, effectively presented structures (03D45) Metamathematics of constructive systems (03F50) Continuous lattices and posets, applications (06B35) Semantics in the theory of computing (68Q55) Second- and higher-order arithmetic and fragments (03F35)
Cites Work
- LCF considered as a programming language
- The Category-Theoretic Solution of Recursive Domain Equations
- Title not available (Why is that?)
- Recursive models for constructive set theories
- Title not available (Why is that?)
- Precision of double sampling estimators for comparing two probabilities
- On the syntax of Martin-Löf's type theories
- Title not available (Why is that?)
- Domain theoretic models of polymorphism
- Constructive mathematics and computer programming
- An interpretation of Martin-Löf's type theory in a type-free theory of propositions
- Title not available (Why is that?)
Cited In (21)
- Title not available (Why is that?)
- The paradox of trees in type theory
- An adequacy theorem for dependent type theory
- A type theoretic interpretation of constructive domain theory
- Hyperfinite type structures
- Characterizing the interpretation of set theory in Martin-Löf type theory
- An information system interpretation of Martin-Löf's partial type theory with universes
- Remarks on Martin-Löf's partial type theory
- Game semantics for dependent types
- Formal definitions and proofs for partial (co)recursive functions
- European Summer Meeting of the Association for Symbolic Logic, Uppsala 1991
- Game semantics of Martin-Löf type theory
- A natural semantics of first-order type dependency
- Title not available (Why is that?)
- Title not available (Why is that?)
- Kripke Semantics for Martin-L\"of's Extensional Type Theory
- Computational foundations of basic recursive function theory
- Games for Dependent Types
- Concrete models of computation for topological algebras
- Well-ordering proofs for Martin-Löf type theory
- Kripke Semantics for Martin-Löf’s Extensional Type Theory
This page was built for publication: Domain interpretations of Martin-Löf's partial type theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q916656)
