Using information systems to solve recursive domain equations

DOI10.1016/0890-5401(91)90068-DMaRDI QIDQ808273zbMATH OpenFDO

Authors Kim G. Larsen, Glynn Winskel

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

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

Recommendations

• scientific article; zbMATH DE number 3858394
• Non-deterministic information systems and their domains
• I-categories as a framework for solving domain equations
• Domains via graphs
• The bicategory-theoretic solution of recursive domain equations

Cites work

• scientific article; zbMATH DE number 3831284 (Why is no real title available?)
• scientific article; zbMATH DE number 3843129 (Why is no real title available?)
• scientific article; zbMATH DE number 3700811 (Why is no real title available?)
• scientific article; zbMATH DE number 3733842 (Why is no real title available?)
• scientific article; zbMATH DE number 3780545 (Why is no real title available?)
• scientific article; zbMATH DE number 3615887 (Why is no real title available?)
• scientific article; zbMATH DE number 3290336 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• A Powerdomain Construction
• Data Types as Lattices
• Effectively given domains
• Petri nets, event structures and domains. I
• The largest Cartesian closed category of domains
• \(\mathbb{T}^\omega\) as a universal domain

Cited in

(11)

• scientific article; zbMATH DE number 3858394 (Why is no real title available?)
• 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)