{"id":"https://openalex.org/W2146471655","doi":"https://doi.org/10.1017/s0960129505004822","title":"Modelling general recursion in type theory","display_name":"Modelling general recursion in type theory","publication_year":2005,"publication_date":"2005-07-15","ids":{"openalex":"https://openalex.org/W2146471655","doi":"https://doi.org/10.1017/s0960129505004822","mag":"2146471655"},"language":"en","primary_location":{"id":"doi:10.1017/s0960129505004822","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0960129505004822","pdf_url":null,"source":{"id":"https://openalex.org/S101766102","display_name":"Mathematical Structures in Computer Science","issn_l":"0960-1295","issn":["0960-1295","1469-8072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Structures in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004649474","display_name":"Ana Bove","orcid":"https://orcid.org/0000-0002-4723-9372"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"ANA BOVE","raw_affiliation_strings":["Department of Computing Science, Chalmers University of Technology, 412 96 G\u00f6teborg, Sweden Email:","Department of Computing Science, Chalmers University of Technology, 412 96 G\u00f6teborg, Sweden Email: bove@cs.chalmers.se"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, Chalmers University of Technology, 412 96 G\u00f6teborg, Sweden Email:","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Department of Computing Science, Chalmers University of Technology, 412 96 G\u00f6teborg, Sweden Email: bove@cs.chalmers.se","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025355354","display_name":"Venanzio Capretta","orcid":"https://orcid.org/0000-0003-1220-7706"},"institutions":[{"id":"https://openalex.org/I153718931","display_name":"University of Ottawa","ror":"https://ror.org/03c4mmv16","country_code":"CA","type":"education","lineage":["https://openalex.org/I153718931"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"VENANZIO CAPRETTA","raw_affiliation_strings":["Department of Mathematics and Statistics, University of Ottawa, 585 King Edward Ave., Ottawa, ON, K1N 6N5, Canada Email:","Department of Mathematics and Statistics, University of Ottawa, 585 King Edward Ave., Ottawa, ON, K1N 6N5, Canada Email: venanzio.capretta@mathstat.uottawa.ca#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, University of Ottawa, 585 King Edward Ave., Ottawa, ON, K1N 6N5, Canada Email:","institution_ids":["https://openalex.org/I153718931"]},{"raw_affiliation_string":"Department of Mathematics and Statistics, University of Ottawa, 585 King Edward Ave., Ottawa, ON, K1N 6N5, Canada Email: venanzio.capretta@mathstat.uottawa.ca#TAB#","institution_ids":["https://openalex.org/I153718931"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5004649474"],"corresponding_institution_ids":["https://openalex.org/I66862912"],"apc_list":null,"apc_paid":null,"fwci":8.2274,"has_fulltext":false,"cited_by_count":85,"citation_normalized_percentile":{"value":0.97473542,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"15","issue":"4","first_page":"671","last_page":"708"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9747999906539917,"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.9713000059127808,"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/type-theory","display_name":"Type theory","score":0.7706940770149231},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.7435773611068726},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6502681970596313},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6123945713043213},{"id":"https://openalex.org/keywords/mutual-recursion","display_name":"Mutual recursion","score":0.540203869342804},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.5217605233192444},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5170239210128784},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.5069770812988281},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.5007476806640625},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.46506837010383606},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.44668564200401306},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4246447682380676},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3954191207885742},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3890717625617981},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3457989990711212}],"concepts":[{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.7706940770149231},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7435773611068726},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6502681970596313},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6123945713043213},{"id":"https://openalex.org/C124416688","wikidata":"https://www.wikidata.org/wiki/Q3454656","display_name":"Mutual recursion","level":3,"score":0.540203869342804},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.5217605233192444},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5170239210128784},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.5069770812988281},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.5007476806640625},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.46506837010383606},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.44668564200401306},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4246447682380676},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3954191207885742},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3890717625617981},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3457989990711212},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"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/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"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":5,"locations":[{"id":"doi:10.1017/s0960129505004822","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0960129505004822","pdf_url":null,"source":{"id":"https://openalex.org/S101766102","display_name":"Mathematical Structures in Computer Science","issn_l":"0960-1295","issn":["0960-1295","1469-8072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Structures in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.57.6947","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.6947","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.chalmers.se/~bove/Papers/general_presentation.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.7.7572","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.7572","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.chalmers.se/~bove/Papers/general_presentation.ps.gz","raw_type":"text"},{"id":"pmh:oai:publications.lib.chalmers.se:7307","is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/7307-modelling-general-recursion-in-type-theory","pdf_url":null,"source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text.Article.Journal.PeerReviewed"},{"id":"pmh:oai:research.chalmers.se:7307","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/7307","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W102560427","https://openalex.org/W569543113","https://openalex.org/W1479894205","https://openalex.org/W1493068803","https://openalex.org/W1511133369","https://openalex.org/W1511668635","https://openalex.org/W1525598168","https://openalex.org/W1535521146","https://openalex.org/W1539706239","https://openalex.org/W1556536463","https://openalex.org/W1570311220","https://openalex.org/W1574366287","https://openalex.org/W1575531367","https://openalex.org/W1577354412","https://openalex.org/W1581378641","https://openalex.org/W1586367033","https://openalex.org/W1608751598","https://openalex.org/W1829244603","https://openalex.org/W1852211073","https://openalex.org/W1872634431","https://openalex.org/W1904811476","https://openalex.org/W1969682671","https://openalex.org/W1986402635","https://openalex.org/W2035324774","https://openalex.org/W2044758536","https://openalex.org/W2058174669","https://openalex.org/W2062887328","https://openalex.org/W2062950667","https://openalex.org/W2078334802","https://openalex.org/W2081019971","https://openalex.org/W2084307964","https://openalex.org/W2104860831","https://openalex.org/W2148387264","https://openalex.org/W2164343886","https://openalex.org/W2379747207","https://openalex.org/W2913493861","https://openalex.org/W2922769443","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1538267314","https://openalex.org/W2786712325","https://openalex.org/W2125274893","https://openalex.org/W2168281995","https://openalex.org/W2785649064","https://openalex.org/W2939807911","https://openalex.org/W2146471655","https://openalex.org/W2788182112","https://openalex.org/W1534565738","https://openalex.org/W1586367033"],"abstract_inverted_index":{"Constructive":[0],"type":[1,21,46,73],"theory":[2,22,47],"is":[3,27,82,105,159],"an":[4,85],"expressive":[5],"programming":[6,25,155],"language":[7,26],"in":[8,35,45,72,152],"which":[9,95],"both":[10],"algorithms":[11,40,71,137],"and":[12,126,132,141,174,178],"proofs":[13],"can":[14,32],"be":[15,33],"represented.":[16],"A":[17],"limitation":[18],"of":[19,102,129,171],"constructive":[20],"as":[23,147,149],"a":[24,65,76,153,168],"that":[28,53,90,114],"only":[29],"terminating":[30],"programs":[31],"defined":[34,107],"it.":[36],"Hence,":[37],"general":[38,69,77],"recursive":[39,51,70,78,163],"have":[41],"no":[42,55,160],"direct":[43],"formalisation":[44],"since":[48],"they":[49],"contain":[50],"calls":[52],"satisfy":[54,118],"syntactic":[56],"condition":[57],"guaranteeing":[58],"termination.":[59],"In":[60],"this":[61,119],"work,":[62],"we":[63,166],"present":[64],"method":[66,81,122,173],"to":[67,83,143],"formalise":[68],"theory.":[74],"Given":[75],"algorithm,":[79],"our":[80],"define":[84],"inductive":[86],"special-purpose":[87],"accessibility":[88],"predicate":[89],"characterises":[91],"the":[92,96,103,112,115,124,130,134,172],"inputs":[93],"on":[94,111,162],"algorithm":[97,104],"terminates.":[98],"The":[99,121],"type-theoretic":[100,136],"version":[101],"then":[106],"by":[108],"structural":[109],"recursion":[110],"proof":[113],"input":[116],"values":[117],"predicate.":[120],"separates":[123],"computational":[125],"logical":[127],"parts":[128],"definitions":[131],"thus":[133],"resulting":[135],"are":[138,146],"clear,":[139],"compact":[140],"easy":[142],"understand.":[144],"They":[145],"simple":[148],"their":[150],"equivalents":[151],"functional":[154],"language,":[156],"where":[157],"there":[158],"restriction":[161],"calls.":[164],"Here,":[165],"give":[167],"formal":[169],"definition":[170],"discuss":[175],"its":[176,179],"power":[177],"limitations.":[180]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}