Domain theory in logical form
From MaRDI portal
Publication:1174593
The article is a very interesting attempt to connect domain theory, logics of programs, and concurrency. The author moves in the mathematical framework of Stone duality. Up to now, Stone duality was important for topology and logic. The author points out its importance for computer science: Stone duality provides the framework for understanding the relationship between denotational semantics and program logics. A metalanguage with types and terms (programs) is introduced. A denotational interpretation, and then a logical one are given. The two interpretations are Stone duals of each other (``a strengthened form of the logician's soundness and completeness). Each determines the other up to isomorphism. Consequently, semantics and logic are guaranteed to be in harmony with each other. Finally, directions for further research are discussed. A deep and provocative paper. A very good reference article.
Recommendations
Cites work
- A calculus of communicating systems
- A filter lambda model and the completeness of type assignment
- A logic for the specification and proof of regular controllable processes of CCS
- A Powerdomain Construction
- Algebraic laws for nondeterminism and concurrency
- An axiomatic basis for computer programming
- Calculi for synchrony and asynchrony
- Computability concepts for programming language semantics
- Computable functionals of finite types
- Data Types as Lattices
- Effectively given domains
- First-order dynamic logic
- Fully abstract models of typed \(\lambda\)-calculi
- scientific article; zbMATH DE number 3889502 (Why is no real title available?)
- scientific article; zbMATH DE number 3846844 (Why is no real title available?)
- scientific article; zbMATH DE number 3856436 (Why is no real title available?)
- scientific article; zbMATH DE number 3858394 (Why is no real title available?)
- scientific article; zbMATH DE number 3813583 (Why is no real title available?)
- scientific article; zbMATH DE number 3904807 (Why is no real title available?)
- scientific article; zbMATH DE number 3929909 (Why is no real title available?)
- scientific article; zbMATH DE number 3940709 (Why is no real title available?)
- scientific article; zbMATH DE number 3959364 (Why is no real title available?)
- scientific article; zbMATH DE number 3976319 (Why is no real title available?)
- scientific article; zbMATH DE number 4005580 (Why is no real title available?)
- scientific article; zbMATH DE number 4045109 (Why is no real title available?)
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 3658971 (Why is no real title available?)
- scientific article; zbMATH DE number 3675301 (Why is no real title available?)
- scientific article; zbMATH DE number 3704559 (Why is no real title available?)
- scientific article; zbMATH DE number 3706504 (Why is no real title available?)
- scientific article; zbMATH DE number 3707731 (Why is no real title available?)
- scientific article; zbMATH DE number 3716749 (Why is no real title available?)
- scientific article; zbMATH DE number 3756452 (Why is no real title available?)
- scientific article; zbMATH DE number 3759128 (Why is no real title available?)
- scientific article; zbMATH DE number 3780545 (Why is no real title available?)
- scientific article; zbMATH DE number 3787631 (Why is no real title available?)
- scientific article; zbMATH DE number 3793435 (Why is no real title available?)
- scientific article; zbMATH DE number 3557184 (Why is no real title available?)
- scientific article; zbMATH DE number 3628344 (Why is no real title available?)
- scientific article; zbMATH DE number 3806938 (Why is no real title available?)
- scientific article; zbMATH DE number 3428899 (Why is no real title available?)
- scientific article; zbMATH DE number 3232606 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- LCF considered as a programming language
- Linear logic
- Modal logics for communicating systems
- Model theory.
- On specifications, theories, and models with higher types
- On the power of list iteration
- Processes and the denotational semantics of concurrency
- Programming as a Discipline of Mathematical Nature
- The Category-Theoretic Solution of Recursive Domain Equations
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The largest Cartesian closed category of domains
- The Theory of Representation for Boolean Algebras
- Universal profinite domains
Cited in
(only showing first 100 items - show all)- Operational domain theory and topology of sequential programming languages
- Rough concept lattices and domains
- Duality for modal \(\mu\)-logics
- Stable neighbourhoods
- Quantitative domains and infinitary algebras
- The mixed powerdomain
- Full abstractness for a functional/concurrent language with higher-order value-passing
- Infinite \(\lambda\)-calculus and types
- Topology, domain theory and theoretical computer science
- 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
- Spectral sets
- Stone duality and representation of stable domain
- The ``relevance of intersection and union types
- A first order logic of effects
- Defaults in domain theory
- A semantic theory for value-passing processes based on the late approach
- Intersection types and domain operators
- Behavioural inverse limit -models
- Entailment systems for stably locally compact locales
- Towards a unified view of bisimulation: A comparative study
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
- Truly concurrent constraint programming
- Bitopology and four-valued logic
- 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
- Reasoning with power defaults
- Infinite intersection types
- A rational reconstruction of the domain of feature structures
- Data refinement, call by value and higher order programs
- A specification structure for deadlock-freedom of synchronous processes
- On phase semantics and denotational semantics in multiplicative-additive linear logic
- A logic for Lawson compact algebraic L-domains
- A categorical duality for algebras of partial functions
- Continuous L-domains in logical form
- Announcement as effort on topological spaces
- Bounded complete domains and their logical form
- A duality theoretic view on limits of finite structures
- The untyped computational \(\lambda \)-calculus and its intersection type discipline
- Bitopological duality for algebras of Fitting's logic and natural duality extension
- Anatomy of a domain of continuous random variables. I
- Information systems for continuous posets
- Easiness in graph models
- Intersection types and lambda models
- A topological approach to full belief
- Quantitative information flow as safety and liveness hyperproperties
- Logical equivalence for subtyping object and recursive types
- Compositional characterisations of \(\lambda\)-terms using intersection types
- Re-visiting axioms of information systems
- A domain equation for bisimulation
- Implication via spacetime
- Remarks on hyperspaces for Priestley spaces
- On the geometry of physical measurements: topological and algebraic aspects
- Stone duality for spectral sheaves and the patch monad
- The categorical equivalence between domains and interpolative generalized closure spaces
- A duality between \(\Omega\)-categories and algebraic \(\Omega\)-categories
- Abstract interpretation from a denotational-semantics perspective
- Semi-decidability of may, must and probabilistic testing in a higher-type setting
- Logical semantics for stability
- A fully abstract model for mobile ambients
- Simple easy terms
- Subtyping in logical form
- Definability and full abstraction
- Functorial coalgebraic logic: the case of many-sorted varieties
- A Duality Theorem for Real C * Algebras
- Can a quantum computer run the von Neumann architecture?
- A Filter Model for the λμ-Calculus
- Abstract Interpretation from a Topological Perspective
- Exploring theories with a model-finding assistant
- Graph lambda theories
- Bitopological duality for distributive lattices and Heyting algebras
- 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08
- A Duality for Algebras of Lattice-Valued Modal Logic
- scientific article; zbMATH DE number 4045109 (Why is no real title available?)
- scientific article; zbMATH DE number 29052 (Why is no real title available?)
- Inverse-limit and topological aspects of abstract interpretation
- Modalities in the Stone age: a comparison of coalgebraic logics
- Quantales, observational logic and process semantics
- scientific article; zbMATH DE number 1154167 (Why is no real title available?)
- Domain mu-calculus
- Measure, randomness and sublocales
- Relational graph models at work
- Higher-order processes and their models
- 2002 Annual Conference of the Australasian Association for Logic
- Towards lambda calculus order-incompleteness
- Continuous domains and their information system representation as logical systems
- Modal languages for coalgebras in a topological setting
- 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
- The McKinsey-Tarski theorem for locally compact ordered spaces
- scientific article; zbMATH DE number 7471705 (Why is no real title available?)
- Consistent disjunctive sequent calculi and Scott domains
- Coalgebraic Geometric Logic: Basic Theory
- The -framework
This page was built for publication: Domain theory in logical form
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1174593)
