Quasi-prime algebraic domains

DOI10.1016/0304-3975(95)00133-6zbMath0873.68132MaRDI QIDQ672133

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

zbMATH Keywords

denotational semantics of programming languages; denotational semantics on quasi-prime algebraic domain; domain equations in quasi-prime algebraic domain; irreducible information systems; symmetric monoidal closed category of quasi-prime algebraic domains; un-typed lambda calculus

Mathematics Subject Classification ID

68Q55: Semantics in the theory of computing

68Q65: Abstract data types; algebraic specification

18D15: Closed categories (closed monoidal and Cartesian closed categories, etc.)

03B40: Combinatory logic and lambda calculus

Related Items

The largest cartesian closed category of stable domains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• The largest cartesian closed category of stable domains
• Using information systems to solve recursive domain equations
• Petri nets, event structures and domains. I
• Stable neighbourhoods
• \(dI\)--domains as prime information systems
• Concrete domains
• A maximal monoidal closed category of distributive algebraic domains
• UNIVERSAL INFORMATION SYSTEMS
• Categorical combinators
• *-Autonomous categories and linear logic
• Universal domains and the amalgamation property
• Some monoidal closed categories of stable domains and event structures
• Linear domains and linear maps