{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T16:34:45Z","timestamp":1694622885694},"reference-count":5,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[2004,4]]},"abstract":"<jats:title>Abstract.<\/jats:title>\n          <jats:p>\n            Nested (or non-uniform, or non-regular) datatypes have recursive definitions in which the type parameter changes. Their folds are restricted in power due to type constraints. Bird and Paterson introduced\n            <jats:italic>generalised folds<\/jats:italic>\n            for extra power, but at the cost of a loss of efficiency: folds may take more than linear time to evaluate. Hinze introduced\n            <jats:italic>efficient generalised folds<\/jats:italic>\n            to counter this inefficiency, but did so in a pragmatic way: he did not provide categorical or equivalent underpinnings, so did not get the associated universal properties for manipulating folds. We combine the efficiency of Hinze\u2019s construction with the powerful reasoning tools of Bird and Paterson\u2019s.\n          <\/jats:p>","DOI":"10.1007\/s00165-003-0013-6","type":"journal-article","created":{"date-parts":[[2004,3,29]],"date-time":"2004-03-29T12:36:13Z","timestamp":1080563773000},"page":"19-35","source":"Crossref","is-referenced-by-count":20,"title":["Disciplined, efficient, generalised folds for nested datatypes"],"prefix":"10.1145","volume":"16","author":[{"given":"Clare","family":"Martin","sequence":"first","affiliation":[{"name":"School of Computing and Mathematical Sciences, Oxford Brookes University, Oxford, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeremy","family":"Gibbons","sequence":"additional","affiliation":[{"name":"Oxford University Computing Laboratory, Oxford, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"Bayley","sequence":"additional","affiliation":[{"name":"Oxford University Computing Laboratory, Oxford, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"p_1","volume-title":"LNCS 1422: Mathematics of program construction","author":"Bi R","year":"1998"},{"issue":"1","key":"p_2","first-page":"77","article-title":"Algebra of programming. Prentice-Hall [BiP99a] Bird R, Paterson R (1999) De Bruijn notation as a nested datatype","volume":"9","author":"New York R","year":"1997","journal-title":"J Funct Program"},{"key":"p_3","first-page":"27","article-title":"Ponte de Lima, Portugal, 6 July 2000 [Hue75] Huet GP (1975) A unification algorithm for typed \u03bb-calculus","volume":"1","year":"2000","journal-title":"Theor Comput Sci"},{"key":"p_4","first-page":"233","article-title":"Categories for the working mathematician, 2nd edn","volume":"80","author":"Spring School","year":"1998","journal-title":"Inf Processing Lett"},{"key":"p_5","volume-title":"Berlin Heidelberg New York [Mee87] Meertens LGLT (1987) First steps towards the theory of rose trees. Draft report","author":"Springer","year":"1998"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00165-003-0013-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00165-003-0013-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/s00165-003-0013-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:34:28Z","timestamp":1641483268000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/s00165-003-0013-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,4]]}},"alternative-id":["10.1007\/s00165-003-0013-6"],"URL":"https:\/\/doi.org\/10.1007\/s00165-003-0013-6","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}