{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T09:37:23Z","timestamp":1770284243704,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"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_53","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:36:42Z","timestamp":1330187802000},"page":"16-30","source":"Crossref","is-referenced-by-count":26,"title":["The algebraic semantics of recursive program schemes"],"prefix":"10.1007","author":[{"given":"B.","family":"Courcelle","sequence":"first","affiliation":[]},{"given":"M.","family":"Nivat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"ADJ, Initial algebra semantics and continuous algebras, JACM 24 (1977) 68\u201395.","DOI":"10.1145\/321992.321997"},{"key":"2_CR2","unstructured":"G. Birkoff, Lattice Theory, AMS (1967)."},{"key":"2_CR3","first-page":"200","volume":"13","author":"S. Bloom","year":"1976","unstructured":"S. Bloom, Varieties of ordered algebras, JCSS 13 (1976), pp 200\u2013212.","journal-title":"JCSS"},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1093\/comjnl\/12.1.41","volume":"12","author":"R. Burstall","year":"1969","unstructured":"R. Burstall, Proving properties of programs by Structural induction, Comp. Journal 12 (1969) 41\u201348.","journal-title":"Comp. Journal"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/321992.321996","volume":"24","author":"R. Burstall","year":"1977","unstructured":"R. Burstall, J. Darlington, A transformation system for developping programs, JACM 24 (1977) 44\u201367.","journal-title":"JACM"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"B. Courcelle, A representation of trees by languages, to appear in TCS (1978).","DOI":"10.1016\/0304-3975(78)90039-7"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"B. Courcelle, On the definition of classes of interpretations, 4th ICALP Turku (1977) Lec, notes in Comp. Sc. Vol. 52. (Springer Verlag).","DOI":"10.1007\/3-540-08342-1_43"},{"key":"2_CR8","unstructured":"B. Courcelle, On recursive equations having a unique solution, Laboria report 285."},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"B. Courcelle, M. Nivat, Algebraic families of interpretations, 17th Symposium on F.O.C.S (Houston 1976) and Laboria report 189.","DOI":"10.1109\/SFCS.1976.3"},{"key":"2_CR10","unstructured":"B. Courcelle, I Guessarian, On some classes of interpretations, to appear in J.C.S.S. (and Laboria report 253)."},{"key":"2_CR11","unstructured":"B. Courcelle, M. Nivat, in preparation."},{"key":"2_CR12","unstructured":"B. Courcelle, J.C. Raoult, Completions of ordered magmas, to appear in Fundamenta Informaticae."},{"key":"2_CR13","unstructured":"J. Darlington, R. Burstall, A system which automatically improves programs, 3rd IJCAI, SRI (1973) 537\u2013542."},{"key":"2_CR14","unstructured":"J. De Bakker, Recursive Procedures, Mathematical center Tract 24, Amsterdam 1971."},{"key":"2_CR15","volume-title":"Automata, Languages, Programing","author":"J. Bakker De","year":"1972","unstructured":"J. De Bakker, W.P. De Roewer, A calculus for recursive program schemes in Automata, Languages, Programing, (Nivat ed.) North-Holland, Amsterdam 1972."},{"key":"2_CR16","unstructured":"G. Huet, B. Lang, Proving and applying program transformations expressed with 2nd order patterms, to appear in Acta Informatica (Laboria report 266)."},{"key":"2_CR17","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1145\/361454.361460","volume":"15","author":"Z. Manna","year":"1972","unstructured":"Z. Manna, J. Vuillemin, Fixpoint approach to the Theory of Computation, CACM 15 (1972), pp 528\u2013536.","journal-title":"CACM"},{"key":"2_CR18","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1147\/rd.202.0138","volume":"20","author":"G. Markowsky","year":"1976","unstructured":"G. Markowsky, B. Rosen, Bases for Chain-complete posets, IBM Jour. of Res. and Dev. vol. 20 (1976) pp 138\u2013147.","journal-title":"IBM Jour. of Res. and Dev."},{"key":"2_CR19","volume-title":"A basis for a mathematical theory of computation in Computer programing and Formal systems","author":"J. McCarthy","year":"1963","unstructured":"J. McCarthy, A basis for a mathematical theory of computation in Computer programing and Formal systems, Braffort and Hirshberg ed., North-Holland, Amsterdam (1963)."},{"key":"2_CR20","unstructured":"J. Messeguer, On order Complete Universal Algebra and Enriched Functorial Semantics, FCT 77 (Poznan), Lecture Notes in Computer Sciences, Springer-Verlag"},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0019-9958(67)90353-1","volume":"11","author":"J. Mezei","year":"1967","unstructured":"J. Mezei, J.B. Wright, Algebraic automata and context-free sets, Inf. and Control 11 (1967) pp 3\u201329.","journal-title":"Inf. and Control"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","volume":"4","author":"R. Milner","year":"1977","unstructured":"R. Milner, Fully abstract models of typed \u03bb-calculi, TCS 4 (1977) 1\u201322.","journal-title":"TCS"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"J.H. Morris, Another Recursion Induction Principle, CACM Vol. 14, no 5 (1971).","DOI":"10.1145\/362588.362598"},{"key":"2_CR24","unstructured":"M. Nivat, On the interpretation of polyadic recursive schemes, Symposia Mathematica, vol. 15, Academic Press (1975)."},{"key":"2_CR25","unstructured":"J.W. Thatcher, E.G. Wagner, J.B. Wright, A uniform approach to inductive posets and inductive closure, to appear in T.C.S."}],"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_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:00:18Z","timestamp":1605643218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08921-7_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"ISBN":["9783540089216","9783540357575"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-08921-7_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978]]}}}