{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:17Z","timestamp":1725663317930},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540128687"},{"type":"electronic","value":"9783540387565"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1983]]},"DOI":"10.1007\/3-540-12868-9_96","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T12:55:52Z","timestamp":1330174552000},"page":"116-127","source":"Crossref","is-referenced-by-count":0,"title":["LISP compilation viewed as provable semantics preserving program transformation"],"prefix":"10.1007","author":[{"given":"Herbert","family":"Stoyan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"B. Buchberger, R. Loos: Algebraic Simplification. in: Computer Algebra \u2014 Symbolic and Algebraic Computation, Wien, New York 1982","DOI":"10.1007\/978-3-7091-3406-1_2"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"L.H.Masinter,L.P.Deutsch: Local optimizations in a compiler for stack-based LISP-machines. 1980 LISP conference.","DOI":"10.1145\/800087.802810"},{"key":"12_CR3","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1002\/spe.4380110603","volume":"11","author":"M. L. Griss","year":"1981","unstructured":"M.L. Griss,A.C. Hearn: A portable LISP compiler.Software \u2014 practice and experience,11,1981,p.541\u2013605","journal-title":"practice and experience"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"H.J\u00fcrgensen: Zur \u00dcbersetzbarkeit von Programmiersprachen. in:3.Fachtagung \u00fcber Programmiersprachen,LNCS 7,Berlin etc. 1974","DOI":"10.1007\/3-540-06666-7_42"},{"key":"12_CR5","unstructured":"H.Stoyan: Peephole optimizations in the LISP-LAP.Manuscript. Erlangen 1982"},{"key":"12_CR6","unstructured":"H.Stoyan: An approach to a theoretical basis for code generation in compilation of higher level programming languages.Manuscript. Erlangen 1983"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-12868-9_96.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:06:33Z","timestamp":1605625593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-12868-9_96"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"ISBN":["9783540128687","9783540387565"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-12868-9_96","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1983]]}}}