{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T16:27:28Z","timestamp":1648916848307},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1986,9,1]],"date-time":"1986-09-01T00:00:00Z","timestamp":525916800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener Comput"],"published-print":{"date-parts":[[1986,9]]},"DOI":"10.1007\/bf03037406","type":"journal-article","created":{"date-parts":[[2009,4,23]],"date-time":"2009-04-23T22:40:55Z","timestamp":1240526455000},"page":"245-272","source":"Crossref","is-referenced-by-count":0,"title":["Low cost environment changing in a shallow binding system"],"prefix":"10.1007","volume":"4","author":[{"given":"K. U.","family":"Felgentreu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W. M.","family":"Lippe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF03037406_CR1","volume-title":"LISP 1.5 Programmer\u2019s Manual","author":"J. McCarthy","year":"1966","unstructured":"McCarthy, J., et al.,LISP 1.5 Programmer\u2019s Manual, MIT Press, Cambridge, Massachusetts, 1966."},{"key":"BF03037406_CR2","first-page":"110","volume":"2","author":"H. Langmaack","year":"1973","unstructured":"Langmaack, H., \u201cOn correct Procedure Parameter Transmission in Higher Programming Languages,\u201dActa Informatica, 2, pp. 110\u2013142, 1973.","journal-title":"Acta Informatica"},{"key":"BF03037406_CR3","doi-asserted-by":"crossref","unstructured":"Greussay, P., \u201cIterative Interpretation of Tail-Recursive LISP Procedures,\u201d inEcole de la Recherche, Universite de Paris, 1978.","DOI":"10.1145\/1411798.1411809"},{"key":"BF03037406_CR4","unstructured":"Perrot, J. F. \u201cPrincipes d\u2019implementation de processus recursifs,\u201d inEcole de la Recherche, Universite de Paris, 1978."},{"issue":"No. 7","key":"BF03037406_CR5","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1145\/359545.359566","volume":"21","author":"H. G. Baker","year":"1978","unstructured":"Baker, H. G., \u201cShallow Binding in LISP 1.5,\u201dCACM, Vol. 21, No. 7, pp. 565\u2013569, July, 1978.","journal-title":"CACM"},{"key":"BF03037406_CR6","unstructured":"Bauchrowitz, N., \u201cVergleich einer operationellen mit einer denotationellen Semantik fuer LISP,\u201d Diplomarbeit am Institut fuer Informatik und Praktische Mathematik der Universit\u00e4t Kiel, 1980."},{"key":"BF03037406_CR7","doi-asserted-by":"crossref","unstructured":"Honschopp, U., Lippe, W.-M. and Simon, F., \u201cCompiling Functional Languages for von Neumann Machines,\u201dSIGPLAN \u201983: Symposium on Programming Language Issues in Software Systems, pp. 22\u201327, 1983.","DOI":"10.1145\/872728.806848"},{"key":"BF03037406_CR8","unstructured":"Felgentreu, K.-U., \u201cImplementierung eines schnellen LISP-Interpretierers,\u201d Diplomarbeit am Institut fuer Informatik und Praktische Mathematik der Universit\u00e4t Kiel, February, 1984."},{"key":"BF03037406_CR9","doi-asserted-by":"crossref","unstructured":"Saint-James, E., \u201cRecursion is more efficient than Iteration,\u201dConference Record of the 1984 ACM Symposium on LISP and Functional Programming, August, 1984.","DOI":"10.1145\/800055.802039"},{"key":"BF03037406_CR10","unstructured":"Felgentreu, K.-U., \u201cDecidability Problems concerning the Optimization of Function Calls,\u201dReport No. 3\/85-I, Institut f\u00fcr Numerische und instrumentelle Mathematik der Universit\u00e4t M\u00fcnster, 1985."},{"key":"BF03037406_CR11","doi-asserted-by":"crossref","unstructured":"Felgentreu, K.-U., Lippe, W.-M., \u201cDynamic Optimization of Covered Tail Recursive Functions in Applicative Languages,\u201dProceedings of the ACM Computer Science Conference, pp. 293\u2013299, February, 1986.","DOI":"10.1145\/324634.325437"}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037406.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037406\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T20:52:36Z","timestamp":1558558356000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037406"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,9]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,9]]}},"alternative-id":["BF03037406"],"URL":"https:\/\/doi.org\/10.1007\/bf03037406","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,9]]}}}