scientific article

zbMath0495.68025MaRDI QIDQ3959414

Dana S. Scott

Publication date: 1982

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

information systemcomputabilitylambda calculusfinite approximationsfixed-point operatorcpo'sS- expression

Mathematics Subject Classification ID

Topological spaces and generalizations (closure spaces, etc.) (54A05) Abstract data types; algebraic specification (68Q65) Data structures (68P05) Semilattices (06A12) Combinatory logic and lambda calculus (03B40) Foundations, relations to logic and deductive systems (18A15)

Related Items

Unification of several distance functions and a common fixed point result ⋮ Representations of algebraic domains and algebraic L-domains by information systems ⋮ On the largest Cartesian closed category of stable domains. ⋮ A domain-theoretic model of nominally-typed object-oriented programming ⋮ A note on finitely derived information systems ⋮ Formal contexts for algebraic domains ⋮ Some corollaries of the correspondence between partial metrics and multivalued equalities ⋮ Modeling misconceptions in knowledge space theory ⋮ Generalised information systems capture L-domains ⋮ Atomicity, coherence of information, and point-free structures ⋮ A characterization of F-complete type assignments ⋮ The system \({\mathcal F}\) of variable types, fifteen years later ⋮ An algebraic semantics approach to the effective resolution of type equations ⋮ A refinement of strong sequentiality for term rewriting with constructors ⋮ Universal profinite domains ⋮ Two-level semantics and code generation ⋮ Hilbert space representation of time evolution of pure states ⋮ Type theories, normal forms, and \(D_{\infty}\)-lambda-models ⋮ Normal functors, power series and \(\lambda\)-calculus ⋮ A quantitative interpretation of Girard's System F ⋮ A logical approach to stable domains ⋮ Semantics of production systems ⋮ Attributes and rough properties in information systems ⋮ On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory ⋮ Full abstraction and limiting completeness in equational languages ⋮ Event structures and domains ⋮ On the relations between monadic semantics ⋮ A new generic scheme for functional logic programming with constraints ⋮ A representation of L-domains by information systems ⋮ The patch construction is dual to algebraic DCPO representation ⋮ Locatedness and overt sublocales ⋮ Two-level semantics and abstract interpretation ⋮ The Hoare and Symth power domain constructors commute under composition ⋮ Non-deterministic information systems and their domains ⋮ Semantics of types for database objects ⋮ An algebraic approach to stable domains ⋮ Contractions in comparing concurrency semantics ⋮ A survey of constraint-based programming paradigms ⋮ Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation ⋮ Domain theory in logical form ⋮ An irregular filter model ⋮ Recursive types for Fun ⋮ A semantics for complex objects and approximate answers ⋮ Relation algebraic domain constructions ⋮ Towards a semantics-based information theory ⋮ Using powerdomains to generalize relational databases ⋮ A fixed point theorem in partial quasi-metric spaces and an application to software engineering ⋮ Domains for logic programming ⋮ A compositional semantic basis for the analysis of equational Horn programs ⋮ Nondeterminism and infinite computations in constraint programming ⋮ Filter models for conjunctive-disjunctive \(\lambda\)-calculi ⋮ Quasi-prime algebraic domains ⋮ On computational environments of topological spaces ⋮ Information systems revisited -- the general continuous case ⋮ Equational theories for inductive types ⋮ A presentation of the initial lift-algebra ⋮ Natural congruences and isomorphism theorems for directed complete partially ordered sets ⋮ Strictness analysis via abstract interpretation for recursively defined types ⋮ Some economic applications of Scott domains ⋮ On the largest Cartesian closed category of stable domains ⋮ I-categories as a framework for solving domain equations ⋮ Logical foundations for programming semantics ⋮ Graph rewriting for a partial ordering semantics of concurrent constraints programming ⋮ \(dI\)--domains as prime information systems ⋮ Subrecursive hierarchies on Scott domains ⋮ Machine semantics ⋮ Proving concurrent constraint programming correct, revisited ⋮ Topology vs generalized rough sets ⋮ Total sets and objects in domain theory ⋮ The probabilistic powerdomain for stably compact spaces ⋮ Computer theorem proving in mathematics ⋮ The multiple facets of the canonical direct unit implicational basis ⋮ A fully abstract may testing semantics for concurrent objects ⋮ Quotient-reflective and bireflective subcategories of the category of preordered sets ⋮ Convex powerdomains. I ⋮ Coherence and consistency in domains ⋮ Categories of embeddings ⋮ A note on inconsistencies caused by fixpoints in a cartesian closed category ⋮ Inverse image analysis generalises strictness analysis ⋮ Functorial polymorphism ⋮ Type inference with recursive types: Syntax and semantics ⋮ Infinite \(\lambda\)-calculus and types ⋮ A fully abstract semantics for concurrent constraint programming ⋮ Ordinal decompositions for preordered root systems ⋮ Ambiguous representations of semilattices, imperfect information, and predicate transformers ⋮ Logic programs, well-orderings, and forward chaining ⋮ \({\mathcal M}^\omega\) considered as a programming language ⋮ On some definition of physical state ⋮ A note on fuzzy power relations ⋮ On a generalized product for domains ⋮ Type inference, abstract interpretation and strictness analysis ⋮ Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin ⋮ Set-theoretical and other elementary models of the \(\lambda\)-calculus ⋮ An abstract machine for concurrent modular systems: CHARM ⋮ On powerdomains and modality ⋮ Using information systems to solve recursive domain equations ⋮ Type inference with partial types ⋮ Information categories ⋮ First order theories for partial models ⋮ Re-visiting axioms of information systems ⋮ On concurrent behaviors and focusing in linear logic ⋮ A context for belief revision: forward chaining-normal nonmonotonic rule systems ⋮ Topological games in domain theory ⋮ Information systems for continuous semi-lattices ⋮ Spectral sets ⋮ Easy lambda-terms are not always simple ⋮ Annotations in formal specifications and proofs ⋮ Information systems for continuous posets ⋮ Consistent disjunctive sequent calculi and Scott domains ⋮ Infinite intersection types ⋮ Algebraic semantics and complexity of term rewriting systems ⋮ Synchronization trees ⋮ Linear time and branching time semantics for recursion with merge ⋮ Algebraic domains of natural transformations ⋮ Adequacy for a lazy functional language with recursive and polymorphic types ⋮ Constructive domain theory as a branch of intuitionistic pointfree topology ⋮ Mediating secure information flow policies ⋮ On completeness theorems for feature logics ⋮ Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms ⋮ Notions from rough set theory in a generalized dependency relation context ⋮ A concrete realization of the Hoare powerdomain ⋮ On subexponentials, focusing and modalities in concurrent systems ⋮ Recursive topological spaces ⋮ A type theoretic interpretation of constructive domain theory ⋮ Algebraic specifications for domain theory ⋮ An abstract interpretation for ML equality kinds ⋮ A set constructor for inductive sets in Martin-Löf's type theory ⋮ Contextual occurrence nets and concurrent constraint programming ⋮ Logic of plotkin continuous domain ⋮ A mereotopology based on sequent algebras ⋮ Liminf convergence in \(\Omega\)-categories ⋮ ALX, an action logic for agents with bounded rationality ⋮ Defaults in domain theory ⋮ Quotients of d-frames ⋮ Normal forms, linearity, and prime algebraicity over nonflat domains ⋮ Some categorical aspects of information systems and domains ⋮ A general view of approximation ⋮ 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. ⋮ Unnamed Item ⋮ Nonflatness and totality ⋮ Unnamed Item ⋮ Composition aspects of programmology. I ⋮ A note on injective spaces. ⋮ Probabilistic argumentation systems. A new way to combine logic with probability. ⋮ Computational topology: Ambient isotopic approximation of 2-manifolds. ⋮ Ideal models of spaces. ⋮ Some points in formal topology. ⋮ Intuitionistic fixed point logic ⋮ Unnamed Item ⋮ 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 ⋮ Behavioural inverse limit \(\lambda\)-models ⋮ Domain theory for concurrency ⋮ Presenting locale pullback via directed complete posets ⋮ Entailment systems for stably locally compact locales ⋮ Unnamed Item ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting) ⋮ Point-Free Spectra of Linear Spreads ⋮ Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming ⋮ Continuous Domains in Formal Concept Analysis* ⋮ Continuous Domains and their Information System Representation as Logical Systems ⋮ Cartesian closed categories of separable Scott domains ⋮ New perspectives of granular computing in relation geometry induced by pairings ⋮ Directed complete poset congruences ⋮ Cartesian closed stable categories ⋮ A stable programming language ⋮ Unnamed Item ⋮ A general framework for FDE-based modal logics ⋮ Rough games modeled via \(L\)-fuzzy ambiguous representations of semilattices ⋮ Disjunctive systems and L-Domains ⋮ An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words ⋮ Set relations and set systems induced by some families of integral domains ⋮ A representation of continuous domains via relationally approximable concepts in a generalized framework of formal concept analysis ⋮ On Scott's thesis for domains of information and well-quasi-orderings ⋮ PROOF SYSTEMS FOR VARIOUS FDE-BASED MODAL LOGICS ⋮ Rough Set Theory: Ontological Systems, Entailment Relations and Approximation Operators ⋮ Continuously generated fixed points ⋮ Recursive domain equations for concrete data structure ⋮ Describing semantic domains with sprouts ⋮ Domain theoretic models of polymorphism ⋮ Building continuous webbed models for system F ⋮ A Fully Abstract Model for Mobile Ambients ⋮ From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models ⋮ A category of quantum posets ⋮ On the parallel between the suplattice and preframe approaches to locale theory ⋮ A cartesian closed category in Martin-Löf's intuitionistic type theory ⋮ Discrimination by parallel observers: the algorithm. ⋮ Relational interpretations of recursive types in an operational setting. ⋮ Toward an infinitary logic of domains: Abramsky logic for transition systems ⋮ A timed concurrent constraint language. ⋮ Clausal logic and logic programming in algebraic domains ⋮ An Infinitary System for the Least Fixed-Point Logic restricted to Finite Models ⋮ Bounded complete domains and their logical form ⋮ A domain-theoretic approach to functional and logic programming ⋮ Models and emerging trends of concurrent constraint programming ⋮ Topological semigroups and their prequantale models ⋮ A categorical representation of algebraic domains based on variations of rough approximable concepts ⋮ Three dual ontologies ⋮ Computational adequacy via ‘mixed’ inductive definitions ⋮ Probabilistic power domains, information systems, and locales ⋮ Universal quasi-prime algebraic domains ⋮ A Comparison of Type Theory with Set Theory ⋮ Adversarial logic ⋮ Topological representations of Lawson compact algebraic L-domains and Scott domains ⋮ A set-theoretic representation of algebraic L-domains ⋮ A generalization of de Vries duality to closed relations between compact Hausdorff spaces ⋮ Information links in domain theory ⋮ How much partiality is needed for a theory of computability? ⋮ Maximal elements with minimal logic ⋮ Various Constructions of Continuous Information Systems ⋮ A \(\kappa\)-denotational semantics for map theory in ZFC+SI ⋮ From concepts to consistent object specifications: Translation of a domain-oriented feature framework into practice ⋮ Domains via graphs ⋮ Intersection types for \(\lambda\)-trees ⋮ Recursive Domain Equations of Filter Models ⋮ A representation of proper BC domains based on conjunctive sequent calculi ⋮ Normalization by Evaluation for Martin-Löf Type Theory with One Universe ⋮ Topological approach for rough sets by using J-nearly concepts via ideals