Bistable Biorders: A Sequential Domain Theory
From MaRDI portal
Publication:5310690
DOI10.2168/LMCS-3(2:5)2007zbMath1128.68048OpenAlexW2043025259MaRDI QIDQ5310690
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
Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Continuous lattices and posets, applications (06B35) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15)
Related Items (4)
Sequential algorithms for unbounded nondeterminism ⋮ Unnamed Item ⋮ Nondeterminism and Observable Sequentiality ⋮ Sequentiality and the CPS Semantics of Fresh Names
This page was built for publication: Bistable Biorders: A Sequential Domain Theory
