{"id":"https://openalex.org/W2117439212","doi":"https://doi.org/10.1145/1389449.1389461","title":"Fixed point semantics and partial recursion in Coq","display_name":"Fixed point semantics and partial recursion in Coq","publication_year":2008,"publication_date":"2008-07-15","ids":{"openalex":"https://openalex.org/W2117439212","doi":"https://doi.org/10.1145/1389449.1389461","mag":"2117439212"},"language":"en","primary_location":{"id":"doi:10.1145/1389449.1389461","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1389449.1389461","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming","raw_type":"proceedings-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/A5013318461","display_name":"Yves Bertot","orcid":"https://orcid.org/0000-0001-5052-3019"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Yves Bertot","raw_affiliation_strings":["INRIA Sophia Antipolis, France","[INRIA-Sophia Antipolis, France]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA Sophia Antipolis, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"[INRIA-Sophia Antipolis, France]","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066283441","display_name":"Vladimir Komendantsky","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Vladimir Komendantsky","raw_affiliation_strings":["INRIA Sophia Antipolis, France","[INRIA-Sophia Antipolis, France]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA Sophia Antipolis, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"[INRIA-Sophia Antipolis, France]","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1326498283"],"apc_list":null,"apc_paid":null,"fwci":4.7024,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.94663191,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"89","last_page":"96"},"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.9936000108718872,"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/T11567","display_name":"semigroups and automata theory","score":0.9769999980926514,"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.7387141585350037},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.6326940059661865},{"id":"https://openalex.org/keywords/primitive-recursive-function","display_name":"Primitive recursive function","score":0.5641751289367676},{"id":"https://openalex.org/keywords/logical-framework","display_name":"Logical framework","score":0.5458373427391052},{"id":"https://openalex.org/keywords/type-theory","display_name":"Type theory","score":0.5353427529335022},{"id":"https://openalex.org/keywords/least-fixed-point","display_name":"Least fixed point","score":0.5075486898422241},{"id":"https://openalex.org/keywords/fixed-point","display_name":"Fixed point","score":0.4978165626525879},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.47748610377311707},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47557535767555237},{"id":"https://openalex.org/keywords/proof-assistant","display_name":"Proof assistant","score":0.47363346815109253},{"id":"https://openalex.org/keywords/fixed-point-theorem","display_name":"Fixed-point theorem","score":0.46497654914855957},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.454832524061203},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4213334918022156},{"id":"https://openalex.org/keywords/dependent-type","display_name":"Dependent type","score":0.4163115322589874},{"id":"https://openalex.org/keywords/normalization-property","display_name":"Normalization property","score":0.41621026396751404},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3950826823711395},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.389157235622406},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.3633880913257599},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.3266060948371887},{"id":"https://openalex.org/keywords/natural-deduction","display_name":"Natural deduction","score":0.32234054803848267},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31598514318466187},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2037336826324463},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.19916969537734985},{"id":"https://openalex.org/keywords/schauder-fixed-point-theorem","display_name":"Schauder fixed point theorem","score":0.1586151421070099},{"id":"https://openalex.org/keywords/brouwer-fixed-point-theorem","display_name":"Brouwer fixed-point theorem","score":0.09454071521759033},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0882667601108551},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.08733665943145752}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7387141585350037},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.6326940059661865},{"id":"https://openalex.org/C9986523","wikidata":"https://www.wikidata.org/wiki/Q1570472","display_name":"Primitive recursive function","level":2,"score":0.5641751289367676},{"id":"https://openalex.org/C20693621","wikidata":"https://www.wikidata.org/wiki/Q6667502","display_name":"Logical framework","level":2,"score":0.5458373427391052},{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.5353427529335022},{"id":"https://openalex.org/C27333817","wikidata":"https://www.wikidata.org/wiki/Q6134913","display_name":"Least fixed point","level":5,"score":0.5075486898422241},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.4978165626525879},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.47748610377311707},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47557535767555237},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.47363346815109253},{"id":"https://openalex.org/C45962547","wikidata":"https://www.wikidata.org/wiki/Q1422068","display_name":"Fixed-point theorem","level":2,"score":0.46497654914855957},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.454832524061203},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4213334918022156},{"id":"https://openalex.org/C20528804","wikidata":"https://www.wikidata.org/wiki/Q997433","display_name":"Dependent type","level":3,"score":0.4163115322589874},{"id":"https://openalex.org/C159333733","wikidata":"https://www.wikidata.org/wiki/Q7051809","display_name":"Normalization property","level":2,"score":0.41621026396751404},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3950826823711395},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.389157235622406},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.3633880913257599},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.3266060948371887},{"id":"https://openalex.org/C62073222","wikidata":"https://www.wikidata.org/wiki/Q1572108","display_name":"Natural deduction","level":2,"score":0.32234054803848267},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31598514318466187},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2037336826324463},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.19916969537734985},{"id":"https://openalex.org/C28642324","wikidata":"https://www.wikidata.org/wiki/Q656176","display_name":"Schauder fixed point theorem","level":4,"score":0.1586151421070099},{"id":"https://openalex.org/C146147875","wikidata":"https://www.wikidata.org/wiki/Q1144897","display_name":"Brouwer fixed-point theorem","level":3,"score":0.09454071521759033},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0882667601108551},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.08733665943145752},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1389449.1389461","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1389449.1389461","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1487472891","https://openalex.org/W1511668635","https://openalex.org/W1518939492","https://openalex.org/W1553511155","https://openalex.org/W1558083009","https://openalex.org/W1560253649","https://openalex.org/W1586367033","https://openalex.org/W1588723084","https://openalex.org/W1600645390","https://openalex.org/W1603012589","https://openalex.org/W1603377159","https://openalex.org/W1741698332","https://openalex.org/W1832063684","https://openalex.org/W1857353355","https://openalex.org/W1949275316","https://openalex.org/W1969682671","https://openalex.org/W2011721441","https://openalex.org/W2015256273","https://openalex.org/W2035324774","https://openalex.org/W2113426200","https://openalex.org/W2135625856","https://openalex.org/W2158003132","https://openalex.org/W2163981019","https://openalex.org/W2316240422","https://openalex.org/W2561675875","https://openalex.org/W4285719527","https://openalex.org/W4394639331","https://openalex.org/W6629033094","https://openalex.org/W6630799916","https://openalex.org/W6635056575"],"related_works":["https://openalex.org/W1546516366","https://openalex.org/W2029404646","https://openalex.org/W4241458200","https://openalex.org/W2952016465","https://openalex.org/W1876613152","https://openalex.org/W4362679128","https://openalex.org/W2899390563","https://openalex.org/W2076577093","https://openalex.org/W2305271820","https://openalex.org/W2117439212"],"abstract_inverted_index":{"We":[0],"propose":[1],"to":[2,13,39,68,84],"use":[3],"the":[4,18,25,50,62,86],"Knaster-Tarski":[5],"least":[6],"fixed":[7],"point":[8],"theorem":[9,36],"as":[10],"a":[11],"basis":[12],"define":[14],"recursive":[15],"functions":[16,28,88],"in":[17,33],"Calculus":[19],"of":[20,27,57],"Inductive":[21],"Constructions.":[22],"This":[23,43],"widens":[24],"class":[26],"that":[29,61,78],"can":[30,80],"be":[31,82],"modelled":[32],"type-theory":[34],"based":[35],"proving":[37],"tools":[38],"potentially":[40],"nonterminating":[41],"functions.":[42],"is":[44],"only":[45],"possible":[46,67],"if":[47],"we":[48,76],"extend":[49],"logical":[51],"framework":[52,64],"by":[53],"adding":[54],"some":[55],"axioms":[56],"classical":[58],"logic.We":[59],"claim":[60],"extended":[63,83],"makes":[65],"it":[66],"reason":[69],"about":[70],"terminating":[71],"or":[72],"non-terminating":[73],"computations":[74],"and":[75],"show":[77],"extraction":[79],"also":[81],"handle":[85],"new":[87]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}