{"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":1750308139064,"version":"3.41.0"},"reference-count":0,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[1972,4,1]],"date-time":"1972-04-01T00:00:00Z","timestamp":70934400000},"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":[[1972,4]]},"abstract":"<jats:p>\n            This note gives a brief description of a number of APL functions which implement a simple list processor somewhat similar to LISP. As the reader is expected to have some familiarity with LISP, only a few preliminary remarks will be given here. Introductions to LISP may be found, for example, in \"List processing\" by P. M. Woodward in\n            <jats:bold>Advances in Programming and Non-numerical Computation<\/jats:bold>\n            by L. Fox (Pergamon, 1966), and in\n            <jats:bold>Recursive Techniques in Programming<\/jats:bold>\n            by D. W. Barron (Macdonald, 1968).\n          <\/jats:p>","DOI":"10.1145\/1115910.1115913","type":"journal-article","created":{"date-parts":[[2006,5,8]],"date-time":"2006-05-08T22:51:53Z","timestamp":1147128713000},"page":"41-45","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["APLISP"],"prefix":"10.1145","volume":"7","author":[{"given":"K. W.","family":"Smillie","sequence":"first","affiliation":[{"name":"University of Alberta, Edmonton, Alberta"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[1972,4]]},"container-title":["ACM SIGPLAN Notices"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1115910.1115913","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1115910.1115913","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\/1115910.1115913"}},"subtitle":["a simple list processor in APL"],"short-title":[],"issued":{"date-parts":[[1972,4]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1972,4]]}},"alternative-id":["10.1145\/1115910.1115913"],"URL":"https:\/\/doi.org\/10.1145\/1115910.1115913","relation":{},"ISSN":["0362-1340","1558-1160"],"issn-type":[{"type":"print","value":"0362-1340"},{"type":"electronic","value":"1558-1160"}],"subject":[],"published":{"date-parts":[[1972,4]]},"assertion":[{"value":"1972-04-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}