Using information systems to solve recursive domain equations
From MaRDI portal
Publication:808273
DOI10.1016/0890-5401(91)90068-DzbMATH Open0731.68071MaRDI QIDQ808273FDOQ808273
Authors: Kim G. Larsen, Glynn Winskel
Publication date: 1991
Published in: Information and Computation (Search for Journal in Brave)
Recommendations
Continuous lattices and posets, applications (06B35) Semantics in the theory of computing (68Q55) Applications of computability and recursion theory (03D80)
Cites Work
- Petri nets, event structures and domains. I
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(\mathbb{T}^\omega\) as a universal domain
- Data Types as Lattices
- The largest Cartesian closed category of domains
- A Powerdomain Construction
- Title not available (Why is that?)
- Title not available (Why is that?)
- Effectively given domains
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- Title not available (Why is that?)
- Bounded complete domains and their logical form
- A category of quantum posets
- New perspectives of granular computing in relation geometry induced by pairings
- Configuration structures, event structures and Petri nets
- A notion of information related to computation
- Notions from rough set theory in a generalized dependency relation context
- A Cook's tour of duality in logic: from quantifiers, through Vietoris, to measures
- A generalization of the trie data structure
- Quasi-prime algebraic domains
- Program extraction from normalization proofs
This page was built for publication: Using information systems to solve recursive domain equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808273)