On the public citation graph
Power domains and predicate transformers: A topological view
0 signed · 225 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-09526-8_8openalex-snapshot
Full abstraction for a simple parallel programming language
inferredcites →https://doi.org/10.1007/3-540-10007-5_48openalex-snapshot
Dijkstra's predicate transformers and smyth's powerdomains
inferredcites →https://doi.org/10.1007/3-540-10843-2_38openalex-snapshot
A cook's tour of countable nondeterminism
inferredcites →https://doi.org/10.1007/978-3-642-67678-9openalex-snapshot
A Compendium of Continuous Lattices
inferredcites →https://doi.org/10.1007/bfb0012788openalex-snapshot
A powerdomain for countable non-determinism
inferredcites →https://doi.org/10.1007/bfb0036936openalex-snapshot
Testing equivalences for processes
inferredcites →https://doi.org/10.1007/bfb0089908openalex-snapshot
Local compactness and continuous lattices
inferredcites →https://doi.org/10.1090/s0002-9947-1951-0042109-4openalex-snapshot
Topologies on spaces of subsets
inferredcites →https://doi.org/10.1145/800070.802188openalex-snapshot
Denotational semantics of concurrency
inferredcites →https://doi.org/10.4064/fm-113-1-21-35openalex-snapshot
Tychonoff's theorem without the axiom of choice
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1991.9999openalex-snapshot
A domain equation for bisimulation
inferred← citeshttps://doi.org/10.1006/inco.1995.1143openalex-snapshot
On Some Decision Problems in Programming
inferred← citeshttps://doi.org/10.1006/inco.1999.2827openalex-snapshot
Toward an Infinitary Logic of Domains: Abramsky Logic for Transition Systems
inferred← citeshttps://doi.org/10.1006/inco.2001.3073openalex-snapshot
Clausal Logic and Logic Programming in Algebraic Domains
inferred← citeshttps://doi.org/10.1007/11408017_7openalex-snapshot
Assertions, Conditionals, and Defaults
inferred← citeshttps://doi.org/10.1007/11787006_31openalex-snapshot
Descriptive and Relative Completeness of Logics for Higher-Order Functions
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_352openalex-snapshot
Compactness in semantics for merge and fair merge
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_12openalex-snapshot
Categories of models for concurrency
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_17openalex-snapshot
Applications of topology to semantics of communicating processes
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_3openalex-snapshot
On the composition and decomposition of assertions
inferred← citeshttps://doi.org/10.1007/3-540-16042-6_22openalex-snapshot
A complete proof system for SCCS with modal assertions
inferred← citeshttps://doi.org/10.1007/3-540-16816-8_27openalex-snapshot
Comparing categories of domains
inferred← citeshttps://doi.org/10.1007/3-540-17162-2_121openalex-snapshot
Category theory and programming language semantics: An overview
inferred← citeshttps://doi.org/10.1007/3-540-17162-2_123openalex-snapshot
A categorical view of weakest liberal preconditions
inferred← citeshttps://doi.org/10.1007/3-540-17162-2_125openalex-snapshot
Finite approximation of spaces
inferred← citeshttps://doi.org/10.1007/3-540-17660-8_59openalex-snapshot
Applications of compactness in the Smyth powerdomain of streams
inferred← citeshttps://doi.org/10.1007/3-540-19020-1_12openalex-snapshot
Quasi-uniformities: Reconciling domains with metric spaces
inferred← citeshttps://doi.org/10.1007/3-540-19020-1_7openalex-snapshot
The versatile continuous order
inferred← citeshttps://doi.org/10.1007/3-540-19020-1_9openalex-snapshot
The metric closure powerspace construction
inferred← citeshttps://doi.org/10.1007/3-540-45793-3_15openalex-snapshot
A Logic for Probabilities in Semantics
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_24openalex-snapshot
On the Semantics of Refinement Calculi
inferred← citeshttps://doi.org/10.1007/3-540-48483-3_20openalex-snapshot
Modular Specification of Concurrent Systems with Observational Logic
inferred← citeshttps://doi.org/10.1007/3-540-48919-3_8openalex-snapshot
Erratic Fudgets: A Semantic Theory for an Embedded Coordination Language
inferred← citeshttps://doi.org/10.1007/3-540-51722-7_6openalex-snapshot
Foundations are rich institutions, but institutions are poor foundations
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_94openalex-snapshot
Geometric logic, causality and event structures
inferred← citeshttps://doi.org/10.1007/3-540-55511-0_14openalex-snapshot
An upper power domain construction in terms of strongly compact sets
inferred← citeshttps://doi.org/10.1007/3-540-56596-5_30openalex-snapshot
Semantics, orderings and recursion in the weakest precondition calculus
inferred← citeshttps://doi.org/10.1007/3-540-56596-5_40openalex-snapshot
Infinite behaviour and fairness in concurrent constraint programming
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_22openalex-snapshot
Isomorphisms between predicate and state transformers
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_127openalex-snapshot
Relating multifunctions and predicate transformers through closure operators
inferred← citeshttps://doi.org/10.1007/3-540-58027-1_20openalex-snapshot
Probabilistic power domains, information systems, and locales
inferred← citeshttps://doi.org/10.1007/978-1-4471-3215-8_9openalex-snapshot
A Semantics for Locally Bottom-Avoiding Choice
inferred← citeshttps://doi.org/10.1007/978-1-4471-3503-6_7openalex-snapshot
Dynamical systems, Measures and Fractals via Domain Theory
inferred← citeshttps://doi.org/10.1007/978-1-4471-3540-1_19openalex-snapshot
Z! In Progress: Maintaining Z specifications
inferred← citeshttps://doi.org/10.1007/978-3-030-51466-2_3openalex-snapshot
Some Notes on Spaces of Ideals and Computable Topology
inferred← citeshttps://doi.org/10.1007/978-3-031-24117-8_4openalex-snapshot
A Cook’s Tour of Duality in Logic: From Quantifiers, Through Vietoris, to Measures
inferred← citeshttps://doi.org/10.1007/978-3-319-27810-0_13openalex-snapshot
Guards, Failure, and Partiality: Dijkstra’s Guarded-Command Language Formulated Topologically
inferred← citeshttps://doi.org/10.1007/978-3-319-64021-1_3openalex-snapshot
Overview of Formal Methods
inferred← citeshttps://doi.org/10.1007/978-3-319-98654-8_13openalex-snapshot
Inequalities for One-Step Products
inferred← citeshttps://doi.org/10.1007/978-3-540-71200-8_15openalex-snapshot
Formal Topology and Information Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-78791-4_17openalex-snapshot
Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models
inferred← citeshttps://doi.org/10.1007/978-3-642-03237-0_20openalex-snapshot
Abstract Interpretation from a Topological Perspective
inferred← citeshttps://doi.org/10.1007/978-3-642-03741-2_20openalex-snapshot
A Duality Theorem for Real C * Algebras
inferred← citeshttps://doi.org/10.1007/978-3-642-29485-3_28openalex-snapshot
Dexter Kozen’s Influence on the Theory of Labelled Markov Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-36976-6_14openalex-snapshot
The Duality of State and Observation in Probabilistic Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-38164-5_12openalex-snapshot
Continuous Domain Theory in Logical Form
inferred← citeshttps://doi.org/10.1007/978-94-010-0654-5_3openalex-snapshot
U K -Admitting DCPOS Need not be Sober
inferred← citeshttps://doi.org/10.1007/978-94-017-1201-9_11openalex-snapshot
Quantales and Observational Semantics
inferred← citeshttps://doi.org/10.1007/bf01210999openalex-snapshot
Data refinement, call by value and higher order programs
inferred← citeshttps://doi.org/10.1007/bf01211604openalex-snapshot
Predicate transformers as power operations
inferred← citeshttps://doi.org/10.1007/bf01213492openalex-snapshot
Refinement-oriented probability for CSP
inferred← citeshttps://doi.org/10.1007/bf01213603openalex-snapshot
The weakest precondition calculus: Recursion and duality
inferred← citeshttps://doi.org/10.1007/bf02207025openalex-snapshot
New results in the theory of multivalued mappings. I. Topological characteristics and solvability of operator relations
inferred← citeshttps://doi.org/10.1007/bfb0014442openalex-snapshot
A theory-based topological notion of institution
inferred← citeshttps://doi.org/10.1007/bfb0014553openalex-snapshot
Infinitary domain logic for finitary transition systems
inferred← citeshttps://doi.org/10.1007/bfb0015739openalex-snapshot
Towards a uniform topological treatment of streams and functions on streams
inferred← citeshttps://doi.org/10.1007/bfb0021980openalex-snapshot
Reasoning about knowledge on computation trees
inferred← citeshttps://doi.org/10.1007/bfb0022654openalex-snapshot
A categorical treatment of pre- and post- conditions
inferred← citeshttps://doi.org/10.1007/bfb0028019openalex-snapshot
A duality theory for quantitative semantics
inferred← citeshttps://doi.org/10.1007/bfb0036892openalex-snapshot
Automata, Languages and Programming
inferred← citeshttps://doi.org/10.1007/bfb0086126openalex-snapshot
A characterization of effective topological spaces
inferred← citeshttps://doi.org/10.1007/pl00003923openalex-snapshot
Unification of Four Versions of Program Semantics
inferred← citeshttps://doi.org/10.1007/s00233-008-9078-0openalex-snapshot
Topological cones: functional analysis in a T0-setting
inferred← citeshttps://doi.org/10.1007/s00236-007-0049-9openalex-snapshot
Dual unbounded nondeterminacy, recursion, and fixpoints
inferred← citeshttps://doi.org/10.1007/s00236-008-0076-1openalex-snapshot
Modelling higher-order dual nondeterminacy
inferred← citeshttps://doi.org/10.1007/s10485-019-09582-wopenalex-snapshot
The Vietoris Monad and Weak Distributive Laws
inferred← citeshttps://doi.org/10.1007/s11083-014-9327-7openalex-snapshot
The Equivalence of QRB, QFS, and Compactness for Quasicontinuous Domains
inferred← citeshttps://doi.org/10.1007/s11229-022-03689-9openalex-snapshot
The introduction of topology into analytic philosophy: two movements and a coda
inferred← citeshttps://doi.org/10.1016/0022-4049(93)90059-3openalex-snapshot
Domains arising as algebras for powerspace constructions
inferred← citeshttps://doi.org/10.1016/0166-8641(95)00013-7openalex-snapshot
Constructing a quasi-uniform function space
inferred← citeshttps://doi.org/10.1016/0167-6423(91)90037-xopenalex-snapshot
Power domain constructions
inferred← citeshttps://doi.org/10.1016/0168-0072(91)90065-topenalex-snapshot
Domain theory in logical form*
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90045-9openalex-snapshot
Merging regular processes by means of fixed-point theory
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90025-9openalex-snapshot
A categorical treatment of pre- and post-conditions
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90042-4openalex-snapshot
Applications of compactness in the Smyth powerdomain of streams
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90182-sopenalex-snapshot
Power domains and second-order predicates
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00048-2openalex-snapshot
Duality beyond sober spaces: Topological spaces and observation frames
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00050-7openalex-snapshot
Domain theory and integration
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00250-2openalex-snapshot
PCF extended with real numbers
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90004-lopenalex-snapshot
Inverse image analysis generalises strictness analysis
inferred← citeshttps://doi.org/10.1016/b978-0-934613-04-0.50032-6openalex-snapshot
A Framework for Intuitionistic Modal Logics
inferred← citeshttps://doi.org/10.1016/j.apal.2008.06.020openalex-snapshot
A Minkowski type duality mediating between state and predicate transformer semantics for a probabilistic nondeterministic language
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.06.063openalex-snapshot
RETRACTED: Semantic Domains for Combining Probability and Non-Determinism
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.033openalex-snapshot
A Hofmann-Mislove theorem for Bitopological Spaces
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.12.023openalex-snapshot
On the Continuity of Effective Multifunctions
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.01.002openalex-snapshot
Semantic Domains for Combining Probability and Non-Determinism
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.082openalex-snapshot
Abstract Interpretation From a Denotational-semantics Perspective
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.086openalex-snapshot
Extending Algebraic Operations to D-Completions
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.092openalex-snapshot
Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting
inferred← citeshttps://doi.org/10.1016/j.entcs.2013.09.015openalex-snapshot
Quasicontinuous Domains and the Smyth Powerdomain
inferred← citeshttps://doi.org/10.1016/j.entcs.2014.10.012openalex-snapshot
A Metrized Duality Theorem for Markov Processes
inferred← citeshttps://doi.org/10.1016/j.entcs.2015.12.016openalex-snapshot
Healthiness Conditions for Predicate Transformers
inferred← citeshttps://doi.org/10.1016/j.entcs.2017.08.012openalex-snapshot
Characterizing Consistent Smyth Powerdomains by FS -∧ ↑ -domains
inferred← citeshttps://doi.org/10.1016/j.entcs.2018.03.029openalex-snapshot
Non-deterministic Effects in a Realizability Model
inferred← citeshttps://doi.org/10.1016/j.fss.2011.07.001openalex-snapshot
Interweaving algebra and topology: Lattice-valued topological systems
inferred← citeshttps://doi.org/10.1016/j.geomphys.2022.104730openalex-snapshot
On the geometry of physical measurements: Topological and algebraic aspects
inferred← citeshttps://doi.org/10.1016/j.ic.2008.12.003openalex-snapshot
Operational domain theory and topology of sequential programming languages
inferred← citeshttps://doi.org/10.1016/j.ins.2008.01.016openalex-snapshot
Domain semantics of possibility computations
inferred← citeshttps://doi.org/10.1016/j.jlamp.2014.11.004openalex-snapshot
Observationally-induced lower and upper powerspace constructions
inferred← citeshttps://doi.org/10.1016/j.jlap.2008.02.007openalex-snapshot
A Hofmann–Mislove theorem for bitopological spaces
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.06.021openalex-snapshot
The probabilistic powerdomain for stably compact spaces
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.01.021openalex-snapshot
Semantics of a sequential language for exact real-number computation
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.029openalex-snapshot
Relating direct and predicate transformer partial correctness semantics for an imperative probabilistic-nondeterministic language
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.02.015openalex-snapshot
Extending algebraic operations to D -completions
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.002openalex-snapshot
Inverse-limit and topological aspects of abstract interpretation
inferred← citeshttps://doi.org/10.1016/j.topol.2014.05.023openalex-snapshot
Consistent Smyth powerdomains
inferred← citeshttps://doi.org/10.1016/j.topol.2014.09.002openalex-snapshot
Consistent Hoare powerdomains
inferred← citeshttps://doi.org/10.1016/j.topol.2014.10.010openalex-snapshot
Consistent Plotkin powerdomains
inferred← citeshttps://doi.org/10.1016/j.topol.2017.06.016openalex-snapshot
Consistent Smyth powerdomains of topological spaces and quasicontinuous domains
inferred← citeshttps://doi.org/10.1016/j.topol.2017.09.006openalex-snapshot
Consistent Hoare powerdomains over dcpos
inferred← citeshttps://doi.org/10.1016/j.topol.2026.109918openalex-snapshot
On the preservation of projective limits by functors of probabilistic and of non-deterministic choice
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80032-7openalex-snapshot
Functional behavior of nondeterministic and concurrent programs
inferred← citeshttps://doi.org/10.1016/s0166-8641(97)00222-8openalex-snapshot
Topology, domain theory and theoretical computer science
inferred← citeshttps://doi.org/10.1016/s0166-8641(97)00225-3openalex-snapshot
Properly injective spaces and function spaces
inferred← citeshttps://doi.org/10.1016/s0167-6423(02)00088-6openalex-snapshot
Erratic Fudgets: a semantic theory for an embedded coordination language
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00222-xopenalex-snapshot
Characterising FS domains by means of power domains
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00050-3openalex-snapshot
Limiting semantics of numerical programs
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00099-1openalex-snapshot
Induction and recursion on the partial real line with applications to Real PCF
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00023-4openalex-snapshot
Denotational Models for Unbounded Nondeterminism
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00025-8openalex-snapshot
Universality and Powerdomains
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00287-7openalex-snapshot
Powerdomains and zero finding
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00332-9openalex-snapshot
Continuous Domains in Logical Form1 1A thesis submitted to The University of Birmingham for the degree of Doctor of Philosophy, June 1999.
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80014-8openalex-snapshot
Maximal Limit Spaces, Powerspaces, and Scott Domains
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80076-8openalex-snapshot
On the Compact-regular Coreflection of a Stably Compact Locale
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)00333-6openalex-snapshot
Continuous Domains in Logical Form
inferred← citeshttps://doi.org/10.1016/s1874-5857(09)70018-4openalex-snapshot
Lambda-Calculus and Combinators in the 20th Century
inferred← citeshttps://doi.org/10.1017/s0305004105008844openalex-snapshot
A categorical account of the Hofmann–Mislove theorem
inferred← citeshttps://doi.org/10.1017/s0960129504004402openalex-snapshot
Operations and equations for coalgebras
inferred← citeshttps://doi.org/10.1017/s0960129506005251openalex-snapshot
Quantum weakest preconditions
inferred← citeshttps://doi.org/10.1017/s0960129509007555openalex-snapshot
Predicate transformers for extended probability and non-determinism
inferred← citeshttps://doi.org/10.1017/s096012950999034xopenalex-snapshot
Domain representations of spaces of compact subsets
inferred← citeshttps://doi.org/10.1017/s0960129511000053openalex-snapshot
Domains occur among spaces as strict algebras among lax
inferred← citeshttps://doi.org/10.1017/s0960129512000965openalex-snapshot
The algebra of multirelations
inferred← citeshttps://doi.org/10.1017/s0960129524000173openalex-snapshot
Countability constraints in order-theoretic approaches to computability
inferred← citeshttps://doi.org/10.1017/s0960129598002552openalex-snapshot
A categorical model for higher order imperative programming
inferred← citeshttps://doi.org/10.1017/s1755020320000222openalex-snapshot
THE LOGIC OF INFORMATION IN STATE SPACES
inferred← citeshttps://doi.org/10.1080/01445340.2015.1054576openalex-snapshot
Continuity in Semantic Theories of Programming
inferred← citeshttps://doi.org/10.1109/grc.2005.1547363openalex-snapshot
Information quanta and approximation spaces. I. Non-classical approximation operators
inferred← citeshttps://doi.org/10.1109/imcsit.2010.5679939openalex-snapshot
A security model for personal information security management based on partial approximative set theory
inferred← citeshttps://doi.org/10.1109/lics.1994.316080openalex-snapshot
Domain theory and integration
inferred← citeshttps://doi.org/10.1109/lics.2004.1319637openalex-snapshot
Semantics of a sequential language for exact real-number computation
inferred← citeshttps://doi.org/10.1109/lics.2005.34openalex-snapshot
Operational Domain Theory and Topology of a Sequential Programming Language
inferred← citeshttps://doi.org/10.1109/lics.2013.33openalex-snapshot
A Relatively Complete Generic Hoare Logic for Order-Enriched Effects
inferred← citeshttps://doi.org/10.1109/lics.2013.38openalex-snapshot
Stone Duality for Markov Processes
inferred← citeshttps://doi.org/10.1109/lics.2013.64openalex-snapshot
Duality in Logic and Computation
inferred← citeshttps://doi.org/10.1109/lics.2017.8005143openalex-snapshot
Differentiation in logical form
inferred← citeshttps://doi.org/10.1109/lics.2019.8785680openalex-snapshot
The convex hull of finitely generable subsets and its predicate transformer
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1996.tb49175.xopenalex-snapshot
Largest Proper Ideals of Transformation Semigroups
inferred← citeshttps://doi.org/10.1142/s0219498826501318openalex-snapshot
Concrete constructions of noncommutative free dcpo semigroups
inferred← citeshttps://doi.org/10.1145/1391956.1391961openalex-snapshot
Dually nondeterministic functions
inferred← citeshttps://doi.org/10.1145/166589.990816openalex-snapshot
Book Review: Programs, Recursion and Unbounded Choice. By Wim H. Hesselink. (Cambridge University Press, 1992. xii+223 pages. ISBN 0-521-40436-3. $39 .95)
inferred← citeshttps://doi.org/10.1145/174675.176925openalex-snapshot
Proving concurrent constraint programs correct
inferred← citeshttps://doi.org/10.1145/248621.248623openalex-snapshot
Algebraic approaches to nondeterminism—an overview
inferred← citeshttps://doi.org/10.1145/265943.265954openalex-snapshot
Proving concurrent constraint programs correct
inferred← citeshttps://doi.org/10.1145/289423.289441openalex-snapshot
Lazy computation with exact real numbers
inferred← citeshttps://doi.org/10.1145/291251.289441openalex-snapshot
Lazy computation with exact real numbers
inferred← citeshttps://doi.org/10.1145/3373718.3394807openalex-snapshot
Modal Intuitionistic Logics as Dialgebraic Logics
inferred← citeshttps://doi.org/10.1145/3477355.3477369openalex-snapshot
Hoare and He’s Unifying Theories of Programming
inferred← citeshttps://doi.org/10.1145/3571740openalex-snapshot
Reconciling Shannon and Scott with a Lattice of Computable Information
inferred← citeshttps://doi.org/10.1145/3720457openalex-snapshot
Adequacy for Algebraic Effects Revisited
inferred← citeshttps://doi.org/10.1145/3776699openalex-snapshot
Domain-Theoretic Semantics for Functional Logic Programming
inferred← citeshttps://doi.org/10.1145/503272.503288openalex-snapshot
Stochastic lambda calculus and monads of probability distributions
inferred← citeshttps://doi.org/10.1145/565816.503288openalex-snapshot
Stochastic lambda calculus and monads of probability distributions
inferred← citeshttps://doi.org/10.1145/96709.96741openalex-snapshot
Relating total and partial correctness interpretations of non-deterministic programs
inferred← citeshttps://doi.org/10.1216/rmj-2018-48-5-1551openalex-snapshot
The upper Vietoris topology on the space of inverse-closed subsets of a spectral space and applications
inferred← citeshttps://doi.org/10.2168/lmcs-7(4:1)2011openalex-snapshot
Computational Models of Certain Hyperspaces of Quasi-metric Spaces
inferred← citeshttps://doi.org/10.2178/jsl/1268917496openalex-snapshot
Effectivity and effective continuity of multifunctions
inferred← citeshttps://doi.org/10.23638/lmcs-13(2:6)2017openalex-snapshot
A Recipe for State-and-Effect Triangles
inferred← citeshttps://doi.org/10.23638/lmcs-15(3:13)2019openalex-snapshot
On the commutativity of the powerspace constructions
inferred← citeshttps://doi.org/10.3233/com-150044openalex-snapshot
Base-complexity classifications of qcb0-spaces1
inferred← citeshttps://doi.org/10.3233/fi-1995-22125openalex-snapshot
ADJUNCTIONS BETWEEN CATEGORIES OF DOMAINS
showing the first 200 of 212 · page through all 212
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.