{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:45:14Z","timestamp":1750308314440,"version":"3.41.0"},"reference-count":14,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2007,4,1]],"date-time":"2007-04-01T00:00:00Z","timestamp":1175385600000},"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":["Queue"],"published-print":{"date-parts":[[2007,4]]},"abstract":"<jats:p>My sermon-text this grumpy month is Matt Barton\u2019s article \u201cThe Fine Art of Computer Programming\u201d, in which he extols the virtues of what is widely called literate programming. As with the related terms literary and literature, we have ample room for wranglings of a theological intensity, further amplified by disputes inherent in the questions: \u201cIs computer science or art?\u201d and \u201cWhat do programmers need to know?\u201d Just as we must prefer agile to clumsy programming, it\u2019s hard to knock anything literate. Competing methods tend to sound, like, man, kinda illiterate, a term with such a bad reputation that cultures that have not yet invented or borrowed a writing system are called preliterate.<\/jats:p>","DOI":"10.1145\/1242489.1242508","type":"journal-article","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T14:37:11Z","timestamp":1181140631000},"page":"52","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Ode or Code? Programmers be Mused!"],"prefix":"10.1145","volume":"5","author":[{"given":"Stan","family":"Kelly-Bootle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,4]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Dijkstra E.W. 1975. How do we tell truths that might hurt? http:\/\/www.cs.utexas.edu\/users\/EWD\/transcriptions\/EWD04xx\/EWD498.html.  Dijkstra E.W. 1975. How do we tell truths that might hurt? http:\/\/www.cs.utexas.edu\/users\/EWD\/transcriptions\/EWD04xx\/EWD498.html."},{"key":"e_1_2_1_2_1","unstructured":"ibid.  ibid."},{"key":"e_1_2_1_3_1","unstructured":"ibid.  ibid."},{"key":"e_1_2_1_4_1","unstructured":"The frisky \"horses-for-courses\" idiom may not have galloped beyond Albion's shores. Even Brits use it without due process. It simply states the obvious: that objects may be differentiated ontologically by their innate purposefulness. Easy for me to say. Liverpool Dock Road cart horses do not win the Pimlico Special. Seabiscuit never hauled a ton of stolen coal. Pascal some claimed was a \"teaching\" language. C others claimed was \"unteachable \" acquired through trial and error chiefly error.  The frisky \"horses-for-courses\" idiom may not have galloped beyond Albion's shores. Even Brits use it without due process. It simply states the obvious: that objects may be differentiated ontologically by their innate purposefulness. Easy for me to say. Liverpool Dock Road cart horses do not win the Pimlico Special. Seabiscuit never hauled a ton of stolen coal. Pascal some claimed was a \"teaching\" language. C others claimed was \"unteachable \" acquired through trial and error chiefly error."},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Kelly-Bootle S. 1995. The Computer Contradictionary. Cambridge: The MIT Press. My entry at Extended Basic gives the unexpurgated version.   Kelly-Bootle S. 1995. The Computer Contradictionary . Cambridge: The MIT Press. My entry at Extended Basic gives the unexpurgated version.","DOI":"10.7551\/mitpress\/2037.001.0001"},{"key":"e_1_2_1_6_1","unstructured":"A clever illiterarily back-formed noun from the more familiar adjective infamous. This reminds me that my current bete noire is the overuse of famously as in \"As Churchill famously remarked..\"  A clever illiterarily back-formed noun from the more familiar adjective infamous . This reminds me that my current bete noire is the overuse of famously as in \"As Churchill famously remarked..\""},{"key":"e_1_2_1_7_1","unstructured":"In keeping with my subject matter fatidic is a more elitist literary choice than prophetic. Was Orwell's pessimism ill founded? I leave it to my readers to decide.  In keeping with my subject matter fatidic is a more elitist literary choice than prophetic . Was Orwell's pessimism ill founded? I leave it to my readers to decide."},{"key":"e_1_2_1_8_1","unstructured":"Kelly-Bootle S. 1988. 680x0 Programming by Example. Indianapolis: Howard W. Sams & Company. I find that I wrote in the introduction \"..one of the objects of the book is to improve your reading skills!\"  Kelly-Bootle S. 1988. 680x0 Programming by Example . Indianapolis: Howard W. Sams & Company. I find that I wrote in the introduction \"..one of the objects of the book is to improve your reading skills!\""},{"key":"e_1_2_1_9_1","unstructured":"Well-versed readers will know that Finnegans Wake is fond of an APL anagram: ALP crops up as Anna Livia Plurabelle. LitCritters get quite excited over such minutiae. I must confess my analogy is imperfect. APLers will rush to tell me that the garrulous circular Finnegans Wake (it opens with \"riverun\" and ends with \"the\"---a sort of GOTO START endless loop) can be expressed in just three lines. Dijkstra's spin was quite acerbic: \"APL is a mistake carried through to perfection. It is the language of the future for the programming techniques of the past: it creates a new generation of coding bums.\"  Well-versed readers will know that Finnegans Wake is fond of an APL anagram: ALP crops up as Anna Livia Plurabelle. LitCritters get quite excited over such minutiae. I must confess my analogy is imperfect. APLers will rush to tell me that the garrulous circular Finnegans Wake (it opens with \"riverun\" and ends with \"the\"---a sort of GOTO START endless loop) can be expressed in just three lines. Dijkstra's spin was quite acerbic: \"APL is a mistake carried through to perfection. It is the language of the future for the programming techniques of the past: it creates a new generation of coding bums.\""},{"key":"e_1_2_1_10_1","unstructured":"Peder Zane J. 2007. The Top 10: Writers Pick Their Favorite Books. New York: W.W. Norton.  Peder Zane J. 2007. The Top 10: Writers Pick Their Favorite Books . New York: W.W. Norton."},{"key":"e_1_2_1_11_1","unstructured":"ibid.  ibid."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1164394.1164396"},{"issue":"1","key":"e_1_2_1_13_1","first-page":"11","article-title":"Programs are not literature, even by analogy","volume":"50","author":"McGrath R.E.","year":"2007","journal-title":"Communications of the ACM"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1188913.1188922"}],"container-title":["Queue"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1242489.1242508","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1242489.1242508","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:38:56Z","timestamp":1750268336000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1242489.1242508"}},"subtitle":["Is your code literate or literary?"],"short-title":[],"issued":{"date-parts":[[2007,4]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,4]]}},"alternative-id":["10.1145\/1242489.1242508"],"URL":"https:\/\/doi.org\/10.1145\/1242489.1242508","relation":{},"ISSN":["1542-7730","1542-7749"],"issn-type":[{"type":"print","value":"1542-7730"},{"type":"electronic","value":"1542-7749"}],"subject":[],"published":{"date-parts":[[2007,4]]},"assertion":[{"value":"2007-04-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}