Using information systems to solve recursive domain equations
From MaRDI portal
Publication:808273
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)
68Q55: Semantics in the theory of computing
06B35: Continuous lattices and posets, applications
03D80: Applications of computability and recursion theory
Related Items
A generalization of the trie data structure, Quasi-prime algebraic domains, Program extraction from normalization proofs, Configuration structures, event structures and Petri nets, A notion of information related to computation
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