{"id":"https://openalex.org/W2301245973","doi":"https://doi.org/10.3233/fi-2017-1475","title":"Guard Your Daggers and Traces: Properties of Guarded (Co-)recursion","display_name":"Guard Your Daggers and Traces: Properties of Guarded (Co-)recursion","publication_year":2017,"publication_date":"2017-03-03","ids":{"openalex":"https://openalex.org/W2301245973","doi":"https://doi.org/10.3233/fi-2017-1475","mag":"2301245973"},"language":"en","primary_location":{"id":"doi:10.3233/fi-2017-1475","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2017-1475","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1603.05214","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015904690","display_name":"Stefan Milius","orcid":"https://orcid.org/0000-0002-2021-1644"},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Stefan Milius","raw_affiliation_strings":["Chair for Theoretical Computer Science (Informatik 8), Friedrich-Alexander University Erlangen-N\u00fcrnberg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Chair for Theoretical Computer Science (Informatik 8), Friedrich-Alexander University Erlangen-N\u00fcrnberg, Germany","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058807832","display_name":"Tadeusz Litak","orcid":"https://orcid.org/0000-0003-2240-3161"},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tadeusz Litak","raw_affiliation_strings":["Chair for Theoretical Computer Science (Informatik 8), Friedrich-Alexander University Erlangen-N\u00fcrnberg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Chair for Theoretical Computer Science (Informatik 8), Friedrich-Alexander University Erlangen-N\u00fcrnberg, Germany","institution_ids":["https://openalex.org/I181369854"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5015904690"],"corresponding_institution_ids":["https://openalex.org/I181369854"],"apc_list":null,"apc_paid":null,"fwci":1.1364,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.83551717,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"150","issue":"3-4","first_page":"407","last_page":"449"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9990000128746033,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9990000128746033,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9984999895095825,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9864000082015991,"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/recursion","display_name":"Recursion (computer science)","score":0.7740828990936279},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.7714872360229492},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.6484450101852417},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5605846047401428},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.41844695806503296},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3523288667201996},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3329451084136963},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.24721106886863708},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18100154399871826}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7740828990936279},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.7714872360229492},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.6484450101852417},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5605846047401428},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.41844695806503296},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3523288667201996},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3329451084136963},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.24721106886863708},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18100154399871826},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3233/fi-2017-1475","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2017-1475","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1603.05214","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1603.05214","pdf_url":"https://arxiv.org/pdf/1603.05214","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1603.05214","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1603.05214","pdf_url":"https://arxiv.org/pdf/1603.05214","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.41999998688697815,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W88360193","https://openalex.org/W1490282072","https://openalex.org/W1503973138","https://openalex.org/W1561269335","https://openalex.org/W1561790505","https://openalex.org/W1590132158","https://openalex.org/W1594606586","https://openalex.org/W1605626978","https://openalex.org/W1794561043","https://openalex.org/W1965602413","https://openalex.org/W1969167499","https://openalex.org/W1972464717","https://openalex.org/W1977260399","https://openalex.org/W1978353388","https://openalex.org/W1984902166","https://openalex.org/W1998189680","https://openalex.org/W1998546360","https://openalex.org/W2020900140","https://openalex.org/W2023022663","https://openalex.org/W2038237961","https://openalex.org/W2057028131","https://openalex.org/W2060903041","https://openalex.org/W2082232201","https://openalex.org/W2095747698","https://openalex.org/W2102357532","https://openalex.org/W2118686544","https://openalex.org/W2120777523","https://openalex.org/W2158789193"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1976679120","https://openalex.org/W4281614748","https://openalex.org/W2377519369","https://openalex.org/W30954630","https://openalex.org/W2765883196","https://openalex.org/W3202311233","https://openalex.org/W2034826746","https://openalex.org/W2396919090","https://openalex.org/W2379816237"],"abstract_inverted_index":{"Motivated":[0],"by":[1,62,79],"the":[2,23,57,69,73,86,92],"recent":[3],"interest":[4],"in":[5,112],"models":[6,41,47],"of":[7,25,28,33,42,48,59,75,94,127],"guarded":[8,19,49,87,95,105,108,131],"(co-)recursion,":[9],"we":[10,102],"study":[11],"their":[12],"equational":[13],"properties.":[14],"We":[15,66,89],"formulate":[16],"axioms":[17,24,35,78],"for":[18,130],"fixpoint":[20,109],"operators":[21,110],"generalizing":[22],"iteration":[26],"theories":[27,45,129],"Bloom":[29],"and":[30,46,101,107],"\u00c9sik.":[31],"Models":[32],"these":[34],"include":[36],"both":[37],"standard":[38,70],"(e.g.,":[39],"cpo-based)":[40],"it":[43],"eration":[44],"recursion":[50],"such":[51],"as":[52,119],"complete":[53],"metric":[54],"spaces":[55],"or":[56],"topos":[58],"trees":[60],"studied":[61],"Birkedal":[63],"et":[64],"al.":[65],"show":[67],"that":[68,104],"result":[71],"on":[72,98],"satisfaction":[74],"all":[76],"Conway":[77],"a":[80,99],"unique":[81],"dagger":[82],"operation":[83],"generalizes":[84],"to":[85],"setting.":[88],"also":[90],"introduce":[91],"notion":[93],"trace":[96,106],"operator":[97],"category,":[100],"prove":[103],"are":[111,117],"one-to-one":[113],"correspondence.":[114],"Our":[115],"results":[116],"intended":[118],"first":[120],"steps":[121],"leading,":[122],"hopefully,":[123],"towards":[124],"future":[125],"description":[126],"classifying":[128],"recursion.":[132]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2025-10-10T00:00:00"}