Bistable Biorders: A Sequential Domain Theory

DOI10.2168/LMCS-3(2:5)2007MaRDI QIDQ5310690zbMATH OpenOpenAlexFDO

Authors James Laird

Publication date 11 October 2007

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/lmcs-3(2:5)2007

Mathematics Subject Classification ID

Continuous lattices and posets, applications (06B35) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Recommendations

• Computer Science Logic
• scientific article; zbMATH DE number 2182492
• Sequential algorithms as bistable maps
• Stable bistructure models of PCF (preliminary draft)
• Sequentiality in an extensional framework

Cited in

(12)

• Locally Boolean domains
• Sequentiality and the CPS semantics of fresh names
• Stable bistructure models of PCF (preliminary draft)
• scientific article; zbMATH DE number 7471671 (Why is no real title available?)
• Sequential algorithms for unbounded nondeterminism
• Nondeterminism and Observable Sequentiality
• Computer Science Logic
• scientific article; zbMATH DE number 2182492 (Why is no real title available?)
• Locally Boolean domains and universal models for infinitary sequential languages.
• Sequentiality in an extensional framework
• Foundations of Software Science and Computation Structures
• Sequential algorithms as bistable maps

This page was built for publication: Bistable Biorders: A Sequential Domain Theory

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