{"id":"https://openalex.org/W3028421255","doi":"https://doi.org/10.1017/s095679682000012x","title":"Tight typings and split bounds, fully developed","display_name":"Tight typings and split bounds, fully developed","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3028421255","doi":"https://doi.org/10.1017/s095679682000012x","mag":"3028421255"},"language":"en","primary_location":{"id":"doi:10.1017/s095679682000012x","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s095679682000012x","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/95BD54E1AF44234025F3462836B7D83D/S095679682000012Xa.pdf/div-class-title-tight-typings-and-split-bounds-fully-developed-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/95BD54E1AF44234025F3462836B7D83D/S095679682000012Xa.pdf/div-class-title-tight-typings-and-split-bounds-fully-developed-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046873607","display_name":"Beniamino Accattoli","orcid":"https://orcid.org/0000-0003-4944-9944"},"institutions":[{"id":"https://openalex.org/I4210139461","display_name":"Laboratoire d'Informatique de l'\u00c9cole Polytechnique","ror":"https://ror.org/04afed728","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I142476485","https://openalex.org/I4210139461","https://openalex.org/I4210145102","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"BENIAMINO ACCATTOLI","raw_affiliation_strings":["Inria & LIX, \u00c9cole Polytechnique, UMR 7161, Palaiseau, France (e-mail:","Automatisation et Repr\u00e9senTation: fOndation du calcUl et de la d\u00e9ducTion"],"raw_orcid":"https://orcid.org/0000-0003-4944-9944","affiliations":[{"raw_affiliation_string":"Inria & LIX, \u00c9cole Polytechnique, UMR 7161, Palaiseau, France (e-mail:","institution_ids":["https://openalex.org/I4210139461"]},{"raw_affiliation_string":"Automatisation et Repr\u00e9senTation: fOndation du calcUl et de la d\u00e9ducTion","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083284084","display_name":"St\u00e9phane Graham-Lengrand","orcid":"https://orcid.org/0000-0002-2112-7284"},"institutions":[{"id":"https://openalex.org/I1298353152","display_name":"SRI International","ror":"https://ror.org/05s570m15","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I1298353152"]},{"id":"https://openalex.org/I4210099336","display_name":"Menlo School","ror":"https://ror.org/01240pn49","country_code":"US","type":"education","lineage":["https://openalex.org/I4210099336"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"ST\u00c9PHANE GRAHAM-LENGRAND","raw_affiliation_strings":["SRI International, USA (e-mail:","SRI International [Menlo Park]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"SRI International, USA (e-mail:","institution_ids":["https://openalex.org/I1298353152"]},{"raw_affiliation_string":"SRI International [Menlo Park]","institution_ids":["https://openalex.org/I1298353152","https://openalex.org/I4210099336"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077330939","display_name":"Delia Kesner","orcid":"https://orcid.org/0000-0003-4254-3129"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I185839726","display_name":"Institut Universitaire de France","ror":"https://ror.org/055khg266","country_code":"FR","type":"education","lineage":["https://openalex.org/I185839726"]},{"id":"https://openalex.org/I4210117673","display_name":"Institut de Recherche en Informatique Fondamentale","ror":"https://ror.org/02krdtz55","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I204730241","https://openalex.org/I4210089394","https://openalex.org/I4210117673","https://openalex.org/I4210139971"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"DELIA KESNER","raw_affiliation_strings":["IRIF, CNRS, Universit\u00e9 de Paris & Institut Universitaire de France, France (e-mail:","Institut de Recherche en Informatique Fondamentale"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IRIF, CNRS, Universit\u00e9 de Paris & Institut Universitaire de France, France (e-mail:","institution_ids":["https://openalex.org/I185839726","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Institut de Recherche en Informatique Fondamentale","institution_ids":["https://openalex.org/I4210117673"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5046873607"],"corresponding_institution_ids":["https://openalex.org/I4210139461"],"apc_list":null,"apc_paid":null,"fwci":1.7681,"has_fulltext":true,"cited_by_count":24,"citation_normalized_percentile":{"value":0.8802547,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"30","issue":null,"first_page":null,"last_page":null},"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.9998999834060669,"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.9998999834060669,"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.9972000122070312,"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/T11567","display_name":"semigroups and automata theory","score":0.9886999726295471,"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/computer-science","display_name":"Computer science","score":0.7678349018096924},{"id":"https://openalex.org/keywords/aka","display_name":"AKA","score":0.5834126472473145},{"id":"https://openalex.org/keywords/substitution","display_name":"Substitution (logic)","score":0.5701258778572083},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.5642917156219482},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.512071430683136},{"id":"https://openalex.org/keywords/modularity","display_name":"Modularity (biology)","score":0.4836205542087555},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.4788805842399597},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4440455734729767},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4041884243488312},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3241996765136719},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24918916821479797},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13280776143074036}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7678349018096924},{"id":"https://openalex.org/C121158502","wikidata":"https://www.wikidata.org/wiki/Q4652161","display_name":"AKA","level":2,"score":0.5834126472473145},{"id":"https://openalex.org/C2778220771","wikidata":"https://www.wikidata.org/wiki/Q1522579","display_name":"Substitution (logic)","level":2,"score":0.5701258778572083},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.5642917156219482},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.512071430683136},{"id":"https://openalex.org/C2779478453","wikidata":"https://www.wikidata.org/wiki/Q6889748","display_name":"Modularity (biology)","level":2,"score":0.4836205542087555},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.4788805842399597},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4440455734729767},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4041884243488312},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3241996765136719},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24918916821479797},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13280776143074036},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C161191863","wikidata":"https://www.wikidata.org/wiki/Q199655","display_name":"Library science","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":2,"locations":[{"id":"doi:10.1017/s095679682000012x","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s095679682000012x","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/95BD54E1AF44234025F3462836B7D83D/S095679682000012Xa.pdf/div-class-title-tight-typings-and-split-bounds-fully-developed-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-03089347v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-03089347","pdf_url":null,"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Functional Programming, 2020, 30, ⟨10.1017/S095679682000012X⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"doi:10.1017/s095679682000012x","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s095679682000012x","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/95BD54E1AF44234025F3462836B7D83D/S095679682000012Xa.pdf/div-class-title-tight-typings-and-split-bounds-fully-developed-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8011290971","display_name":null,"funder_award_id":"ANR-16-CE40-004-01","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3028421255.pdf","grobid_xml":"https://content.openalex.org/works/W3028421255.grobid-xml"},"referenced_works_count":70,"referenced_works":["https://openalex.org/W120450198","https://openalex.org/W159715351","https://openalex.org/W161800829","https://openalex.org/W220669002","https://openalex.org/W1230660382","https://openalex.org/W1554278997","https://openalex.org/W1575284330","https://openalex.org/W1596346405","https://openalex.org/W1597392452","https://openalex.org/W1630373979","https://openalex.org/W1904606068","https://openalex.org/W1965630431","https://openalex.org/W1966928697","https://openalex.org/W1981303668","https://openalex.org/W1993439083","https://openalex.org/W2001822718","https://openalex.org/W2002689571","https://openalex.org/W2004553747","https://openalex.org/W2010790229","https://openalex.org/W2024929322","https://openalex.org/W2028576530","https://openalex.org/W2064236106","https://openalex.org/W2065246392","https://openalex.org/W2068055184","https://openalex.org/W2081694512","https://openalex.org/W2085670481","https://openalex.org/W2095867533","https://openalex.org/W2098607593","https://openalex.org/W2115141955","https://openalex.org/W2130554190","https://openalex.org/W2157460885","https://openalex.org/W2169655078","https://openalex.org/W2171496589","https://openalex.org/W2187443617","https://openalex.org/W2232523289","https://openalex.org/W2240853903","https://openalex.org/W2276552877","https://openalex.org/W2288327229","https://openalex.org/W2293486267","https://openalex.org/W2480764764","https://openalex.org/W2508102865","https://openalex.org/W2569392808","https://openalex.org/W2753372626","https://openalex.org/W2757509170","https://openalex.org/W2760585651","https://openalex.org/W2779912584","https://openalex.org/W2786649823","https://openalex.org/W2885468325","https://openalex.org/W2896999751","https://openalex.org/W2898747740","https://openalex.org/W2898952448","https://openalex.org/W2911921619","https://openalex.org/W2915016821","https://openalex.org/W2933535240","https://openalex.org/W2964032597","https://openalex.org/W2964120150","https://openalex.org/W2988921440","https://openalex.org/W2993444805","https://openalex.org/W3003709640","https://openalex.org/W3098591714","https://openalex.org/W3098943782","https://openalex.org/W3099560079","https://openalex.org/W3102239426","https://openalex.org/W4233636389","https://openalex.org/W4235052724","https://openalex.org/W4307583454","https://openalex.org/W6747392685","https://openalex.org/W6748121188","https://openalex.org/W6752561482","https://openalex.org/W6771046272"],"related_works":["https://openalex.org/W3014541132","https://openalex.org/W2994737807","https://openalex.org/W2379444625","https://openalex.org/W2393147081","https://openalex.org/W2948639032","https://openalex.org/W2575869988","https://openalex.org/W2948704552","https://openalex.org/W2948403110","https://openalex.org/W3156494719","https://openalex.org/W3117615547"],"abstract_inverted_index":{"Abstract":[0],"Multi":[1],"types":[2,7,69,237],"\u2013":[3,8,208,226],"aka":[4],"non-idempotent":[5],"intersection":[6],"have":[9],"been":[10],"used.":[11],"to":[12,105,126,216],"obtain":[13],"quantitative":[14],"bounds":[15,136,203],"on":[16],"higher-order":[17],"programs,":[18],"as":[19,53,246],"pioneered":[20],"by":[21,101,248],"de":[22,182],"Carvalho.":[23],"Notably,":[24],"they":[25],"bound":[26],"at":[27,163,243],"the":[28,31,37,40,46,60,76,79,86,119,128,131,143,153,166,169,178,205,209,228,231,239,249],"same":[29,61],"time":[30,56],"number":[32,47,87],"of":[33,39,48,78,88,130,241],"evaluation":[34,116,139],"steps":[35,49],"and":[36,96,103,118,148,151,171,184,192,220,227],"size":[38,77],"result.":[41],"Recent":[42],"results":[43,65,167],"show":[44],"that":[45,67,213,230],"can":[50,81],"be":[51,82],"taken":[52],"a":[54,98,189,193,222,244],"reasonable":[55,223],"complexity":[57,73,224],"measure.":[58],"At":[59],"time,":[62],"however,":[63],"these":[64],"suggest":[66],"multi":[68,236],"provide":[70,106,134],"quite":[71],"lax":[72],"bounds,":[74],"because":[75],"result":[80,122],"exponentially":[83],"bigger":[84],"than":[85],"steps.":[89],"Starting":[90],"from":[91],"this":[92],"observation,":[93],"we":[94,133],"refine":[95],"generalise":[97],"technique":[99,191],"introduced":[100],"Bernadet":[102,185],"Graham-Lengrand":[104,187],"exact":[107,135,201],"bounds.":[108],"Our":[109,160],"typing":[110],"judgements":[111],"carry":[112],"counters,":[113],"one":[114],"measuring":[115,121],"lengths":[117],"other":[120],"sizes.":[123],"In":[124],"order":[125],"emphasise":[127],"modularity":[129],"approach,":[132],"for":[137,204],"four":[138],"strategies,":[140],"both":[141,164],"in":[142,152,168],"\u03bb":[144],"-calculus":[145],"(head,":[146],"leftmost-outermost,":[147],"maximal":[149],"evaluation)":[150],"linear":[154,250],"substitution":[155,242,251],"calculus":[156],"(linear":[157],"head":[158],"evaluation).":[159],"work":[161],"aims":[162],"capturing":[165],"literature":[170],"extending":[172],"them":[173],"with":[174],"new":[175],"outcomes.":[176],"Concerning":[177],"literature,":[179],"it":[180],"unifies":[181],"Carvalho":[183],"&":[186],"via":[188],"uniform":[190],"complexity-based":[194],"perspective.":[195],"The":[196],"two":[197],"main":[198],"novelties":[199],"are":[200],"split":[202],"leftmost":[206],"strategy":[207,212],"only":[210],"known":[211],"evaluates":[214],"terms":[215],"full":[217],"normal":[218],"forms":[219],"provides":[221],"measure":[225],"observation":[229],"computing":[232],"device":[233],"hidden":[234],"behind":[235],"is":[238],"notion":[240],"distance,":[245],"implemented":[247],"calculus.":[252]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}