{"id":"https://openalex.org/W2731470241","doi":"https://doi.org/10.1145/3110276","title":"Parametric quantifiers for dependent type theory","display_name":"Parametric quantifiers for dependent type theory","publication_year":2017,"publication_date":"2017-08-29","ids":{"openalex":"https://openalex.org/W2731470241","doi":"https://doi.org/10.1145/3110276","mag":"2731470241"},"language":"en","primary_location":{"id":"doi:10.1145/3110276","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3110276","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3110276&type=pdf","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":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":"bronze","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=3110276&type=pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036983503","display_name":"Andreas Nuyts","orcid":"https://orcid.org/0000-0002-1571-5063"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Andreas Nuyts","raw_affiliation_strings":["KU Leuven, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KU Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"middle","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"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011654888","display_name":"Dominique Devriese","orcid":"https://orcid.org/0000-0002-3862-6856"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Dominique Devriese","raw_affiliation_strings":["KU Leuven, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KU Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5036983503"],"corresponding_institution_ids":["https://openalex.org/I99464096"],"apc_list":null,"apc_paid":null,"fwci":3.9539,"has_fulltext":true,"cited_by_count":37,"citation_normalized_percentile":{"value":0.94936492,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"1","issue":"ICFP","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.9896000027656555,"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/T13124","display_name":"Chemical synthesis and alkaloids","score":0.9611999988555908,"subfield":{"id":"https://openalex.org/subfields/1605","display_name":"Organic Chemistry"},"field":{"id":"https://openalex.org/fields/16","display_name":"Chemistry"},"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.7376923561096191},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.7376425266265869},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.5825680494308472},{"id":"https://openalex.org/keywords/conservative-extension","display_name":"Conservative extension","score":0.49630409479141235},{"id":"https://openalex.org/keywords/dependent-type","display_name":"Dependent type","score":0.4953848123550415},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4713287651538849},{"id":"https://openalex.org/keywords/quantifier-elimination","display_name":"Quantifier elimination","score":0.43705350160598755},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42934757471084595},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4168233275413513},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.41316843032836914},{"id":"https://openalex.org/keywords/functor","display_name":"Functor","score":0.4128623306751251},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.403202623128891},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.3097585141658783},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2961932122707367},{"id":"https://openalex.org/keywords/lambda-calculus","display_name":"Lambda calculus","score":0.18119129538536072}],"concepts":[{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.7376923561096191},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.7376425266265869},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.5825680494308472},{"id":"https://openalex.org/C2780432614","wikidata":"https://www.wikidata.org/wiki/Q864213","display_name":"Conservative extension","level":2,"score":0.49630409479141235},{"id":"https://openalex.org/C20528804","wikidata":"https://www.wikidata.org/wiki/Q997433","display_name":"Dependent type","level":3,"score":0.4953848123550415},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4713287651538849},{"id":"https://openalex.org/C32278780","wikidata":"https://www.wikidata.org/wiki/Q1849020","display_name":"Quantifier elimination","level":2,"score":0.43705350160598755},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42934757471084595},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4168233275413513},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.41316843032836914},{"id":"https://openalex.org/C156772000","wikidata":"https://www.wikidata.org/wiki/Q864475","display_name":"Functor","level":2,"score":0.4128623306751251},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.403202623128891},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.3097585141658783},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2961932122707367},{"id":"https://openalex.org/C135790938","wikidata":"https://www.wikidata.org/wiki/Q242028","display_name":"Lambda calculus","level":2,"score":0.18119129538536072},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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":8,"locations":[{"id":"doi:10.1145/3110276","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3110276","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3110276&type=pdf","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":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:lirias2repo.kuleuven.be:123456789/586249","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/586249","pdf_url":"https://lirias.kuleuven.be/retrieve/4f2cab71-ab45-40d5-b559-256b40b3dac5","source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Proceedings of the ACM on Programming Languages, vol. 1 (ICFP), Art.No. 32, (1-29)","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:research.chalmers.se:527464","is_oa":true,"landing_page_url":"https://research.chalmers.se/en/publication/8ee29552-c14e-4281-9941-1aad5a3f2417","pdf_url":"http://publications.lib.chalmers.se/records/fulltext/252073/local_252073.pdf","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:lirias2repo.kuleuven.be:123456789/586189","is_oa":false,"landing_page_url":"https://lirias.kuleuven.be/bitstream/123456789/586189/1/TYPESabstract.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/lecture"},{"id":"pmh:oai:publications.lib.chalmers.se:252073","is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/252073-parametric-quantifiers-for-dependent-type-theory","pdf_url":null,"source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (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":"Text.Article.Conference.PeerReviewed"},{"id":"pmh:oai:research.chalmers.se:252073","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/252073","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:vubissmart:VUBISSMART:2000:113773","is_oa":false,"landing_page_url":"https://biblio.vub.ac.be/vubir/parametric-quantifiers-for-dependent-type-theory(d98991d4-a9e9-4bda-a086-f9a51300ca04).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306402573","display_name":"VUBIR (Vrije Universiteit Brussel)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I13469542","host_organization_name":"Vrije Universiteit Brussel","host_organization_lineage":["https://openalex.org/I13469542"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:vubissmart:VUBISSMART:2000:236659","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306402573","display_name":"VUBIR (Vrije Universiteit Brussel)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I13469542","host_organization_name":"Vrije Universiteit Brussel","host_organization_lineage":["https://openalex.org/I13469542"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3110276","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3110276","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3110276&type=pdf","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":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":[{"display_name":"Peace, Justice and strong institutions","score":0.5,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321730","display_name":"Fonds Wetenschappelijk Onderzoek","ror":"https://ror.org/03qtxy027"},{"id":"https://openalex.org/F4320327336","display_name":"Vlaamse regering","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2731470241.pdf","grobid_xml":"https://content.openalex.org/works/W2731470241.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W124942006","https://openalex.org/W326743114","https://openalex.org/W619451721","https://openalex.org/W1480685649","https://openalex.org/W1494555245","https://openalex.org/W1511371610","https://openalex.org/W1533094521","https://openalex.org/W1536469717","https://openalex.org/W1549406551","https://openalex.org/W1554068457","https://openalex.org/W1557561422","https://openalex.org/W1664326696","https://openalex.org/W1825669111","https://openalex.org/W1987700231","https://openalex.org/W1988824860","https://openalex.org/W1995581828","https://openalex.org/W2033146968","https://openalex.org/W2034083013","https://openalex.org/W2042204873","https://openalex.org/W2057292961","https://openalex.org/W2085552917","https://openalex.org/W2088982170","https://openalex.org/W2095835314","https://openalex.org/W2104412665","https://openalex.org/W2108392659","https://openalex.org/W2116438866","https://openalex.org/W2140216155","https://openalex.org/W2148275052","https://openalex.org/W2155221538","https://openalex.org/W2162592943","https://openalex.org/W2293895310","https://openalex.org/W2337679798","https://openalex.org/W2550513301","https://openalex.org/W2625421309","https://openalex.org/W3101776309","https://openalex.org/W4210653864","https://openalex.org/W6619379960"],"related_works":["https://openalex.org/W1912064545","https://openalex.org/W2114058479","https://openalex.org/W1965763876","https://openalex.org/W1971922971","https://openalex.org/W1851509138","https://openalex.org/W4233723952","https://openalex.org/W2114705282","https://openalex.org/W1827112781","https://openalex.org/W1577182889","https://openalex.org/W2731470241"],"abstract_inverted_index":{"Polymorphic":[0],"type":[1,16,27,65,118,130,167,208,263],"systems":[2,66],"such":[3,67],"as":[4,68,78,146],"System":[5,60],"F":[6,61],"enjoy":[7],"the":[8,22,45,105,111,124,129,137,159,177,254],"parametricity":[9,49,73,171,222],"property:":[10],"polymorphic":[11],"functions":[12,241],"cannot":[13],"inspect":[14],"their":[15,144],"argument":[17,145],"and":[18,128,156,162,164,182,233],"will":[19],"therefore":[20],"apply":[21],"same":[23],"algorithm":[24],"to":[25,90,99,110,121,247,253],"any":[26],"they":[28],"are":[29,242],"instantiated":[30],"on.":[31],"This":[32],"idea":[33],"is":[34,85,134],"formalized":[35],"mathematically":[36],"in":[37,136,261],"Reynolds's":[38],"theory":[39],"of":[40,48,54,179,185,197,206,219,230],"relational":[41],"parametricity,":[42],"which":[43,84,133],"allows":[44],"metatheoretical":[46],"derivation":[47],"theorems":[50,92,172],"about":[51],"all":[52],"values":[53],"a":[55,116,147,194],"given":[56],"type.":[57],"Although":[58],"predicative":[59],"embeds":[62],"into":[63],"dependent":[64],"Martin-L\u00f6f":[69],"Type":[70],"Theory":[71],"(MLTT),":[72],"does":[74],"not":[75],"carry":[76],"over":[77],"easily.":[79],"The":[80,239],"identity":[81],"extension":[82,252],"lemma,":[83],"crucial":[86],"if":[87],"we":[88],"want":[89],"prove":[91,204],"involving":[93],"equality,":[94],"has":[95],"only":[96],"been":[97],"shown":[98],"hold":[100],"for":[101,169,193],"small":[102],"types,":[103],"excluding":[104],"universe.":[106],"We":[107,149,174,203,249],"attribute":[108],"this":[109],"fact":[112],"that":[113,139,227,235,244,258],"MLTT":[114,151],"uses":[115],"single":[117],"former":[119,131],"\u03a0":[120,161],"generalize":[122],"both":[123,188],"parametric":[125,153,240],"quantifier":[126],"\u2200":[127,155],"\u2192":[132],"non-parametric":[135],"sense":[138],"its":[140],"elements":[141],"may":[142],"use":[143],"value.":[148],"equip":[150],"with":[152],"quantifiers":[154],"\u2203":[157],"alongside":[158],"existing":[160,212],"\u03a3,":[163],"provide":[165],"relation":[166],"formers":[168],"proving":[170],"internally.":[173],"show":[175],"internally":[176],"existence":[178],"initial":[180],"algebras":[181],"final":[183],"co-algebras":[184],"indexed":[186],"functors":[187],"by":[189,199,210,223],"Church":[190],"encoding":[191],"and,":[192],"large":[195],"class":[196],"functors,":[198],"using":[200],"sized":[201],"types.":[202],"soundness":[205],"our":[207,262],"system":[209],"enhancing":[211],"iterated":[213],"reflexive":[214],"graph":[215],"(cubical":[216],"set)":[217],"models":[218],"dependently":[220],"typed":[221],"distinguishing":[224],"between":[225],"edges":[226,234],"express":[228,236],"relatedness":[229],"objects":[231],"(bridges)":[232],"equality":[237],"(paths).":[238],"those":[243],"map":[245],"bridges":[246],"paths.":[248],"implement":[250],"an":[251],"Agda":[255],"proof":[256],"assistant":[257],"type-checks":[259],"proofs":[260],"system.":[264]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}