Using information systems to solve recursive domain equations

DOI10.1016/0890-5401(91)90068-DzbMath0731.68071MaRDI QIDQ808273

Glynn Winskel, Kim Guldstrand Larsen

Publication date: 1991

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

zbMATH Keywords

information systemsrecursive domain equationscomplete partial order

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Continuous lattices and posets, applications (06B35) Applications of computability and recursion theory (03D80)

Related Items (9)

Configuration structures, event structures and Petri nets ⋮ Notions from rough set theory in a generalized dependency relation context ⋮ A notion of information related to computation ⋮ A generalization of the trie data structure ⋮ Quasi-prime algebraic domains ⋮ New perspectives of granular computing in relation geometry induced by pairings ⋮ A category of quantum posets ⋮ Bounded complete domains and their logical form ⋮ Program extraction from normalization proofs

Cites Work

• The largest Cartesian closed category of domains
• \(\mathbb{T}^\omega\) as a universal domain
• Effectively given domains
• Petri nets, event structures and domains. I
• 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: Using information systems to solve recursive domain equations