{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T10:37:46Z","timestamp":1648895866756},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1979,6,1]],"date-time":"1979-06-01T00:00:00Z","timestamp":297043200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1979,6]]},"DOI":"10.1007\/bf02252093","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T11:49:03Z","timestamp":1132055343000},"page":"119-138","source":"Crossref","is-referenced-by-count":1,"title":["Zur Elimination von Prozedurschachtelungen"],"prefix":"10.1007","volume":"23","author":[{"given":"W. M.","family":"Lippe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Simon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02252093_CR1","first-page":"110","volume":"2","author":"H. Langmaack","year":"1973","unstructured":"Langmaack, H.: On correct procedure parameter transmission in higher programming languages. Acta Informatica2, 110\u2013142 (1973).","journal-title":"Acta Informatica"},{"key":"BF02252093_CR2","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF00289503","volume":"2","author":"H. Langmaack","year":"1973","unstructured":"Langmaack, H.: On procedures as open subroutines I. Acta Informatica2, 311\u2013333 (1973).","journal-title":"Acta Informatica"},{"key":"BF02252093_CR3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF00288636","volume":"3","author":"H. Langmaack","year":"1974","unstructured":"Langmaack, H.: On procedures as open subroutines II. Acta Informatica3, 227\u2013241 (1974).","journal-title":"Acta Informatica"},{"key":"BF02252093_CR4","unstructured":"Simon, F.: Zur Charakterisierung von LISP als ALGOL-\u00e4hnliche Programmiersprache mit einem strikt nach dem Kellerprinzip arbeitenden Laufzeitsystem. Dissertation, Christian-Albrechts-Universit\u00e4t Kiel, 1978."},{"key":"BF02252093_CR5","first-page":"111","volume-title":"Informatik-Fachberichte 1","author":"F. Simon","year":"1976","unstructured":"Simon, F.: Cons-freies Programmieren in LISP unter deletion-Strategie, in: Informatik-Fachberichte 1 (Schneider, H. J., Nagl, M., Hrsg.), S. 111\u2013123. Berlin-Heidelberg-New York: Springer 1976."},{"key":"BF02252093_CR6","unstructured":"Simon, F., Trademann, P.: Eine Beziehung zwischen cons-freiem LISP und Stackautomaten. Elektronische Informationsverarbeitung und Kybernetik EIK 14 (1978)."},{"key":"BF02252093_CR7","unstructured":"Kaufholz, G., Lippe, W. M.: A note on a paper of H. Langmaack about correct procedure parameter transmission. Bericht Nr. A 74\/06 des Fachbereichs Angewandte Mathematik und Informatik der Universit\u00e4t des Saarlandes, Saarbr\u00fccken, 1974."},{"key":"BF02252093_CR8","unstructured":"Lippe, W. M.: Zur Entscheidbarkeit von Programmeigenschaften durch Programmtransformationen. Bericht Nr. 7607, Institut f\u00fcr Informatik und Praktische Mathematik der Christian-Albrechts-Universit\u00e4t Kiel, 1976."},{"key":"BF02252093_CR9","first-page":"124","volume-title":"Informatik-Fachberichte 1","author":"W. M. Lippe","year":"1976","unstructured":"Lippe, W. M.: \u00dcber die Entscheidbarkeit der formalen Erreichbarkeit von Prozeduren bei monadischen Programmen, in: Informatik-Fachberichte 1 (Schneider, H. J., Hrsg.), S. 124\u2013134. Berlin-Heidelberg-New York: Springer 1976."},{"key":"BF02252093_CR10","unstructured":"Lippe, W. M., Simon, F.: Untersuchungen zur Beziehung zwischen ALGOL 60 und ALGOL 60-P-G. Bericht Nr. 7707, Institut f\u00fcr Informatik und Praktische Mathematik der Christian-Albrechts-Universit\u00e4t Kiel, 1977."},{"key":"BF02252093_CR11","unstructured":"Damm, W., Fehr, E., Indermark, K.: Higher type recursion and self-application as control structures. Proc. of the IFIP Working Conference on Formal Description of Programming Concepts (1977)."},{"key":"BF02252093_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Theory of program structures: schemes, semantics and verification","author":"S. Greibach","year":"1976","unstructured":"Greibach, S.: Theory of program structures: schemes, semantics and verification. (Lecture Notes in Computer Science, Vol. 36.) Berlin-Heidelberg-New York: Springer 1976."}],"container-title":["Computing"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02252093.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02252093\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02252093","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T10:46:08Z","timestamp":1558003568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02252093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,6]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1979,6]]}},"alternative-id":["BF02252093"],"URL":"https:\/\/doi.org\/10.1007\/bf02252093","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,6]]}}}