I-categories as a framework for solving domain equations

DOI10.1016/0304-3975(93)90056-YzbMath0790.18003MaRDI QIDQ685401

Abbas Edalat, Michael B. Smyth

Publication date: 20 December 1993

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

zbMATH Keywords

information systemsinitial algebraScott domains\(I\)-categorycomplete partial ordercontinuous partial ordercontinuous Scott domainsdomain equationsfixed-point completion

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Semantics in the theory of computing (68Q55) Continuous lattices and posets, applications (06B35) Preorders, orders, domains and lattices (viewed as categories) (18B35) Ordered structures (06F99)

Related Items (2)

Games and full abstraction for FPC. ⋮ Three dual ontologies

Cites Work

• Universal profinite domains
• Effectively given domains
• Sequential algorithms on concrete data structures
• Continuous information systems
• The Category-Theoretic Solution of Recursive Domain Equations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: I-categories as a framework for solving domain equations