{"id":"https://openalex.org/W4315631413","doi":"https://doi.org/10.1145/3571235","title":"Admissible Types-to-PERs Relativization in Higher-Order Logic","display_name":"Admissible Types-to-PERs Relativization in Higher-Order Logic","publication_year":2023,"publication_date":"2023-01-09","ids":{"openalex":"https://openalex.org/W4315631413","doi":"https://doi.org/10.1145/3571235"},"language":"en","primary_location":{"id":"doi:10.1145/3571235","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3571235","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3571235","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/3571235","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064907118","display_name":"Andrei Popescu","orcid":"https://orcid.org/0000-0001-8747-0619"},"institutions":[{"id":"https://openalex.org/I91136226","display_name":"University of Sheffield","ror":"https://ror.org/05krs5044","country_code":"GB","type":"education","lineage":["https://openalex.org/I91136226"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Andrei Popescu","raw_affiliation_strings":["University of Sheffield, UK"],"affiliations":[{"raw_affiliation_string":"University of Sheffield, UK","institution_ids":["https://openalex.org/I91136226"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046106256","display_name":"Dmitriy Traytel","orcid":"https://orcid.org/0000-0001-7982-2768"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Dmitriy Traytel","raw_affiliation_strings":["University of Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5064907118"],"corresponding_institution_ids":["https://openalex.org/I91136226"],"apc_list":null,"apc_paid":null,"fwci":0.3474,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.62726105,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":"7","issue":"POPL","first_page":"1214","last_page":"1245"},"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.9998000264167786,"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.9998000264167786,"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.9940999746322632,"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.9746999740600586,"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/hol","display_name":"HOL","score":0.9884641170501709},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.5708526372909546},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.5598123073577881},{"id":"https://openalex.org/keywords/type-theory","display_name":"Type theory","score":0.5409013628959656},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.521946370601654},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.5142266750335693},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5043023824691772},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4816981256008148},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4801201820373535},{"id":"https://openalex.org/keywords/proof-assistant","display_name":"Proof assistant","score":0.46670010685920715},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40430256724357605},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3350350856781006},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.19760453701019287},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.09799936413764954}],"concepts":[{"id":"https://openalex.org/C17435882","wikidata":"https://www.wikidata.org/wiki/Q17030435","display_name":"HOL","level":2,"score":0.9884641170501709},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.5708526372909546},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.5598123073577881},{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.5409013628959656},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.521946370601654},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.5142266750335693},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5043023824691772},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4816981256008148},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4801201820373535},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.46670010685920715},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40430256724357605},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3350350856781006},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.19760453701019287},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.09799936413764954},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3571235","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3571235","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3571235","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"},{"id":"pmh:oai:eprints.whiterose.ac.uk:197460","is_oa":true,"landing_page_url":null,"pdf_url":"https://eprints.whiterose.ac.uk/197460/1/3571235.pdf","source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:pure.atira.dk:publications/1fb8d52e-5c88-4079-987f-29f7fd01dc90","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/1fb8d52e-5c88-4079-987f-29f7fd01dc90","pdf_url":"https://curis.ku.dk/ws/files/335694006/Admissible_Types_to_PERs.pdf","source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"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":"Popescu , A & Traytel , D 2023 , ' Admissible Types-to-PERs Relativization in Higher-Order Logic ' , Proceedings of the ACM on Programming Languages , vol. 7 , no. POPL , 42 . https://doi.org/10.1145/3571235","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3571235","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3571235","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3571235","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":[{"score":0.7200000286102295,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4315631413.pdf","grobid_xml":"https://content.openalex.org/works/W4315631413.grobid-xml"},"referenced_works_count":51,"referenced_works":["https://openalex.org/W91041530","https://openalex.org/W101424827","https://openalex.org/W836255558","https://openalex.org/W1464569014","https://openalex.org/W1497011154","https://openalex.org/W1503170941","https://openalex.org/W1515094747","https://openalex.org/W1534850143","https://openalex.org/W1553511155","https://openalex.org/W1558175043","https://openalex.org/W1588424036","https://openalex.org/W1600435877","https://openalex.org/W1602718819","https://openalex.org/W1607688932","https://openalex.org/W1664326696","https://openalex.org/W1789208025","https://openalex.org/W1926673875","https://openalex.org/W1943070836","https://openalex.org/W1988136938","https://openalex.org/W1996404651","https://openalex.org/W1997132558","https://openalex.org/W2003701327","https://openalex.org/W2023035194","https://openalex.org/W2043566933","https://openalex.org/W2048306076","https://openalex.org/W2056141758","https://openalex.org/W2057292961","https://openalex.org/W2076409494","https://openalex.org/W2079640625","https://openalex.org/W2088189323","https://openalex.org/W2098909266","https://openalex.org/W2101444617","https://openalex.org/W2147130609","https://openalex.org/W2152414370","https://openalex.org/W2152762348","https://openalex.org/W2161331421","https://openalex.org/W2166662837","https://openalex.org/W2337267853","https://openalex.org/W2533538450","https://openalex.org/W2776461454","https://openalex.org/W2780404142","https://openalex.org/W2791394679","https://openalex.org/W2806477068","https://openalex.org/W2908479200","https://openalex.org/W2972845810","https://openalex.org/W4205469893","https://openalex.org/W4250846042","https://openalex.org/W4250850800","https://openalex.org/W4281558819","https://openalex.org/W4300934094","https://openalex.org/W6894253383"],"related_works":["https://openalex.org/W2888810578","https://openalex.org/W4289666903","https://openalex.org/W2769609281","https://openalex.org/W2483392883","https://openalex.org/W2534028225","https://openalex.org/W2153177892","https://openalex.org/W2519051298","https://openalex.org/W4293192252","https://openalex.org/W1504680642","https://openalex.org/W4386350920"],"abstract_inverted_index":{"Relativizing":[0],"statements":[1],"in":[2,41,44,77],"Higher-Order":[3],"Logic":[4],"(HOL)":[5],"from":[6],"types":[7,67],"to":[8],"sets":[9],"is":[10,75],"useful":[11],"for":[12,57],"improving":[13],"productivity":[14],"when":[15],"working":[16],"with":[17,108],"HOL-based":[18],"interactive":[19],"theorem":[20],"provers":[21],"such":[22,68],"as":[23,69,117],"HOL4,":[24],"HOL":[25,63,107,125],"Light":[26],"and":[27,36,71],"Isabelle/HOL.":[28],"This":[29],"paper":[30],"provides":[31],"the":[32,45,79,82,87,98],"first":[33],"comprehensive":[34],"definition":[35],"study":[37],"of":[38,49,62,81,89,100,106,124],"types-to-sets":[39],"relativization":[40,74,116,123],"HOL,":[42],"done":[43],"more":[46],"general":[47],"form":[48],"types-to-PERs":[50,73,115],"(partial":[51],"equivalence":[52],"relations).":[53],"We":[54,112],"prove":[55],"that,":[56],"a":[58,101],"large":[59],"practical":[60],"fragment":[61],"which":[64],"includes":[65],"container":[66],"datatypes":[70],"codatatypes,":[72],"admissible,":[76],"that":[78,121],"provability":[80,88],"original,":[83],"type-based":[84],"statement":[85],"implies":[86],"its":[90],"relativized,":[91],"PER-based":[92],"counterpart.":[93],"Our":[94],"results":[95],"also":[96],"imply":[97],"admissibility":[99],"previously":[102],"proposed":[103],"axiomatic":[104],"extension":[105],"local":[109],"type":[110],"definitions.":[111],"have":[113],"implemented":[114],"an":[118],"Isabelle":[119],"tool":[120],"performs":[122],"theorems":[126],"on":[127],"demand.":[128]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}