{"id":"https://openalex.org/W7119470012","doi":"https://doi.org/10.1145/3776672","title":"Algorithmic Conversion with Surjective Pairing: A Syntactic and Untyped Approach","display_name":"Algorithmic Conversion with Surjective Pairing: A Syntactic and Untyped Approach","publication_year":2026,"publication_date":"2026-01-08","ids":{"openalex":"https://openalex.org/W7119470012","doi":"https://doi.org/10.1145/3776672"},"language":"en","primary_location":{"id":"doi:10.1145/3776672","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3776672","pdf_url":null,"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://doi.org/10.1145/3776672","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055973502","display_name":"Yiyun Liu","orcid":"https://orcid.org/0009-0006-8717-2498"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]},{"id":"https://openalex.org/I922845939","display_name":"Philadelphia University","ror":"https://ror.org/03zzmyz63","country_code":"US","type":"education","lineage":["https://openalex.org/I922845939"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yiyun Liu","raw_affiliation_strings":["University of Pennsylvania, Philadelphia, USA"],"affiliations":[{"raw_affiliation_string":"University of Pennsylvania, Philadelphia, USA","institution_ids":["https://openalex.org/I922845939","https://openalex.org/I79576946"]}]},{"author_position":"last","author":{"id":null,"display_name":"Stephanie Weirich","orcid":"https://orcid.org/0000-0002-6756-9168"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]},{"id":"https://openalex.org/I922845939","display_name":"Philadelphia University","ror":"https://ror.org/03zzmyz63","country_code":"US","type":"education","lineage":["https://openalex.org/I922845939"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stephanie Weirich","raw_affiliation_strings":["University of Pennsylvania, Philadelphia, USA"],"affiliations":[{"raw_affiliation_string":"University of Pennsylvania, Philadelphia, USA","institution_ids":["https://openalex.org/I922845939","https://openalex.org/I79576946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055973502"],"corresponding_institution_ids":["https://openalex.org/I79576946","https://openalex.org/I922845939"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.057721,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":"POPL","first_page":"865","last_page":"894"},"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.9580000042915344,"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.9580000042915344,"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.009499999694526196,"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"}},{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.00559999980032444,"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/surjective-function","display_name":"Surjective function","score":0.7303000092506409},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6899999976158142},{"id":"https://openalex.org/keywords/confluence","display_name":"Confluence","score":0.5583999752998352},{"id":"https://openalex.org/keywords/type-theory","display_name":"Type theory","score":0.4708999991416931},{"id":"https://openalex.org/keywords/modularity","display_name":"Modularity (biology)","score":0.4690999984741211},{"id":"https://openalex.org/keywords/normalization","display_name":"Normalization (sociology)","score":0.42410001158714294},{"id":"https://openalex.org/keywords/logical-consequence","display_name":"Logical consequence","score":0.41449999809265137},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.39329999685287476}],"concepts":[{"id":"https://openalex.org/C119238805","wikidata":"https://www.wikidata.org/wiki/Q229102","display_name":"Surjective function","level":2,"score":0.7303000092506409},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6899999976158142},{"id":"https://openalex.org/C77906462","wikidata":"https://www.wikidata.org/wiki/Q1140902","display_name":"Confluence","level":2,"score":0.5583999752998352},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5034999847412109},{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.4708999991416931},{"id":"https://openalex.org/C2779478453","wikidata":"https://www.wikidata.org/wiki/Q6889748","display_name":"Modularity (biology)","level":2,"score":0.4690999984741211},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46880000829696655},{"id":"https://openalex.org/C136886441","wikidata":"https://www.wikidata.org/wiki/Q926129","display_name":"Normalization (sociology)","level":2,"score":0.42410001158714294},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4235999882221222},{"id":"https://openalex.org/C134752490","wikidata":"https://www.wikidata.org/wiki/Q374182","display_name":"Logical consequence","level":2,"score":0.41449999809265137},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.39329999685287476},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3797999918460846},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3714999854564667},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.3257000148296356},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3142000138759613},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3019999861717224},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.2985000014305115},{"id":"https://openalex.org/C195653647","wikidata":"https://www.wikidata.org/wiki/Q7625047","display_name":"Structural proof theory","level":4,"score":0.29600000381469727},{"id":"https://openalex.org/C121375916","wikidata":"https://www.wikidata.org/wiki/Q936559","display_name":"Principle of compositionality","level":2,"score":0.27480000257492065},{"id":"https://openalex.org/C161505775","wikidata":"https://www.wikidata.org/wiki/Q3240280","display_name":"Direct proof","level":2,"score":0.2694999873638153},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.2678000032901764},{"id":"https://openalex.org/C2986991398","wikidata":"https://www.wikidata.org/wiki/Q37437","display_name":"Syntactic structure","level":3,"score":0.25440001487731934},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.25369998812675476}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3776672","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3776672","pdf_url":null,"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"}],"best_oa_location":{"id":"doi:10.1145/3776672","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3776672","pdf_url":null,"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":[{"display_name":"Peace, Justice and strong institutions","score":0.7003783583641052,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G6764096287","display_name":null,"funder_award_id":"2327738","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W18232636","https://openalex.org/W87054518","https://openalex.org/W124942006","https://openalex.org/W1513749726","https://openalex.org/W1533094521","https://openalex.org/W1554068457","https://openalex.org/W1589742942","https://openalex.org/W1988292549","https://openalex.org/W1991947308","https://openalex.org/W2006607295","https://openalex.org/W2018181305","https://openalex.org/W2032294923","https://openalex.org/W2033146968","https://openalex.org/W2043740265","https://openalex.org/W2096161640","https://openalex.org/W2103033459","https://openalex.org/W2146471655","https://openalex.org/W2168254994","https://openalex.org/W2402296188","https://openalex.org/W2510726753","https://openalex.org/W2563196418","https://openalex.org/W2751791540","https://openalex.org/W2779668776","https://openalex.org/W2780835401","https://openalex.org/W2792493843","https://openalex.org/W2883606308","https://openalex.org/W2963765784","https://openalex.org/W2995917016","https://openalex.org/W4226400279","https://openalex.org/W4386464470","https://openalex.org/W4387270836","https://openalex.org/W4390605327","https://openalex.org/W4390777456","https://openalex.org/W4406221673","https://openalex.org/W4414383750","https://openalex.org/W6893338876","https://openalex.org/W7090304196"],"related_works":[],"abstract_inverted_index":{"In":[0,67],"a":[1,21,91,118,126],"dependent":[2],"type":[3,27,97],"theory":[4],"with":[5,83],"\u03b2-equivalence":[6],"as":[7,110],"its":[8,44],"equational":[9],"theory,":[10],"the":[11,24,30,37,40,52,58,81,144,155],"confluence":[12,84],"of":[13,23,26,39,43,54,94,96,122,129],"untyped":[14,123],"reduction":[15],"and":[16,89,125],"termination":[17],"immediately":[18],"give":[19],"us":[20,134],"proof":[22,93,102,115,121,128],"decidability":[25,95],"conversion,":[28],"where":[29],"decision":[31],"procedure":[32],"for":[33,60],"convertibility":[34],"simply":[35],"checks":[36],"equality":[38],"\u03b2-normal":[41],"forms":[42],"inputs.":[45],"This":[46,131],"technique":[47],"is":[48,64],"not":[49,65],"available":[50],"in":[51],"presence":[53],"surjective":[55,87],"pairing":[56],"(i.e.":[57],"\u03b7-law":[59],"pairs)":[61],"because":[62],"\u03b2\u03b7-reduction":[63],"confluent.":[66],"this":[68],"work,":[69],"we":[70,78],"show":[71],"that":[72],"by":[73,86],"adopting":[74],"established":[75],"syntactic":[76,127,140],"techniques,":[77],"can":[79],"resolve":[80],"issue":[82],"caused":[85],"pairing,":[88],"recover":[90],"confluence-based":[92],"conversion.":[98],"Compared":[99],"to":[100,135],"existing":[101],"developments,":[103],"which":[104],"rely":[105],"on":[106],"semantic":[107,120,146],"tools":[108],"such":[109],"Kripke-style":[111],"logical":[112],"relations,":[113],"our":[114,152],"modularly":[116],"composes":[117],"minimal":[119,145],"normalization":[124],"decidability.":[130],"modularity":[132],"enables":[133],"explore":[136],"algorithmic":[137],"conversion":[138],"through":[139],"methods":[141],"without":[142],"modifying":[143],"proof.":[147],"We":[148],"have":[149],"fully":[150],"mechanized":[151],"results":[153],"using":[154],"Rocq":[156],"theorem":[157],"prover.":[158]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2026-01-09T00:00:00"}