{"id":"https://openalex.org/W2043025259","doi":"https://doi.org/10.2168/lmcs-3(2:5)2007","title":"Bistable Biorders: A Sequential Domain Theory","display_name":"Bistable Biorders: A Sequential Domain Theory","publication_year":2007,"publication_date":"2007-05-15","ids":{"openalex":"https://openalex.org/W2043025259","doi":"https://doi.org/10.2168/lmcs-3(2:5)2007","mag":"2043025259"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-3(2:5)2007","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-3(2:5)2007","pdf_url":"https://lmcs.episciences.org/2222/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/2222/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051457838","display_name":"James D. Laird","orcid":"https://orcid.org/0000-0002-3636-8937"},"institutions":[{"id":"https://openalex.org/I162608824","display_name":"University of Sussex","ror":"https://ror.org/00ayhx656","country_code":"GB","type":"education","lineage":["https://openalex.org/I162608824"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"James Laird","raw_affiliation_strings":["Dept. of Informatics, University of Sussex, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Informatics, University of Sussex, UK","institution_ids":["https://openalex.org/I162608824"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5051457838"],"corresponding_institution_ids":["https://openalex.org/I162608824"],"apc_list":null,"apc_paid":null,"fwci":1.4526,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.85527647,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"Volume 3, Issue 2","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9908000230789185,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bistability","display_name":"Bistability","score":0.8422470688819885},{"id":"https://openalex.org/keywords/cartesian-closed-category","display_name":"Cartesian closed category","score":0.5620015859603882},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5606809258460999},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.4824714958667755},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.48140501976013184},{"id":"https://openalex.org/keywords/joins","display_name":"Joins","score":0.4664171636104584},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4172629117965698},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3766464293003082},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35610219836235046},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32747822999954224},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22757893800735474},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10535699129104614},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08345222473144531},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08060896396636963},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07882764935493469}],"concepts":[{"id":"https://openalex.org/C97292510","wikidata":"https://www.wikidata.org/wiki/Q2304620","display_name":"Bistability","level":2,"score":0.8422470688819885},{"id":"https://openalex.org/C171032842","wikidata":"https://www.wikidata.org/wiki/Q1725874","display_name":"Cartesian closed category","level":2,"score":0.5620015859603882},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5606809258460999},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.4824714958667755},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.48140501976013184},{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.4664171636104584},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4172629117965698},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3766464293003082},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35610219836235046},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32747822999954224},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22757893800735474},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10535699129104614},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08345222473144531},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08060896396636963},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07882764935493469},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.2168/lmcs-3(2:5)2007","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-3(2:5)2007","pdf_url":"https://lmcs.episciences.org/2222/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:cs/0702169","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0702169","pdf_url":"https://arxiv.org/pdf/cs/0702169","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.341.5827","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.341.5827","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0702169v2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.342.8145","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.8145","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0702169v1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.64.727","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.727","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cogs.susx.ac.uk/users/jiml/bb.pdf","raw_type":"text"},{"id":"pmh:oai:doaj.org/article:d1d0d26227b2408ca90fc029f9d0058b","is_oa":true,"landing_page_url":"https://doaj.org/article/d1d0d26227b2408ca90fc029f9d0058b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 3, Issue 2 (2007)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-3(2:5)2007","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-3(2:5)2007","pdf_url":"https://lmcs.episciences.org/2222/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2043025259.pdf","grobid_xml":"https://content.openalex.org/works/W2043025259.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W128738456","https://openalex.org/W182780044","https://openalex.org/W1037112088","https://openalex.org/W1486197358","https://openalex.org/W1516611407","https://openalex.org/W1558075131","https://openalex.org/W1589628946","https://openalex.org/W1597533630","https://openalex.org/W1599781357","https://openalex.org/W1824087518","https://openalex.org/W1920350623","https://openalex.org/W1978840985","https://openalex.org/W1982535387","https://openalex.org/W1985955425","https://openalex.org/W2005637075","https://openalex.org/W2007270285","https://openalex.org/W2012319728","https://openalex.org/W2017055028","https://openalex.org/W2047559554","https://openalex.org/W2054299141","https://openalex.org/W2060852846","https://openalex.org/W2094685149","https://openalex.org/W2095219623","https://openalex.org/W2095636721","https://openalex.org/W2156876717","https://openalex.org/W2156992159","https://openalex.org/W2911979341","https://openalex.org/W4230231514","https://openalex.org/W4285719527","https://openalex.org/W6758148075"],"related_works":["https://openalex.org/W4224217224","https://openalex.org/W2088925915","https://openalex.org/W2382891957","https://openalex.org/W2393491644","https://openalex.org/W2067184662","https://openalex.org/W1964519618","https://openalex.org/W3118640947","https://openalex.org/W2953326236","https://openalex.org/W2759988702","https://openalex.org/W2752311799"],"abstract_inverted_index":{"We":[0,51,98,114,132],"give":[1,150],"a":[2,7,24,33,101,106,135,166],"simple":[3],"order-theoretic":[4],"construction":[5],"of":[6,11,39,45,84,104,127],"Cartesian":[8],"closed":[9],"category":[10],"sequential":[12,142,147,167],"functions.":[13],"It":[14],"is":[15,129,163],"based":[16],"on":[17],"bistable":[18,34,56,81,102,139,153,158],"biorders,":[19,154],"which":[20,36],"are":[21,59,68],"sets":[22],"with":[23,94,111],"partial":[25],"order":[26,30],"--":[27,31],"the":[28,80,85,120,125],"extensional":[29],"and":[32,48,55,66,71,91,96,141,155],"coherence,":[35],"captures":[37],"equivalence":[38],"program":[40],"behaviour,":[41],"up":[42],"to":[43,61,75,122,152],"permutation":[44],"top":[46],"(error)":[47],"bottom":[49],"(divergence).":[50],"show":[52,123],"that":[53,124,146,156],"monotone":[54],"functions":[57,140],"(which":[58],"required":[60],"preserve":[62],"bistably":[63],"bounded":[64],"meets":[65],"joins)":[67],"strongly":[69],"sequential,":[70],"use":[72,115],"this":[73],"fact":[74],"prove":[76],"universality":[77,117],"results":[78],"for":[79,119],"biorder":[82],"semantics":[83,126],"simply-typed":[86],"lambda-calculus":[87,121],"(with":[88],"atomic":[89],"constants),":[90],"an":[92],"extension":[93],"arithmetic":[95],"recursion.":[97],"also":[99],"construct":[100],"model":[103],"SPCF,":[105],"higher-order":[107],"functional":[108],"programming":[109],"language":[110],"non-local":[112],"control.":[113],"our":[116],"result":[118],"SPCF":[128],"fully":[130],"abstract.":[131],"then":[133],"establish":[134],"direct":[136],"correspondence":[137],"between":[138,160],"algorithms":[143],"by":[144,165],"showing":[145],"data":[148],"structures":[149],"rise":[151],"each":[157],"function":[159],"such":[161],"biorders":[162],"computed":[164],"algorithm.":[168]},"counts_by_year":[{"year":2015,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}