{"id":"https://openalex.org/W2013202135","doi":"https://doi.org/10.1145/2784731.2784751","title":"A unification algorithm for Coq featuring universe polymorphism and overloading","display_name":"A unification algorithm for Coq featuring universe polymorphism and overloading","publication_year":2015,"publication_date":"2015-08-26","ids":{"openalex":"https://openalex.org/W2013202135","doi":"https://doi.org/10.1145/2784731.2784751","mag":"2013202135"},"language":"en","primary_location":{"id":"doi:10.1145/2784731.2784751","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2784731.2784751","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming","raw_type":"proceedings-article"},"type":"preprint","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/A5051003407","display_name":"Beta Ziliani","orcid":"https://orcid.org/0000-0001-7071-6010"},"institutions":[{"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":["DE"],"is_corresponding":true,"raw_author_name":"Beta Ziliani","raw_affiliation_strings":["MPI-SWS, Germany"],"affiliations":[{"raw_affiliation_string":"MPI-SWS, 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/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"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/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Matthieu Sozeau","raw_affiliation_strings":["INRIA, France / University of Paris Diderot, France"],"affiliations":[{"raw_affiliation_string":"INRIA, France / University of Paris Diderot, France","institution_ids":["https://openalex.org/I169173203","https://openalex.org/I1326498283","https://openalex.org/I204730241"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051003407"],"corresponding_institution_ids":["https://openalex.org/I4210121786"],"apc_list":null,"apc_paid":null,"fwci":0.4451,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.76684596,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"179","last_page":"191"},"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.9998999834060669,"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.9998999834060669,"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.9918000102043152,"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.991599977016449,"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.9268652200698853},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.8690494298934937},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7549768686294556},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6517491340637207},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5293261408805847},{"id":"https://openalex.org/keywords/proof-assistant","display_name":"Proof assistant","score":0.46717390418052673},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.46000367403030396},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.4571824073791504},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42523759603500366},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2781147062778473},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.13332337141036987}],"concepts":[{"id":"https://openalex.org/C96146094","wikidata":"https://www.wikidata.org/wiki/Q609057","display_name":"Unification","level":2,"score":0.9268652200698853},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.8690494298934937},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7549768686294556},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6517491340637207},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5293261408805847},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.46717390418052673},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.46000367403030396},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.4571824073791504},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42523759603500366},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2781147062778473},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.13332337141036987},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2784731.2784751","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2784731.2784751","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01248804v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-01248804","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":"20th ACM SIGPLAN International Conference on Functional Programming, Sep 2015, Vancouver, Canada. ⟨10.1145/2784731.2784751⟩","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W10165608","https://openalex.org/W157487627","https://openalex.org/W434005793","https://openalex.org/W1486558830","https://openalex.org/W1768814311","https://openalex.org/W1875842672","https://openalex.org/W1881760753","https://openalex.org/W1968608688","https://openalex.org/W1982209843","https://openalex.org/W1990204174","https://openalex.org/W1990946582","https://openalex.org/W2059895047","https://openalex.org/W2120226337","https://openalex.org/W2137076681","https://openalex.org/W2140647971","https://openalex.org/W2144645833","https://openalex.org/W2145108549","https://openalex.org/W2148123185","https://openalex.org/W2160230109","https://openalex.org/W2162201044","https://openalex.org/W2277214925","https://openalex.org/W2288636442","https://openalex.org/W4252547602","https://openalex.org/W6672060838"],"related_works":["https://openalex.org/W2120230527","https://openalex.org/W1536365843","https://openalex.org/W2125797022","https://openalex.org/W1802268423","https://openalex.org/W1223318389","https://openalex.org/W1981828430","https://openalex.org/W1583400373","https://openalex.org/W2566029784","https://openalex.org/W1516362967","https://openalex.org/W2508333642"],"abstract_inverted_index":{"Unification":[0],"is":[1,32],"a":[2,69,73,101],"core":[3],"component":[4],"of":[5,48,56,72,80,86,104,124],"every":[6],"proof":[7],"assistant":[8],"or":[9],"programming":[10],"language":[11],"featuring":[12],"dependent":[13],"types.":[14],"In":[15],"many":[16],"cases,":[17],"it":[18,114],"must":[19],"deal":[20],"with":[21],"higher-order":[22],"problems":[23],"up":[24],"to":[25,40],"conversion.":[26],"Since":[27],"unification":[28,34,75],"in":[29],"such":[30],"conditions":[31],"undecidable,":[33],"algorithms":[35],"may":[36],"include":[37],"several":[38,116],"heuristics":[39,49,125],"solve":[41],"common":[42],"problems.":[43],"However,":[44],"when":[45],"the":[46,52,57,78,121],"stack":[47],"grows":[50],"large,":[51],"result":[53],"and":[54,100,112],"complexity":[55],"algorithm":[58,76],"can":[59],"become":[60],"unpredictable.":[61],"Our":[62],"contributions":[63],"are":[64],"twofold:":[65],"(1)":[66],"We":[67,108],"present":[68],"full":[70],"description":[71],"new":[74],"for":[77,127],"Calculus":[79],"Inductive":[81],"Constructions":[82],"(the":[83,93],"base":[84],"logic":[85],"Coq),":[87],"including":[88],"universe":[89],"polymorphism,":[90],"canonical":[91],"structures":[92],"overloading":[94],"mechanism":[95],"baked":[96],"into":[97],"Coq's":[98],"unification),":[99],"small":[102],"set":[103,123],"useful":[105],"heuristics.":[106],"(2)":[107],"implemented":[109],"our":[110],"algorithm,":[111],"tested":[113],"on":[115],"libraries,":[117],"providing":[118],"evidence":[119],"that":[120],"selected":[122],"suffices":[126],"large":[128],"developments.":[129]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-13T07:58:08.660418","created_date":"2025-10-10T00:00:00"}