{"id":"https://openalex.org/W2586911241","doi":"https://doi.org/10.1017/s0956796817000028","title":"A comprehensible guide to a new unifier for CIC including universe polymorphism and overloading","display_name":"A comprehensible guide to a new unifier for CIC including universe polymorphism and overloading","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2586911241","doi":"https://doi.org/10.1017/s0956796817000028","mag":"2586911241"},"language":"en","primary_location":{"id":"doi:10.1017/s0956796817000028","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796817000028","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/19A095CA0645F89A772B7E2B7B3D92B2/S0956796817000028a.pdf/div-class-title-a-comprehensible-guide-to-a-new-unifier-for-cic-including-universe-polymorphism-and-overloading-a-href-afn1-ref-type-fn-a-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"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":"Journal of Functional Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/19A095CA0645F89A772B7E2B7B3D92B2/S0956796817000028a.pdf/div-class-title-a-comprehensible-guide-to-a-new-unifier-for-cic-including-universe-polymorphism-and-overloading-a-href-afn1-ref-type-fn-a-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051003407","display_name":"Beta Ziliani","orcid":"https://orcid.org/0000-0001-7071-6010"},"institutions":[{"id":"https://openalex.org/I151201029","display_name":"Consejo Nacional de Investigaciones Cient\u00edficas y T\u00e9cnicas","ror":"https://ror.org/03cqe8w59","country_code":"AR","type":"government","lineage":["https://openalex.org/I151201029","https://openalex.org/I4210123736","https://openalex.org/I4387155568"]},{"id":"https://openalex.org/I166401450","display_name":"Universidad Nacional de C\u00f3rdoba","ror":"https://ror.org/056tb7j80","country_code":"AR","type":"education","lineage":["https://openalex.org/I166401450"]},{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["AR","DE"],"is_corresponding":true,"raw_author_name":"BETA ZILIANI","raw_affiliation_strings":["FAMAF, Universidad Nacional de C\u00f3rdoba, Argentina, and CONICET, C\u00f3rdoba, Argentina (e-mail:","MPI-SWS - Max Planck Institute for Software Systems (D-66111 Saarbr\u00fccken/D-67663 Kaiserslautern - Germany)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"FAMAF, Universidad Nacional de C\u00f3rdoba, Argentina, and CONICET, C\u00f3rdoba, Argentina (e-mail:","institution_ids":["https://openalex.org/I166401450","https://openalex.org/I151201029"]},{"raw_affiliation_string":"MPI-SWS - Max Planck Institute for Software Systems (D-66111 Saarbr\u00fccken/D-67663 Kaiserslautern - Germany)","institution_ids":["https://openalex.org/I4210121786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065124885","display_name":"Matthieu Sozeau","orcid":"https://orcid.org/0000-0001-6452-8806"},"institutions":[{"id":"https://openalex.org/I169173203","display_name":"D\u00e9l\u00e9gation Paris 7","ror":"https://ror.org/00bw5n526","country_code":"FR","type":"government","lineage":["https://openalex.org/I154526488","https://openalex.org/I169173203"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"MATTHIEU SOZEAU","raw_affiliation_strings":["Inria & PPS, France, and Universit\u00e9 Paris Diderot, Paris, France (e-mail:","PI.R2 - Design, study and implementation of languages for proofs and programs (France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inria & PPS, France, and Universit\u00e9 Paris Diderot, Paris, France (e-mail:","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I169173203"]},{"raw_affiliation_string":"PI.R2 - Design, study and implementation of languages for proofs and programs (France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051003407"],"corresponding_institution_ids":["https://openalex.org/I151201029","https://openalex.org/I166401450","https://openalex.org/I4210121786"],"apc_list":null,"apc_paid":null,"fwci":0.8314,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.79616673,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"27","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.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/T10142","display_name":"Formal Methods in Verification","score":0.994700014591217,"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"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9911999702453613,"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/unification","display_name":"Unification","score":0.935563862323761},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.8594920635223389},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.8285034894943237},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7327916622161865},{"id":"https://openalex.org/keywords/generic-programming","display_name":"Generic programming","score":0.4950258135795593},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.45737767219543457},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4550855755805969},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4234873652458191},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41799795627593994},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40026530623435974},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.32765528559684753}],"concepts":[{"id":"https://openalex.org/C96146094","wikidata":"https://www.wikidata.org/wiki/Q609057","display_name":"Unification","level":2,"score":0.935563862323761},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.8594920635223389},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8285034894943237},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7327916622161865},{"id":"https://openalex.org/C7051814","wikidata":"https://www.wikidata.org/wiki/Q1051282","display_name":"Generic programming","level":2,"score":0.4950258135795593},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.45737767219543457},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4550855755805969},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4234873652458191},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41799795627593994},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40026530623435974},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.32765528559684753},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s0956796817000028","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796817000028","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/19A095CA0645F89A772B7E2B7B3D92B2/S0956796817000028a.pdf/div-class-title-a-comprehensible-guide-to-a-new-unifier-for-cic-including-universe-polymorphism-and-overloading-a-href-afn1-ref-type-fn-a-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"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":"Journal of Functional Programming","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01671925v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-01671925","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Functional Programming, 2017, 27, ⟨10.1017/S0956796817000028⟩","raw_type":"Journal articles"},{"id":"pmh:oai:ri.conicet.gov.ar:11336/72454","is_oa":true,"landing_page_url":"http://hdl.handle.net/11336/72454","pdf_url":null,"source":{"id":"https://openalex.org/S4306402455","display_name":"CONICET Digital (CONICET)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148385","host_organization_name":"Biomedicine Research Institute of Buenos Aires - CONICET - Partner Institute of the Max Planck Society","host_organization_lineage":["https://openalex.org/I4210148385"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1017/s0956796817000028","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796817000028","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/19A095CA0645F89A772B7E2B7B3D92B2/S0956796817000028a.pdf/div-class-title-a-comprehensible-guide-to-a-new-unifier-for-cic-including-universe-polymorphism-and-overloading-a-href-afn1-ref-type-fn-a-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"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":"Journal of Functional Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2586911241.pdf","grobid_xml":"https://content.openalex.org/works/W2586911241.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W203573882","https://openalex.org/W1486558830","https://openalex.org/W1512750313","https://openalex.org/W1532023943","https://openalex.org/W1546270920","https://openalex.org/W1558383352","https://openalex.org/W1583295953","https://openalex.org/W1768814311","https://openalex.org/W1968608688","https://openalex.org/W1990204174","https://openalex.org/W1990946582","https://openalex.org/W2014836228","https://openalex.org/W2019994514","https://openalex.org/W2100738443","https://openalex.org/W2107923385","https://openalex.org/W2113992680","https://openalex.org/W2120226337","https://openalex.org/W2135326783","https://openalex.org/W2137076681","https://openalex.org/W2140647971","https://openalex.org/W2144645833","https://openalex.org/W2145108549","https://openalex.org/W2148123185","https://openalex.org/W2157266926","https://openalex.org/W2160230109","https://openalex.org/W2294656706","https://openalex.org/W2485857450","https://openalex.org/W3126448347","https://openalex.org/W4230919050","https://openalex.org/W4252547602","https://openalex.org/W4388298880","https://openalex.org/W6642059636"],"related_works":["https://openalex.org/W2120230527","https://openalex.org/W1536365843","https://openalex.org/W2125797022","https://openalex.org/W1223318389","https://openalex.org/W1981828430","https://openalex.org/W1583400373","https://openalex.org/W2566029784","https://openalex.org/W1516362967","https://openalex.org/W1775126135","https://openalex.org/W1811327378"],"abstract_inverted_index":{"Abstract":[0],"Unification":[1],"is":[2,34,108],"a":[3,71,75,96,129],"core":[4],"component":[5],"of":[6,50,58,74,82,88,103,132,152],"every":[7],"proof":[8],"assistant":[9],"or":[10],"programming":[11],"language":[12],"featuring":[13],"dependent":[14],"types.":[15],"In":[16],"many":[17],"cases,":[18],"it":[19,93,107,142],"must":[20],"deal":[21],"with":[22],"higher":[23],"order":[24],"problems":[25],"up":[26,94],"to":[27,42,99],"conversion.":[28],"Since":[29],"unification":[30,36,77],"in":[31,110],"such":[32],"conditions":[33],"undecidable,":[35],"algorithms":[37],"may":[38],"include":[39],"several":[40,144],"heuristics":[41,51,153],"solve":[43],"common":[44],"problems.":[45],"However,":[46],"when":[47],"the":[48,54,59,80,100,149],"stack":[49],"grows":[52],"large,":[53],"result":[55],"and":[56,128,140],"complexity":[57],"algorithm":[60,78],"can":[61],"become":[62],"unpredictable.":[63],"Our":[64],"contributions":[65],"are":[66],"twofold:":[67],"(1)":[68],"We":[69,136],"present":[70],"full":[72,101],"description":[73],"new":[76],"for":[79,155],"Calculus":[81,102],"Inductive":[83,104],"Constructions":[84,105],"(the":[85,119],"base":[86],"logic":[87],"C":[89,111,124],"OQ":[90,112,125],"),":[91],"building":[92],"from":[95],"basic":[97],"calculus":[98],"as":[106],"implemented":[109,137],",":[113],"including":[114],"universe":[115],"polymorphism,":[116],"canonical":[117],"structures":[118],"overloading":[120],"mechanism":[121],"baked":[122],"into":[123],"'s":[126],"unification),":[127],"small":[130],"set":[131,151],"useful":[133],"heuristics.":[134],"(2)":[135],"our":[138],"algorithm,":[139],"tested":[141],"on":[143],"libraries,":[145],"providing":[146],"evidence":[147],"that":[148],"selected":[150],"suffices":[154],"large":[156],"developments.":[157]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-23T06:14:38.165362","created_date":"2025-10-10T00:00:00"}