{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:06:19Z","timestamp":1699833979833},"reference-count":12,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,27]],"date-time":"2006-10-27T00:00:00Z","timestamp":1161907200000},"content-version":"vor","delay-in-days":11441,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1975,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This note describes a method of enabling non\u2010deterministic algorithms to be written in conventional deterministic programming languages. The method involves a dynamic manipulation of stack contents, and is contrasted with standard techniques of implementing non\u2010deterministic programming languages.<\/jats:p>","DOI":"10.1002\/spe.4380050302","type":"journal-article","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T13:54:43Z","timestamp":1163771683000},"page":"221-227","source":"Crossref","is-referenced-by-count":4,"title":["Embedding non\u2010determinism"],"prefix":"10.1002","volume":"5","author":[{"given":"John A.","family":"Self","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,27]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/321296.321300"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/321420.321422"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(70)90003-2"},{"key":"e_1_2_1_5_2","unstructured":"G. J.Sussman T.WinogradandE.Charniak MICROPLANNER Reference Manual AI Memo 203A MIT (1972)."},{"key":"e_1_2_1_6_2","unstructured":"G. J.SussmanandD. V.McDermott CONNIVER Reference Manual AI Memo 259 MIT (1972)."},{"key":"e_1_2_1_7_2","unstructured":"D. J. M.Davies POPLER Reference Manual TPU Report No. 1 University of Edinburgh (1973)."},{"key":"e_1_2_1_8_2","doi-asserted-by":"crossref","unstructured":"W.Teitelman D. G.BobrowandA.Hartley INTERLISP Reference Manual Xerox Palo Alto Research Center (1973).","DOI":"10.1145\/1056786.1056787"},{"key":"e_1_2_1_9_2","unstructured":"C.Hewitt Description and Theoretical Analysis (using Schemata) of PLANNER Ph. D. thesis MIT (1972)."},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/17.1.44"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/362375.362379"},{"key":"e_1_2_1_12_2","volume-title":"BCPL Reference Manual","author":"Richards M.","year":"1969"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-7373(74)80005-2"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380050302","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380050302","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T05:56:51Z","timestamp":1699768611000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380050302"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,7]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1975,7]]}},"alternative-id":["10.1002\/spe.4380050302"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380050302","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1975,7]]}}}