Proofs and types
Theoretical Computer Science
Non-deterministic information systems and their domains
Theoretical Computer Science
Logic of domains
Information systems for continuous posets
Theoretical Computer Science
dI-Domains as prime information systems
Information and Computation
Information and Computation
Information and Computation
Mathematical theory of domains
Mathematical theory of domains
Handbook of logic in computer science (vol. 3)
Domains for Denotational Semantics
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Disjunctive Systems and L-Domains
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
An introduction to event structures
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Information systems revisited – the general continuous case
Theoretical Computer Science
Adjunctions Between Categories Of Domains
Fundamenta Informaticae
Hi-index | 0.00 |
In this paper, some classical constructions for continuous information systems in a more general sense are established. Some non-classical constructions for continuous information systems such as weak systems, algebraic kernels and algebraic retracts are also introduced.