{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:43:13Z","timestamp":1725601393110},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540068594"},{"type":"electronic","value":"9783540378198"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1974]]},"DOI":"10.1007\/3-540-06859-7_126","type":"book-chapter","created":{"date-parts":[[2011,8,18]],"date-time":"2011-08-18T11:52:56Z","timestamp":1313668376000},"page":"81-87","source":"Crossref","is-referenced-by-count":0,"title":["Structured recursive programming"],"prefix":"10.1007","author":[{"given":"Robert E.","family":"Noonan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dale J.","family":"Panton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"8_CR1","unstructured":"Burstall, R. M. \"Semantics of Assignment,\" Machine Intelligence, 2, edited by E. Dale and D. Michie. American Elsevier Publishing Co. (1968), pp. 3\u201320."},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1093\/comjnl\/12.1.41","volume":"9","author":"R. M. Burstall","year":"1969","unstructured":"Burstall, R. M. \"Proving Properties of Programs by Structural Induction,\" Computer Journal, 9, (Feb. 1969), pp. 41\u201348.","journal-title":"Computer Journal"},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1145\/362929.362947","volume":"11","author":"E. W. Dijkstra","year":"1968","unstructured":"Dijkstra, E. W. \"Go To Statement Considered Harmful,\" CACM, 11, (March 1968), pp. 147\u2013148 and (August 1968), pp. 538, 541.","journal-title":"CACM"},{"key":"8_CR4","unstructured":"Dijkstra, E. W. \"Notes on Structured Programming,\" Structured Programming by O. J. Dahl, E. W. Dijkstra, and C. A. R. Hoare. Academic Press (1972), pp. 1\u201382."},{"key":"8_CR5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/356599.356602","volume":"4","author":"B. Elspas","year":"1972","unstructured":"Elspas, B., K. N. Levitt, R. J. Waldinger, and A. Waksman. \"An Assessment of Techniques for Proving Program Correctness,\" Computing Surveys, 4, (June 1972), pp. 97\u2013147.","journal-title":"Computing Surveys"},{"key":"8_CR6","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1090\/psapm\/019\/0235771","volume":"19","author":"R. W. Floyd","year":"1966","unstructured":"Floyd, R. W. \"Assigning Meanings to Programs,\" Proc. of Symposia in Applied Math., 19, (April 1966), pp. 19\u201332.","journal-title":"Proc. of Symposia in Applied Math."},{"key":"8_CR7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1145\/365230.365257","volume":"9","author":"P. J. Landin","year":"1966","unstructured":"Landin, P. J. \"The Next 700 Programming Languages,\" CACM, 9, (March 1966), pp. 157\u2013164.","journal-title":"CACM"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"London, R. L. \"Correctness of a Compiler for a LISP Subset,\" Proc. of ACM Conf. on Proving Assertions about Programs, (Jan. 1972), pp. 121\u2013127.","DOI":"10.1145\/800235.807080"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Manna, Z., S. Ness and J. Vuillemin. \"Inductive Methods for Proving Properties about Programs,\" Proc. of ACM Conf. on Proving Assertions about Programs, (Jan. 1972), pp. 27\u201350.","DOI":"10.1145\/800235.807070"},{"key":"8_CR10","unstructured":"McCarthy, J. \"Towards a Mathematical Science of Computation,\" Proc. IFIP Conf., 1962, pp. 21\u201370."},{"key":"8_CR11","unstructured":"Mills, H. D. \"Mathematic Foundations for Structured Programming,\" IBM Corp., FSC 72-6012 (Feb. 1972)."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Milner, R. \"Implementation and Applications of Scott's Logic for Computable Functions,\" Proc. of ACM Conf. on Proving Assertions about Programs, (Jan. 1972), pp. 1\u20136.","DOI":"10.1145\/800235.807067"}],"container-title":["Lecture Notes in Computer Science","Programming Symposium"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-06859-7_126.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T16:43:36Z","timestamp":1619541816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-06859-7_126"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974]]},"ISBN":["9783540068594","9783540378198"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-06859-7_126","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1974]]}}}