On stable domains

DOI10.1016/0304-3975(93)90183-TzbMath0777.68061MaRDI QIDQ685428

Manfred Droste

Publication date: 15 December 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

stable domains\(L\)-domainscartesian closurepower-domains

Mathematics Subject Classification ID

Partial orders, general (06A06) Semantics in the theory of computing (68Q55)

Related Items (9)

On the largest Cartesian closed category of stable domains. ⋮ Stone duality and representation of stable domain ⋮ The largest cartesian closed category of stable domains ⋮ On the largest Cartesian closed category of stable domains ⋮ Maximality and totality of stable functions in the category of stable bifinite domains ⋮ A partial solution to an open problem of Amadio and Curien ⋮ Cartesian closed stable categories ⋮ A Nice labelling for tree-like event structures of degree 3 ⋮ Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin

Cites Work

• The largest Cartesian closed category of domains
• Non-deterministic information systems and their domains
• An algebraic approach to stable domains
• \(\mathbb{T}^\omega\) as a universal domain
• The lambda calculus, its syntax and semantics
• Universal homogeneous event structures and domains
• LCF considered as a programming language
• Fully abstract models of typed \(\lambda\)-calculi
• Categories of embeddings
• Data Types as Lattices
• A Powerdomain Construction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On stable domains