{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:55:21Z","timestamp":1750308921897,"version":"3.41.0"},"reference-count":1,"publisher":"Association for Computing Machinery (ACM)","issue":"79","license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"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":["SIGART Bull."],"published-print":{"date-parts":[[1982,1]]},"abstract":"<jats:p>This project concentrates on the fast, efficient execution of sequences of imperative sentences for a variety of applications. The general strategy assumes that the machine controls a world of interest to the user which can be observed on a computer display screen. The user inputs sentences requesting actions to be performed on the world and observes the result of each command. If the result does not satisfy the user, he or she may request a back-up and rephase the command in clearer language. Most commands are executed in about 2 to 4 seconds making it possible to have a genuine dialog in real time in the solution of real problems.<\/jats:p>","DOI":"10.1145\/1056663.1056689","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"50-51","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Natural Language programming"],"prefix":"10.1145","author":[{"given":"Alan W.","family":"Biermann","sequence":"first","affiliation":[{"name":"Duke University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruce W.","family":"Ballard","sequence":"additional","affiliation":[{"name":"Duke University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pamela K.","family":"Fink","sequence":"additional","affiliation":[{"name":"Duke University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Rodman","sequence":"additional","affiliation":[{"name":"North Carolina State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Rubin","sequence":"additional","affiliation":[{"name":"Duke University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[1982,1]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"A. W. Biermann V. W. Ballard \"Towards Natural Language Programming\" JACL Vol. 6 No. 2 1980.   A. W. Biermann V. W. Ballard \"Towards Natural Language Programming\" JACL Vol. 6 No. 2 1980."}],"container-title":["ACM SIGART Bulletin"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1056663.1056689","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1056663.1056689","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:36:39Z","timestamp":1750282599000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1056663.1056689"}},"subtitle":["Duke University"],"short-title":[],"issued":{"date-parts":[[1982,1]]},"references-count":1,"journal-issue":{"issue":"79","published-print":{"date-parts":[[1982,1]]}},"alternative-id":["10.1145\/1056663.1056689"],"URL":"https:\/\/doi.org\/10.1145\/1056663.1056689","relation":{},"ISSN":["0163-5719"],"issn-type":[{"type":"print","value":"0163-5719"}],"subject":[],"published":{"date-parts":[[1982,1]]},"assertion":[{"value":"1982-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}