Pages that link to "Item:Q3956379"

The following pages link to The Category-Theoretic Solution of Recursive Domain Equations (Q3956379):

Displaying 50 items.

• Quantitative domains and infinitary algebras (Q1185015) (← links)
• New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic (Q1193588) (← links)
• Strictness analysis via abstract interpretation for recursively defined types (Q1193597) (← links)
• Complete restrictions of the intersection type discipline (Q1193654) (← links)
• Some economic applications of Scott domains (Q1196207) (← links)
• The mixed powerdomain (Q1199543) (← links)
• Algebraically compact functors (Q1208195) (← links)
• Fixed-point constructions in order-enriched categories (Q1255084) (← links)
• Categories of embeddings (Q1263665) (← links)
• Induction and recursion on the partial real line with applications to Real PCF (Q1274810) (← links)
• On functions preserving levels of approximation: A refined model construction for various lambda calculi (Q1275633) (← links)
• Structural induction and coinduction in a fibrational setting (Q1275820) (← links)
• Topology, domain theory and theoretical computer science (Q1295216) (← links)
• On a generalized product for domains (Q1311968) (← links)
• The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus (Q1314360) (← links)
• Set-theoretical and other elementary models of the \(\lambda\)-calculus (Q1314361) (← links)
• A co-induction principle for recursively defined domains (Q1318702) (← links)
• The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\) (Q1318721) (← links)
• Information categories (Q1320330) (← links)
• Banach's fixed-point theorem as a base for data-type equations (Q1330915) (← links)
• The connection between initial and unique solutions of domain equations in the partial order and metric approach (Q1377300) (← links)
• The equational logic of fixed points (Q1391734) (← links)
• Trees and semantics (Q1391740) (← links)
• Approximating labelled Markov processes (Q1398379) (← links)
• On final coalgebras of continuous functors (Q1398459) (← links)
• A domain-theoretic semantics of lax generic functions. (Q1398469) (← links)
• Infinite trees and completely iterative theories: A coalgebraic view (Q1399957) (← links)
• A fully abstract model for the \(\pi\)-calculus. (Q1400720) (← links)
• Universal coalgebra: A theory of systems (Q1583483) (← links)
• The generic approximation lemma (Q1603477) (← links)
• CSP, partial automata, and coalgebras. (Q1603814) (← links)
• Polymorphic lambda calculus and subtyping. (Q1605176) (← links)
• Fixpoint operators for domain equations (Q1605186) (← links)
• Domain theory, testing and simulation for labelled Markov processes (Q1770416) (← links)
• Categorical fixed point semantics (Q1813970) (← links)
• Infinite hypergraphs. I: Basic properties (Q1814126) (← links)
• Recursive domain equations for concrete data structure (Q1823005) (← links)
• Describing semantic domains with sprouts (Q1823713) (← links)
• Domain theoretic models of polymorphism (Q1824612) (← links)
• Equational logic of circular data type specification (Q1825026) (← links)
• Games and full abstraction for FPC. (Q1854351) (← links)
• Computational adequacy for recursive types in models of intuitionistic set theory (Q1886324) (← links)
• Models of nondeterministic regular expressions (Q1970200) (← links)
• Coalgebraic semantics for nominal automata (Q2104476) (← links)
• Weakly linear systems for matrices over the max-plus quantale (Q2128082) (← links)
• Parametrized fixed points and their applications to session types (Q2133474) (← links)
• A curry-style semantics of interaction: from untyped to second-order lazy \(\lambda\mu\)-calculus (Q2200839) (← links)
• Structural operational semantics for continuous state stochastic transition systems (Q2341700) (← links)
• Terminal coalgebras in well-founded set theory (Q2367542) (← links)
• Piecewise initial algebra semantics (Q2461761) (← links)