{"id":"https://openalex.org/W2888153140","doi":"https://doi.org/10.1145/3290316","title":"Definitional proof-irrelevance without K","display_name":"Definitional proof-irrelevance without K","publication_year":2019,"publication_date":"2019-01-02","ids":{"openalex":"https://openalex.org/W2888153140","doi":"https://doi.org/10.1145/3290316","mag":"2888153140"},"language":"en","primary_location":{"id":"doi:10.1145/3290316","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3290316","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3290316","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3290316","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020613218","display_name":"Ga\u00ebtan Gilbert","orcid":null},"institutions":[{"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":true,"raw_author_name":"Ga\u00ebtan Gilbert","raw_affiliation_strings":["Inria, France"],"affiliations":[{"raw_affiliation_string":"Inria, France","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065497509","display_name":"Jesper Cockx","orcid":"https://orcid.org/0000-0003-3862-4073"},"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"]},{"id":"https://openalex.org/I881427289","display_name":"University of Gothenburg","ror":"https://ror.org/01tm6cn81","country_code":"SE","type":"education","lineage":["https://openalex.org/I881427289"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Jesper Cockx","raw_affiliation_strings":["Chalmers University of Technology, Sweden / University of Gothenburg, Sweden"],"affiliations":[{"raw_affiliation_string":"Chalmers University of Technology, Sweden / University of Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912","https://openalex.org/I881427289"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065124885","display_name":"Matthieu Sozeau","orcid":"https://orcid.org/0000-0001-6452-8806"},"institutions":[{"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 / IRIF, France"],"affiliations":[{"raw_affiliation_string":"Inria, France / IRIF, France","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033499088","display_name":"Nicolas Tabareau","orcid":"https://orcid.org/0000-0003-3366-2273"},"institutions":[{"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":"Nicolas Tabareau","raw_affiliation_strings":["Inria, France"],"affiliations":[{"raw_affiliation_string":"Inria, France","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5020613218"],"corresponding_institution_ids":["https://openalex.org/I1326498283"],"apc_list":null,"apc_paid":null,"fwci":3.4684,"has_fulltext":true,"cited_by_count":48,"citation_normalized_percentile":{"value":0.94063017,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"3","issue":"POPL","first_page":"1","last_page":"28"},"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.9994000196456909,"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.9994000196456909,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9872999787330627,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9830999970436096,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/type-theory","display_name":"Type theory","score":0.8339413404464722},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7313361763954163},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7172244787216187},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6418477296829224},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.557761549949646},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.5468846559524536},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5433744192123413},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.5406820774078369},{"id":"https://openalex.org/keywords/structural-proof-theory","display_name":"Structural proof theory","score":0.4872347414493561},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.483750581741333},{"id":"https://openalex.org/keywords/proof-assistant","display_name":"Proof assistant","score":0.47555845975875854},{"id":"https://openalex.org/keywords/dependent-type","display_name":"Dependent type","score":0.47333958745002747},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.42701655626296997},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42133253812789917},{"id":"https://openalex.org/keywords/formal-proof","display_name":"Formal proof","score":0.42090755701065063},{"id":"https://openalex.org/keywords/uniqueness","display_name":"Uniqueness","score":0.4113849699497223},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31086987257003784},{"id":"https://openalex.org/keywords/lambda-calculus","display_name":"Lambda calculus","score":0.13654854893684387}],"concepts":[{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.8339413404464722},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7313361763954163},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7172244787216187},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6418477296829224},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.557761549949646},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.5468846559524536},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5433744192123413},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.5406820774078369},{"id":"https://openalex.org/C195653647","wikidata":"https://www.wikidata.org/wiki/Q7625047","display_name":"Structural proof theory","level":4,"score":0.4872347414493561},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.483750581741333},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.47555845975875854},{"id":"https://openalex.org/C20528804","wikidata":"https://www.wikidata.org/wiki/Q997433","display_name":"Dependent type","level":3,"score":0.47333958745002747},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.42701655626296997},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42133253812789917},{"id":"https://openalex.org/C94461902","wikidata":"https://www.wikidata.org/wiki/Q2762418","display_name":"Formal proof","level":3,"score":0.42090755701065063},{"id":"https://openalex.org/C2777021972","wikidata":"https://www.wikidata.org/wiki/Q22976830","display_name":"Uniqueness","level":2,"score":0.4113849699497223},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31086987257003784},{"id":"https://openalex.org/C135790938","wikidata":"https://www.wikidata.org/wiki/Q242028","display_name":"Lambda calculus","level":2,"score":0.13654854893684387},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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":2,"locations":[{"id":"doi:10.1145/3290316","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3290316","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3290316","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01859964v2","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01859964","pdf_url":null,"source":{"id":"https://openalex.org/S4406922466","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the ACM on Programming Languages, 2019, POPL'19, pp.1-28. ⟨10.1145/3290316⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"doi:10.1145/3290316","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3290316","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3290316","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1438627009","display_name":null,"funder_award_id":"64399","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"}],"funders":[{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2888153140.pdf","grobid_xml":"https://content.openalex.org/works/W2888153140.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1494555245","https://openalex.org/W1522049235","https://openalex.org/W1601157167","https://openalex.org/W1821509023","https://openalex.org/W2033146968","https://openalex.org/W2098691999","https://openalex.org/W2104412665","https://openalex.org/W2111690589","https://openalex.org/W2121730419","https://openalex.org/W2151520617","https://openalex.org/W2158830522","https://openalex.org/W2337679798","https://openalex.org/W2565502105","https://openalex.org/W2590229416","https://openalex.org/W2779668776","https://openalex.org/W2793739232","https://openalex.org/W2799446534","https://openalex.org/W2886328560","https://openalex.org/W2899394398","https://openalex.org/W3045781805","https://openalex.org/W3101932690","https://openalex.org/W4293770342","https://openalex.org/W4300050167"],"related_works":["https://openalex.org/W2491370528","https://openalex.org/W2166197034","https://openalex.org/W1854197585","https://openalex.org/W2755232768","https://openalex.org/W2110020126","https://openalex.org/W1544323334","https://openalex.org/W183809628","https://openalex.org/W1561664087","https://openalex.org/W2898855460","https://openalex.org/W1981809958"],"abstract_inverted_index":{"Definitional":[0],"equality\u2014or":[1],"conversion\u2014for":[2],"a":[3,7,44,63,71,82,125,130,138,152,158,164],"type":[4,9,48,72,92,121,131,142,165],"theory":[5,73,132],"with":[6,108,133,148],"decidable":[8,144],"checking":[10,93,143],"is":[11,41,62,146],"the":[12,21,24,31,38,57,169,190],"simplest":[13],"tool":[14],"to":[15,42,66,69,128,155,208],"prove":[16],"that":[17,52,140],"two":[18,54],"objects":[19],"are":[20,34,60,106,206],"same,":[22],"letting":[23],"system":[25],"decide":[26,156],"just":[27],"using":[28,176],"computation.":[29],"Therefore,":[30],"more":[32,74],"things":[33],"equal":[35],"by":[36,90,96,175,195],"conversion,":[37],"simpler":[39],"it":[40,87],"use":[43],"language":[45],"based":[46],"on":[47,182],"theory.":[49],"Proof-irrelevance,":[50],"stating":[51],"any":[53],"proofs":[55,104],"of":[56,102,173,192,204,214],"same":[58],"proposition":[59,159],"equal,":[61],"possible":[64],"way":[65,127,139],"extend":[67,129],"conversion":[68],"make":[70],"powerful.":[75],"However,":[76],"this":[77,115],"new":[78,98,153],"power":[79],"comes":[80],"at":[81],"price":[83],"if":[84],"we":[85,123],"integrate":[86],"naively,":[88],"either":[89],"making":[91],"undecidable":[94],"or":[95],"realizing":[97],"axioms\u2014such":[99],"as":[100,112],"uniqueness":[101],"identity":[103],"(UIP)\u2014that":[105],"incompatible":[107],"other":[109],"extensions,":[110],"such":[111],"univalence.":[113,149],"In":[114],"paper,":[116],"taking":[117],"inspiration":[118],"from":[119,179],"homotopy":[120],"theory,":[122],"propose":[124],"general":[126],"definitional":[134],"proof":[135,216],"irrelevance,":[136],"in":[137,211],"keeps":[141],"and":[145,167,201],"compatible":[147],"We":[150,188],"provide":[151],"criterion":[154],"whether":[157],"can":[160],"be":[161,209],"eliminated":[162],"over":[163],"(correcting":[166],"improving":[168],"so-called":[170],"singleton":[171],"elimination":[172],"Coq)":[174],"techniques":[177],"coming":[178],"recent":[180],"development":[181],"dependent":[183],"pattern":[184],"matching":[185],"without":[186],"UIP.":[187],"show":[189],"generality":[191],"our":[193],"approach":[194],"providing":[196],"implementations":[197],"for":[198],"both":[199,203],"Coq":[200],"Agda,":[202],"which":[205],"planned":[207],"integrated":[210],"future":[212],"versions":[213],"those":[215],"assistants.":[217]},"counts_by_year":[{"year":2026,"cited_by_count":7},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":7}],"updated_date":"2026-04-13T07:58:08.660418","created_date":"2025-10-10T00:00:00"}