{"id":"https://openalex.org/W2130163138","doi":"https://doi.org/10.1017/s0956796810000122","title":"Factorising folds for faster functions","display_name":"Factorising folds for faster functions","publication_year":2010,"publication_date":"2010-06-30","ids":{"openalex":"https://openalex.org/W2130163138","doi":"https://doi.org/10.1017/s0956796810000122","mag":"2130163138"},"language":"en","primary_location":{"id":"doi:10.1017/s0956796810000122","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796810000122","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/1AC94646C45744F2474475CE5B3C7F90/S0956796810000122a.pdf/div-class-title-factorising-folds-for-faster-functions-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":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/1AC94646C45744F2474475CE5B3C7F90/S0956796810000122a.pdf/div-class-title-factorising-folds-for-faster-functions-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069634739","display_name":"Graham Hutton","orcid":"https://orcid.org/0000-0001-9584-5150"},"institutions":[{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"GRAHAM HUTTON","raw_affiliation_strings":["University of Nottingham, Nottingham, UK (e-mail:","University of nottingham, nottingham, uk (e-mail: gmh@cs.nott.ac.uk)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Nottingham, Nottingham, UK (e-mail:","institution_ids":["https://openalex.org/I142263535"]},{"raw_affiliation_string":"University of nottingham, nottingham, uk (e-mail: gmh@cs.nott.ac.uk)","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060258989","display_name":"Mauro Jaskelioff","orcid":"https://orcid.org/0000-0001-7865-3341"},"institutions":[{"id":"https://openalex.org/I4141589","display_name":"National University of Rosario","ror":"https://ror.org/02tphfq59","country_code":"AR","type":"education","lineage":["https://openalex.org/I4141589"]}],"countries":["AR"],"is_corresponding":false,"raw_author_name":"MAURO JASKELIOFF","raw_affiliation_strings":["Universidad Nacional de Rosario, Rosario, Argentina (e-mail:","Universidad nacional de rosario, rosario, argentina (e-mail: mauro@fceia.unr.edu.ar)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidad Nacional de Rosario, Rosario, Argentina (e-mail:","institution_ids":["https://openalex.org/I4141589"]},{"raw_affiliation_string":"Universidad nacional de rosario, rosario, argentina (e-mail: mauro@fceia.unr.edu.ar)","institution_ids":["https://openalex.org/I4141589"]}]},{"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 GILL","raw_affiliation_strings":["University of Kansas, Lawrence, KS, USA (e-mail:","University of kansas, lawrence, ks, usa (e-mail: andygill@ku.edu)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Kansas, Lawrence, KS, USA (e-mail:","institution_ids":["https://openalex.org/I146416000"]},{"raw_affiliation_string":"University of kansas, lawrence, ks, usa (e-mail: andygill@ku.edu)","institution_ids":["https://openalex.org/I146416000"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.4277,"has_fulltext":true,"cited_by_count":19,"citation_normalized_percentile":{"value":0.92840666,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"20","issue":"3-4","first_page":"353","last_page":"373"},"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.9997000098228455,"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.9997000098228455,"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.9968000054359436,"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.9883999824523926,"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/recursion","display_name":"Recursion (computer science)","score":0.8903899788856506},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8408118486404419},{"id":"https://openalex.org/keywords/program-transformation","display_name":"Program transformation","score":0.7479123473167419},{"id":"https://openalex.org/keywords/transformation","display_name":"Transformation (genetics)","score":0.6847560405731201},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.6665925979614258},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.614383339881897},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5309146642684937},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.45526766777038574},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.434095561504364},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.4035395383834839},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3598822355270386},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11674562096595764},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.07692119479179382},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.047498613595962524}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.8903899788856506},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8408118486404419},{"id":"https://openalex.org/C2778361913","wikidata":"https://www.wikidata.org/wiki/Q7248437","display_name":"Program transformation","level":2,"score":0.7479123473167419},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.6847560405731201},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.6665925979614258},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.614383339881897},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5309146642684937},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.45526766777038574},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.434095561504364},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.4035395383834839},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3598822355270386},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11674562096595764},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.07692119479179382},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.047498613595962524},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1017/s0956796810000122","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796810000122","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/1AC94646C45744F2474475CE5B3C7F90/S0956796810000122a.pdf/div-class-title-factorising-folds-for-faster-functions-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:CiteSeerX.psu:10.1.1.159.2105","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.159.2105","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.nott.ac.uk/~gmh/wrapper2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.186.7788","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.7788","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.nott.ac.uk/%7Egmh/f5.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.308.6127","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.308.6127","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.nott.ac.uk/~gmh/f5-extended.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.598.8875","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.598.8875","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.fceia.unr.edu.ar/~mauro/pubs/f5.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1017/s0956796810000122","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796810000122","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/1AC94646C45744F2474475CE5B3C7F90/S0956796810000122a.pdf/div-class-title-factorising-folds-for-faster-functions-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":[{"id":"https://metadata.un.org/sdg/8","score":0.5299999713897705,"display_name":"Decent work and economic growth"}],"awards":[{"id":"https://openalex.org/G3073610710","display_name":null,"funder_award_id":"EP/E04350X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2130163138.pdf","grobid_xml":"https://content.openalex.org/works/W2130163138.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W31396267","https://openalex.org/W78774630","https://openalex.org/W134478003","https://openalex.org/W1499496279","https://openalex.org/W1553992341","https://openalex.org/W1556536463","https://openalex.org/W1565385009","https://openalex.org/W1571615440","https://openalex.org/W1587758675","https://openalex.org/W1590681881","https://openalex.org/W1597497095","https://openalex.org/W1608714802","https://openalex.org/W1732358472","https://openalex.org/W2000212732","https://openalex.org/W2021982406","https://openalex.org/W2076018351","https://openalex.org/W2078944436","https://openalex.org/W2101565274","https://openalex.org/W2110050316","https://openalex.org/W2116908067","https://openalex.org/W2131916293","https://openalex.org/W2138452186","https://openalex.org/W2140647971","https://openalex.org/W2141576692","https://openalex.org/W2143566245","https://openalex.org/W2175912519","https://openalex.org/W2911481279","https://openalex.org/W3023216518","https://openalex.org/W3208714696","https://openalex.org/W4240127846","https://openalex.org/W4241202945","https://openalex.org/W4248623832","https://openalex.org/W4252656082"],"related_works":["https://openalex.org/W2130163138","https://openalex.org/W2023299380","https://openalex.org/W2087175527","https://openalex.org/W1532167182","https://openalex.org/W2158595452","https://openalex.org/W2072445029","https://openalex.org/W114260088","https://openalex.org/W1452601014","https://openalex.org/W2364065203","https://openalex.org/W2027685350"],"abstract_inverted_index":{"Abstract":[0],"The":[1,19],"worker/wrapper":[2,64],"transformation":[3,65],"is":[4],"a":[5,39,50,88],"general":[6],"technique":[7,86],"for":[8],"improving":[9],"the":[10,63,73],"performance":[11],"of":[12,43,76,90],"recursive":[13],"programs":[14,70],"by":[15,79],"changing":[16],"their":[17],"types.":[18],"previous":[20],"formalisation":[21],"(A.":[22],"Gill":[23],"&":[24],"G.":[25],"Hutton,":[26],"J.":[27],"Funct.":[28],"Program.":[29],",":[30],"vol.":[31],"19,":[32],"2009,":[33],"pp.":[34],"227\u2013251)":[35],"was":[36],"based":[37,54],"upon":[38,55],"simple":[40],"fixed-point":[41],"semantics":[42],"recursion.":[44],"In":[45,58],"this":[46],"paper,":[47],"we":[48,60],"develop":[49],"more":[51],"structured":[52,74],"approach,":[53],"initial-algebra":[56],"semantics.":[57],"particular,":[59],"show":[61],"how":[62],"can":[66],"be":[67],"applied":[68],"to":[69],"defined":[71],"using":[72],"pattern":[75],"recursion":[77],"captured":[78],"fold":[80],"operators,":[81],"and":[82],"illustrate":[83],"our":[84],"new":[85],"with":[87],"number":[89],"examples.":[91]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}