{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:05:45Z","timestamp":1725663945538},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540559849"},{"type":"electronic","value":"9783540473350"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55984-1_27","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:50:13Z","timestamp":1330253413000},"page":"297-311","source":"Crossref","is-referenced-by-count":2,"title":["Compiling flang"],"prefix":"10.1007","author":[{"given":"Andrei","family":"Mantsivoda","sequence":"first","affiliation":[]},{"given":"Vyacheslav","family":"Petukhin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"A.Mantsivoda. Flang: A Functional-Logic Language. Proc. of Int. conf on Processing Declarative Knowledge.-Kaiserslautern, July 1991.","DOI":"10.1007\/BFb0013535"},{"key":"27_CR2","unstructured":"D.H.D.Warren. An Abstract Prolog Instruction Set. Technical Note 309 SRI International, Menlo Park, CA, October 1983."},{"key":"27_CR3","volume-title":"Constraint Satisfaction in Logic Programming","author":"P. Hentenryck Van","year":"1989","unstructured":"P. Van Hentenryck. Constraint Satisfaction in Logic Programming. The MIT Press, Cambridge, 1989."},{"key":"27_CR4","unstructured":"H.Boley. A relational\/functional Language and its Compilation into the WAM. SEKI Report SR-90-05, University of Kaiserslautern, 1990."},{"key":"27_CR5","unstructured":"P.L.van Roy Can Logic Programming Execute as Fast as Imperative Programming? PhD Dissertation, University of California at Berkeley, November 1990."},{"key":"27_CR6","unstructured":"A. Taylor High Performance Prolog Implementation. PhD. Dissertation, Basser Department of Computer Science, University of Sydney, June 1991."},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"D. Turner. An Overview of Miranda. SIGPLAN Notices, vol 21, No 12.","DOI":"10.1145\/15042.15053"},{"key":"27_CR8","first-page":"1388","volume-title":"Proc. 5th Int. Conf. Symp. Logic Programming","author":"G. Janssens","year":"1988","unstructured":"G. Janssens, B. Demoen, A. Marten. Improving the Register Allocation in WAM by Reordering Unification. Proc. 5th Int. Conf. Symp. Logic Programming, pp. 1388\u20131402, MIT Press, Cambridge, MA, 1988."}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55984-1_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:48:01Z","timestamp":1619570881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55984-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540559849","9783540473350"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-55984-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}