Domains via graphs
From MaRDI portal
Publication:5956841
DOI10.1007/BF02943235zbMath1013.68115MaRDI QIDQ5956841
Publication date: 28 February 2002
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- The largest cartesian closed category of stable domains
- Universal profinite domains
- \(\mathbb{T}^\omega\) as a universal domain
- Sequential algorithms on concrete data structures
- \(dI\)--domains as prime information systems
- Coherence and consistency in domains
- Stone duality and representation of stable domain
- Syntactic characterisations of amalgamation, convexity and related properties
- Data Types as Lattices
- Some monoidal closed categories of stable domains and event structures
This page was built for publication: Domains via graphs