The following pages link to Domain theory in logical form (Q1174593):
Displayed 50 items.
- A logical approach to stable domains (Q859843) (← links)
- Coalgebraic representations of distributive lattices with operators (Q869666) (← links)
- Dijkstra and Hoare monads in monadic computation (Q890377) (← 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)
- Bitopology and four-valued logic (Q1744388) (← 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)
- Clausal logic and logic programming in algebraic domains (Q1854478) (← links)
- Reasoning with power defaults (Q1882904) (← links)
- Infinite intersection types (Q1887155) (← links)
- A rational reconstruction of the domain of feature structures (Q1903084) (← links)
- Data refinement, call by value and higher order programs (Q1906039) (← links)
- A specification structure for deadlock-freedom of synchronous processes (Q1960536) (← links)
- On phase semantics and denotational semantics in multiplicative-additive linear logic (Q1971797) (← links)
- A logic for Lawson compact algebraic L-domains (Q1989346) (← links)
- A categorical duality for algebras of partial functions (Q2031546) (← links)
- Continuous L-domains in logical form (Q2041961) (← links)
- Announcement as effort on topological spaces (Q2053358) (← links)
- Bounded complete domains and their logical form (Q2105444) (← links)
- A duality theoretic view on limits of finite structures (Q2200829) (← links)
- The untyped computational \(\lambda \)-calculus and its intersection type discipline (Q2210507) (← links)
- Bitopological duality for algebras of Fitting's logic and natural duality extension (Q2231653) (← links)
- Anatomy of a domain of continuous random variables. I (Q2253185) (← links)
- Information systems for continuous posets (Q2367538) (← links)