{"id":"https://openalex.org/W2886891016","doi":"https://doi.org/10.1145/3236787","title":"Equivalences for free: univalent parametricity for effective transport","display_name":"Equivalences for free: univalent parametricity for effective transport","publication_year":2018,"publication_date":"2018-07-30","ids":{"openalex":"https://openalex.org/W2886891016","doi":"https://doi.org/10.1145/3236787","mag":"2886891016"},"language":"en","primary_location":{"id":"doi:10.1145/3236787","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3236787","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3236787","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":"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":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3236787","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","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 sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nicolas Tabareau","raw_affiliation_strings":["Inria, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inria, France","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074606459","display_name":"\u00c9ric Tanter","orcid":"https://orcid.org/0000-0002-7359-890X"},"institutions":[{"id":"https://openalex.org/I69737025","display_name":"University of Chile","ror":"https://ror.org/047gc3g35","country_code":"CL","type":"education","lineage":["https://openalex.org/I69737025"]}],"countries":["CL"],"is_corresponding":false,"raw_author_name":"\u00c9ric Tanter","raw_affiliation_strings":["University of Chile, Chile"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Chile, Chile","institution_ids":["https://openalex.org/I69737025"]}]},{"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/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Matthieu Sozeau","raw_affiliation_strings":["Inria, France / IRIF, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inria, France / IRIF, France","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.9483,"has_fulltext":true,"cited_by_count":23,"citation_normalized_percentile":{"value":0.92955547,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"2","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.9997000098228455,"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.9997000098228455,"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/T10260","display_name":"Software Engineering Research","score":0.9886999726295471,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11424","display_name":"Security and Verification in Computing","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.7573734521865845},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.7151920795440674},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6704534292221069},{"id":"https://openalex.org/keywords/proof-assistant","display_name":"Proof assistant","score":0.588586151599884},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.553534984588623},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.5038885474205017},{"id":"https://openalex.org/keywords/programmer","display_name":"Programmer","score":0.49659520387649536},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.45015260577201843},{"id":"https://openalex.org/keywords/monad","display_name":"Monad (category theory)","score":0.44855743646621704},{"id":"https://openalex.org/keywords/unification","display_name":"Unification","score":0.4463709890842438},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4372212886810303},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2550221085548401},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23348355293273926},{"id":"https://openalex.org/keywords/functor","display_name":"Functor","score":0.14821013808250427},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.09020882844924927}],"concepts":[{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.7573734521865845},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7151920795440674},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6704534292221069},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.588586151599884},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.553534984588623},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.5038885474205017},{"id":"https://openalex.org/C2778514511","wikidata":"https://www.wikidata.org/wiki/Q1374194","display_name":"Programmer","level":2,"score":0.49659520387649536},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.45015260577201843},{"id":"https://openalex.org/C33959348","wikidata":"https://www.wikidata.org/wiki/Q1630568","display_name":"Monad (category theory)","level":3,"score":0.44855743646621704},{"id":"https://openalex.org/C96146094","wikidata":"https://www.wikidata.org/wiki/Q609057","display_name":"Unification","level":2,"score":0.4463709890842438},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4372212886810303},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2550221085548401},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23348355293273926},{"id":"https://openalex.org/C156772000","wikidata":"https://www.wikidata.org/wiki/Q864475","display_name":"Functor","level":2,"score":0.14821013808250427},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.09020882844924927},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3236787","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3236787","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3236787","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":"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"}],"best_oa_location":{"id":"doi:10.1145/3236787","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3236787","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3236787","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":"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":[{"display_name":"Life below water","id":"https://metadata.un.org/sdg/14","score":0.5600000023841858}],"awards":[{"id":"https://openalex.org/G3470880770","display_name":null,"funder_award_id":"Fondecyt Regular 1150017 & Redes 170067","funder_id":"https://openalex.org/F4320334812","funder_display_name":"Comisi\u00f3n Nacional de Investigaci\u00f3n Cient\u00edfica y Tecnol\u00f3gica"}],"funders":[{"id":"https://openalex.org/F4320334812","display_name":"Comisi\u00f3n Nacional de Investigaci\u00f3n Cient\u00edfica y Tecnol\u00f3gica","ror":"https://ror.org/02ap3w078"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2886891016.pdf","grobid_xml":"https://content.openalex.org/works/W2886891016.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W1713610","https://openalex.org/W101424827","https://openalex.org/W326743114","https://openalex.org/W1480443021","https://openalex.org/W1558115254","https://openalex.org/W1649012353","https://openalex.org/W1664326696","https://openalex.org/W1825669111","https://openalex.org/W1836508668","https://openalex.org/W2057292961","https://openalex.org/W2098691999","https://openalex.org/W2113181166","https://openalex.org/W2133629640","https://openalex.org/W2140647971","https://openalex.org/W2148275052","https://openalex.org/W2158336522","https://openalex.org/W2206900256","https://openalex.org/W2291662397","https://openalex.org/W2533890487","https://openalex.org/W2550513301","https://openalex.org/W2565502105","https://openalex.org/W2611244834","https://openalex.org/W2949164661","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1987401065","https://openalex.org/W2767001837","https://openalex.org/W3123725507","https://openalex.org/W2545433890","https://openalex.org/W2277214925","https://openalex.org/W1993262756","https://openalex.org/W2255188432","https://openalex.org/W2939158620","https://openalex.org/W4299554251","https://openalex.org/W2128992690"],"abstract_inverted_index":{"Homotopy":[0],"Type":[1,14],"Theory":[2],"promises":[3],"a":[4,56,60,100,120,156],"unification":[5],"of":[6,9,19,63,69,82,95,146,151],"the":[7,17,20,67,72,105,111,144,174],"concepts":[8],"equality":[10],"and":[11,37,74,117,136,154,186],"equivalence":[12],"in":[13,104,149],"Theory,":[15],"through":[16],"introduction":[18],"univalence":[21,49,70],"principle.":[22],"However,":[23],"existing":[24,83],"proof":[25,107],"assistants":[26],"based":[27],"on":[28,59,80,162],"type":[29,84,96,121,135],"theory":[30],"treat":[31],"this":[32,52],"principle":[33],"as":[34,126],"an":[35,123],"axiom,":[36],"it":[38],"is":[39,166],"not":[40],"yet":[41],"clear":[42],"how":[43,141],"to":[44,47,65,71,92,113,122,142,168,176],"extend":[45],"them":[46],"handle":[48],"internally.":[50],"In":[51,86],"paper,":[53],"we":[54],"propose":[55],"construction":[57],"grounded":[58],"univalent":[61,88,164],"version":[62],"parametricity":[64,89,91],"bring":[66],"benefits":[68],"programmer":[73],"prover,":[75],"that":[76,109],"can":[77],"be":[78,169],"used":[79],"top":[81],"theories.":[85],"particular,":[87],"strengthens":[90],"ensure":[93],"preservation":[94],"equivalences.":[97,189],"We":[98,139],"present":[99],"lightweight":[101],"framework":[102],"implemented":[103],"Coq":[106],"assistant":[108],"allows":[110],"user":[112],"transparently":[114],"transfer":[115],"definitions":[116],"theorems":[118],"for":[119,159,179],"equivalent":[124],"one,":[125],"if":[127],"they":[128],"were":[129],"equal.":[130],"Our":[131],"approach":[132],"handles":[133],"both":[134],"term":[137],"dependency.":[138],"study":[140],"maximize":[143],"effectiveness":[145],"these":[147],"transports":[148],"terms":[150],"computational":[152],"behavior,":[153],"identify":[155],"fragment":[157],"useful":[158],"certified":[160,180],"programming":[161,181,185],"which":[163],"transport":[165],"guaranteed":[167],"effective.":[170],"This":[171],"work":[172],"paves":[173],"way":[175],"easier-to-use":[177],"environments":[178],"by":[182],"supporting":[183],"seamless":[184],"proving":[187],"modulo":[188]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":5}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}