Bistable Biorders: A Sequential Domain Theory
<|reference_start|>Bistable Biorders: A Sequential Domain Theory: We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order -- the extensional order -- and a bistable coherence, which captures equivalence of program behaviour, up to permutation of top (error) and bottom (divergence). We show that monotone and bistable functions (which are required to preserve bistably bounded meets and joins) are strongly sequential, and use this fact to prove universality results for the bistable biorder semantics of the simply-typed lambda-calculus (with atomic constants), and an extension with arithmetic and recursion.   We also construct a bistable model of SPCF, a higher-order functional programming language with non-local control. We use our universality result for the lambda-calculus to show that the semantics of SPCF is fully abstract. We then establish a direct correspondence between bistable functions and sequential algorithms by showing that sequential data structures give rise to bistable biorders, and that each bistable function between such biorders is computed by a sequential algorithm.<|reference_end|>
@article{laird2007bistable,
    title={Bistable Biorders: A Sequential Domain Theory},
    author={James Laird},
    journal={Logical Methods in Computer Science, Volume 3, Issue 2 (May 15,
  2007) lmcs:2222},
    year={2007},
    doi={10.2168/LMCS-3(2:5)2007},
    archivePrefix={arXiv},
    eprint={cs/0702169},
    primaryClass={cs.PL cs.LO}
}