The system F of variable types, fifteen years later
Theoretical Computer Science
Theoretical Computer Science
Non-deterministic information systems and their domains
Theoretical Computer Science
Handbook of theoretical computer science (vol. B)
Logic of domains
Semantics of programming languages: structures and techniques
Semantics of programming languages: structures and techniques
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): semantic structures
Handbook of logic in computer science (vol. 3): semantic structures
When is the ideal completion of abstract basis algebraic
Theoretical Computer Science
Domains and lambda-calculi
Domains for Denotational Semantics
Proceedings of the 9th 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
Abstract Deducibility and Domain Theory
Abstract Deducibility and Domain Theory
Adjunctions Between Categories Of Domains
Fundamenta Informaticae
Various Constructions of Continuous Information Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Representations of Algebraic Domains and Algebraic L-domains by Information Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A Note on Finitely Derived Information Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal Contexts for Algebraic Domains
Electronic Notes in Theoretical Computer Science (ENTCS)
A categorical representation of algebraic domains based on variations of rough approximable concepts
International Journal of Approximate Reasoning
Hi-index | 5.23 |
In this paper a new notion of continuous information system is introduced. It is shown that the information systems of this kind generate exactly the continuous domains. The new information systems are of the same logic-oriented style as the information systems first introduced by Scott in 1982: they consist of a set of tokens, a consistency predicate and an entailment relation satisfying a set of natural axioms. It is shown that continuous information systems are closely related to abstract bases. Indeed, both categories are equivalent. Since it is known that the categories of abstract bases and/or continuous domains are equivalent, it follows that the category of continuous information systems is also equivalent to that of continuous domains. In applications, mostly subclasses of continuous domains are considered. For example, the domains have to be pointed, algebraic, bounded-complete or FS. Conditions are presented that, when fulfilled by a continuous information system, force the generated domain to belong to the required subclass. In most cases the requirements are not only sufficient but also necessary.