Domains via graphs

DOI10.1007/BF02943235zbMATH Open1013.68115MaRDI QIDQ5956841FDOQ5956841

Authors: Yixiang Chen, Guoqiang Zhang 

Publication date: 28 February 2002

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Recommendations

• Universal homogeneous graph-like structures and domains
• A convenient category of domains
• scientific article; zbMATH DE number 3940731
• Building domains from graph models
• Concrete domains

zbMATH Keywords

domain theorycoherence spaces

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Cites Work

• \(dI\)--domains as prime information systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Linear logic
• \(\mathbb{T}^\omega\) as a universal domain
• Data Types as Lattices
• The largest cartesian closed category of stable domains
• Title not available (Why is that?)
• Stone duality and representation of stable domain
• Sequential algorithms on concrete data structures
• Some monoidal closed categories of stable domains and event structures
• Syntactic characterisations of amalgamation, convexity and related properties
• Universal profinite domains
• Coherence and consistency in domains

Cited In (4)

• Title not available (Why is that?)
• A decomposition theorem for domains
• Universal homogeneous graph-like structures and domains
• A convenient category of domains

This page was built for publication: Domains via graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5956841)