{"id":"https://openalex.org/W2083792687","doi":"https://doi.org/10.1017/s0956796898003165","title":"A theory of weak bisimulation for Core CML","display_name":"A theory of weak bisimulation for Core CML","publication_year":1998,"publication_date":"1998-09-01","ids":{"openalex":"https://openalex.org/W2083792687","doi":"https://doi.org/10.1017/s0956796898003165","mag":"2083792687"},"language":"en","primary_location":{"id":"doi:10.1017/s0956796898003165","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0956796898003165","pdf_url":null,"source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043011289","display_name":"William Ferreira","orcid":"https://orcid.org/0000-0002-5851-8270"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"WILLIAM FERREIRA","raw_affiliation_strings":["Computing Laboratory, University of Cambridge, Cambridge, UK","Computing Laboratory, University of Cambridge, Cambridge, UK#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computing Laboratory, University of Cambridge, Cambridge, UK","institution_ids":["https://openalex.org/I241749"]},{"raw_affiliation_string":"Computing Laboratory, University of Cambridge, Cambridge, UK#TAB#","institution_ids":["https://openalex.org/I241749"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036035088","display_name":"Matthew Hennessy","orcid":null},"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":false,"raw_author_name":"MATTHEW HENNESSY","raw_affiliation_strings":["School of Cognitive and Computing Sciences, University of Sussex, Brighton, UK","School of Cognitive and Computing Sciences University of Sussex, Brighton, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Cognitive and Computing Sciences, University of Sussex, Brighton, UK","institution_ids":["https://openalex.org/I162608824"]},{"raw_affiliation_string":"School of Cognitive and Computing Sciences University of Sussex, Brighton, UK","institution_ids":["https://openalex.org/I162608824"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012868882","display_name":"Alan Jeffrey","orcid":"https://orcid.org/0000-0001-6342-0318"},"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":false,"raw_author_name":"ALAN JEFFREY","raw_affiliation_strings":["School of Cognitive and Computing Sciences, University of Sussex, Brighton, UK","School of Cognitive and Computing Sciences University of Sussex, Brighton, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Cognitive and Computing Sciences, University of Sussex, Brighton, UK","institution_ids":["https://openalex.org/I162608824"]},{"raw_affiliation_string":"School of Cognitive and Computing Sciences University of Sussex, Brighton, UK","institution_ids":["https://openalex.org/I162608824"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5043011289"],"corresponding_institution_ids":["https://openalex.org/I241749"],"apc_list":null,"apc_paid":null,"fwci":1.6482,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.86985238,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"8","issue":"5","first_page":"447","last_page":"491"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9983000159263611,"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"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9966999888420105,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.9281650185585022},{"id":"https://openalex.org/keywords/process-calculus","display_name":"Process calculus","score":0.7541232705116272},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.6905431747436523},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6640660166740417},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6470698118209839},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6364383101463318},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.6028397679328918},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.5569585561752319},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4699647128582001},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.43417078256607056},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4243416488170624},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.40244901180267334},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35020673274993896},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27013057470321655},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.16273432970046997}],"concepts":[{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.9281650185585022},{"id":"https://openalex.org/C161771561","wikidata":"https://www.wikidata.org/wiki/Q1970286","display_name":"Process calculus","level":2,"score":0.7541232705116272},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.6905431747436523},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6640660166740417},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6470698118209839},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6364383101463318},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.6028397679328918},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5569585561752319},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4699647128582001},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.43417078256607056},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4243416488170624},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.40244901180267334},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35020673274993896},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27013057470321655},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.16273432970046997},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0956796898003165","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0956796898003165","pdf_url":null,"source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1548677193","https://openalex.org/W1576242407","https://openalex.org/W1593666219","https://openalex.org/W1770668492","https://openalex.org/W1790031272","https://openalex.org/W1824183965","https://openalex.org/W1906944391","https://openalex.org/W1965724121","https://openalex.org/W1980939032","https://openalex.org/W1987868327","https://openalex.org/W1997143185","https://openalex.org/W2015888335","https://openalex.org/W2031129600","https://openalex.org/W2085273936","https://openalex.org/W2088735483","https://openalex.org/W2098830227","https://openalex.org/W2113020196","https://openalex.org/W2128932399","https://openalex.org/W2136920408","https://openalex.org/W2158942489","https://openalex.org/W2167949883"],"related_works":["https://openalex.org/W1547524815","https://openalex.org/W2951374406","https://openalex.org/W4300624557","https://openalex.org/W1532145728","https://openalex.org/W2091970733","https://openalex.org/W3020829080","https://openalex.org/W3081656401","https://openalex.org/W207043953","https://openalex.org/W1608609850","https://openalex.org/W2083792687"],"abstract_inverted_index":{"Concurrent":[0],"ML":[1,8],"(CML)":[2],"is":[3],"an":[4],"extension":[5],"of":[6,9,18,42,57,66,73],"Standard":[7],"New":[10],"Jersey":[11],"with":[12],"concurrent":[13],"features":[14],"similar":[15],"to":[16,61,84,87],"those":[17],"process":[19,47],"algebra.":[20,48],"In":[21],"this":[22],"paper,":[23],"we":[24,53],"build":[25,62],"upon":[26],"John":[27],"Reppy's":[28,85],"reduction":[29],"semantics":[30,38,52,82],"for":[31,39],"CML":[32,76],"by":[33],"constructing":[34],"a":[35,40,63],"compositional":[36],"operational":[37,51],"fragment":[41],"CML,":[43],"based":[44],"on":[45],"higher-order":[46],"Using":[49],"the":[50,55],"generalise":[54],"notion":[56],"weak":[58,88],"bisimulation":[59],"equivalence":[60],"semantic":[64],"theory":[65],"CML.":[67],"We":[68],"give":[69],"some":[70],"small":[71],"examples":[72],"proofs":[74],"about":[75],"expressions,":[77],"and":[78],"show":[79],"that":[80],"our":[81],"corresponds":[83],"up":[86],"first-order":[89],"bisimulation.":[90]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-23T06:14:38.165362","created_date":"2025-10-10T00:00:00"}