A Convenient Category of Domains

No abstract is available for this paper.

• Publication year

  2007

• Venue

  Computation, Meaning, and Logic

• Publication date

  2007-04-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.entcs.2007.02.004
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Computable Analysis: An Introduction

  2014cited by this paper
• A Category of Topological Predomains

  2008cited by this paper
• Two preservation results for countable products of sequential spaces

  2007cited by this paper
• Computational Effects in Topological Domain Theory

  2006influential reference
• Compactly generated domain theory

  2006cited by this paper
• Computable Analysis

  2005cited by this paper
• Under consideration for publication in Math. Struct. in Comp. Science Quotients of countably based spaces are not

  2005cited by this paper
• Equilogical spaces

  2004cited by this paper
• Using Synthetic Domain Theory to Prove Operational Properties of a Polymorphic Programming Language Based on Strictness

  2004cited by this paper
• Synthetic Topology: of Data Types and Classical Spaces

  2004cited by this paper
• Continuous Lattices and Domains

  2003cited by this paper
• Admissible representations for continuous computations

  2003influential reference
• Type Theory and Recursion Extended Abstract

  2003cited by this paper
• Towards a Convenient Category of Topological Domains

  2003cited by this paper
• Extended admissibility

  2002cited by this paper
• Foundations of Topology: An Approach to Convenient Topology

  2002cited by this paper
• A universal characterization of the closed Euclidean interval

  2001cited by this paper
• Axioms and (counter) examples in synthetic domain theory

  2000cited by this paper
• Topology via Logic

  1999cited by this paper
• Under consideration for publication in Math. Struct. in Comp. Science Topological and Limit-space Subcategories of Countably-based Equilogical Spaces

  1999cited by this paper
• Axiomatic domain theory in categories of partial maps

  1998influential reference
• A uniform approach to domain theory in realizability models

  1997cited by this paper
• The troublesome probabilistic powerdomain

  1997cited by this paper
• General synthetic domain theory – a logical approach

  1997cited by this paper
• Domain theory

  1995cited by this paper
• Realizability toposes and language semantics

  1995cited by this paper
• An axiomatisation of computationally adequate domain theoretic models of FPC

  1994cited by this paper
• Probabilistic Domains

  1994cited by this paper
• Applications of Categories in Computer Science: Remarks on algebraically compact categories

  1992cited by this paper
• Algebraically complete categories

  1991cited by this paper
• Notions of Computation and Monads

  1991cited by this paper
• First steps in synthetic domain theory

  1991cited by this paper
• A Note on Inconsistencies Caused by Fixpoints in a Cartesian Closed Category

  1990cited by this paper
• The Discrete Objects in the Effective Topos

  1990cited by this paper
• Effective domains and intrinsic structure

  1990cited by this paper
• Probabilistic non-determinism

  1990cited by this paper
• The classification of continuous domains

  1990cited by this paper
• A probabilistic powerdomain of evaluations

  1989cited by this paper
• A SMALL COMPLETE CATEGORY

  1988cited by this paper
• Types, Abstraction and Parametric Polymorphism

  1983cited by this paper
• Dedekind complete posets and scott topologies

  1981cited by this paper
• Filter spaces and continuous functionals

  1979cited by this paper
• Full Abstraction for a Simple Parallel Programming Language

  1979cited by this paper
• Category theory

  1979cited by this paper
• The category-theoretic solution of recursive domain equations

  1977cited by this paper
• A Powerdomain Construction

  1976cited by this paper
• A convenient category of topological spaces.

  1967cited by this paper
• Spaces in which sequences suffice

  1965cited by this paper
• FUNCTION SPACES AND PRODUCT TOPOLOGIES

  1964cited by this paper
• Edinburgh Research Explorer Computational effects and operations: an overview

  year unknowncited by this paper
• LSU Digital Commons LSU Digital Commons Comparing Cartesian closed categories of (core) compactly Comparing Cartesian closed categories of (core) compactly generated spaces generated spaces

  year unknowncited by this paper

