{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T12:46:13Z","timestamp":1768567573827,"version":"3.49.0"},"reference-count":0,"publisher":"Oxford University Press (OUP)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2011,11,1]]},"DOI":"10.1093\/comjnl\/bxr002","type":"journal-article","created":{"date-parts":[[2011,3,9]],"date-time":"2011-03-09T01:46:56Z","timestamp":1299635216000},"page":"1756-1772","source":"Crossref","is-referenced-by-count":19,"title":["Dijkstra's Rallying Cry for Generalization: The Advent of the Recursive Procedure, Late 1950s-Early 1960s"],"prefix":"10.1093","volume":"54","author":[{"given":"E. G.","family":"Daylight","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2011,3,8]]},"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/54\/11\/1756\/1005708\/bxr002.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,22]],"date-time":"2017-08-22T22:08:30Z","timestamp":1503439710000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxr002"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,8]]},"references-count":0,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2011,10,28]]},"published-print":{"date-parts":[[2011,11,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxr002","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,8]]}}}