Convex powerdomains. I

DOI10.1016/0890-5401(87)90021-6zbMath0627.06011OpenAlexW1972342770MaRDI QIDQ581432

Karel Hrbacek

Publication date: 1987

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(87)90021-6

zbMATH Keywords

programming languagescompletionpartially ordered setspowerdomainssemanticscontinuous latticealgebraic latticesdata typesconvex powerdomainFrink ideals

Mathematics Subject Classification ID

Complete lattices, completions (06B23) Semantics in the theory of computing (68Q55) Continuous lattices and posets, applications (06B35)

Related Items (3)

Convex powerdomains. II ⋮ Continuous completions ⋮ Duality beyond sober spaces: Topological spaces and observation frames

Cites Work

• The largest Cartesian closed category of domains
• Bases for Chain-complete Posets
• Data Types as Lattices
• A Powerdomain Construction
• Ideals in Partially Ordered Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Convex powerdomains. I