{"id":"https://openalex.org/W4241544125","doi":"https://doi.org/10.1145/2103656.2103713","title":"A unified approach to fully lazy sharing","display_name":"A unified approach to fully lazy sharing","publication_year":2012,"publication_date":"2012-01-24","ids":{"openalex":"https://openalex.org/W4241544125","doi":"https://doi.org/10.1145/2103656.2103713"},"language":"en","primary_location":{"id":"doi:10.1145/2103656.2103713","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2103656.2103713","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011884066","display_name":"Thibaut Balabonski","orcid":null},"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/I169173203","display_name":"D\u00e9l\u00e9gation Paris 7","ror":"https://ror.org/00bw5n526","country_code":"FR","type":"government","lineage":["https://openalex.org/I154526488","https://openalex.org/I169173203"]},{"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"]},{"id":"https://openalex.org/I4210091437","display_name":"Sorbonne Paris Cit\u00e9","ror":"https://ror.org/001z21q04","country_code":"FR","type":"other","lineage":["https://openalex.org/I4210091437"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Thibaut Balabonski","raw_affiliation_strings":["Univ Paris Diderot, Sorbonne Paris Cit\u00e9, PPS, UMR 7126, CNRS, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Univ Paris Diderot, Sorbonne Paris Cit\u00e9, PPS, UMR 7126, CNRS, Paris, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I169173203","https://openalex.org/I204730241","https://openalex.org/I4210091437"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5011884066"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I169173203","https://openalex.org/I204730241","https://openalex.org/I4210091437"],"apc_list":null,"apc_paid":null,"fwci":2.0813,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.88796065,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"469","last_page":"480"},"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.9987999796867371,"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.9811999797821045,"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/lazy-evaluation","display_name":"Lazy evaluation","score":0.7767939567565918},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.755776584148407},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7148619294166565},{"id":"https://openalex.org/keywords/lambda-calculus","display_name":"Lambda calculus","score":0.6103423237800598},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.5781065225601196},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5138707160949707},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.47030824422836304},{"id":"https://openalex.org/keywords/conservative-extension","display_name":"Conservative extension","score":0.4668391942977905},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3592372536659241},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.3203624486923218},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2570146322250366}],"concepts":[{"id":"https://openalex.org/C128099668","wikidata":"https://www.wikidata.org/wiki/Q573952","display_name":"Lazy evaluation","level":3,"score":0.7767939567565918},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.755776584148407},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7148619294166565},{"id":"https://openalex.org/C135790938","wikidata":"https://www.wikidata.org/wiki/Q242028","display_name":"Lambda calculus","level":2,"score":0.6103423237800598},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.5781065225601196},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5138707160949707},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.47030824422836304},{"id":"https://openalex.org/C2780432614","wikidata":"https://www.wikidata.org/wiki/Q864213","display_name":"Conservative extension","level":2,"score":0.4668391942977905},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3592372536659241},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.3203624486923218},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2570146322250366},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2103656.2103713","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2103656.2103713","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1543641760","https://openalex.org/W1553954213","https://openalex.org/W1582300138","https://openalex.org/W1884266445","https://openalex.org/W1980647766","https://openalex.org/W1983303046","https://openalex.org/W2004843654","https://openalex.org/W2027836624","https://openalex.org/W2030663607","https://openalex.org/W2035840350","https://openalex.org/W2063068243","https://openalex.org/W2085014646","https://openalex.org/W2092727913","https://openalex.org/W2103859677","https://openalex.org/W2112022010","https://openalex.org/W2118172707","https://openalex.org/W2135316487","https://openalex.org/W2147478629","https://openalex.org/W2155200218","https://openalex.org/W2156231390","https://openalex.org/W4212868911","https://openalex.org/W4241544125","https://openalex.org/W6686384162"],"related_works":["https://openalex.org/W1553079342","https://openalex.org/W2612055453","https://openalex.org/W2157334321","https://openalex.org/W2764317176","https://openalex.org/W2168393711","https://openalex.org/W2099473324","https://openalex.org/W2104819922","https://openalex.org/W2105232714","https://openalex.org/W4241544125","https://openalex.org/W2091382363"],"abstract_inverted_index":{"We":[0,29,58],"give":[1],"an":[2],"axiomatic":[3],"presentation":[4],"of":[5,35,43,46,56,66,86],"sharing-via-labelling":[6],"for":[7],"weak":[8,67,87],"lambda-calculi,":[9],"that":[10,31],"makes":[11],"it":[12],"possible":[13],"to":[14,20],"formally":[15],"compare":[16],"many":[17],"different":[18],"approaches":[19],"fully":[21,75],"lazy":[22,76],"sharing,":[23],"and":[24,69],"obtain":[25],"two":[26],"important":[27],"results.":[28],"prove":[30],"the":[32,44,54,63,83],"known":[33],"implementations":[34],"full":[36],"laziness":[37],"are":[38],"all":[39],"equivalent":[40],"in":[41,78],"terms":[42],"number":[45],"beta-reductions":[47],"performed,":[48],"although":[49],"they":[50],"behave":[51],"differently":[52],"regarding":[53],"duplication":[55],"terms.":[57],"establish":[59],"a":[60],"link":[61],"between":[62],"optimality":[64],"theories":[65],"lambda-calculi":[68],"first-order":[70,84],"rewriting":[71],"systems":[72],"by":[73],"expressing":[74],"lambda-lifting":[77],"our":[79],"framework,":[80],"thus":[81],"emphasizing":[82],"essence":[85],"reduction.":[88]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}