{"id":"https://openalex.org/W2573921324","doi":"https://doi.org/10.29007/n51d","title":"Termination Checking in the Presence of Nested Inductive and Coinductive Types","display_name":"Termination Checking in the Presence of Nested Inductive and Coinductive Types","publication_year":2018,"publication_date":"2018-01-23","ids":{"openalex":"https://openalex.org/W2573921324","doi":"https://doi.org/10.29007/n51d","mag":"2573921324"},"language":"en","primary_location":{"id":"doi:10.29007/n51d","is_oa":true,"landing_page_url":"https://doi.org/10.29007/n51d","pdf_url":"https://easychair.org/publications/open/v6HK","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://easychair.org/publications/open/v6HK","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056420469","display_name":"Thorsten Altenkirch","orcid":"https://orcid.org/0000-0002-6582-5025"},"institutions":[{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Thorsten Altenkirch","raw_affiliation_strings":["University of Nottingham"],"affiliations":[{"raw_affiliation_string":"University of Nottingham","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016464590","display_name":"Nils Anders Danielsson","orcid":null},"institutions":[{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Nils Anders Danielsson","raw_affiliation_strings":["University of Nottingham"],"affiliations":[{"raw_affiliation_string":"University of Nottingham","institution_ids":["https://openalex.org/I142263535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5056420469"],"corresponding_institution_ids":["https://openalex.org/I142263535"],"apc_list":null,"apc_paid":null,"fwci":0.3461,"has_fulltext":true,"cited_by_count":16,"citation_normalized_percentile":{"value":0.65312899,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"5","issue":null,"first_page":"101","last_page":"94"},"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.9944000244140625,"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.9861000180244446,"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/coinduction","display_name":"Coinduction","score":0.9729677438735962},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.801928699016571},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7747242450714111},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.7253099679946899},{"id":"https://openalex.org/keywords/simplicity","display_name":"Simplicity","score":0.6941893100738525},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.549579918384552},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.527894139289856},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3522370457649231},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2199447751045227}],"concepts":[{"id":"https://openalex.org/C40220748","wikidata":"https://www.wikidata.org/wiki/Q4227156","display_name":"Coinduction","level":3,"score":0.9729677438735962},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.801928699016571},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7747242450714111},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.7253099679946899},{"id":"https://openalex.org/C2776372474","wikidata":"https://www.wikidata.org/wiki/Q508291","display_name":"Simplicity","level":2,"score":0.6941893100738525},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.549579918384552},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.527894139289856},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3522370457649231},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2199447751045227},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.29007/n51d","is_oa":true,"landing_page_url":"https://doi.org/10.29007/n51d","pdf_url":"https://easychair.org/publications/open/v6HK","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.29007/n51d","is_oa":true,"landing_page_url":"https://doi.org/10.29007/n51d","pdf_url":"https://easychair.org/publications/open/v6HK","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.6800000071525574,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2573921324.pdf","grobid_xml":"https://content.openalex.org/works/W2573921324.grobid-xml"},"referenced_works_count":4,"referenced_works":["https://openalex.org/W23451326","https://openalex.org/W1530804070","https://openalex.org/W1575675278","https://openalex.org/W2162919535"],"related_works":["https://openalex.org/W2368019753","https://openalex.org/W2333930193","https://openalex.org/W4210711561","https://openalex.org/W2592977449","https://openalex.org/W1803721540","https://openalex.org/W2573921324","https://openalex.org/W2163981019","https://openalex.org/W4362597565","https://openalex.org/W3203610362","https://openalex.org/W2020914843"],"abstract_inverted_index":{"In":[0],"the":[1,18,47,59,66,69,73],"dependently":[2],"typed":[3],"functional":[4],"programming":[5],"language":[6,33],"Agda":[7],"one":[8],"can":[9,52],"easily":[10],"mix":[11],"induction":[12],"and":[13,72],"coinduction.":[14],"The":[15],"implementation":[16,67],"of":[17,27,46,58,68],"termination/productivity":[19],"checker":[20,30,71],"is":[21],"based":[22],"on":[23],"a":[24,28,32,42],"simple":[25],"extension":[26],"termination":[29,70],"for":[31],"with":[34],"inductive":[35],"types.":[36],"However,":[37],"this":[38],"simplicity":[39],"comes":[40],"at":[41],"price:":[43],"only":[44],"types":[45,57],"form":[48,60],"\u03bdX.\u03bcY.F":[49],"X":[50,62],"Y":[51],"be":[53],"handled":[54],"directly,":[55],"not":[56],"\u03bcY.\u03bdX.F":[61],"Y.":[63],"We":[64],"explain":[65],"ensuing":[74],"problem.":[75]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}