The following pages link to (Q4288818):
Displaying 50 items.
- Nondeterministic semantics of compound diagrams (Q258605) (← links)
- Representations of algebraic domains and algebraic L-domains by information systems (Q276406) (← links)
- Intuitionistic completeness of first-order logic (Q392280) (← links)
- Inverse-limit and topological aspects of abstract interpretation (Q418811) (← links)
- Strong normalisation in the \(\pi\)-calculus (Q598201) (← links)
- Metric completion versus ideal completion (Q672047) (← links)
- Proving properties of typed \(\lambda\)-terms using realizability, covers, and sheaves (Q673628) (← links)
- Two models of synthetic domain theory (Q678839) (← links)
- A characterization of the least-fixed-point operator by dinaturality (Q685386) (← links)
- Generalised information systems capture L-domains (Q831140) (← links)
- A calculus and logic of resources and processes (Q855007) (← links)
- On the relations between monadic semantics (Q879354) (← links)
- A representation of L-domains by information systems (Q896923) (← links)
- Information systems revisited -- the general continuous case (Q949623) (← links)
- Lifting non-finite axiomatizability results to extensions of process algebras (Q969643) (← links)
- Operational domain theory and topology of sequential programming languages (Q1013087) (← links)
- Entailment-based actions for coordination (Q1127518) (← 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)
- A behavioural theory of first-order CML (Q1285654) (← links)
- Decidability of behavioural equivalence in unary PCF (Q1285665) (← links)
- Properly injective spaces and function spaces (Q1295213) (← links)
- Topology, domain theory and theoretical computer science (Q1295216) (← links)
- Historical introduction to ``Concrete domains'' by G. Kahn and G. D. Plotkin (Q1314353) (← links)
- A type-theoretical alternative to ISWIM, CUCH, OWHY (Q1314363) (← links)
- Variations on the bagdomain theme (Q1349648) (← links)
- Computational adequacy of the FIX-logic (Q1349677) (← links)
- PCF extended with real numbers (Q1349926) (← links)
- On representation and querying incomplete information in databases with bags (Q1350296) (← links)
- Kripke models and the (in)equational logic of the second-order \(\lambda\)-calculus (Q1356979) (← links)
- Full abstraction for the second order subset of an Algol-like language (Q1369235) (← links)
- Models of approximation in databases (Q1389445) (← links)
- Domain-independent queries on databases with external functions (Q1389449) (← links)
- The common order-theoretic structure of version spaces and ATMSs (Q1389537) (← links)
- Trees and semantics (Q1391740) (← links)
- Limiting semantics of numerical programs (Q1392276) (← links)
- A characterization of partial metrizability: Domains are quantifiable. (Q1427788) (← links)
- Hybrid I/O automata. (Q1427865) (← links)
- Local properties of query languages (Q1575140) (← links)
- A fully abstract denotational semantics for the \(\pi\)-calculus (Q1605174) (← links)
- On the Yoneda completion of a quasi-metric space (Q1605178) (← links)
- Observational heterarchy enhancing active coupling (Q1765313) (← links)
- Subtyping recursion and parametric polymorphism in kernel Fun (Q1780453) (← links)
- Orthomodular lattice obtained from addressing a fixed point (Q1808259) (← links)
- Two-level languages for program optimization (Q1826626) (← links)
- The correspondence between partial metrics and semivaluations (Q1826629) (← links)
- Basic theory of \(F\)-bounded quantification. (Q1854309) (← links)
- Relational interpretations of recursive types in an operational setting. (Q1854316) (← links)
- Games and full abstraction for FPC. (Q1854351) (← links)
- Integration in Real PCF (Q1854356) (← links)
