{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:59:55Z","timestamp":1767139195153,"version":"build-2238731810"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540068419","type":"print"},{"value":"9783662215456","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1974]]},"DOI":"10.1007\/978-3-662-21545-6_11","type":"book-chapter","created":{"date-parts":[[2013,12,7]],"date-time":"2013-12-07T05:10:34Z","timestamp":1386393034000},"page":"157-169","source":"Crossref","is-referenced-by-count":4,"title":["Graph Representation and Computation Rules for Typeless Recursive Languages"],"prefix":"10.1007","author":[{"given":"G.","family":"Pacini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Montangero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Turini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","volume-title":"Ph.D. Thesis. Computer Science Depat. Stanford U.","author":"JM Cadiou","year":"1972","unstructured":"Cadiou J.M. \u201cRecursive definitions of partial functions and their computations\u201d. Ph.D. Thesis. Computer Science Depat. Stanford U., 1972."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Manna Z., S.Ness and J.Vuillemin. \u201cInductive methods for proving properties of pregrams\u201d. CACM, pp. 491\u2013502, August 1973.","DOI":"10.1145\/355609.362336"},{"key":"11_CR3","unstructured":"Pacini G. \u201cAn optimal fixpoint computation algorithm for a simple recursive language\u201d. Internal Report I.F.I. 873\u201310, October 73."},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Rosen K.B.K. \u201cTree manipulating systems and Church Rosser theorems\u201d. JACM, pp. 160\u2013187, January 1973.","DOI":"10.1145\/321738.321750"},{"key":"11_CR5","volume-title":"Oxford U. PRO technical mono.","author":"D Scott","year":"1970","unstructured":"Scott D. \u201cOutline of a mathematical theory of computation\u201d. Oxford U. PRO technical mono., 1970."},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Vuillemin J. \u201cCorrect and optimal implementations of recursion in a simple programming language\u201d. Proc. of 5-th annual ACM Symposium or Theory of Computing. Austin,Texas. pp. 224\u2013239, April 1973.","DOI":"10.1145\/800125.804054"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-21545-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T08:56:38Z","timestamp":1561971398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-21545-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974]]},"ISBN":["9783540068419","9783662215456"],"references-count":6,"aliases":["10.1007\/3-540-06841-4_58"],"URL":"https:\/\/doi.org\/10.1007\/978-3-662-21545-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974]]}}}