scientific article
From MaRDI portal
Publication:3326830
zbMath0539.68019MaRDI QIDQ3326830
Glynn Winskel, Kim Guldstrand Larsen
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
domain theoryeffective domainsrecursive domain equationscpoeffectively given domainsScott's information systems
Abstract data types; algebraic specification (68Q65) Theory of numerations, effectively presented structures (03D45)
Related Items
Information systems for continuous semi-lattices, Representations of algebraic domains and algebraic L-domains by information systems, A note on finitely derived information systems, Universal quasi-prime algebraic domains, Generalised information systems capture L-domains, Information systems for continuous posets, Atomicity, coherence of information, and point-free structures, Consistent disjunctive sequent calculi and Scott domains, Universal profinite domains, Prime algebraicity, Adequacy for a lazy functional language with recursive and polymorphic types, Full abstraction and limiting completeness in equational languages, Event structures and domains, Algebraic specifications for domain theory, From semantics to types: the case of the imperative \(\lambda\)-calculus, A representation of L-domains by information systems, A generalization of de Vries duality to closed relations between compact Hausdorff spaces, Decomposition of domains, Some categorical aspects of information systems and domains, Representation of algebraic domains by formal association rule systems, The categorical equivalence between domains and interpolative generalized closure spaces, The presence of lattice theory in discrete problems of mathematical social sciences. Why., Nonflatness and totality, Non-deterministic information systems and their domains, Domain theory in logical form, Weak algebraic information systems and a new equivalent category of DOM of domains, Representations of stably continuous semi-lattices by information systems and abstract bases, Domain theory for concurrency, Domains for logic programming, Elements of generalized ultrametric domain theory, New representations of algebraic domains and algebraic L-domains via closure systems, Information systems revisited -- the general continuous case, I-categories as a framework for solving domain equations, \(dI\)--domains as prime information systems, Various Constructions of Continuous Information Systems, A \(\kappa\)-denotational semantics for map theory in ZFC+SI, The categorical equivalence between algebraic domains and F-augmented closure spaces., Domains via graphs, Disjunctive systems and L-Domains, Unnamed Item, A representation of continuous domains via relationally approximable concepts in a generalized framework of formal concept analysis, A representation of proper BC domains based on conjunctive sequent calculi, On Scott's thesis for domains of information and well-quasi-orderings, Nominal Domain Theory for Concurrency, Recursive domain equations for concrete data structure, Describing semantic domains with sprouts, Domain theoretic models of polymorphism, Building continuous webbed models for system F, Dedekind completion as a method for constructing new Scott domains, From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models, A co-induction principle for recursively defined domains, Information categories, A categorical representation of algebraic domains based on variations of rough approximable concepts, Fixed points of Scott continuous self-maps, Re-visiting axioms of information systems
