On the public citation graph
A Powerdomain Construction
0 signed · 596 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-06841-4_57openalex-snapshot
On the relation between direct and continuation semantics
inferredcites →https://doi.org/10.1007/3-540-07142-3_85openalex-snapshot
On the recursive specification of data types
inferredcites →https://doi.org/10.1016/0004-3702(70)90002-0openalex-snapshot
The correctness of nondeterministic programs
inferredcites →https://doi.org/10.1016/0304-3975(77)90044-5openalex-snapshot
LCF considered as a programming language
inferredcites →https://doi.org/10.1016/0304-3975(79)90053-7openalex-snapshot
Fixed-point constructions in order-enriched categories
inferredcites →https://doi.org/10.1016/s0049-237x(08)71948-7openalex-snapshot
Processes: A Mathematical Model of Computing Agents
inferredcites →https://doi.org/10.1137/0205036openalex-snapshot
The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4689710openalex-extracted
Smyth and Hoare Power Constructions Commute on All Well-Filtered Dcpos
inferred← citeshttps://doi.org/10.1002/malq.70025openalex-snapshot
The Representations of QFS‐Domains
inferred← citeshttps://doi.org/10.1002/scj.4690210803openalex-snapshot
Behavioral Specification of Nondeterministic State Machines by Event Sequence Sets
inferred← citeshttps://doi.org/10.1006/inco.1991.9999openalex-snapshot
A domain equation for bisimulation
inferred← citeshttps://doi.org/10.1006/inco.1993.1037openalex-snapshot
On Functors Expressible in the Polymorphic Typed Lambda Calculus
inferred← citeshttps://doi.org/10.1006/inco.1995.1145openalex-snapshot
Nondeterministic Extensions of Untyped λ-Calculus
inferred← citeshttps://doi.org/10.1006/inco.1996.0077openalex-snapshot
CPO Models for Compact GSOS Languages
inferred← citeshttps://doi.org/10.1006/inco.1998.2723openalex-snapshot
Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing
inferred← citeshttps://doi.org/10.1006/inco.1999.2801openalex-snapshot
Closures on CPOs Form Complete Lattices
inferred← citeshttps://doi.org/10.1007/11560586_6openalex-snapshot
A Static Analysis of PKI-Based Systems
inferred← citeshttps://doi.org/10.1007/11784180_6openalex-snapshot
Measuring the Speed of Information Leakage in Mobile Processes
inferred← citeshttps://doi.org/10.1007/11799573_17openalex-snapshot
Generality Relations in Answer Set Programming
inferred← citeshttps://doi.org/10.1007/3-540-07854-1_217openalex-snapshot
DIJKSTRA's predicate transformer, non-determinism, recursion, and termination
inferred← citeshttps://doi.org/10.1007/3-540-08442-8_65openalex-snapshot
Non deterministic recursive program schemes
inferred← citeshttps://doi.org/10.1007/3-540-08860-1_7openalex-snapshot
Stable models of typed λ-calculi
inferred← citeshttps://doi.org/10.1007/3-540-08921-7_67openalex-snapshot
Semantics of nondeterminism, concurrency and communication
inferred← citeshttps://doi.org/10.1007/3-540-09118-1_19openalex-snapshot
When are two effectively given domains identical?
inferred← citeshttps://doi.org/10.1007/3-540-09526-8_8openalex-snapshot
Full abstraction for a simple parallel programming language
inferred← citeshttps://doi.org/10.1007/3-540-10003-2_102openalex-snapshot
Computability in categories
inferred← citeshttps://doi.org/10.1007/3-540-10003-2_59openalex-snapshot
Semantics of unbounded nondeterminism
inferred← citeshttps://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferred← citeshttps://doi.org/10.1007/3-540-10007-5_35openalex-snapshot
Foundations of denotational semantics
inferred← citeshttps://doi.org/10.1007/3-540-10007-5_47openalex-snapshot
On the semantics of fair parallelism
inferred← citeshttps://doi.org/10.1007/3-540-10007-5_48openalex-snapshot
Dijkstra's predicate transformers and smyth's powerdomains
inferred← citeshttps://doi.org/10.1007/3-540-10699-5_101openalex-snapshot
On the algebraic extensions of abstract data types
inferred← citeshttps://doi.org/10.1007/3-540-10699-5_118openalex-snapshot
Using least fixed points to characterize formal computations of non-deterministic equations
inferred← citeshttps://doi.org/10.1007/3-540-10828-9_60openalex-snapshot
Une semantique pour les arbres non deterministes
inferred← citeshttps://doi.org/10.1007/3-540-10843-2_38openalex-snapshot
A cook's tour of countable nondeterminism
inferred← citeshttps://doi.org/10.1007/3-540-11494-7_13openalex-snapshot
Powerdomains and nondeterministic recursive definitions
inferred← citeshttps://doi.org/10.1007/3-540-11604-4_45openalex-snapshot
Synchronization mechanisms for parallel processing
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_112openalex-snapshot
Functional behavior of nondeterministic programs
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_127openalex-snapshot
Metrical and ordered properties of powerdomains
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_131openalex-snapshot
A note on powerdomains and modality
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_89openalex-snapshot
Experiments, powerdomains and fully abstract models for applicative multiprogramming
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_98openalex-snapshot
A complete set of axioms for a theory of communicating sequential processes
inferred← citeshttps://doi.org/10.1007/3-540-12920-0_15openalex-snapshot
Denotational semantics of concurrent programs with shared memory
inferred← citeshttps://doi.org/10.1007/3-540-12920-0_25openalex-snapshot
Logic programs and many-valued logic
inferred← citeshttps://doi.org/10.1007/3-540-12925-1_34openalex-snapshot
Implementations of nondeterministic programs
inferred← citeshttps://doi.org/10.1007/3-540-13346-1_5openalex-snapshot
Using information systems to solve reoursive domain equations effectively
inferred← citeshttps://doi.org/10.1007/3-540-15198-2_2openalex-snapshot
Specification and top down design of distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_19openalex-snapshot
The ESTEREL synchronous programming language and its mathematical semantics
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_22openalex-snapshot
Alternative semantics for McCarthy's amb
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_23openalex-snapshot
Semantics of networks containing indeterminate operators
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_24openalex-snapshot
Abstract interpretation and indeterminacy
inferred← citeshttps://doi.org/10.1007/3-540-15976-2_8openalex-snapshot
Solving type equations by graph rewriting
inferred← citeshttps://doi.org/10.1007/3-540-16078-7_64openalex-snapshot
Some probabilistic powerdomains in the category SFP
inferred← citeshttps://doi.org/10.1007/3-540-16446-4_3openalex-snapshot
The theory of strictness analysis for higher order functions
inferred← citeshttps://doi.org/10.1007/3-540-16816-8_27openalex-snapshot
Comparing categories of domains
inferred← citeshttps://doi.org/10.1007/3-540-16816-8_31openalex-snapshot
Free constructions of powerdomains
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_125openalex-snapshot
Finite approximation of spaces
inferred← citeshttps://doi.org/10.1007/3-540-17162-2_127openalex-snapshot
A note on distributive laws and power domains
inferred← citeshttps://doi.org/10.1007/3-540-17654-3_19openalex-snapshot
A formal semantics for a DataFlow Machine — Using VDM
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-18419-8_10openalex-snapshot
Designing equivalent semantic models for process creation
inferred← citeshttps://doi.org/10.1007/3-540-19020-1_11openalex-snapshot
Closure properties of a probabilistic domain construction
inferred← citeshttps://doi.org/10.1007/3-540-19020-1_15openalex-snapshot
New results on hierarchies of domains
inferred← citeshttps://doi.org/10.1007/3-540-19020-1_19openalex-snapshot
Continuous auxiliary relations
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-19488-6_125openalex-snapshot
Contractions in comparing concurrency semantics
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_133openalex-snapshot
Computations, residuals, and the power of indeterminacy
inferred← citeshttps://doi.org/10.1007/3-540-45315-6_1openalex-snapshot
Adequacy for Algebraic Effects
inferred← citeshttps://doi.org/10.1007/3-540-45449-7_13openalex-snapshot
Directions in Functional Programming for Real(-Time) Applications
inferred← citeshttps://doi.org/10.1007/3-540-45554-x_11openalex-snapshot
Approximation Spaces of Type-Free Sets
inferred← citeshttps://doi.org/10.1007/3-540-45931-6_24openalex-snapshot
Notions of Computation Determine Monads
inferred← citeshttps://doi.org/10.1007/3-540-48119-2_2openalex-snapshot
Scientific Decisions which Characterize VDM
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-49099-x_4openalex-snapshot
A Per Model of Secure Information Flow in Sequential Programs
inferred← citeshttps://doi.org/10.1007/3-540-51285-3_51openalex-snapshot
Data structures for parallel execution of functional languages
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_83openalex-snapshot
Pomset semantics for true concurrency with synchronization and recursion
inferred← citeshttps://doi.org/10.1007/3-540-52513-0_27openalex-snapshot
A naive domain universe for VDM
inferred← citeshttps://doi.org/10.1007/3-540-52592-0_59openalex-snapshot
Type inference for action semantics
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_106openalex-snapshot
A fixed-point semantics for feature type systems
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_75openalex-snapshot
Formal techniques for parallel object-oriented languages
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_74openalex-snapshot
On the semantics of atomized statements — the parallel-choice option —
inferred← citeshttps://doi.org/10.1007/3-540-55251-0_11openalex-snapshot
Must preorder in non-deterministic untyped λ-calculus
inferred← citeshttps://doi.org/10.1007/3-540-55251-0_9openalex-snapshot
Power domains supporting recursion and failure
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-55613-3_6openalex-snapshot
Formal techniques for parallel object-oriented languages
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_81openalex-snapshot
Disjunctive systems and L-Domains
inferred← citeshttps://doi.org/10.1007/3-540-56992-8_11openalex-snapshot
Comparative transition system semantics
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-57182-5_32openalex-snapshot
Filter models for a parallel and non deterministic λ-calculus
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-58338-6_82openalex-snapshot
Processes and hyperuniverses
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_89openalex-snapshot
Logic of plotkin continuous domain
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_211openalex-snapshot
Generated models and the ω-rule: The nondeterministic case
inferred← citeshttps://doi.org/10.1007/3-540-60164-3_23openalex-snapshot
The convex powerdomain in a category of posets realized by cpos
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_45openalex-snapshot
The expressive power of indeterminate primitives in asynchronous computation
inferred← citeshttps://doi.org/10.1007/3-540-61055-3_26openalex-snapshot
Some practical problems and their influence on semantics
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_44openalex-snapshot
Retracing some paths in process algebra
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_65openalex-snapshot
Truly concurrent constraint programming
inferred← citeshttps://doi.org/10.1007/3-540-62064-8_25openalex-snapshot
The disjunctive constrained lambda calculus
inferred← citeshttps://doi.org/10.1007/3-540-62064-8_31openalex-snapshot
A semantics-based determinacy analysis for prolog with cut
inferred← citeshttps://doi.org/10.1007/978-0-387-35608-2_39openalex-snapshot
Combining Computational Effects: Commutativity and Sum
inferred← citeshttps://doi.org/10.1007/978-1-4471-3166-3_4openalex-snapshot
An Iterative Powerdomain Construction
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_12openalex-snapshot
Product Operations in Strong Monads
inferred← citeshttps://doi.org/10.1007/978-1-4471-3503-6_15openalex-snapshot
Concurrency, Fairness and Logical Complexity
inferred← citeshttps://doi.org/10.1007/978-1-4471-3534-0_1openalex-snapshot
The Interplay of Theory and Practice in a Parallel Object-Oriented Language
inferred← citeshttps://doi.org/10.1007/978-1-4471-3794-8_5openalex-snapshot
A Tiny Functional Language with Logical Features
inferred← citeshttps://doi.org/10.1007/978-1-4612-4962-7_13openalex-snapshot
Order Semantics of Data Types
inferred← citeshttps://doi.org/10.1007/978-1-84882-912-1_1openalex-snapshot
Insight, Inspiration and Collaboration
inferred← citeshttps://doi.org/10.1007/978-3-030-01461-2_2openalex-snapshot
Concurrency: Handling Interference Formally
inferred← citeshttps://doi.org/10.1007/978-3-030-02928-9_6openalex-snapshot
Challenges for Formal Semantic Description: Responses from the Main Approaches
inferred← citeshttps://doi.org/10.1007/978-3-030-91631-2_21openalex-snapshot
On Orderings in Security Models
inferred← citeshttps://doi.org/10.1007/978-3-031-16912-0_8openalex-snapshot
Streams of Approximations, Equivalence of Recursive Effectful Programs
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-031-43345-0_5openalex-snapshot
Shades of Iteration: From Elgot to Kleene
inferred← citeshttps://doi.org/10.1007/978-3-031-57635-5_5openalex-snapshot
Relational Patterns, Partiality, and Set Lifting in Modal Semantics
inferred← citeshttps://doi.org/10.1007/978-3-031-66673-5_4openalex-snapshot
On the Relational Basis of Early R/G Work
inferred← citeshttps://doi.org/10.1007/978-3-031-69940-5_9openalex-snapshot
Implying and Containing in Truthmaker Semantics
inferred← citeshttps://doi.org/10.1007/978-3-032-14339-6_13openalex-snapshot
Analytic Implication and Equivalence in Truthmaker Semantics for Intuitionistic Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-08970-6_14openalex-snapshot
Formalized, Effective Domain Theory in Coq
inferred← citeshttps://doi.org/10.1007/978-3-319-15545-6_7openalex-snapshot
Logical Relations and Nondeterminism
inferred← citeshttps://doi.org/10.1007/978-3-319-25150-9_35openalex-snapshot
A Mathematical Game Semantics of Concurrency and Nondeterminism
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-54072-6_11openalex-snapshot
Continuation Passing Semantics for Membrane Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-97226-8_4openalex-snapshot
Formal Semantics of ALGOL 60: Four Descriptions in their Historical Context
inferred← citeshttps://doi.org/10.1007/978-3-540-27778-1_9openalex-snapshot
First Steps towards Computably-Infinite Information Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_12openalex-snapshot
Countable Non-Determinism and Uncountable Limits
inferred← citeshttps://doi.org/10.1007/978-3-540-70594-9_10openalex-snapshot
Asynchronous Exceptions as an Effect
inferred← citeshttps://doi.org/10.1007/978-3-540-73228-0_15openalex-snapshot
Weakly Distributive Domains
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_23openalex-snapshot
Interpreting a Finitary Pi-calculus in Differential Interaction Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-92687-0_8openalex-snapshot
A Relational Model of a Parallel and Non-deterministic λ-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-03034-5_2openalex-snapshot
Model-Driven Engineering from Modular Monadic Semantics: Implementation Techniques Targeting Hardware and Software
inferred← citeshttps://doi.org/10.1007/978-3-642-03359-9_19openalex-snapshot
A Purely Definitional Universal Domain
inferred← citeshttps://doi.org/10.1007/978-3-642-04027-6_39openalex-snapshot
Nominal Domain Theory for Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-642-22833-9_43openalex-snapshot
The Semantics of wlp and slp of Fuzzy Imperative Programming Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-24933-4_12openalex-snapshot
Towards a System Model for Ensembles
inferred← citeshttps://doi.org/10.1007/978-3-642-25560-1_24openalex-snapshot
A Semantic Hierarchy for Erasure Policies
inferred← citeshttps://doi.org/10.1007/978-3-642-32347-8_12openalex-snapshot
Applying Data Refinement for Monadic Programs to Hopcroft’s Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-82921-5_6openalex-snapshot
Extensional Behaviour of Concurrent, Nondeterministic, Communicating Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-04293-9_9openalex-snapshot
Structural Operational Semantics
inferred← citeshttps://doi.org/10.1007/978-3-662-09691-8_14openalex-snapshot
On the Algebraic Specification of Domains
inferred← citeshttps://doi.org/10.1007/978-3-662-40153-8_2openalex-snapshot
Non Deterministic Recursive Program Schemes
inferred← citeshttps://doi.org/10.1007/978-3-662-54434-1_9openalex-snapshot
Linearity, Control Effects, and Behavioral Types
inferred← citeshttps://doi.org/10.1007/978-3-663-07678-0_5openalex-snapshot
Performanzorientiertes Parsing und Grammatik-Design — das Parse Talk-System
inferred← citeshttps://doi.org/10.1007/978-94-009-0125-4_33openalex-snapshot
Embeddings of Z-Domains in Cubes
inferred← citeshttps://doi.org/10.1007/978-94-009-7893-5_16openalex-snapshot
A Fixed Point Approach to Applicative Multiprogramming
inferred← citeshttps://doi.org/10.1007/978-94-010-0413-8_1openalex-snapshot
Cartesian Closed Categories of Effective Domains
inferred← citeshttps://doi.org/10.1007/978-94-010-0654-5_10openalex-snapshot
Domains of View: A Foundation for Specification and Analysis
inferred← citeshttps://doi.org/10.1007/978-94-017-1291-0_9openalex-snapshot
A Note on Strongly Finite Sequent Structures
inferred← citeshttps://doi.org/10.1007/978-981-96-0354-1_2openalex-snapshot
Adding Concurrency to Quantum Dynamic Logic
inferred← citeshttps://doi.org/10.1007/bf00264365openalex-snapshot
Extensional equivalences for transition systems
inferred← citeshttps://doi.org/10.1007/bf00267044openalex-snapshot
On the algebraic specification of infinite objects — ordered and continuous models of algebraic types
inferred← citeshttps://doi.org/10.1007/bf00289044openalex-snapshot
Functional behavior in data spaces
inferred← citeshttps://doi.org/10.1007/bf00289245openalex-snapshot
Backtracking in recursive computations
inferred← citeshttps://doi.org/10.1007/bf00289713openalex-snapshot
A denotational semantics for shared-memory parallelism and nondeterminism
inferred← citeshttps://doi.org/10.1007/bf00290146openalex-snapshot
General correctness: A unification of partial and total correctness
inferred← citeshttps://doi.org/10.1007/bf00291051openalex-snapshot
A calculus of refinements for program derivations
inferred← citeshttps://doi.org/10.1007/bf01101651openalex-snapshot
Semantics of algorithmic languages
inferred← citeshttps://doi.org/10.1007/bf01185679openalex-snapshot
On the synthesis of function inverses
inferred← citeshttps://doi.org/10.1007/bf01211604openalex-snapshot
Predicate transformers as power operations
inferred← citeshttps://doi.org/10.1007/bf01530788openalex-snapshot
Towards reasoning about Hoare relations
inferred← citeshttps://doi.org/10.1007/bf01660035openalex-snapshot
Semantics of digital networks containing indeterminate modules
inferred← citeshttps://doi.org/10.1007/bf01744297openalex-snapshot
Formal computations of non deterministic recursive program schemes
inferred← citeshttps://doi.org/10.1007/bf01752392openalex-snapshot
Algebraic specification of data types: A synthetic approach
inferred← citeshttps://doi.org/10.1007/bf01784023openalex-snapshot
Step semantics for “true” concurrency with recursion
inferred← citeshttps://doi.org/10.1007/bf01786252openalex-snapshot
Semantics of finite and infinite networks of concurrent communicating agents
inferred← citeshttps://doi.org/10.1007/bf01786983openalex-snapshot
In Scott-Strachey style denotational semantics, parallelism implies nondeterminism
inferred← citeshttps://doi.org/10.1007/bf01887214openalex-snapshot
Issues in the design of a parallel object-oriented language
inferred← citeshttps://doi.org/10.1007/bf01888222openalex-snapshot
Equational reasoning about nondeterministic processes
inferred← citeshttps://doi.org/10.1007/bf03167919openalex-snapshot
Characterizations of semantic domains for randomized algorithms
inferred← citeshttps://doi.org/10.1007/bfb0012762openalex-snapshot
Approximations of infinitary objects
inferred← citeshttps://doi.org/10.1007/bfb0012788openalex-snapshot
A powerdomain for countable non-determinism
inferred← citeshttps://doi.org/10.1007/bfb0013038openalex-snapshot
Correctness and full abstraction of metric semantics for concurrency
inferred← citeshttps://doi.org/10.1007/bfb0014683openalex-snapshot
Semantics of nondeterministic and noncontinuous constructs
inferred← citeshttps://doi.org/10.1007/bfb0015004openalex-snapshot
Countable non-determinism and uncountable limits
inferred← citeshttps://doi.org/10.1007/bfb0015727openalex-snapshot
Linear and branching structures in the semantics and logics of reactive systems
inferred← citeshttps://doi.org/10.1007/bfb0015748openalex-snapshot
A universal domain technique for profinite posets
inferred← citeshttps://doi.org/10.1007/bfb0015753openalex-snapshot
Powerdomains as algebraic lattices preliminary report
inferred← citeshttps://doi.org/10.1007/bfb0022270openalex-snapshot
Powerdomains, powerstructures and fairness
inferred← citeshttps://doi.org/10.1007/bfb0022470openalex-snapshot
Denotational semantics of parallelism
inferred← citeshttps://doi.org/10.1007/bfb0027040openalex-snapshot
Contrasting themes in the semantics of imperative concurrency
inferred← citeshttps://doi.org/10.1007/bfb0028018openalex-snapshot
Full abstractness for a functional/concurrent language with higher-order value-passing
inferred← citeshttps://doi.org/10.1007/bfb0028024openalex-snapshot
A game-theoretic, concurrent and fair model of the typed λ-calculus, with full recursion
showing the first 200 of 587 · page through all 587
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.