The following pages link to (Q3138538):
Displaying 23 items.
- Two models of synthetic domain theory (Q678839) (← links)
- A presentation of the initial lift-algebra (Q678845) (← links)
- Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure (Q890383) (← links)
- Synthetic domain theory and models of linear Abadi {\&} Plotkin logic (Q952487) (← links)
- Equational properties of iteration in algebraically complete categories (Q1128480) (← links)
- Induction and recursion on the partial real line with applications to Real PCF (Q1274810) (← links)
- Structural induction and coinduction in a fibrational setting (Q1275820) (← links)
- Topology, domain theory and theoretical computer science (Q1295216) (← links)
- The equational logic of fixed points (Q1391734) (← links)
- Fixpoint operators for domain equations (Q1605186) (← links)
- Games and full abstraction for FPC. (Q1854351) (← links)
- Computational adequacy for recursive types in models of intuitionistic set theory (Q1886324) (← links)
- Game-theoretic analysis of call-by-value computation (Q1960532) (← links)
- Coalgebraic semantics for nominal automata (Q2104476) (← links)
- Parametrized fixed points and their applications to session types (Q2133474) (← links)
- Recursive coalgebras from comonads (Q2495640) (← links)
- Unique, guarded fixed points in an additive setting (Q2842814) (← links)
- A Convenient Category of Domains (Q2864147) (← links)
- The Bicategory-Theoretic Solution of Recursive Domain Equations (Q2864151) (← links)
- Some Domain Theory and Denotational Semantics in Coq (Q3183523) (← links)
- Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion (Q4921510) (← links)
- The convex powerdomain in a category of posets realized by cpos (Q5057469) (← links)
- Computational adequacy via ‘mixed’ inductive definitions (Q5890041) (← links)
