{"id":"https://openalex.org/W2779668776","doi":"https://doi.org/10.1145/3158111","title":"Decidability of conversion for type theory in type theory","display_name":"Decidability of conversion for type theory in type theory","publication_year":2017,"publication_date":"2017-12-27","ids":{"openalex":"https://openalex.org/W2779668776","doi":"https://doi.org/10.1145/3158111","mag":"2779668776"},"language":"en","primary_location":{"id":"doi:10.1145/3158111","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3158111","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3158111?download=true","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":false,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3158111?download=true","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008534457","display_name":"Andreas Abel","orcid":"https://orcid.org/0000-0003-0420-4492"},"institutions":[{"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":"Andreas Abel","raw_affiliation_strings":["University of Gothenburg, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Gothenburg, Sweden","institution_ids":["https://openalex.org/I881427289"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017420568","display_name":"Joakim \u00d6hman","orcid":"https://orcid.org/0000-0002-9284-3886"},"institutions":[{"id":"https://openalex.org/I4210162154","display_name":"IMDEA Software Institute","ror":"https://ror.org/04xvfkh51","country_code":"ES","type":"facility","lineage":["https://openalex.org/I105140100","https://openalex.org/I4210162154"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Joakim \u00d6hman","raw_affiliation_strings":["IMDEA Software Institute, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IMDEA Software Institute, Spain","institution_ids":["https://openalex.org/I4210162154"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066208562","display_name":"Andrea Vezzosi","orcid":"https://orcid.org/0000-0001-9570-9407"},"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":false,"raw_author_name":"Andrea Vezzosi","raw_affiliation_strings":["Chalmers University of Technology, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Chalmers University of Technology, Sweden","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.8915,"has_fulltext":true,"cited_by_count":61,"citation_normalized_percentile":{"value":0.93112162,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"2","issue":"POPL","first_page":"1","last_page":"29"},"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.9993000030517578,"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.9993000030517578,"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.9901999831199646,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9585000276565552,"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.8462868928909302},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.5924987196922302},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5896540284156799},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.586837112903595},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.5750800371170044},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5515767931938171},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.447043240070343},{"id":"https://openalex.org/keywords/uniqueness","display_name":"Uniqueness","score":0.4461100995540619},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.4444884657859802},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.4431348741054535},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.4270550608634949},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.42607927322387695},{"id":"https://openalex.org/keywords/structural-proof-theory","display_name":"Structural proof theory","score":0.42009884119033813},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.41861891746520996},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.4090663194656372},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3753935992717743},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3094083368778229},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.239854097366333},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2256314754486084}],"concepts":[{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.8462868928909302},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.5924987196922302},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5896540284156799},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.586837112903595},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.5750800371170044},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5515767931938171},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.447043240070343},{"id":"https://openalex.org/C2777021972","wikidata":"https://www.wikidata.org/wiki/Q22976830","display_name":"Uniqueness","level":2,"score":0.4461100995540619},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.4444884657859802},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.4431348741054535},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.4270550608634949},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.42607927322387695},{"id":"https://openalex.org/C195653647","wikidata":"https://www.wikidata.org/wiki/Q7625047","display_name":"Structural proof theory","level":4,"score":0.42009884119033813},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.41861891746520996},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.4090663194656372},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3753935992717743},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3094083368778229},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.239854097366333},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2256314754486084},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3158111","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3158111","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3158111?download=true","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":false,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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:research.chalmers.se:504131","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/504131","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":""},{"id":"pmh:oai:research.chalmers.se:527432","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/fbe4913d-171c-459e-8071-df1f7954660c","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":{"id":"doi:10.1145/3158111","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3158111","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3158111?download=true","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":false,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":[{"id":"https://metadata.un.org/sdg/16","score":0.49000000953674316,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G4048376791","display_name":null,"funder_award_id":"621-2014-4864","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G6267636775","display_name":null,"funder_award_id":"CA15123","funder_id":"https://openalex.org/F4320320366","funder_display_name":"European Cooperation in Science and Technology"}],"funders":[{"id":"https://openalex.org/F4320320366","display_name":"European Cooperation in Science and Technology","ror":"https://ror.org/01bstzn19"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2779668776.pdf","grobid_xml":"https://content.openalex.org/works/W2779668776.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W18425853","https://openalex.org/W124154939","https://openalex.org/W1494555245","https://openalex.org/W1547527421","https://openalex.org/W1563063152","https://openalex.org/W1593841126","https://openalex.org/W1986402635","https://openalex.org/W2004778262","https://openalex.org/W2033146968","https://openalex.org/W2043740265","https://openalex.org/W2058174669","https://openalex.org/W2088156780","https://openalex.org/W2103033459","https://openalex.org/W2148742142","https://openalex.org/W2151520617","https://openalex.org/W2153462594","https://openalex.org/W2159419736","https://openalex.org/W2171496589","https://openalex.org/W2188068291","https://openalex.org/W2263142775","https://openalex.org/W2274485505","https://openalex.org/W2562368761","https://openalex.org/W2568721247","https://openalex.org/W3101264733","https://openalex.org/W3101776309","https://openalex.org/W3104945076"],"related_works":["https://openalex.org/W2151894250","https://openalex.org/W3187382182","https://openalex.org/W2115401928","https://openalex.org/W2183851921","https://openalex.org/W2168281995","https://openalex.org/W1981809958","https://openalex.org/W2787858359","https://openalex.org/W1864872089","https://openalex.org/W4287280922","https://openalex.org/W2788182112"],"abstract_inverted_index":{"Type":[0,149,163],"theory":[1,32,66],"should":[2],"be":[3],"able":[4],"to":[5,11,17,36,45,108,119],"handle":[6],"its":[7,13],"own":[8],"meta-theory,":[9],"both":[10],"justify":[12],"foundational":[14],"claims":[15],"and":[16,75,111,116],"obtain":[18,109],"a":[19,26,57,63,86,92],"verified":[20],"implementation.":[21],"At":[22],"the":[23,82,102,121,124,135],"core":[24],"of":[25,39,95,97,113,123,137,146],"type":[27,31,65,114],"checker":[28],"for":[29,62,77,157],"intensional":[30,147],"lies":[33],"an":[34],"algorithm":[35,61,83],"check":[37,46],"equality":[38],"types,":[40],"or":[41,161],"in":[42,55,144],"other":[43],"words,":[44],"whether":[47],"two":[48],"types":[49],"are":[50],"convertible.":[51],"We":[52,80,99],"have":[53],"formalized":[54],"Agda":[56],"practical":[58],"conversion":[59],"checking":[60],"dependent":[64],"with":[67],"one":[68],"universe":[69],"\u00e0":[70],"la":[71],"Russell,":[72],"natural":[73],"numbers,":[74],"\u03b7-equality":[76],"\u03a0":[78],"types.":[79],"prove":[81,120],"correct":[84],"via":[85],"Kripke":[87],"logical":[88],"relation":[89],"parameterized":[90,103],"by":[91],"suitable":[93],"notion":[94],"equivalence":[96],"terms.":[98],"then":[100],"instantiate":[101],"fundamental":[104],"lemma":[105],"twice:":[106],"once":[107,117],"canonicity":[110],"injectivity":[112],"formers,":[115],"again":[118],"completeness":[122],"algorithm.":[125],"Our":[126],"proof":[127],"relies":[128],"on":[129,134],"inductive-recursive":[130],"definitions,":[131],"but":[132],"not":[133],"uniqueness":[136],"identity":[138],"proofs.":[139],"Thus,":[140],"it":[141],"is":[142],"valid":[143],"variants":[145],"Martin-L\u00f6f":[148],"Theory":[150],"as":[151,153],"long":[152],"they":[154],"support":[155],"induction-recursion,":[156],"instance,":[158],"Extensional,":[159],"Observational,":[160],"Homotopy":[162],"Theory.":[164]},"counts_by_year":[{"year":2026,"cited_by_count":8},{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":7}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}