{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:45:57Z","timestamp":1750308357804,"version":"3.41.0"},"reference-count":4,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[1981,3,1]],"date-time":"1981-03-01T00:00:00Z","timestamp":352252800000},"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":["SIGAPL APL Quote Quad"],"published-print":{"date-parts":[[1981,3]]},"abstract":"<jats:p>This note presents a consistent approach to evaluating the reduction of an array along an empty axis, giving results which agree with accepted values where these exist and also giving unique and consistent results for the Nand and Nor functions.Note: For clarity, the body of this paper deals only with vectors; the extension to higher-rank arrays is straightforward.<\/jats:p>","DOI":"10.1145\/586640.586643","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"17-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Redefining reduction along an empty axis"],"prefix":"10.1145","volume":"11","author":[{"given":"Zeke","family":"Hoskin","sequence":"first","affiliation":[{"name":"I.P. Sharp Associates, Ltd., Vancouver, British Columbia Canada"}]}],"member":"320","published-online":{"date-parts":[[1981,3]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Sharp APL Reference Manual","author":"Berry Paul C.","year":"1979","unstructured":"Paul C. Berry . Sharp APL Reference Manual , I.P. Sharp Associates , Toronto ( 1979 ) p. 186. Paul C. Berry. Sharp APL Reference Manual, I.P. Sharp Associates, Toronto (1979) p. 186."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/390008.804495"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/800269.810826"},{"key":"e_1_2_1_4_1","first-page":"2","volume":"4","author":"Smith Bob","year":"1973","unstructured":"Bob Smith . Similarities between reduction and scan of Boolean vectors , APL Quote Quad 4 2 ( Jan. 1973 ) p. 35. Bob Smith. Similarities between reduction and scan of Boolean vectors, APL Quote Quad 4 2 (Jan. 1973) p. 35.","journal-title":"APL Quote Quad"}],"container-title":["ACM SIGAPL APL Quote Quad"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/586640.586643","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/586640.586643","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:43:41Z","timestamp":1750268621000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/586640.586643"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,3]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981,3]]}},"alternative-id":["10.1145\/586640.586643"],"URL":"https:\/\/doi.org\/10.1145\/586640.586643","relation":{},"ISSN":["0163-6006"],"issn-type":[{"type":"print","value":"0163-6006"}],"subject":[],"published":{"date-parts":[[1981,3]]},"assertion":[{"value":"1981-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}