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...

Full description

Bibliographic Details

Published in:	Logical methods in computer science Vol. 3, Issue 2
Main Author:	Laird, James
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science e.V 15.05.2007
Subjects:	computer science - logic in computer science computer science - programming languages f.3.2
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!