{"id":"https://openalex.org/W4414110085","doi":"https://doi.org/10.46298/lmcs-21(3:19)2025","title":"Totality for Mixed Inductive and Coinductive Types","display_name":"Totality for Mixed Inductive and Coinductive Types","publication_year":2025,"publication_date":"2025-09-03","ids":{"openalex":"https://openalex.org/W4414110085","doi":"https://doi.org/10.46298/lmcs-21(3:19)2025"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-21(3:19)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(3:19)2025","pdf_url":"https://lmcs.episciences.org/16449/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":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/16449/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081262354","display_name":"Pierre Hyvernat","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I70900168","display_name":"Universit\u00e9 Savoie Mont Blanc","ror":"https://ror.org/04gqg1a07","country_code":"FR","type":"education","lineage":["https://openalex.org/I70900168"]},{"id":"https://openalex.org/I4210144844","display_name":"Laboratoire d\u2019Analyse et de Math\u00e9matiques Appliqu\u00e9es","ror":"https://ror.org/0581g8849","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I197681013","https://openalex.org/I4210141950","https://openalex.org/I4210144844","https://openalex.org/I4210154111"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Pierre Hyvernat","raw_affiliation_strings":["Universit Savoie Mont Blanc , CNRS , LAMA , 73000 Chambry , France. CA 94105 , USA , or Eisenacher Strasse 2 , 10777 Berlin , Germany"],"affiliations":[{"raw_affiliation_string":"Universit Savoie Mont Blanc , CNRS , LAMA , 73000 Chambry , France. CA 94105 , USA , or Eisenacher Strasse 2 , 10777 Berlin , Germany","institution_ids":["https://openalex.org/I70900168","https://openalex.org/I4210144844","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5081262354"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210144844","https://openalex.org/I70900168"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.24952133,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 21, Issue 3","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.5899999737739563,"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"}},"topics":[{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.5899999737739563,"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.955299973487854},{"id":"https://openalex.org/keywords/haskell","display_name":"Haskell","score":0.6919999718666077},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6383000016212463},{"id":"https://openalex.org/keywords/interpretation","display_name":"Interpretation (philosophy)","score":0.5432999730110168},{"id":"https://openalex.org/keywords/type-theory","display_name":"Type theory","score":0.5145000219345093},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.5128999948501587},{"id":"https://openalex.org/keywords/proof-assistant","display_name":"Proof assistant","score":0.4855000078678131},{"id":"https://openalex.org/keywords/abstract-interpretation","display_name":"Abstract interpretation","score":0.4345000088214874},{"id":"https://openalex.org/keywords/dependent-type","display_name":"Dependent type","score":0.42489999532699585}],"concepts":[{"id":"https://openalex.org/C40220748","wikidata":"https://www.wikidata.org/wiki/Q4227156","display_name":"Coinduction","level":3,"score":0.955299973487854},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7186999917030334},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7074999809265137},{"id":"https://openalex.org/C2780624054","wikidata":"https://www.wikidata.org/wiki/Q34010","display_name":"Haskell","level":3,"score":0.6919999718666077},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6383000016212463},{"id":"https://openalex.org/C527412718","wikidata":"https://www.wikidata.org/wiki/Q855395","display_name":"Interpretation (philosophy)","level":2,"score":0.5432999730110168},{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.5145000219345093},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.5128999948501587},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.4855000078678131},{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.4345000088214874},{"id":"https://openalex.org/C20528804","wikidata":"https://www.wikidata.org/wiki/Q997433","display_name":"Dependent type","level":3,"score":0.42489999532699585},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4088999927043915},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3903000056743622},{"id":"https://openalex.org/C98184364","wikidata":"https://www.wikidata.org/wiki/Q1780131","display_name":"Argument (complex analysis)","level":2,"score":0.37869998812675476},{"id":"https://openalex.org/C2780432614","wikidata":"https://www.wikidata.org/wiki/Q864213","display_name":"Conservative extension","level":2,"score":0.35679998993873596},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.35100001096725464},{"id":"https://openalex.org/C55128367","wikidata":"https://www.wikidata.org/wiki/Q2552799","display_name":"System F","level":3,"score":0.34130001068115234},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.3361000120639801},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.3346000015735626},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.32749998569488525},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.325300008058548},{"id":"https://openalex.org/C154564781","wikidata":"https://www.wikidata.org/wiki/Q5384236","display_name":"Equational logic","level":3,"score":0.30730000138282776},{"id":"https://openalex.org/C2777855551","wikidata":"https://www.wikidata.org/wiki/Q12310021","display_name":"Subject (documents)","level":2,"score":0.3019999861717224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30090001225471497},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2872999906539917},{"id":"https://openalex.org/C2778361913","wikidata":"https://www.wikidata.org/wiki/Q7248437","display_name":"Program transformation","level":2,"score":0.2761000096797943},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.2728999853134155},{"id":"https://openalex.org/C142156749","wikidata":"https://www.wikidata.org/wiki/Q2607208","display_name":"Typed lambda calculus","level":3,"score":0.2653999924659729},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2632000148296356},{"id":"https://openalex.org/C17435882","wikidata":"https://www.wikidata.org/wiki/Q17030435","display_name":"HOL","level":2,"score":0.25780001282691956},{"id":"https://openalex.org/C9986523","wikidata":"https://www.wikidata.org/wiki/Q1570472","display_name":"Primitive recursive function","level":2,"score":0.25130000710487366},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.46298/lmcs-21(3:19)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(3:19)2025","pdf_url":"https://lmcs.episciences.org/16449/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"}],"best_oa_location":{"id":"doi:10.46298/lmcs-21(3:19)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(3:19)2025","pdf_url":"https://lmcs.episciences.org/16449/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":[{"id":"https://openalex.org/G6858444455","display_name":null,"funder_award_id":"ANR-21-CE48-019-01","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414110085.pdf","grobid_xml":"https://content.openalex.org/works/W4414110085.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1523149969","https://openalex.org/W4246799966","https://openalex.org/W1680684178","https://openalex.org/W2530227870","https://openalex.org/W2737623643","https://openalex.org/W2158409018","https://openalex.org/W2908075982","https://openalex.org/W3023599973","https://openalex.org/W1864217700"],"abstract_inverted_index":{"This":[0,118],"paper":[1,119],"introduces":[2],"an":[3,78,86,132],"ML":[4],"/":[5],"Haskell":[6],"like":[7,63],"programming":[8],"language":[9],"with":[10,38,146],"nested":[11],"inductive":[12],"and":[13,26,32,74,101,140],"coinductive":[14],"algebraic":[15],"datatypes":[16],"called":[17],"\\chariot.":[18],"Functions":[19],"are":[20,116],"defined":[21],"by":[22,113],"arbitrary":[23],"recursive":[24,114],"definitions":[25,115],"can":[27,141],"thus":[28],"lead":[29],"to":[30,107,144],"non-termination":[31],"other":[33],"``bad''":[34],"behavior.":[35],"\\chariot":[36],"comes":[37],"a":[39,48,152],"totality":[40,49,149],"checker":[41,50,69],"that":[42,109],"tags":[43],"possibly":[44],"ill-behaved":[45],"definitions.":[46],"Such":[47],"is":[51,70],"mandatory":[52],"in":[53,155],"the":[54,98,110,121,125,129,147],"context":[55],"of":[56,67,80,88,131,157],"proof":[57],"assistants":[58],"based":[59],"on":[60,76],"type":[61],"theory":[62],"Agda.":[64],"Proving":[65],"correctness":[66],"this":[68,158],"far":[71],"from":[72],"trivial":[73],"relies":[75],"-":[77,85,97],"interpretation":[79,87],"types":[81],"as":[82,91],"parity":[83],"games,":[84,96],"correct":[89],"values":[90],"winning":[92],"strategies":[93,111],"for":[94],"those":[95],"Lee,":[99],"Jones":[100],"Ben":[102],"Amram's":[103],"size-change":[104],"principle,":[105],"used":[106,143],"check":[108],"induced":[112],"winning.":[117],"develops":[120],"first":[122],"two":[123],"points,":[124],"last":[126],"step":[127],"being":[128],"subject":[130],"upcoming":[133],"paper.":[134],"A":[135],"prototype":[136],"has":[137],"been":[138],"implemented":[139],"be":[142],"experiment":[145],"resulting":[148],"checker,":[150],"giving":[151],"practical":[153],"argument":[154],"favor":[156],"principle.":[159]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}