{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:21:45Z","timestamp":1725456105303},"publisher-location":"Berlin\/Heidelberg","reference-count":21,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354011212X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0025773","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T10:23:41Z","timestamp":1132395821000},"page":"37-51","source":"Crossref","is-referenced-by-count":2,"title":["Toward a logical theory of program data"],"prefix":"10.1007","author":[{"given":"Robert","family":"Cartwright","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"ADJ (J. Goguen, J. Thatcher, E. Wagner) (1976) An Initial Algebra Approach to the Specification, Correctness, and Implementation of Abstract Data Types, IBM Research Report RC 6487."},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"J. Goguen","year":"1977","unstructured":"ADJ (J. Goguen, J. Thatcher, E. Wagner, J. Wright) (1977) Initial Algebra Semantics and Continuous Algebras, Jour. ACM 24, 68\u201395.","journal-title":"Jour. ACM"},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1145\/321864.321875","volume":"22","author":"R. Boyer","year":"1975","unstructured":"Boyer, R. and J Moore. (1975): Proving Theorems about LISP Functions, Jour. ACM 22(1), 129\u2013144 (January).","journal-title":"Jour. ACM"},{"key":"4_CR4","first-page":"228","volume-title":"Automata Languages, and Programming","author":"R. Cartwright","year":"1976","unstructured":"Cartwright, R. (1976): User-Defined Data Types as Aid to Verifying LISP Programs, in S. Michaelson and R. Milner (eds.), Automata Languages, and Programming, pp. 228\u2013256, Edinburgh Press, Edinburgh."},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Cartwright, R. (1980): A Constructive Alternative to Axiomatic Data Type Definitions. Proc. of 1980 LISP Conference, Stanford, California, August, 1980, pp. 46\u201355.","DOI":"10.1145\/800087.802789"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Cartwright, R. (1981): Formal Program Testing, Proc. Eighth Annual ACM Symposium on Principles of Programming Languages, January 1981, pp. 125\u2013132.","DOI":"10.1145\/567532.567546"},{"key":"4_CR7","series-title":"Technical Report","volume-title":"The Semantics of Lazy Evaluation","author":"R. Cartwright","year":"1981","unstructured":"Cartwright, R. and J. Donahue (1981): The Semantics of Lazy Evaluation, Technical Report, Department of Mathematical Sciences, Rice University, Houston, Texas."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Cartwright, R. and J. McCarthy (1979): First Order Programming Logic, Proc. Sixth Annual ACM Symposium on Principles of Programming Languages, January 1979, pp. 68\u201380.","DOI":"10.1145\/567752.567759"},{"key":"4_CR9","volume-title":"A Programming Logic","author":"R. Constable","year":"1978","unstructured":"Constable, R. and M. O'Donnell (1978): A Programming Logic, Winthrop Publishers, Cambridge."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Floyd, R. W. (1967): Assigning Meaning to Programs, Proc. of a Symposium in Applied Mathematics, American Mathematical Society, pp. 19\u201332.","DOI":"10.1090\/psapm\/019\/0235771"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Guttag, J. V. et al. (1976): Abstract Data Types and Software Validation, USC Information Sciences Institute Technical Report ISI\/RR-76-48.","DOI":"10.21236\/ADA029896"},{"key":"4_CR12","first-page":"27","volume":"10","author":"J. V. Guttag","year":"1977","unstructured":"Guttag, J. V. (1977): Abstract Data Types and the Development of of Data Types, Acta Informatica 10, 27\u201352.","journal-title":"Acta Informatica"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1145\/359605.359618","volume":"20","author":"J. V. Guttag","year":"1978","unstructured":"Guttag, J. V. and J. J. Horning (1978): The Algebraic Specification Data Structures, Comm. ACM 20, 396\u2013404.","journal-title":"Comm. ACM"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Henderson, P. and J. Morris (1976): A Lazy Evaluator, Proc. of the 3rd Annual ACM Symposium on Principles of Programming Languages, January 1976, pp. 95\u2013103.","DOI":"10.1145\/800168.811543"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"von Henke, F. and D. C. Luckham (1974): Automatic Program Verification III: A Methodology for Verifying Programs, Stanford Artificial Intelligence Project Memo AIM-256.","DOI":"10.21236\/ADA007563"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C. A. R. Hoare","year":"1969","unstructured":"Hoare, C. A. R. (1969): \"An Axiomatic Basis for Computer Programming\", Comm. ACM 12, 576\u2013580.","journal-title":"Comm. ACM"},{"key":"4_CR17","unstructured":"Hoare, C. A. R. (1973): Recursive Data Types, Stanford Artificial Intelligence Project Memo AIM-223."},{"key":"4_CR18","series-title":"Technical Report","volume-title":"Algorithmic Specifications of Abstract Data Types","author":"J. Loeckx","year":"1980","unstructured":"Loeckx, J. (1980): Algorithmic Specifications of Abstract Data Types, Technical Report, Informatik, Universitat des Saarlandes, Saarbrucken, West Germany."},{"key":"4_CR19","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0049-237X(08)72018-4","volume-title":"Computer Programming and Formal Systems","author":"J. McCarthy","year":"1963","unstructured":"McCarthy, J. (1963): A Basis for a Mathematical Theory of Computation, in P. Braffort and D. Hirschberg (eds.), Computer Programming and Formal Systems), pp. 33\u201370. North-Holland Publishing Company, Amsterdam."},{"issue":"1","key":"4_CR20","first-page":"1","volume":"7","author":"R. Milner","year":"1972","unstructured":"Milner, R., Implementation and Application of Scott's Logic for Computable Functions, Proc. ACM Conf. on Proving Assertions about Programs, SIGPLAN Notices 7,1, January, 1972, pp. 1\u20136.","journal-title":"Proc. ACM Conf. on Proving Assertions about Programs, SIGPLAN Notices"},{"key":"4_CR21","unstructured":"Pratt, V. (1976): Semantical Considerations of Floyd-Hoare Logic, 17th Annual IEEE Symposium on the Foundations of Computer Science, October, 1976, pp. 109\u2013121."}],"container-title":["Lecture Notes in Computer Science","Logics of Programs"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0025773.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:55:24Z","timestamp":1607550924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0025773"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354011212X"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0025773","relation":{},"subject":[]}}