{"id":"https://openalex.org/W4405030530","doi":"https://doi.org/10.1145/3704915","title":"Tail Modulo Cons, OCaml, and Relational Separation Logic","display_name":"Tail Modulo Cons, OCaml, and Relational Separation Logic","publication_year":2025,"publication_date":"2025-01-07","ids":{"openalex":"https://openalex.org/W4405030530","doi":"https://doi.org/10.1145/3704915"},"language":"en","primary_location":{"id":"doi:10.1145/3704915","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3704915","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":"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":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1145/3704915","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075592935","display_name":"Cl\u00e9ment Allain","orcid":null},"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":"Cl\u00e9ment Allain","raw_affiliation_strings":["Inria, Paris, France"],"raw_orcid":"https://orcid.org/0009-0005-2972-5181","affiliations":[{"raw_affiliation_string":"Inria, Paris, France","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037202767","display_name":"Fr\u00e9d\u00e9ric Bour","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fr\u00e9d\u00e9ric Bour","raw_affiliation_strings":["Tarides, Paris, France"],"raw_orcid":"https://orcid.org/0009-0007-5268-5784","affiliations":[{"raw_affiliation_string":"Tarides, Paris, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077489120","display_name":"Basile Cl\u00e9ment","orcid":"https://orcid.org/0000-0002-9126-0937"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Basile Cl\u00e9ment","raw_affiliation_strings":["OCamlPro, Paris, France"],"raw_orcid":"https://orcid.org/0000-0002-9126-0937","affiliations":[{"raw_affiliation_string":"OCamlPro, Paris, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060426941","display_name":"Fran\u00e7ois Pottier","orcid":"https://orcid.org/0000-0002-4069-1235"},"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":"Fran\u00e7ois Pottier","raw_affiliation_strings":["Inria, Paris, France"],"raw_orcid":"https://orcid.org/0000-0002-4069-1235","affiliations":[{"raw_affiliation_string":"Inria, Paris, France","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047042180","display_name":"Gabriel Scherer","orcid":"https://orcid.org/0000-0003-1758-3938"},"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"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Gabriel Scherer","raw_affiliation_strings":["Inria, Paris, France","Universit\u00e9 Paris Cit\u00e9, Paris, France"],"raw_orcid":"https://orcid.org/0000-0003-1758-3938","affiliations":[{"raw_affiliation_string":"Inria, Paris, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"Universit\u00e9 Paris Cit\u00e9, Paris, France","institution_ids":["https://openalex.org/I204730241"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.5479,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.93635077,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":"9","issue":"POPL","first_page":"2337","last_page":"2363"},"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.9995999932289124,"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.9995999932289124,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9962999820709229,"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/modulo","display_name":"Modulo","score":0.7817622423171997},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7214786410331726},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6992219090461731},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6591352224349976},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.5700324177742004},{"id":"https://openalex.org/keywords/separation-logic","display_name":"Separation logic","score":0.49282458424568176},{"id":"https://openalex.org/keywords/proof-assistant","display_name":"Proof assistant","score":0.4764459431171417},{"id":"https://openalex.org/keywords/transformation","display_name":"Transformation (genetics)","score":0.445763498544693},{"id":"https://openalex.org/keywords/bunched-logic","display_name":"Bunched logic","score":0.43277376890182495},{"id":"https://openalex.org/keywords/stack","display_name":"Stack (abstract data type)","score":0.42833849787712097},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4163379669189453},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4131316840648651},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.4118240475654602},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29064807295799255},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.26570963859558105},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.15361812710762024},{"id":"https://openalex.org/keywords/multimodal-logic","display_name":"Multimodal logic","score":0.08590546250343323},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08305796980857849}],"concepts":[{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.7817622423171997},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7214786410331726},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6992219090461731},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6591352224349976},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.5700324177742004},{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.49282458424568176},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.4764459431171417},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.445763498544693},{"id":"https://openalex.org/C80467683","wikidata":"https://www.wikidata.org/wiki/Q4997446","display_name":"Bunched logic","level":5,"score":0.43277376890182495},{"id":"https://openalex.org/C9395851","wikidata":"https://www.wikidata.org/wiki/Q177929","display_name":"Stack (abstract data type)","level":2,"score":0.42833849787712097},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4163379669189453},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4131316840648651},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.4118240475654602},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29064807295799255},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.26570963859558105},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.15361812710762024},{"id":"https://openalex.org/C203659156","wikidata":"https://www.wikidata.org/wiki/Q6934805","display_name":"Multimodal logic","level":3,"score":0.08590546250343323},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08305796980857849},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C3845977","wikidata":"https://www.wikidata.org/wiki/Q4826262","display_name":"Autoepistemic logic","level":4,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3704915","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3704915","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":"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:arXiv.org:2411.19397","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2411.19397","pdf_url":"https://arxiv.org/pdf/2411.19397","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-04884634v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-04884634","pdf_url":"https://inria.hal.science/hal-04884634/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"Proceedings of the ACM on Programming Languages, 2025, 9 (POPL), pp.2337-2363. &#x27E8;10.1145/3704915&#x27E9;","raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.5281/zenodo.14238919","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.14238919","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"JournalArticle"}],"best_oa_location":{"id":"doi:10.1145/3704915","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3704915","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":"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":"Quality Education","score":0.7599999904632568,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1503535982","https://openalex.org/W2006543828","https://openalex.org/W2010742976","https://openalex.org/W2028861803","https://openalex.org/W2115974895","https://openalex.org/W2116918412","https://openalex.org/W2402209726","https://openalex.org/W2476818328","https://openalex.org/W2581223864","https://openalex.org/W2940960788","https://openalex.org/W3037762203","https://openalex.org/W3123460033","https://openalex.org/W3175711391","https://openalex.org/W4206600087","https://openalex.org/W4315631774","https://openalex.org/W4399872417"],"related_works":["https://openalex.org/W2148687959","https://openalex.org/W3194921765","https://openalex.org/W2144482530","https://openalex.org/W3136970019","https://openalex.org/W4247835804","https://openalex.org/W2154768716","https://openalex.org/W2495367456","https://openalex.org/W3110302737","https://openalex.org/W2118916314","https://openalex.org/W3029202334"],"abstract_inverted_index":{"Common":[0],"functional":[1],"languages":[2],"incentivize":[3],"tail-recursive":[4,31,73],"functions,":[5],"as":[6],"opposed":[7],"to":[8,20,146,165],"general":[9],"recursive":[10,89],"functions":[11,28,71],"that":[12,33,63,110,150],"consume":[13],"stack":[14],"space":[15],"and":[16,38,86],"may":[17,34],"not":[18],"scale":[19],"large":[21],"inputs.":[22],"This":[23,45],"distinction":[24],"occasionally":[25],"requires":[26],"writing":[27],"in":[29,57,79,100,123],"a":[30,67,101,105,170],"style":[32],"be":[35],"more":[36],"complex":[37],"slower":[39],"than":[40],"the":[41,51,58,81,94,112,116,124,129,143,160,167],"natural,":[42],"non-tail-recursive":[43],"definition.":[44],"work":[46,138],"describes":[47],"our":[48,137,156],"implementation":[49],"of":[50,70,84,96,115,136,142,163,169],"tail":[52],"modulo":[53,74],"constructor":[54],"(TMC)":[55],"transformation":[56,99],"OCaml":[59,117],"compiler,":[60],"an":[61,140],"optimization":[62],"provides":[64],"stack-efficiency":[65],"for":[66],"larger":[68],"class":[69],"\u2014":[72,76,104,109],"constructors":[75],"which":[77],"includes":[78],"particular":[80],"natural":[82],"definition":[83],"List.map":[85],"many":[87],"similar":[88],"data-constructing":[90],"functions.":[91],"We":[92],"prove":[93,166],"correctness":[95,168],"this":[97,158],"program":[98],"simplified":[102],"setting":[103],"small":[106],"untyped":[107],"calculus":[108],"captures":[111],"salient":[113],"aspects":[114],"implementation.":[118],"Our":[119],"proof":[120,126],"is":[121,139,159],"mechanized":[122],"Coq":[125],"assistant,":[127],"using":[128],"Iris":[130],"base":[131],"logic.":[132],"An":[133],"independent":[134],"contribution":[135],"extension":[141],"Simuliris":[144,164],"approach":[145],"define":[147],"simulation":[148],"relations":[149],"support":[151],"different":[152],"calling":[153],"conventions.":[154],"To":[155],"knowledge,":[157],"first":[161],"use":[162],"compiler":[171],"transformation.":[172]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}
