scientific article
From MaRDI portal
Publication:3138538
zbMath0803.18002MaRDI QIDQ3138538
Publication date: 18 November 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Partial orders, general (06A06) Functor categories, comma categories (18A25) Categories and theories (18C99) Theory of computing (68Q99)
Related Items (23)
Computational adequacy via ‘mixed’ inductive definitions ⋮ Parametrized fixed points and their applications to session types ⋮ Computational adequacy for recursive types in models of intuitionistic set theory ⋮ The convex powerdomain in a category of posets realized by cpos ⋮ Some Domain Theory and Denotational Semantics in Coq ⋮ Equational properties of iteration in algebraically complete categories ⋮ The equational logic of fixed points ⋮ Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure ⋮ Game-theoretic analysis of call-by-value computation ⋮ Two models of synthetic domain theory ⋮ A presentation of the initial lift-algebra ⋮ Synthetic domain theory and models of linear Abadi {\&} Plotkin logic ⋮ Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion ⋮ Recursive coalgebras from comonads ⋮ Induction and recursion on the partial real line with applications to Real PCF ⋮ Structural induction and coinduction in a fibrational setting ⋮ Unique, guarded fixed points in an additive setting ⋮ Topology, domain theory and theoretical computer science ⋮ Games and full abstraction for FPC. ⋮ A Convenient Category of Domains ⋮ The Bicategory-Theoretic Solution of Recursive Domain Equations ⋮ Coalgebraic semantics for nominal automata ⋮ Fixpoint operators for domain equations
This page was built for publication:
