{"id":"https://openalex.org/W2016408482","doi":"https://doi.org/10.1016/s1571-0661(05)80284-1","title":"A Foundation for Space-Safe Transformations of Call-by-Need Programs","display_name":"A Foundation for Space-Safe Transformations of Call-by-Need Programs","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2016408482","doi":"https://doi.org/10.1016/s1571-0661(05)80284-1","mag":"2016408482"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(05)80284-1","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80284-1","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(05)80284-1","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055736375","display_name":"J\u00f6rgen Gustavsson","orcid":null},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"J\u00f6rgen Gustavsson","raw_affiliation_strings":["Chalmers University of Technology and G\u00f6teborg University, Sweden","Chalmers University of Technology and Goteborg University, Sweden#TAB#"],"affiliations":[{"raw_affiliation_string":"Chalmers University of Technology and G\u00f6teborg University, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Chalmers University of Technology and Goteborg University, Sweden#TAB#","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082447666","display_name":"David Sands","orcid":"https://orcid.org/0000-0001-6221-0503"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"David Sands","raw_affiliation_strings":["Chalmers University of Technology and G\u00f6teborg University, Sweden","Chalmers University of Technology and Goteborg University, Sweden#TAB#"],"affiliations":[{"raw_affiliation_string":"Chalmers University of Technology and G\u00f6teborg University, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Chalmers University of Technology and Goteborg University, Sweden#TAB#","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055736375","https://openalex.org/A5082447666"],"corresponding_institution_ids":["https://openalex.org/I66862912"],"apc_list":null,"apc_paid":null,"fwci":6.7529,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.96671298,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"26","issue":null,"first_page":"69","last_page":"86"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9979000091552734,"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/T10142","display_name":"Formal Methods in Verification","score":0.9976000189781189,"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/heap","display_name":"Heap (data structure)","score":0.6727297306060791},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6658235788345337},{"id":"https://openalex.org/keywords/haskell","display_name":"Haskell","score":0.5962294936180115},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.4770992398262024},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4602370262145996},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.45726287364959717},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.44178542494773865},{"id":"https://openalex.org/keywords/garbage-collection","display_name":"Garbage collection","score":0.4287053942680359},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42167556285858154},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.2852337062358856},{"id":"https://openalex.org/keywords/garbage","display_name":"Garbage","score":0.1945766806602478}],"concepts":[{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.6727297306060791},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6658235788345337},{"id":"https://openalex.org/C2780624054","wikidata":"https://www.wikidata.org/wiki/Q34010","display_name":"Haskell","level":3,"score":0.5962294936180115},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.4770992398262024},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4602370262145996},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.45726287364959717},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.44178542494773865},{"id":"https://openalex.org/C105122174","wikidata":"https://www.wikidata.org/wiki/Q322202","display_name":"Garbage collection","level":3,"score":0.4287053942680359},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42167556285858154},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.2852337062358856},{"id":"https://openalex.org/C75403996","wikidata":"https://www.wikidata.org/wiki/Q5521979","display_name":"Garbage","level":2,"score":0.1945766806602478},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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":3,"locations":[{"id":"doi:10.1016/s1571-0661(05)80284-1","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80284-1","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.136.3819","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.136.3819","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.chalmers.se/~gustavss/publications/hoots99.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.42.3130","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.3130","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.chalmers.se/~dave/papers/space.ps.gz","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(05)80284-1","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80284-1","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1480674757","https://openalex.org/W1495057638","https://openalex.org/W1539402181","https://openalex.org/W1543641760","https://openalex.org/W1578914958","https://openalex.org/W1582565166","https://openalex.org/W1597593202","https://openalex.org/W1939773358","https://openalex.org/W2004843654","https://openalex.org/W2009332552","https://openalex.org/W2011648260","https://openalex.org/W2026930779","https://openalex.org/W2035636826","https://openalex.org/W2039112578","https://openalex.org/W2046914864","https://openalex.org/W2048706733","https://openalex.org/W2049803057","https://openalex.org/W2050907089","https://openalex.org/W2052184002","https://openalex.org/W2056714230","https://openalex.org/W2068324780","https://openalex.org/W2073304179","https://openalex.org/W2073569229","https://openalex.org/W2103859677","https://openalex.org/W2151109649","https://openalex.org/W2208923056","https://openalex.org/W2313175711","https://openalex.org/W6634855547","https://openalex.org/W6640392334","https://openalex.org/W6651711446","https://openalex.org/W6653390967","https://openalex.org/W6663326027","https://openalex.org/W6667762737","https://openalex.org/W6668679169","https://openalex.org/W6668959577"],"related_works":["https://openalex.org/W1601811574","https://openalex.org/W1587224678","https://openalex.org/W2192862863","https://openalex.org/W4256398696","https://openalex.org/W4237978591","https://openalex.org/W2010349279","https://openalex.org/W2503105192","https://openalex.org/W2151958460","https://openalex.org/W3006199460","https://openalex.org/W2112404227"],"abstract_inverted_index":{"We":[0,114,142],"introduce":[1],"a":[2,22,36,50,95,106,110,132],"space-improvement":[3],"relation":[4],"on":[5],"programs":[6],"which":[7],"guarantees":[8],"that":[9,124,145],"whenever":[10],"M":[11,18],"is":[12,63,138],"improved":[13],"by":[14,19,131],"N,":[15],"replacement":[16],"of":[17,39,49,88,99,105,119,126,135],"N":[20],"in":[21,46],"program":[23],"can":[24,82],"never":[25],"lead":[26],"to":[27,66],"asymptotically":[28],"worse":[29],"space":[30,61,86],"(heap":[31],"or":[32],"stack)":[33],"behaviour,":[34],"for":[35,109,150,157],"particular":[37],"model":[38],"garbage":[40],"collection.":[41],"This":[42],"study":[43],"takes":[44],"place":[45],"the":[47,84,103,120],"context":[48,107],"call-by-need":[51],"programming":[52],"language.":[53],"For":[54],"languages":[55],"implemented":[56],"using":[57],"call-by-need,":[58],"e.g.,":[59],"Haskell,":[60],"behaviour":[62],"notoriously":[64],"difficult":[65],"predict":[67],"and":[68,70,140],"analyse,":[69],"even":[71],"innocent-looking":[72],"equivalences":[73],"like":[74],"x":[75,81],"+":[76,80],"y":[77,79],"=":[78],"change":[83],"asymptotic":[85],"requirements":[87],"some":[89],"programs.":[90],"Despite":[91],"this,":[92],"we":[93,122],"establish":[94],"fairly":[96],"rich":[97],"collection":[98],"improvement":[100,112],"laws,":[101],"with":[102],"help":[104],"lemma":[108],"finer-grained":[111],"relation.":[113],"briefly":[115],"consider":[116],"an":[117],"application":[118],"theory;":[121],"prove":[123],"inlining":[125],"affine-linear":[127],"bindings":[128],"(as":[129],"introduced":[130],"certain":[133,146],"class":[134],"\u201cused-once\u201d":[136],"type-systems)":[137],"work-":[139],"space-safe.":[141],"also":[143],"show":[144],"weaker":[147],"type":[148],"systems":[149],"usage":[151],"do":[152],"not":[153],"provide":[154],"sufficient":[155],"conditions":[156],"space-safe":[158],"inlining.":[159]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}