{"id":"https://openalex.org/W7168413882","doi":"https://doi.org/10.4230/lipics.fscd.2026.21","title":"Constructing (Co)inductive Types via Large Sizes","display_name":"Constructing (Co)inductive Types via Large Sizes","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7168413882","doi":"https://doi.org/10.4230/lipics.fscd.2026.21"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26371","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2026.21","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol378-fscd2026/LIPIcs.FSCD.2026.21/LIPIcs.FSCD.2026.21.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol378-fscd2026/LIPIcs.FSCD.2026.21/LIPIcs.FSCD.2026.21.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5140769921","display_name":"Bastiaan Laarakker","orcid":"https://orcid.org/0009-0005-3079-8505"},"institutions":[{"id":"https://openalex.org/I121797337","display_name":"Leiden University","ror":"https://ror.org/027bh9e22","country_code":"NL","type":"education","lineage":["https://openalex.org/I121797337"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Laarakker, Bastiaan","raw_affiliation_strings":["LIACS, Leiden University, The Netherlands"],"raw_orcid":"https://orcid.org/0009-0005-3079-8505","affiliations":[{"raw_affiliation_string":"LIACS, Leiden University, The Netherlands","institution_ids":["https://openalex.org/I121797337"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5140850595","display_name":"Dani\u00ebl Otten","orcid":"https://orcid.org/0000-0003-2557-3959"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Otten, Dani\u00ebl","raw_affiliation_strings":["ILLC, University of Amsterdam, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-2557-3959","affiliations":[{"raw_affiliation_string":"ILLC, University of Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5140840210","display_name":"Benno van den Berg","orcid":"https://orcid.org/0000-0002-0469-0788"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"van den Berg, Benno","raw_affiliation_strings":["ILLC, University of Amsterdam, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-0469-0788","affiliations":[{"raw_affiliation_string":"ILLC, University of Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.87325672,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"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.9882000088691711,"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.9882000088691711,"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.0019000000320374966,"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/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.0017000000225380063,"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.807200014591217},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6485000252723694},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.628000020980835},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.6151000261306763},{"id":"https://openalex.org/keywords/type-theory","display_name":"Type theory","score":0.5659000277519226},{"id":"https://openalex.org/keywords/uncountable-set","display_name":"Uncountable set","score":0.4851999878883362},{"id":"https://openalex.org/keywords/dependent-type","display_name":"Dependent type","score":0.4361000061035156},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.3955000042915344}],"concepts":[{"id":"https://openalex.org/C40220748","wikidata":"https://www.wikidata.org/wiki/Q4227156","display_name":"Coinduction","level":3,"score":0.807200014591217},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6485000252723694},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.628000020980835},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.6151000261306763},{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.5659000277519226},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5612000226974487},{"id":"https://openalex.org/C142399903","wikidata":"https://www.wikidata.org/wiki/Q1128796","display_name":"Uncountable set","level":3,"score":0.4851999878883362},{"id":"https://openalex.org/C20528804","wikidata":"https://www.wikidata.org/wiki/Q997433","display_name":"Dependent type","level":3,"score":0.4361000061035156},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.427700012922287},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.3955000042915344},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38119998574256897},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.3743000030517578},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.35429999232292175},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.335999995470047},{"id":"https://openalex.org/C94461902","wikidata":"https://www.wikidata.org/wiki/Q2762418","display_name":"Formal proof","level":3,"score":0.3353999853134155},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3296999931335449},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3253999948501587},{"id":"https://openalex.org/C138958017","wikidata":"https://www.wikidata.org/wiki/Q190087","display_name":"Data type","level":2,"score":0.32010000944137573},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.30790001153945923},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.30250000953674316},{"id":"https://openalex.org/C527412718","wikidata":"https://www.wikidata.org/wiki/Q855395","display_name":"Interpretation (philosophy)","level":2,"score":0.2890999913215637},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2879999876022339},{"id":"https://openalex.org/C82029504","wikidata":"https://www.wikidata.org/wiki/Q4373882","display_name":"Sequential consistency","level":4,"score":0.28679999709129333},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.2825999855995178},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.273499995470047}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26371","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2026.21","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol378-fscd2026/LIPIcs.FSCD.2026.21/LIPIcs.FSCD.2026.21.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.fscd.2026.21","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fscd.2026.21","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26371","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2026.21","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol378-fscd2026/LIPIcs.FSCD.2026.21/LIPIcs.FSCD.2026.21.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.5822172164916992}],"awards":[{"id":"https://openalex.org/G2738818759","display_name":"Characterizing Expressivity in Operational Semantics (ChEOpS)","funder_award_id":"VI.Veni.232.286","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7168413882.pdf","grobid_xml":"https://content.openalex.org/works/W7168413882.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"To":[0],"ensure":[1],"decidability":[2],"and":[3,18,34,62,102,111],"consistency":[4,136],"of":[5,66,81,100,137,151],"its":[6],"type":[7,92,99,150],"theory,":[8,119],"a":[9,39,82,97],"proof":[10,23],"assistant":[11],"should":[12],"only":[13,128],"accept":[14],"terminating":[15],"recursive":[16],"functions":[17],"productive":[19],"corecursive":[20],"functions.":[21],"Most":[22],"assistants":[24],"enforce":[25],"this":[26,118,126],"through":[27],"syntactic":[28],"conditions,":[29],"which":[30,120,147],"can":[31,55,114],"be":[32,57,115],"restrictive":[33],"non-modular.":[35],"Sized":[36],"types":[37,44,68,113],"are":[38,45],"type-based":[40],"alternative":[41,88],"where":[42,90,125],"(co)inductive":[43],"annotated":[46],"with":[47,96],"additional":[48],"size":[49],"information.":[50],"Well-founded":[51],"induction":[52],"on":[53,122],"sizes":[54,101,152],"then":[56],"used":[58],"to":[59,78],"prove":[60],"termination":[61],"productivity.":[63],"An":[64],"implementation":[65],"sized":[67],"exists":[69],"in":[70,117],"Agda,":[71],"but":[72],"it":[73],"is":[74,94,140],"currently":[75],"inconsistent":[76],"due":[77],"the":[79,131,138,149],"addition":[80],"largest":[83],"size.":[84],"We":[85,107],"investigate":[86],"an":[87,143,154],"approach,":[89],"intensional":[91],"theory":[93,139],"extended":[95],"large":[98],"parametric":[103],"quantifiers":[104],"over":[105],"sizes.":[106],"show":[108],"that":[109],"inductive":[110,133],"coinductive":[112],"constructed":[116],"improves":[121],"earlier":[123],"work":[124],"was":[127],"possible":[129],"for":[130],"finitely-branching":[132],"types.":[134],"The":[135],"justified":[141],"by":[142],"impredicative":[144],"realisability":[145],"model,":[146],"interprets":[148],"as":[153],"uncountable":[155],"ordinal.":[156]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-16T00:00:00"}