• A topologically enriched probability monad on the Cartesian closed category of CGWH spaces

  2024influential citation
• Rigorous Function Calculi in Ariadne

  2023cites this paper
• A note on the category of c-spaces

  2022cites this paper
• Admissibly Represented Spaces and Qcb-Spaces

  2020cites this paper
• PλωNK: functional probabilistic NetKAT

  2019cites this paper
• An Application of Computable Distributions to the Semantics of Probabilistic Programs

  2018cites this paper
• A domain theory for statistical probabilistic programming

  2018cites this paper
• On Programming Languages for Probabilistic Modeling

  2017influential citation
• On the commutativity of the powerspace constructions

  2017cites this paper
• A convenient category for higher-order probability theory

  2017cites this paper
• Welcome Address Welcome to PhDs in Logic VIII ! “ PhDs in Logic

  2016cites this paper
• Computability in Basic Quantum Mechanics

  2016influential citation
• University of Birmingham The intrinsic topology of Martin-Löf universes

  2016cites this paper
• The intrinsic topology of Martin-Löf universes

  2016cites this paper
• Weak upper topologies and duality for cones

  2015cites this paper
• Full Abstraction for Probabilistic PCF

  2015influential citation
• Weak upper topologies and duality

  2015cites this paper
• Healthiness Conditions for Predicate Transformers

  2015cites this paper
• The extensional realizability model of continuous functionals and three weakly non-constructive classical theorems

  2015cites this paper
• Co)algebraic Foundations for Effectful Recursive Definitions

  2014cites this paper
• Algorithmic solution of higher type equations

  2013cites this paper
• The universe is indiscrete

  2013cites this paper
• Comparing approaches to free dcpo-algebra constructions

  2013cites this paper
• Combinatory algebras of functions and their modest sets

  2012cites this paper
• Observationally-induced Effects in Cartesian Closed Categories

  2012cites this paper
• Relative Completeness for Logics of Functional Programs

  2011cites this paper
• Banach Spaces as Data Types

  2011cites this paper
• University of Birmingham Selection Functions, Bar Recursion and Backward Induction

  2010cites this paper
• Domain Representable Spaces Defined by Strictly Positive Induction

  2010influential citation
• Selection functions, bar recursion and backward induction

  2010cites this paper
• Comparing free algebras in Topological and Classical Domain Theory

  2010cites this paper
• A Note on Closed Subsets in Quasi-zero-dimensional Qcb-spaces

  2010cites this paper
• Topological properties of concept spaces (full version)

  2010cites this paper
• Computable analysis with applications to dynamic systems

  2010cites this paper
• omega-QRB-Domains and the Probabilistic Powerdomain

  2010cites this paper
• Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting

  2009cites this paper
• A rich hierarchy of functionals of finite types

  2009cites this paper
• Partial Combinatory Algebras of Functions

  2009cites this paper
• Computability of Continuous Solutions of Higher-Type Equations

  2009cites this paper
• A computable type theory for control systems

  2009cites this paper
• Selection Functions , Bar Recursion , and Backward Induction

  2009cites this paper
• Computable de Finetti measures

  2009cites this paper
• On the Relationship between Filter Spaces and Weak Limit Spaces

  2008cites this paper
• Exhaustible Sets in Higher-type Computation

  2008influential citation
• An Effective Tietze-Urysohn Theorem for QCB-Spaces: (Extended Abstract)

  2008cites this paper
• Topological domain theory

  2008cites this paper
• Infinite sets that admit fast exhaustive search

  2007cites this paper
• Two Probabilistic Powerdomains in Topological Domain Theory

  2006cites this paper
• Unifying Semantics for Programming and Verification

  year unknowncites this paper
• Edinburgh Research Explorer A Convenient Category for Higher-Order Probability Theory

  year unknowncites this paper
• Antrag auf Förderung einer wissenschaftlichen Zusammenarbeit zwischen Deutschland und Großbritannien

  year unknowncites this paper