{"id":"https://openalex.org/W4307731886","doi":"https://doi.org/10.1145/3563340","title":"Checking equivalence in a non-strict language","display_name":"Checking equivalence in a non-strict language","publication_year":2022,"publication_date":"2022-10-31","ids":{"openalex":"https://openalex.org/W4307731886","doi":"https://doi.org/10.1145/3563340"},"language":"en","primary_location":{"id":"doi:10.1145/3563340","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3563340","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3563340","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3563340","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090456949","display_name":"John C. Kolesar","orcid":"https://orcid.org/0000-0002-6084-2387"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"John C. Kolesar","raw_affiliation_strings":["Yale University, USA"],"affiliations":[{"raw_affiliation_string":"Yale University, USA","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045794652","display_name":"Ru\u017eica Piska\u010d","orcid":"https://orcid.org/0000-0002-3267-0776"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ruzica Piskac","raw_affiliation_strings":["Yale University, USA"],"affiliations":[{"raw_affiliation_string":"Yale University, USA","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001928568","display_name":"William T. Hallahan","orcid":"https://orcid.org/0000-0003-4925-3861"},"institutions":[{"id":"https://openalex.org/I123946342","display_name":"Binghamton University","ror":"https://ror.org/008rmbt77","country_code":"US","type":"education","lineage":["https://openalex.org/I123946342"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"William T. Hallahan","raw_affiliation_strings":["Binghamton University, USA"],"affiliations":[{"raw_affiliation_string":"Binghamton University, USA","institution_ids":["https://openalex.org/I123946342"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5090456949"],"corresponding_institution_ids":["https://openalex.org/I32971472"],"apc_list":null,"apc_paid":null,"fwci":0.4164,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.68888702,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"6","issue":"OOPSLA2","first_page":"1469","last_page":"1496"},"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.9998000264167786,"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.9998000264167786,"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.9987000226974487,"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/T10260","display_name":"Software Engineering Research","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/counterexample","display_name":"Counterexample","score":0.8679885268211365},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.8527526259422302},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6519703269004822},{"id":"https://openalex.org/keywords/haskell","display_name":"Haskell","score":0.6030212640762329},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5994629263877869},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5033647418022156},{"id":"https://openalex.org/keywords/logical-equivalence","display_name":"Logical equivalence","score":0.4768993854522705},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.4609646499156952},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.36484983563423157},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34331077337265015},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3290949761867523},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30933210253715515}],"concepts":[{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.8679885268211365},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.8527526259422302},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6519703269004822},{"id":"https://openalex.org/C2780624054","wikidata":"https://www.wikidata.org/wiki/Q34010","display_name":"Haskell","level":3,"score":0.6030212640762329},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5994629263877869},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5033647418022156},{"id":"https://openalex.org/C70846408","wikidata":"https://www.wikidata.org/wiki/Q220433","display_name":"Logical equivalence","level":3,"score":0.4768993854522705},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.4609646499156952},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.36484983563423157},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34331077337265015},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3290949761867523},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30933210253715515},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"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/3563340","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3563340","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3563340","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3563340","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3563340","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3563340","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.44999998807907104,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[{"id":"https://openalex.org/G7306246066","display_name":"TWC: Large: Collaborative: Verifiable Hardware: Chips that Prove their Own Correctness","funder_award_id":"1565208","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G96301305","display_name":"DASS: Accountability from Attention, not Assumption","funder_award_id":"2131476","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310728","display_name":"Centre International de Recherche sur le Cancer","ror":"https://ror.org/00v452281"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4307731886.pdf","grobid_xml":"https://content.openalex.org/works/W4307731886.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W123460044","https://openalex.org/W174956004","https://openalex.org/W1498001169","https://openalex.org/W1506927614","https://openalex.org/W1541587797","https://openalex.org/W1552909716","https://openalex.org/W1596722521","https://openalex.org/W1765915613","https://openalex.org/W1989813138","https://openalex.org/W1993129359","https://openalex.org/W2074888021","https://openalex.org/W2088189323","https://openalex.org/W2097284057","https://openalex.org/W2110907326","https://openalex.org/W2116322260","https://openalex.org/W2125379835","https://openalex.org/W2144562508","https://openalex.org/W2158409018","https://openalex.org/W2183062003","https://openalex.org/W2408152518","https://openalex.org/W2482837440","https://openalex.org/W2886472010","https://openalex.org/W2910204069","https://openalex.org/W2949799707","https://openalex.org/W2953958793","https://openalex.org/W2975856493","https://openalex.org/W2997326335","https://openalex.org/W3097487747","https://openalex.org/W3102406088","https://openalex.org/W3108936444","https://openalex.org/W4234413063","https://openalex.org/W4235180834","https://openalex.org/W4239799099","https://openalex.org/W4246799966","https://openalex.org/W4299968636","https://openalex.org/W6676649285","https://openalex.org/W6950178124"],"related_works":["https://openalex.org/W2127617483","https://openalex.org/W1757338326","https://openalex.org/W2129253059","https://openalex.org/W1504459189","https://openalex.org/W3136890312","https://openalex.org/W1489609867","https://openalex.org/W2175256523","https://openalex.org/W1601811574","https://openalex.org/W1587224678","https://openalex.org/W4307731886"],"abstract_inverted_index":{"Program":[0],"equivalence":[1,31,71,93],"checking":[2],"is":[3],"the":[4,12,30],"task":[5],"of":[6,32,53,80],"confirming":[7],"that":[8,42,58],"two":[9],"programs":[10,33,81],"have":[11],"same":[13],"behavior":[14],"on":[15,23],"corresponding":[16],"inputs.":[17],"We":[18,62,85],"develop":[19],"a":[20,35,64],"calculus":[21,44],"based":[22],"symbolic":[24],"execution":[25],"and":[26,73,94],"coinduction":[27],"to":[28,48,101],"check":[29],"in":[34,83],"non-strict":[36],"functional":[37],"language.":[38],"Additionally,":[39],"we":[40],"show":[41],"our":[43],"can":[45],"be":[46],"used":[47],"derive":[49],"counterexamples":[50,57,96],"for":[51,68],"pairs":[52],"inequivalent":[54],"programs,":[55],"including":[56],"arise":[59],"from":[60],"non-termination.":[61],"describe":[63],"fully":[65],"automated":[66],"approach":[67],"finding":[69],"both":[70,91],"proofs":[72],"counterexamples.":[74],"Our":[75],"implementation,":[76],"Nebula,":[77],"proves":[78],"equivalences":[79],"written":[82],"Haskell.":[84],"demonstrate":[86],"Nebula's":[87],"practical":[88],"effectiveness":[89],"at":[90],"proving":[92],"producing":[95],"automatically":[97],"by":[98],"applying":[99],"Nebula":[100],"existing":[102],"benchmark":[103],"properties.":[104]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}