Locally Boolean domains

DOI10.1016/J.TCS.2005.06.007MaRDI QIDQ2566030zbMATH OpenOpenAlexFDO

Authors Yanyan Li, James Laird

Publication date 22 September 2005

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2005.06.007

zbMATH Keywords

Domain theoryGame semanticsLinear logic

Mathematics Subject Classification ID

Proof-theoretic aspects of linear logic and other substructural logics (03F52) Categorical semantics of formal languages (18C50) Semantics in the theory of computing (68Q55)

Recommendations

• Locally Boolean domains and universal models for infinitary sequential languages.
• Linear domains and linear maps
• Bistructures, bidomains and linear logic
• Bistable Biorders: A Sequential Domain Theory
• Computer Science Logic

Cites work

• A categorical semantics of higher order store
• Call-by-value games
• Computer Science Logic
• Full abstraction for PCF
• Fully abstract semantics for observably sequential languages
• Polarized games
• Sequential algorithms on concrete data structures

Cited in

(11)

• Some programming languages suggested by game models (extended abstract)
• LOCALIZATION ON SNOWFLAKE DOMAINS
• Nondeterminism and Observable Sequentiality
• Imperative programs as proofs via game semantics
• A synthetic theory of sequential domains
• Bistructures, bidomains and linear logic
• Extensional and intensional semantics of bounded and unbounded nondeterminism
• Piecewise Boolean algebras and their domains
• Locally Boolean domains and universal models for infinitary sequential languages.
• Sequential algorithms for unbounded nondeterminism
• A calculus of coroutines

This page was built for publication: Locally Boolean domains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2566030)