Domain theory in logical form

From MaRDI portal

Publication:1174593

Jump to:navigation, search

DOI10.1016/0168-0072(91)90065-TzbMath0737.03006WikidataQ57006926 ScholiaQ57006926MaRDI QIDQ1174593

Samson Abramsky

Publication date: 25 June 1992

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

Stone duality denotational semantics concurrency domain logics of programs

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Stone spaces (Boolean spaces) and related structures (06E15)

Related Items

Metric axioms and distance, Linear domains and linear maps, Unnamed Item, Consistent disjunctive sequent calculi and Scott domains, Coalgebraic Geometric Logic: Basic Theory, Quantales, observational logic and process semantics, Full abstraction and the Context Lemma (preliminary report), Intersection and union types, Logic of plotkin continuous domain, May and must convergency in concurrent λ-calculus, From semantics to types: the case of the imperative \(\lambda\)-calculus, Security Protocol Analysis in Context: Computing Minimal Executions Using SMT and CPSA, Streams of approximations, equivalence of recursive effectful programs, Topological representations of Lawson compact algebraic L-domains and Scott domains, A set-theoretic representation of algebraic L-domains, The Maude strategy language, A simple language supporting angelic nondeterminism and parallel composition, Decomposition of domains, Unnamed Item, Higher-order processes and their models, Bitopological duality for distributive lattices and Heyting algebras, 2002 Annual Conference of the Australasian Association for Logic, Continuous Domains in Formal Concept Analysis*, Towards Lambda Calculus Order-Incompleteness, Continuous Domains and their Information System Representation as Logical Systems, Modal Languages for Coalgebras in a Topological Setting, Truly concurrent constraint programming, From Haar to Lebesgue via Domain Theory, Continuous Domain Theory in Logical Form, Anatomy of a Domain of Continuous Random Variables II, Linear Structures for Concurrency in Probabilistic Programming Languages, Intersection Types and Computational Rules, The algebra of multirelations, Quantales, finite observations and strong bisimulation, A fully abstract denotational semantics for the calculus of higher-order communicating systems, Unnamed Item, Unnamed Item, Unnamed Item, Stone duality, topological algebra, and recognition., 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08, THE MCKINSEY–TARSKI THEOREM FOR LOCALLY COMPACT ORDERED SPACES, Unnamed Item, A representation of proper BC domains based on conjunctive sequent calculi, A Duality for Algebras of Lattice-Valued Modal Logic, Domain mu-calculus, Denotational Semantics with Nominal Scott Domains, A Hofmann-Mislove theorem for Bitopological Spaces, Extracting Program Logics From Abstract Interpretations Defined by Logical Relations, The approximation theorem for the Λμ-calculus, Essential and relational models, Injectivity of directed complete poset acts, Spectral sets, A duality between \(\Omega\)-categories and algebraic \(\Omega\)-categories, A Duality Theorem for Real C * Algebras, Generalised information systems capture L-domains, Information systems for continuous posets, Reasoning with power defaults, Easiness in graph models, Intersection types and lambda models, Infinite intersection types, Exploring Theories with a Model-Finding Assistant, A domain equation for bisimulation, A rational reconstruction of the domain of feature structures, Data refinement, call by value and higher order programs, A logical approach to stable domains, Stone duality and representation of stable domain, Coalgebraic representations of distributive lattices with operators, Implication via spacetime, The ``relevance of intersection and union types, Duality for modal \(\mu\)-logics, A first order logic of effects, Typing Weak MSOL Properties, Defaults in domain theory, Dijkstra and Hoare monads in monadic computation, Presenting functors on many-sorted varieties and applications, A topological approach to full belief, A semantic theory for value-passing processes based on the late approach, Remarks on hyperspaces for Priestley spaces, On the geometry of physical measurements: topological and algebraic aspects, Inverse-limit and topological aspects of abstract interpretation, Modalities in the Stone age: a comparison of coalgebraic logics, Stone duality for spectral sheaves and the patch monad, A duality theoretic view on limits of finite structures, Coalgebraic semantics of modal logics: an overview, The categorical equivalence between domains and interpolative generalized closure spaces, The untyped computational \(\lambda \)-calculus and its intersection type discipline, Measure, randomness and sublocales, A specification structure for deadlock-freedom of synchronous processes, Duality and canonical extensions for stably compact spaces, Graph lambda theories, An irregular filter model, A type assignment system for game semantics, Quantitative information flow as safety and liveness hyperproperties, Intersection types and domain operators, Behavioural inverse limit \(\lambda\)-models, Entailment systems for stably locally compact locales, On phase semantics and denotational semantics in multiplicative-additive linear logic, Can a Quantum Computer Run the von Neumann Architecture?, Bitopological duality for algebras of Fitting's logic and natural duality extension, Stable neighbourhoods, Quantitative domains and infinitary algebras, A Hofmann-Mislove theorem for bitopological spaces, Duality and the completeness of the modal \(\mu\)-calculus, Filter models for conjunctive-disjunctive \(\lambda\)-calculi, Predicate transformers and higher-order programs, A Filter Model for the λμ-Calculus, Studying equivalences of transition systems with algebraic tools, Bitopology and four-valued logic, A logic for Lawson compact algebraic L-domains, A logical view of composition, Stable domains are generalized topological spaces, The mixed powerdomain, Anatomy of a domain of continuous random variables. I, Logical equivalence for subtyping object and recursive types, Canonical extensions and canonicity via dcpo presentations, The probabilistic powerdomain for stably compact spaces, Stone coalgebras, A coalgebraic view on positive modal logic, A fully abstract may testing semantics for concurrent objects, A Stone-type duality for \(s T_0\) stratified Alexandrov \(L\)-topological spaces, A categorical duality for algebras of partial functions, Abstract Interpretation From a Denotational-semantics Perspective, Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting, Logical Semantics for Stability, Continuous L-domains in logical form, Operational domain theory and topology of sequential programming languages, Announcement as effort on topological spaces, Constructive modal logics. I, Inverse image analysis generalises strictness analysis, Rough concept lattices and domains, Full abstractness for a functional/concurrent language with higher-order value-passing, Abstract Interpretation from a Topological Perspective, Infinite \(\lambda\)-calculus and types, A Fully Abstract Model for Mobile Ambients, Towards a unified view of bisimulation: A comparative study, Simple Easy Terms, Subtyping in Logical Form, Compositional characterisations of \(\lambda\)-terms using intersection types, Topology, domain theory and theoretical computer science, From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models, Discrimination by parallel observers: the algorithm., Toward an infinitary logic of domains: Abramsky logic for transition systems, Corrigendum: ``A domain equation for bisimulation by S. Abramsky, Clausal logic and logic programming in algebraic domains, Definability and Full Abstraction, Bounded complete domains and their logical form, Type inference, abstract interpretation and strictness analysis, Set-theoretical and other elementary models of the \(\lambda\)-calculus, Truly concurrent constraint programming, Functorial Coalgebraic Logic: The Case of Many-sorted Varieties, Re-visiting axioms of information systems

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1174593&oldid=12005778"