{"id":"https://openalex.org/W2530648415","doi":"https://doi.org/10.1145/2933575.2934506","title":"Program Equivalence is Coinductive","display_name":"Program Equivalence is Coinductive","publication_year":2016,"publication_date":"2016-07-05","ids":{"openalex":"https://openalex.org/W2530648415","doi":"https://doi.org/10.1145/2933575.2934506","mag":"2530648415"},"language":"en","primary_location":{"id":"doi:10.1145/2933575.2934506","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2933575.2934506","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},"type":"conference-paper","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/A5077171828","display_name":"Dirk Pattinson","orcid":"https://orcid.org/0000-0002-5832-6666"},"institutions":[{"id":"https://openalex.org/I118347636","display_name":"Australian National University","ror":"https://ror.org/019wvm592","country_code":"AU","type":"education","lineage":["https://openalex.org/I118347636"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Dirk Pattinson","raw_affiliation_strings":["The Australian National University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Australian National University","institution_ids":["https://openalex.org/I118347636"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073765060","display_name":"Lutz Schr\u00f6der","orcid":"https://orcid.org/0000-0002-3146-5906"},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Lutz Schr\u00f6der","raw_affiliation_strings":["Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","institution_ids":["https://openalex.org/I181369854"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.09373848,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"337","last_page":"346"},"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.9994999766349792,"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.9994999766349792,"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.9987999796867371,"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/coinduction","display_name":"Coinduction","score":0.9662205576896667},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6098725199699402},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5549463033676147},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.5050283074378967},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5001859664916992},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4662173390388489},{"id":"https://openalex.org/keywords/signature","display_name":"Signature (topology)","score":0.45009666681289673},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.4312571585178375},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.41543442010879517},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.40597599744796753},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38503363728523254},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3735816478729248},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.3552037477493286},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3414064645767212},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2909267544746399},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.22055748105049133},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.14535710215568542}],"concepts":[{"id":"https://openalex.org/C40220748","wikidata":"https://www.wikidata.org/wiki/Q4227156","display_name":"Coinduction","level":3,"score":0.9662205576896667},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6098725199699402},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5549463033676147},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.5050283074378967},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5001859664916992},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4662173390388489},{"id":"https://openalex.org/C2779696439","wikidata":"https://www.wikidata.org/wiki/Q7512811","display_name":"Signature (topology)","level":2,"score":0.45009666681289673},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.4312571585178375},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.41543442010879517},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.40597599744796753},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38503363728523254},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3735816478729248},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.3552037477493286},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3414064645767212},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2909267544746399},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.22055748105049133},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.14535710215568542},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0},{"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.1145/2933575.2934506","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2933575.2934506","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W195770254","https://openalex.org/W1498220043","https://openalex.org/W1506927614","https://openalex.org/W1508098446","https://openalex.org/W1837997878","https://openalex.org/W1963772255","https://openalex.org/W1981062279","https://openalex.org/W1998368317","https://openalex.org/W1999823887","https://openalex.org/W2043128724","https://openalex.org/W2050628956","https://openalex.org/W2061970672","https://openalex.org/W2088189323","https://openalex.org/W2088941870","https://openalex.org/W2091590322","https://openalex.org/W2093949981","https://openalex.org/W2101032471","https://openalex.org/W2142311525","https://openalex.org/W2161668260","https://openalex.org/W2202809771","https://openalex.org/W4285719527","https://openalex.org/W6630314268","https://openalex.org/W6673192412","https://openalex.org/W6681110350"],"related_works":["https://openalex.org/W2463782052","https://openalex.org/W1541732450","https://openalex.org/W2518082944","https://openalex.org/W1488076266","https://openalex.org/W1562440999","https://openalex.org/W2603068949","https://openalex.org/W1820233200","https://openalex.org/W3101797533","https://openalex.org/W1827680569","https://openalex.org/W136487247"],"abstract_inverted_index":{"We":[0,53],"describe":[1,32],"computational":[2],"models,":[3],"notably":[4],"Turing":[5],"and":[6,24,60,78],"counter":[7],"machines,":[8],"as":[9,140],"state":[10,112],"transition":[11,38],"systems":[12],"with":[13,124,151],"side":[14],"effects.":[15],"Side":[16],"effects":[17],"are":[18],"expressed":[19,139],"via":[20],"an":[21],"algebraic":[22],"signature":[23],"interpreted":[25],"over":[26,46,67],"comodels":[27,31,47,63],"for":[28,106],"that":[29,64,80],"signature:":[30],"the":[33,37,41,68,74,96,120,125,154,158],"memory":[34,97],"model":[35],"while":[36],"system":[39],"captures":[40],"control":[42],"structure.":[43],"Equational":[44],"reasoning":[45],"is":[48,83,148],"known":[49],"to":[50,149],"be":[51,138],"subtle.":[52],"identify":[54],"a":[55,91,102,111],"criterion":[56,82],"on":[57,90,129],"equational":[58,76,93],"theories":[59],"classes":[61],"of":[62,71,73,95,134,146,153],"guarantees":[65],"completeness,":[66],"given":[69],"class":[70],"comodels,":[72],"standard":[75],"calculus,":[77],"show":[79],"this":[81],"satisfied":[84],"in":[85],"our":[86],"leading":[87],"examples.":[88],"Based":[89],"complete":[92,103],"axiomatization":[94],"(co)model,":[98],"we":[99],"then":[100,137],"give":[101],"inductive-coinductive":[104],"calculus":[105],"simulation":[107],"between":[108],"states,":[109],"where":[110,157],"simulates":[113],"another":[114],"if":[115],"it":[116],"has":[117],"at":[118],"least":[119],"same":[121,126],"terminating":[122],"computations,":[123],"cumulative":[127],"effect":[128],"global":[130],"state.":[131],"Extensional":[132],"equivalence":[133],"computations":[135],"can":[136],"mutual":[141],"simulation.":[142],"The":[143],"crucial":[144],"use":[145],"coinduction":[147],"deal":[150],"non-termination":[152],"simulated":[155],"computation":[156],"coinductive":[159],"rule":[160],"permits":[161],"infinite":[162],"unfolding.":[163]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}