The following pages link to Domain theory in logical form (Q1174593):
Displayed 50 items.
- Inverse-limit and topological aspects of abstract interpretation (Q418811) (← links)
- Modalities in the Stone age: a comparison of coalgebraic logics (Q418820) (← links)
- Measure, randomness and sublocales (Q450959) (← links)
- Canonical extensions and canonicity via dcpo presentations (Q541219) (← links)
- A fully abstract may testing semantics for concurrent objects (Q557787) (← links)
- Presenting functors on many-sorted varieties and applications (Q618170) (← links)
- Coalgebraic semantics of modal logics: an overview (Q639647) (← links)
- Duality and canonical extensions for stably compact spaces (Q649839) (← links)
- Duality and the completeness of the modal \(\mu\)-calculus (Q671986) (← links)
- Filter models for conjunctive-disjunctive \(\lambda\)-calculi (Q672044) (← links)
- Predicate transformers and higher-order programs (Q672318) (← links)
- Studying equivalences of transition systems with algebraic tools (Q673968) (← links)
- A logical view of composition (Q685416) (← links)
- Stable domains are generalized topological spaces (Q685417) (← links)
- The probabilistic powerdomain for stably compact spaces (Q703479) (← links)
- Stone coalgebras (Q703523) (← links)
- A coalgebraic view on positive modal logic (Q703528) (← links)
- Constructive modal logics. I (Q750417) (← links)
- Inverse image analysis generalises strictness analysis (Q751835) (← links)
- A logical approach to stable domains (Q859843) (← links)
- Coalgebraic representations of distributive lattices with operators (Q869666) (← links)
- An irregular filter model (Q930872) (← links)
- A type assignment system for game semantics (Q930873) (← links)
- A Hofmann-Mislove theorem for bitopological spaces (Q941428) (← links)
- Operational domain theory and topology of sequential programming languages (Q1013087) (← links)
- Rough concept lattices and domains (Q1023298) (← links)
- Duality for modal \(\mu\)-logics (Q1128984) (← links)
- Stable neighbourhoods (Q1185012) (← links)
- Quantitative domains and infinitary algebras (Q1185015) (← links)
- The mixed powerdomain (Q1199543) (← links)
- Full abstractness for a functional/concurrent language with higher-order value-passing (Q1271466) (← links)
- Infinite \(\lambda\)-calculus and types (Q1275621) (← links)
- Topology, domain theory and theoretical computer science (Q1295216) (← links)
- Type inference, abstract interpretation and strictness analysis (Q1314350) (← links)
- Set-theoretical and other elementary models of the \(\lambda\)-calculus (Q1314361) (← links)
- Spectral sets (Q1330687) (← links)
- Stone duality and representation of stable domain (Q1368465) (← links)
- The ``relevance'' of intersection and union types (Q1381437) (← links)
- A first order logic of effects (Q1390955) (← links)
- Defaults in domain theory (Q1391866) (← links)
- A semantic theory for value-passing processes based on the late approach (Q1398368) (← links)
- Intersection types and domain operators (Q1434348) (← links)
- Behavioural inverse limit \(\lambda\)-models (Q1434350) (← links)
- Entailment systems for stably locally compact locales (Q1434362) (← links)
- Towards a unified view of bisimulation: A comparative study (Q1575240) (← links)
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485) (← links)
- Truly concurrent constraint programming (Q1605181) (← links)
- Discrimination by parallel observers: the algorithm. (Q1854269) (← links)
- Toward an infinitary logic of domains: Abramsky logic for transition systems (Q1854320) (← links)
- Corrigendum: ``A domain equation for bisimulation'' by S. Abramsky (Q1854414) (← links)