{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:42:19Z","timestamp":1750308139845,"version":"3.41.0"},"reference-count":7,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[1971,2,1]],"date-time":"1971-02-01T00:00:00Z","timestamp":34214400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGPLAN Not."],"published-print":{"date-parts":[[1971,2]]},"abstract":"<jats:p>The data structures proposed for the Madcap VI programming language are described. The declaration, value specification, and referencing of these structures are defined formally and their implementation using \"codewords\" is discussed. A structure declaration has the form of a directed tree, and a structure itself, since it can contain references to other structures, including itself, has the form of a directed graph. Levels of the tree may be ordered or unordered. Variables of primitive data-type (real, complex, etc.) are naturally considered as empty structures. The possibility for both multi-and fractional-word representation of structures is evident, but, of course the language itself is implementation independent. Thus a &lt;u&gt;field&lt;\/u&gt; is equivalent to a sub-structure. The Madcap VI generalized data structures are compared to data structure concepts in PL\/1.<\/jats:p>","DOI":"10.1145\/1115880.1115895","type":"journal-article","created":{"date-parts":[[2006,5,8]],"date-time":"2006-05-08T22:51:53Z","timestamp":1147128713000},"page":"321-336","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Generalized data structures in Madcap VI"],"prefix":"10.1145","volume":"6","author":[{"suffix":"Jr.","given":"James B.","family":"Morris","sequence":"first","affiliation":[{"name":"University of California"}]},{"given":"Mark B.","family":"Wells","sequence":"additional","affiliation":[{"name":"University of California"}]}],"member":"320","published-online":{"date-parts":[[1971,2]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/364139.364152"},{"key":"e_1_2_1_2_1","volume-title":"The Art of Computer Programming","author":"Knuth D. E.","year":"1969","unstructured":"Knuth , D. E. The Art of Computer Programming , Vol. 1 , Fundamental Algorithms. Addison-Wesley , Reading, Mass., 1969 (second printing). Knuth, D. E. The Art of Computer Programming, Vol. 1, Fundamental Algorithms. Addison-Wesley, Reading, Mass., 1969 (second printing)."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/366193.366201"},{"key":"e_1_2_1_4_1","volume-title":"Programming Languages: History and Fundamentals","author":"Sammet J. E.","year":"1969","unstructured":"Sammet , J. E. Programming Languages: History and Fundamentals . Prentice-Hall , Englewood Cliffs , New Jersey, 1969 (second printing). Sammet, J. E. Programming Languages: History and Fundamentals. Prentice-Hall, Englewood Cliffs, New Jersey, 1969 (second printing)."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/366062.366080"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1964.263845"},{"key":"e_1_2_1_7_1","volume-title":"Elements of Combinatorial Computing","author":"Wells M. B.","year":"1970","unstructured":"Wells , M. B. Elements of Combinatorial Computing . Pergamon , Oxford , 1970 . Wells, M. B. Elements of Combinatorial Computing. Pergamon, Oxford, 1970."}],"container-title":["ACM SIGPLAN Notices"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1115880.1115895","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1115880.1115895","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:38Z","timestamp":1750262918000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1115880.1115895"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1971,2]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1971,2]]}},"alternative-id":["10.1145\/1115880.1115895"],"URL":"https:\/\/doi.org\/10.1145\/1115880.1115895","relation":{},"ISSN":["0362-1340","1558-1160"],"issn-type":[{"type":"print","value":"0362-1340"},{"type":"electronic","value":"1558-1160"}],"subject":[],"published":{"date-parts":[[1971,2]]},"assertion":[{"value":"1971-02-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}