{"id":"https://openalex.org/W4414188982","doi":"https://doi.org/10.1017/s0956796825100099","title":"Checking equivalence in a non-strict language","display_name":"Checking equivalence in a non-strict language","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4414188982","doi":"https://doi.org/10.1017/s0956796825100099"},"language":"en","primary_location":{"id":"doi:10.1017/s0956796825100099","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796825100099","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/82D1E4CE7541BDDF5B954B471549C447/S0956796825100099a.pdf/div-class-title-checking-equivalence-in-a-non-strict-language-div.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/82D1E4CE7541BDDF5B954B471549C447/S0956796825100099a.pdf/div-class-title-checking-equivalence-in-a-non-strict-language-div.pdf","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 CHARLES KOLESAR","raw_affiliation_strings":["Yale University"],"affiliations":[{"raw_affiliation_string":"Yale University","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"],"affiliations":[{"raw_affiliation_string":"Yale University","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 TRIEST HALLAHAN","raw_affiliation_strings":["Binghamton University"],"affiliations":[{"raw_affiliation_string":"Binghamton University","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.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12529741,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"35","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.9991000294685364,"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.9991000294685364,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9980999827384949,"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.9976000189781189,"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/equivalence","display_name":"Equivalence (formal languages)","score":0.8709999918937683},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.8650000095367432},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7192999720573425},{"id":"https://openalex.org/keywords/logical-equivalence","display_name":"Logical equivalence","score":0.4837000072002411},{"id":"https://openalex.org/keywords/pi-calculus","display_name":"Pi calculus","score":0.4259999990463257},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.40860000252723694},{"id":"https://openalex.org/keywords/formal-equivalence-checking","display_name":"Formal equivalence checking","score":0.4027000069618225},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.40130001306533813}],"concepts":[{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.8709999918937683},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.8650000095367432},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7192999720573425},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.70660001039505},{"id":"https://openalex.org/C70846408","wikidata":"https://www.wikidata.org/wiki/Q220433","display_name":"Logical equivalence","level":3,"score":0.4837000072002411},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4763000011444092},{"id":"https://openalex.org/C2984882572","wikidata":"https://www.wikidata.org/wiki/Q602886","display_name":"Pi calculus","level":2,"score":0.4259999990463257},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.40860000252723694},{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.4027000069618225},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40139999985694885},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.40130001306533813},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.3702000081539154},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35350000858306885},{"id":"https://openalex.org/C2776863286","wikidata":"https://www.wikidata.org/wiki/Q17104639","display_name":"Weak equivalence","level":3,"score":0.3449000120162964},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3418000042438507},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3230000138282776},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.3111000061035156},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.30730000138282776},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.30149999260902405},{"id":"https://openalex.org/C23123167","wikidata":"https://www.wikidata.org/wiki/Q7661193","display_name":"Symbolic trajectory evaluation","level":3,"score":0.2628999948501587},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.2599000036716461},{"id":"https://openalex.org/C2988012377","wikidata":"https://www.wikidata.org/wiki/Q29966452","display_name":"Functional equivalence","level":2,"score":0.2590000033378601},{"id":"https://openalex.org/C161771561","wikidata":"https://www.wikidata.org/wiki/Q1970286","display_name":"Process calculus","level":2,"score":0.2526000142097473},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2517000138759613}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0956796825100099","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796825100099","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/82D1E4CE7541BDDF5B954B471549C447/S0956796825100099a.pdf/div-class-title-checking-equivalence-in-a-non-strict-language-div.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1017/s0956796825100099","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796825100099","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/82D1E4CE7541BDDF5B954B471549C447/S0956796825100099a.pdf/div-class-title-checking-equivalence-in-a-non-strict-language-div.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1579190114","display_name":"Collaborative Research: FMitF: Track I: Automating and Synthesizing Parallel Zero-Knowledge Protocols","funder_award_id":"2318974","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5739476720","display_name":"Collaborative Research: FMitF: Track I: Automatic Discovery and Verification of Database Query Transformations","funder_award_id":"2219995","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"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":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414188982.pdf","grobid_xml":"https://content.openalex.org/works/W4414188982.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W1164717351","https://openalex.org/W1498001169","https://openalex.org/W1503946341","https://openalex.org/W1506927614","https://openalex.org/W1552909716","https://openalex.org/W1556837122","https://openalex.org/W1574340008","https://openalex.org/W1765915613","https://openalex.org/W1989813138","https://openalex.org/W1993129359","https://openalex.org/W2029776211","https://openalex.org/W2074888021","https://openalex.org/W2088189323","https://openalex.org/W2097284057","https://openalex.org/W2110907326","https://openalex.org/W2116322260","https://openalex.org/W2119451064","https://openalex.org/W2125379835","https://openalex.org/W2127844749","https://openalex.org/W2144562508","https://openalex.org/W2158409018","https://openalex.org/W2482837440","https://openalex.org/W2769582192","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/W3011737828","https://openalex.org/W3097487747","https://openalex.org/W3102406088","https://openalex.org/W3103850025","https://openalex.org/W3108936444","https://openalex.org/W4234413063","https://openalex.org/W4239720440","https://openalex.org/W4239799099","https://openalex.org/W4246799966","https://openalex.org/W4294844136","https://openalex.org/W4299968636"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Program":[1],"equivalence":[2,32,72,96],"checking":[3],"is":[4],"the":[5,13,31],"task":[6],"of":[7,33,54,82],"confirming":[8],"that":[9,43,59],"two":[10],"programs":[11,34,83],"have":[12],"same":[14],"behavior":[15],"on":[16,24],"corresponding":[17],"inputs.":[18],"We":[19,63,87],"develop":[20],"a":[21,36,65],"calculus":[22,45],"based":[23],"symbolic":[25],"execution":[26],"and":[27,74,97],"coinduction":[28],"to":[29,49,104],"check":[30],"in":[35,85],"non-strict":[37],"functional":[38],"language.":[39],"Additionally,":[40],"we":[41],"show":[42],"our":[44],"can":[46],"be":[47],"used":[48],"derive":[50],"counterexamples":[51,58,99],"for":[52,69],"pairs":[53],"inequivalent":[55],"programs,":[56],"including":[57],"arise":[60],"from":[61],"non-termination.":[62],"describe":[64],"fully":[66],"automated":[67],"approach":[68],"finding":[70],"both":[71,94],"proofs":[73],"counterexamples.":[75],"Our":[76],"implementation,":[77],"nebula":[78,89,103],",":[79],"proves":[80],"equivalences":[81],"written":[84],"Haskell.":[86],"demonstrate":[88],"\u2019s":[90],"practical":[91],"effectiveness":[92],"at":[93],"proving":[95],"producing":[98],"automatically":[100],"by":[101],"applying":[102],"existing":[105],"benchmark":[106],"properties.":[107]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}