The system F of variable types, fifteen years later
Theoretical Computer Science
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
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
| Hi-index | 0.00 |
Information systems play an important role in characterizing order structures. In this paper, we introduce the notions of the algebraic information system and algebraic L-information system. They are of the same logic-oriented style as the information system introduced by Scott (1982). But the axioms in this paper are briefer than reported in existing work. We also prove that the two new information systems exactly represent the algebraic domains and algebraic L-domains respectively. Based on the notion of approximable mapping between the algebraic information systems and the algebraic L-information systems, we obtain the result that the corresponding categories of algebraic information systems and algebraic L-information systems are equivalent to the category of algebraic domains and algebraic L-domains respectively.