{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T08:24:13Z","timestamp":1770279853130,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540089216","type":"print"},{"value":"9783540357575","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1978]]},"DOI":"10.1007\/3-540-08921-7_73","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:36:28Z","timestamp":1330187788000},"page":"257-266","source":"Crossref","is-referenced-by-count":1,"title":["Some applications of algebraic semantics"],"prefix":"10.1007","author":[{"given":"Ir\u00e8ne","family":"Guessarian","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"22_CR1","volume-title":"The theory of parsing, translation and compiling","author":"A. Aho","year":"1973","unstructured":"A. AHO, J. ULLMAN, The theory of parsing, translation and compiling, Prentice Hall, London (1973)"},{"issue":"3","key":"22_CR2","first-page":"5","volume":"10","author":"A. Arnold","year":"1976","unstructured":"A. ARNOLD, M. DAUCHET, Transductions de for\u00eats reconnaissables monadiques, for\u00eats cor\u00e9guli\u00e8res, R.A.I.R.O., Vol. 10, no3 (1976), 5\u201328","journal-title":"R.A.I.R.O."},{"key":"22_CR3","unstructured":"G. BIRKHOFF, Lattice theory, AMS 3rd edition, New York (1967)"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"B. COURCELLE, I. GUESSARIAN, On some classes of interpretations, IRIA Report no253 (1977)","DOI":"10.1007\/3-540-08342-1_43"},{"key":"22_CR5","unstructured":"B. COURCELLE, I. GUESSARIAN, M. NIVAT, The algebraic semanties of recursive program schemes, in preparation"},{"issue":"3","key":"22_CR6","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1137\/0205031","volume":"5","author":"P. Downey","year":"1976","unstructured":"P. DOWNEY, R. SETHI, Correct computation rules for recursive languages, SIAM J. Comp., Vol.5,no3 (1976), 378\u2013401","journal-title":"SIAM J. Comp."},{"key":"22_CR7","unstructured":"J. ENGELFRIET, Some remarks on classes of macro-languages, Coll. \"Les arbres en alg\u00e8bre et programmation\", Lille Univ. (1976)"},{"key":"22_CR8","volume-title":"Sch\u00e9mas r\u00e9cursifs polyadiques: \u00e9quivalences et classe d'interpr\u00e9tations","author":"I. Guessarian","year":"1975","unstructured":"I. GUESSARIAN, Sch\u00e9mas r\u00e9cursifs polyadiques: \u00e9quivalences et classe d'interpr\u00e9tations, Th\u00e8se d'Etat, Univ. PARIS 7, Paris (1975)"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"J. GOGUEN, J. THATCHER, E. WAGNER, J. WRIGHT, Some fundamentals of order-algebraic semantics, MFCS 76, Lecture Notes in Computer Science no45, A. Mazurkiewicz Ed., Springer-Verlag (1976), 153\u2013168","DOI":"10.1007\/3-540-07854-1_169"},{"key":"22_CR10","first-page":"82","volume-title":"The logical schemes of algorithms","author":"I. Ianov","year":"1960","unstructured":"I. IANOV, The logical schemes of algorithms, in problems of Cybernetics, Pergamon Press, London (1960), 82\u2013140"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"K. INDERMARK, Schemes with recursion on higher types, MFCS 76, Lect. Notes in Comp. Sc. no45, A. Mazurkiewicz Ed., Springer-Verlag (1976), 352\u2013358","DOI":"10.1007\/3-540-07854-1_198"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"R. MILNER, Models of LCF, Stanford A.I. Lab. Memo. AIM\/CS 332, Stanford (1973)","DOI":"10.21236\/AD0758645"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1145\/362588.362598","volume":"14","author":"J. Morris","year":"1971","unstructured":"J. MORRIS, Another recursion induction principle, Com. ACM, Vol. 14 (1971), 351\u2013354","journal-title":"Com. ACM"},{"key":"22_CR14","unstructured":"M. NIVAT, On the interpretation of recursive polyadic program schemes, Symposia Mathematica, Vol. 15, Rome (1975)"},{"key":"22_CR15","unstructured":"D. SCOTT, C. STRACHEY, Toward a mathematical semantics for computer languages, Technical Monograph PRG-6, Oxford Univ. (1971)"},{"key":"22_CR16","unstructured":"J. VUILLEMIN, Syntaxe, s\u00e9mantique et axiomatique d'un langage de programmation simple, Th\u00e8se d'\u00e9tat, Paris (1974)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1978"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08921-7_73.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:00:24Z","timestamp":1605643224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08921-7_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"ISBN":["9783540089216","9783540357575"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-08921-7_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978]]}}}