Quasi-prime algebraic domains
DOI10.1016/0304-3975(95)00133-6zbMATH Open0873.68132OpenAlexW2093209788MaRDI QIDQ672133FDOQ672133
Authors: Juan-Miguel Gracia
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00133-6
Recommendations
denotational semantics of programming languagesdenotational semantics on quasi-prime algebraic domaindomain equations in quasi-prime algebraic domainirreducible information systemssymmetric monoidal closed category of quasi-prime algebraic domainsun-typed lambda calculus
Combinatory logic and lambda calculus (03B40) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65)
Cites Work
- Petri nets, event structures and domains. I
- \(dI\)--domains as prime information systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear logic
- Stable neighbourhoods
- Title not available (Why is that?)
- Universal domains and the amalgamation property
- Title not available (Why is that?)
- The largest cartesian closed category of stable domains
- Title not available (Why is that?)
- Linear domains and linear maps
- *-Autonomous categories and linear logic
- Categorical combinators
- A maximal monoidal closed category of distributive algebraic domains
- Title not available (Why is that?)
- Some monoidal closed categories of stable domains and event structures
- Concrete domains
- UNIVERSAL INFORMATION SYSTEMS
- Using information systems to solve recursive domain equations
Cited In (7)
This page was built for publication: Quasi-prime algebraic domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672133)