{"id":"https://openalex.org/W2130480853","doi":"https://doi.org/10.1145/1411304.1411309","title":"Unrestricted pure call-by-value recursion","display_name":"Unrestricted pure call-by-value recursion","publication_year":2008,"publication_date":"2008-09-21","ids":{"openalex":"https://openalex.org/W2130480853","doi":"https://doi.org/10.1145/1411304.1411309","mag":"2130480853"},"language":"en","primary_location":{"id":"doi:10.1145/1411304.1411309","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1411304.1411309","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 ACM SIGPLAN workshop on ML","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/A5112008233","display_name":"Johan Nordlander","orcid":null},"institutions":[{"id":"https://openalex.org/I190632392","display_name":"Lule\u00e5 University of Technology","ror":"https://ror.org/016st3p78","country_code":"SE","type":"education","lineage":["https://openalex.org/I190632392"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Johan Nordlander","raw_affiliation_strings":["Lulea University of Technology, Lule\u00e5, Sweden","[Lulea University of Technology, Lulea, Sweden]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lulea University of Technology, Lule\u00e5, Sweden","institution_ids":["https://openalex.org/I190632392"]},{"raw_affiliation_string":"[Lulea University of Technology, Lulea, Sweden]","institution_ids":["https://openalex.org/I190632392"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019542473","display_name":"Magnus Carlsson","orcid":"https://orcid.org/0000-0003-1860-0170"},"institutions":[{"id":"https://openalex.org/I4210140281","display_name":"Galois (United States)","ror":"https://ror.org/03g8y8161","country_code":"US","type":"company","lineage":["https://openalex.org/I4210140281"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Magnus Carlsson","raw_affiliation_strings":["Galois, Inc., Portland, OR, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Galois, Inc., Portland, OR, USA","institution_ids":["https://openalex.org/I4210140281"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029124439","display_name":"Andy Gill","orcid":null},"institutions":[{"id":"https://openalex.org/I146416000","display_name":"University of Kansas","ror":"https://ror.org/001tmjg57","country_code":"US","type":"education","lineage":["https://openalex.org/I146416000"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andy J. Gill","raw_affiliation_strings":["The University of Kansas, Lawrence, KS, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Kansas, Lawrence, KS, USA","institution_ids":["https://openalex.org/I146416000"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2518,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.50132657,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"23","last_page":"34"},"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.9987000226974487,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9984999895095825,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/laziness","display_name":"Laziness","score":0.9267308115959167},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.8235892057418823},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7326355576515198},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.7222305536270142},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.5985585451126099},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5902525186538696},{"id":"https://openalex.org/keywords/haskell","display_name":"Haskell","score":0.5407841205596924},{"id":"https://openalex.org/keywords/mutual-recursion","display_name":"Mutual recursion","score":0.499830961227417},{"id":"https://openalex.org/keywords/lazy-evaluation","display_name":"Lazy evaluation","score":0.48532193899154663},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42585915327072144}],"concepts":[{"id":"https://openalex.org/C2776447739","wikidata":"https://www.wikidata.org/wiki/Q484","display_name":"Laziness","level":2,"score":0.9267308115959167},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.8235892057418823},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7326355576515198},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.7222305536270142},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.5985585451126099},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5902525186538696},{"id":"https://openalex.org/C2780624054","wikidata":"https://www.wikidata.org/wiki/Q34010","display_name":"Haskell","level":3,"score":0.5407841205596924},{"id":"https://openalex.org/C124416688","wikidata":"https://www.wikidata.org/wiki/Q3454656","display_name":"Mutual recursion","level":3,"score":0.499830961227417},{"id":"https://openalex.org/C128099668","wikidata":"https://www.wikidata.org/wiki/Q573952","display_name":"Lazy evaluation","level":3,"score":0.48532193899154663},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42585915327072144},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C118552586","wikidata":"https://www.wikidata.org/wiki/Q7867","display_name":"Psychiatry","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1411304.1411309","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1411304.1411309","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 ACM SIGPLAN workshop on ML","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.567.6923","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.567.6923","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ittc.ku.edu/~andygill/papers/RecBinds.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W34175919","https://openalex.org/W1488750823","https://openalex.org/W1593771739","https://openalex.org/W1783388813","https://openalex.org/W2000817748","https://openalex.org/W2002301065","https://openalex.org/W2004843654","https://openalex.org/W2026557621","https://openalex.org/W2067901725","https://openalex.org/W2079512738","https://openalex.org/W2095451697","https://openalex.org/W2109404349","https://openalex.org/W2116813111","https://openalex.org/W2140764366","https://openalex.org/W2491204390","https://openalex.org/W3145454088"],"related_works":["https://openalex.org/W2392016641","https://openalex.org/W1975054464","https://openalex.org/W2521829344","https://openalex.org/W2466718051","https://openalex.org/W1734457603","https://openalex.org/W2116323891","https://openalex.org/W2764317176","https://openalex.org/W2489038392","https://openalex.org/W2112632506","https://openalex.org/W2130480853"],"abstract_inverted_index":{"Call-by-value":[0],"languages":[1,32],"commonly":[2],"restrict":[3],"recursive":[4],"definitions":[5],"by":[6],"only":[7],"allowing":[8],"functions":[9],"and":[10],"syntactically":[11],"explicit":[12],"values":[13],"in":[14,29,37],"the":[15,56],"right-hand":[16],"sides.":[17],"As":[18],"a":[19,38],"consequence,":[20],"some":[21],"very":[22],"appealing":[23],"programming":[24],"patterns":[25],"that":[26],"work":[27],"well":[28],"lazy":[30],"functional":[31],"are":[33],"hard":[34],"to":[35,54],"apply":[36],"call-by-value":[39],"setting,":[40],"even":[41],"though":[42],"they":[43],"might":[44],"not":[45],"be":[46],"using":[47],"laziness":[48],"for":[49],"any":[50],"other":[51],"purpose":[52],"than":[53],"enable":[55],"desired":[57],"form":[58],"of":[59],"recursion.":[60]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}