{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:19:36Z","timestamp":1725455976998},"publisher-location":"Berlin\/Heidelberg","reference-count":9,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354008360X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0021420","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T05:19:12Z","timestamp":1132723152000},"page":"85-101","source":"Crossref","is-referenced-by-count":0,"title":["A note on \"pointers\""],"prefix":"10.1007","author":[{"given":"C. P.","family":"Earnest","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/362384.362685","volume":"13\/6","author":"E. F. Codd","year":"1970","unstructured":"Codd, E. F. A relational model of data for large shared data banks. CACM 13\/6 (June 1970), pp. 377\u2013387.","journal-title":"CACM"},{"key":"5_CR2","unstructured":"Department of Defense Requirements for High Order Computer Programming Languages: \"Tinman\" (June 1976)."},{"key":"5_CR3","unstructured":"Hoare, C. A. R. Recursive data structures Stanford Artificial Intelligence Laboratory Memo STAN-CS-73-400 (Oct. 1973)."},{"key":"5_CR4","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF00289504","volume":"2","author":"C. A. R. Hoare","year":"1973","unstructured":"Hoare, C. A. R. and Wirth, Niklaus. An axiomatic description of the programming language PASCAL. Acta Informatica 2, pp. 335\u2013355 (1973).","journal-title":"Acta Informatica"},{"key":"5_CR5","volume-title":"Pascal User Manual and Report","author":"K. Jensen","year":"1975","unstructured":"Jensen, Kathleen and Wirth, Niklaus. Pascal User Manual and Report, Second Edition. Springer Verlag, New York (1975).","edition":"Second Edition"},{"issue":"2","key":"5_CR6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1145\/942574.807127","volume":"8","author":"R. B. Kieburtz","year":"1976","unstructured":"Kieburtz, Richard B. Programming without pointer variables. Proceedings of Conference on Data, March 22\u201324, 1976. SIGPLAN Notices Volume 8, No. 2 (1976), pp. 95\u2013107.","journal-title":"SIGPLAN Notices"},{"issue":"4","key":"5_CR7","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/356635.356640","volume":"6","author":"D. E. Knuth","year":"1974","unstructured":"Knuth, D. E. Structured programming with go to statements. ACM Computing Surveys, Vol. 6, No. 4 (December 1974), pp. 261\u2013301.","journal-title":"ACM Computing Surveys"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Van Wijngaarden, ed. Revised report on the algorithmic language Algol 68. Acta Informatica 5, pp. 1\u2013236 (1975).","DOI":"10.1007\/BF00265077"},{"key":"5_CR9","volume-title":"Algorithms + Data Structures = Programs","author":"N. Wirth","year":"1976","unstructured":"Wirth, Niklaus. Algorithms + Data Structures = Programs. Prentice-Hall, Inc., Englewood Cliffs, N. J. (1976)"}],"container-title":["Lecture Notes in Computer Science","Design and Implementation of Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0021420.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:46:48Z","timestamp":1607550408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0021420"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354008360X"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0021420","relation":{},"subject":[]}}