scientific article
From MaRDI portal
Publication:3978973
zbMath0747.18004MaRDI QIDQ3978973
Publication date: 26 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
fixed pointsrecursioneffectivitysynthetic domain theory\(\omega\)-chainscpodirected unionscategories of directed complete posetscategory of modest sets in the effective toposinterpretations for recursively defined typessemi- decidable sets
Related Items
Computational adequacy for recursive types in models of intuitionistic set theory, Synthetic topology in Homotopy Type Theory for probabilistic programming, Observationally-induced Effects in Cartesian Closed Categories, The S-replete construction, Lifting as a KZ-doctrine, Quotienting the delay monad by weak bisimilarity, Foundations of dependent interoperability, Relating first-order set theories, toposes and categories of classes, On fixed-point theorems in synthetic computability, An exper model for Quest, A synthetic theory of sequential domains, Parallelism in realizability models, Metric spaces in synthetic topology, Denotational semantics of recursive types in synthetic guarded domain theory, Observationally-induced lower and upper powerspace constructions, Two models of synthetic domain theory, A presentation of the initial lift-algebra, Sobriety for equilogical spaces, The Frobenius condition, right properness, and uniform fibrations, On the structure of categories of coalgebras, Domains in \(H\), Unnamed Item, Axioms and (counter)examples in synthetic domain theory, Repleteness and the associated sheaf, The sequentially realizable functionals, A Convenient Category of Domains, Relational Parametricity for Control Considered as a Computational Effect, A type-theoretical alternative to ISWIM, CUCH, OWHY
