{"id":"https://openalex.org/W2462468993","doi":"https://doi.org/10.2168/lmcs-12(3:7)2016","title":"The Guarded Lambda-Calculus: Programming and Reasoning with Guarded Recursion for Coinductive Types","display_name":"The Guarded Lambda-Calculus: Programming and Reasoning with Guarded Recursion for Coinductive Types","publication_year":2017,"publication_date":"2017-04-27","ids":{"openalex":"https://openalex.org/W2462468993","doi":"https://doi.org/10.2168/lmcs-12(3:7)2016","mag":"2462468993"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-12(3:7)2016","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-12(3:7)2016","pdf_url":"https://lmcs.episciences.org/2019/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":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/2019/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019623257","display_name":"Ranald Clouston","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Ranald Clouston","raw_affiliation_strings":["Department of Computer Science, Aarhus University, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067950871","display_name":"Ale\u0161 Bizjak","orcid":"https://orcid.org/0000-0002-2982-827X"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Ale\u0161 Bizjak","raw_affiliation_strings":["Department of Computer Science, Aarhus University, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087440000","display_name":"Hans Bugge Grathwohl","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Hans Bugge Grathwohl","raw_affiliation_strings":["Department of Computer Science, Aarhus University, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055959064","display_name":"Lars Birkedal","orcid":"https://orcid.org/0000-0003-1320-0098"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Lars Birkedal","raw_affiliation_strings":["Department of Computer Science, Aarhus University, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0654,"has_fulltext":true,"cited_by_count":21,"citation_normalized_percentile":{"value":0.89800007,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"Volume 12, 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/T10126","display_name":"Logic, programming, and type systems","score":0.9997000098228455,"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.9997000098228455,"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.9986000061035156,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.988099992275238,"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.9707029461860657},{"id":"https://openalex.org/keywords/predicate-transformer-semantics","display_name":"Predicate transformer semantics","score":0.5998179912567139},{"id":"https://openalex.org/keywords/lambda-calculus","display_name":"Lambda calculus","score":0.5867800116539001},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5846127867698669},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.5771074295043945},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.533714771270752},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.4751025438308716},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.47388026118278503},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4737996459007263},{"id":"https://openalex.org/keywords/simply-typed-lambda-calculus","display_name":"Simply typed lambda calculus","score":0.4730186462402344},{"id":"https://openalex.org/keywords/dependent-type","display_name":"Dependent type","score":0.4438348710536957},{"id":"https://openalex.org/keywords/typed-lambda-calculus","display_name":"Typed lambda calculus","score":0.4435533583164215},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.43333500623703003},{"id":"https://openalex.org/keywords/type-theory","display_name":"Type theory","score":0.41710150241851807},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.41380053758621216},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4107826054096222},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.40885359048843384},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34208327531814575},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.3115023374557495},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.29253238439559937},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.18563184142112732}],"concepts":[{"id":"https://openalex.org/C40220748","wikidata":"https://www.wikidata.org/wiki/Q4227156","display_name":"Coinduction","level":3,"score":0.9707029461860657},{"id":"https://openalex.org/C30128091","wikidata":"https://www.wikidata.org/wiki/Q291929","display_name":"Predicate transformer semantics","level":4,"score":0.5998179912567139},{"id":"https://openalex.org/C135790938","wikidata":"https://www.wikidata.org/wiki/Q242028","display_name":"Lambda calculus","level":2,"score":0.5867800116539001},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5846127867698669},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.5771074295043945},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.533714771270752},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.4751025438308716},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.47388026118278503},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4737996459007263},{"id":"https://openalex.org/C61237538","wikidata":"https://www.wikidata.org/wiki/Q855192","display_name":"Simply typed lambda calculus","level":4,"score":0.4730186462402344},{"id":"https://openalex.org/C20528804","wikidata":"https://www.wikidata.org/wiki/Q997433","display_name":"Dependent type","level":3,"score":0.4438348710536957},{"id":"https://openalex.org/C142156749","wikidata":"https://www.wikidata.org/wiki/Q2607208","display_name":"Typed lambda calculus","level":3,"score":0.4435533583164215},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.43333500623703003},{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.41710150241851807},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.41380053758621216},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4107826054096222},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.40885359048843384},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34208327531814575},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.3115023374557495},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.29253238439559937},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.18563184142112732},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.2168/lmcs-12(3:7)2016","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-12(3:7)2016","pdf_url":"https://lmcs.episciences.org/2019/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"},{"id":"pmh:oai:arXiv.org:1606.09455","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1606.09455","pdf_url":"https://arxiv.org/pdf/1606.09455","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire/9d2e1cdf-f396-4f85-84b8-13099c6102a4","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/9d2e1cdf-f396-4f85-84b8-13099c6102a4","pdf_url":"https://pure.au.dk/ws/files/103312085/1606.09455v2","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Clouston, R, Bizjak, A, Grathwohl, H B & Birkedal, L 2016, 'The Guarded Lambda-Calculus : Programming and Reasoning with Guarded Recursion for Coinductive Types', Logical Methods in Computer Science, vol. 12, no. 3, pp. 1 - 39. https://doi.org/10.2168/LMCS-12(3:7)2016","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:doaj.org/article:1366e42ab74d4ccda101393e79dfd4de","is_oa":true,"landing_page_url":"https://doaj.org/article/1366e42ab74d4ccda101393e79dfd4de","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 12, Issue 3 (2017)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-12(3:7)2016","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-12(3:7)2016","pdf_url":"https://lmcs.episciences.org/2019/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":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.6899999976158142}],"awards":[],"funders":[{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"},{"id":"https://openalex.org/F4320322928","display_name":"Danmarks Frie Forskningsfond","ror":"https://ror.org/02sptwz63"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2462468993.pdf","grobid_xml":"https://content.openalex.org/works/W2462468993.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W88360193","https://openalex.org/W1488538795","https://openalex.org/W1575675278","https://openalex.org/W1678412398","https://openalex.org/W1868623080","https://openalex.org/W2029408547","https://openalex.org/W2030299533","https://openalex.org/W2048043961","https://openalex.org/W2107354844","https://openalex.org/W2143623703","https://openalex.org/W2509578035","https://openalex.org/W2546131033","https://openalex.org/W2550513301"],"related_works":["https://openalex.org/W3123171335","https://openalex.org/W1594451895","https://openalex.org/W32986836","https://openalex.org/W2566708468","https://openalex.org/W2153353244","https://openalex.org/W1983748102","https://openalex.org/W2027907817","https://openalex.org/W4297858128","https://openalex.org/W114844303","https://openalex.org/W2462468993"],"abstract_inverted_index":{"We":[0,56,87,103],"present":[1],"the":[2,8,25,51,63,71,80,98,105,108,112],"guarded":[3,13,21],"lambda-calculus,":[4],"an":[5],"extension":[6],"of":[7,20,27,53,73,82,101,107,114],"simply":[9],"typed":[10],"lambda-calculus":[11],"with":[12,92],"recursive":[14,22,31],"and":[15,46,65],"coinductive":[16,37],"types.":[17],"The":[18,75],"use":[19],"types":[23,32,38],"ensures":[24],"productivity":[26],"well-typed":[28],"programs.":[29,102],"Guarded":[30],"may":[33],"be":[34],"transformed":[35],"into":[36],"by":[39,43,110],"a":[40,58,83,89],"type-former":[41],"inspired":[42],"modal":[44],"logic":[45,91],"Atkey-McBride":[47],"clock":[48],"quantification,":[49],"allowing":[50],"typing":[52],"acausal":[54],"functions.":[55],"give":[57],"call-by-name":[59],"operational":[60],"semantics":[61,69],"for":[62,95],"calculus,":[64],"define":[66],"adequate":[67],"denotational":[68],"in":[70],"topos":[72],"trees.":[74],"adequacy":[76],"proof":[77],"entails":[78],"that":[79],"evaluation":[81],"program":[84,90],"always":[85],"terminates.":[86],"introduce":[88],"L\\\"ob":[93],"induction":[94],"reasoning":[96],"about":[97],"contextual":[99],"equivalence":[100],"demonstrate":[104],"expressiveness":[106],"calculus":[109],"showing":[111],"definability":[113],"solutions":[115],"to":[116],"Rutten's":[117],"behavioural":[118],"differential":[119],"equations.":[120]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2020-11-23T00:00:00"}