{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T02:16:52Z","timestamp":1648520212032},"reference-count":5,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7716,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1016\/0167-6423(92)90020-c","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:09:22Z","timestamp":1027642162000},"page":"281-292","source":"Crossref","is-referenced-by-count":1,"title":["The smallest upravel"],"prefix":"10.1016","volume":"18","author":[{"given":"Richard S.","family":"Bird","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(92)90020-C_BIB1","series-title":"Logic of Programming and Calculi of Discrete Design","article-title":"An introduction to the theory of lists","volume":"36","author":"Bird","year":"1986"},{"key":"10.1016\/0167-6423(92)90020-C_BIB2","series-title":"Research Topics in Functional Programming","article-title":"A calculus of functions for program derivation","author":"Bird","year":"1990"},{"key":"10.1016\/0167-6423(92)90020-C_BIB3","series-title":"Constructive Methods in Computing Science","article-title":"Lectures on constructive functional programming","volume":"52","author":"Bird","year":"1988"},{"key":"10.1016\/0167-6423(92)90020-C_BIB4","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0020-0190(85)90034-1","article-title":"On the decomposition of sequences into ascending subsequences","volume":"21","author":"Kaldewaij","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-6423(92)90020-C_BIB5","series-title":"IFIP WG2.1 Working Paper","article-title":"Some more examples of algorithmic developments","author":"Meertens","year":"1985"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764239290020C?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764239290020C?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:54:50Z","timestamp":1555077290000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016764239290020C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["016764239290020C"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(92)90020-c","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}