{"id":"https://openalex.org/W3210955572","doi":"https://doi.org/10.46298/lmcs-19(1:21)2023","title":"A strong call-by-need calculus","display_name":"A strong call-by-need calculus","publication_year":2023,"publication_date":"2023-03-24","ids":{"openalex":"https://openalex.org/W3210955572","doi":"https://doi.org/10.46298/lmcs-19(1:21)2023","mag":"3210955572"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-19(1:21)2023","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-19(1:21)2023","pdf_url":"https://lmcs.episciences.org/11115/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/11115/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011884066","display_name":"Thibaut Balabonski","orcid":null},"institutions":[{"id":"https://openalex.org/I4387154672","display_name":"Laboratoire M\u00e9thodes Formelles","ror":"https://ror.org/00gdtta79","country_code":"FR","type":"facility","lineage":["https://openalex.org/I11559806","https://openalex.org/I1294671590","https://openalex.org/I277688954","https://openalex.org/I277688954","https://openalex.org/I4387154672"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Thibaut Balabonski","raw_affiliation_strings":["LMF - Laboratoire M\u00e9thodes Formelles (4, avenue des Sciences, 91190, Gif-sur-Yvette - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LMF - Laboratoire M\u00e9thodes Formelles (4, avenue des Sciences, 91190, Gif-sur-Yvette - France)","institution_ids":["https://openalex.org/I4387154672"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064817010","display_name":"Antoine Lanco","orcid":null},"institutions":[{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Antoine Lanco","raw_affiliation_strings":["TOCCATA - Formally Verified Programs, Certified Tools and Numerical Computations (Universit\u00e9 Paris-Saclay; B\u00e2timent 650 ; 91405 ORSAY CEDEX - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TOCCATA - Formally Verified Programs, Certified Tools and Numerical Computations (Universit\u00e9 Paris-Saclay; B\u00e2timent 650 ; 91405 ORSAY CEDEX - France)","institution_ids":["https://openalex.org/I277688954"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073473823","display_name":"Guillaume Melquiond","orcid":"https://orcid.org/0000-0002-6697-1809"},"institutions":[{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Guillaume Melquiond","raw_affiliation_strings":["TOCCATA - Formally Verified Programs, Certified Tools and Numerical Computations (Universit\u00e9 Paris-Saclay; B\u00e2timent 650 ; 91405 ORSAY CEDEX - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TOCCATA - Formally Verified Programs, Certified Tools and Numerical Computations (Universit\u00e9 Paris-Saclay; B\u00e2timent 650 ; 91405 ORSAY CEDEX - France)","institution_ids":["https://openalex.org/I277688954"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.261,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.60987097,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":"Volume 19, Issue 1","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.9990000128746033,"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.9955999851226807,"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/calculus","display_name":"Calculus (dental)","score":0.6818113923072815},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5896468758583069},{"id":"https://openalex.org/keywords/typed-lambda-calculus","display_name":"Typed lambda calculus","score":0.5778771638870239},{"id":"https://openalex.org/keywords/church-encoding","display_name":"Church encoding","score":0.5704236030578613},{"id":"https://openalex.org/keywords/simply-typed-lambda-calculus","display_name":"Simply typed lambda calculus","score":0.5375238656997681},{"id":"https://openalex.org/keywords/lambda-calculus","display_name":"Lambda calculus","score":0.5115681290626526},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45895251631736755},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4558682441711426},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36540186405181885},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.05486863851547241}],"concepts":[{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.6818113923072815},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5896468758583069},{"id":"https://openalex.org/C142156749","wikidata":"https://www.wikidata.org/wiki/Q2607208","display_name":"Typed lambda calculus","level":3,"score":0.5778771638870239},{"id":"https://openalex.org/C77736955","wikidata":"https://www.wikidata.org/wiki/Q1089708","display_name":"Church encoding","level":5,"score":0.5704236030578613},{"id":"https://openalex.org/C61237538","wikidata":"https://www.wikidata.org/wiki/Q855192","display_name":"Simply typed lambda calculus","level":4,"score":0.5375238656997681},{"id":"https://openalex.org/C135790938","wikidata":"https://www.wikidata.org/wiki/Q242028","display_name":"Lambda calculus","level":2,"score":0.5115681290626526},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45895251631736755},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4558682441711426},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36540186405181885},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.05486863851547241},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.46298/lmcs-19(1:21)2023","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-19(1:21)2023","pdf_url":"https://lmcs.episciences.org/11115/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2111.01485","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2111.01485","pdf_url":"https://arxiv.org/pdf/2111.01485","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-03409681v3","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-03409681","pdf_url":"https://inria.hal.science/hal-03409681/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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, 2023, 19 (1), pp.39. ⟨10.46298/lmcs-19(1:21)2023⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:doaj.org/article:e725cba17a2442fbba8e833c83a989b8","is_oa":true,"landing_page_url":"https://doaj.org/article/e725cba17a2442fbba8e833c83a989b8","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 19, Issue 1 (2023)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-19(1:21)2023","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-19(1:21)2023","pdf_url":"https://lmcs.episciences.org/11115/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.4300000071525574,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W3210955572.pdf"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W120450198","https://openalex.org/W220669002","https://openalex.org/W618258190","https://openalex.org/W1527432636","https://openalex.org/W1750600100","https://openalex.org/W1934781858","https://openalex.org/W1961757151","https://openalex.org/W1969204136","https://openalex.org/W2012068558","https://openalex.org/W2024902159","https://openalex.org/W2028576530","https://openalex.org/W2030663607","https://openalex.org/W2062838731","https://openalex.org/W2082152317","https://openalex.org/W2083060740","https://openalex.org/W2085670481","https://openalex.org/W2088735483","https://openalex.org/W2091382363","https://openalex.org/W2091657052","https://openalex.org/W2118229393","https://openalex.org/W2134776161","https://openalex.org/W2155200218","https://openalex.org/W2157460885","https://openalex.org/W2168254994","https://openalex.org/W2460688276","https://openalex.org/W2753719079","https://openalex.org/W2760585651","https://openalex.org/W2953874395","https://openalex.org/W3100920743","https://openalex.org/W3107124382","https://openalex.org/W3132125281","https://openalex.org/W3133336796","https://openalex.org/W3174426273","https://openalex.org/W4210639184","https://openalex.org/W4241544125","https://openalex.org/W4246086292"],"related_works":["https://openalex.org/W2761902706","https://openalex.org/W3123171335","https://openalex.org/W2114151019","https://openalex.org/W1595139175","https://openalex.org/W2088376608","https://openalex.org/W2110435210","https://openalex.org/W2189323991","https://openalex.org/W236003875","https://openalex.org/W2114701904","https://openalex.org/W2153353244"],"abstract_inverted_index":{"We":[0,96,127],"present":[1],"a":[2,63,67,71,89,99,155],"call-by-need":[3,159],"$\\lambda$-calculus":[4],"that":[5,19,104,110],"enables":[6],"strong":[7,64],"reduction":[8,11,45,80,113,160],"(that":[9],"is,":[10],"inside":[12],"the":[13,37,53,76,85,92,106,124,130],"body":[14],"of":[15,91,101,115,137,158],"abstractions)":[16],"and":[17,26,35,47,109,140],"guarantees":[18],"arguments":[20],"are":[21],"only":[22,111],"evaluated":[23],"if":[24],"needed":[25],"at":[27],"most":[28],"once.":[29],"This":[30],"calculus":[31,56,86,103],"uses":[32],"explicit":[33],"substitutions":[34],"subsumes":[36],"existing":[38,125],"strong-call-by-need":[39],"strategy,":[40],"but":[41],"allows":[42],"for":[43],"more":[44],"sequences,":[46],"often":[48],"shorter":[49],"ones,":[50],"while":[51],"preserving":[52],"neededness.":[54],"The":[55],"is":[57],"shown":[58],"to":[59,134,153],"be":[60],"normalizing":[61],"in":[62,75,84],"sense:":[65],"Whenever":[66],"$\\lambda$-term":[68],"t":[69,83],"admits":[70],"normal":[72,93],"form":[73,94],"n":[74],"$\\lambda$-calculus,":[77],"then":[78],"any":[79],"sequence":[81],"from":[82],"eventually":[87],"reaches":[88],"representative":[90],"n.":[95],"also":[97],"exhibit":[98],"restriction":[100],"this":[102,138,143],"has":[105],"diamond":[107],"property":[108],"performs":[112],"sequences":[114],"minimal":[116],"length,":[117],"which":[118],"makes":[119],"it":[120,150],"systematically":[121],"better":[122],"than":[123],"strategy.":[126],"have":[128],"used":[129],"Abella":[131],"proof":[132],"assistant":[133],"formalize":[135],"part":[136],"calculus,":[139],"discuss":[141],"how":[142],"experiment":[144],"affected":[145],"its":[146],"design.":[147],"In":[148],"particular,":[149],"led":[151],"us":[152],"derive":[154],"new":[156],"description":[157],"based":[161],"on":[162],"inductive":[163],"rules.":[164]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2025-10-10T00:00:00"}