{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:10:19Z","timestamp":1725455419010},"publisher-location":"Berlin\/Heidelberg","reference-count":9,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540167838"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0016247","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:39:17Z","timestamp":1131860357000},"page":"239-246","source":"Crossref","is-referenced-by-count":0,"title":["Iterative systems of equations"],"prefix":"10.1007","author":[{"given":"Virgil Emil","family":"C\u0102z\u0102nescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"ADJ (J.A.Goguen, J.W.Thatcher, E.G.Wagner, J.B.Wright), A Junction between Computer Science and Category Theory, IBM Research Report RC 4526 (1973), IBM Research Report RC 5908 (1976)."},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"ADJ, Initial Algebra Semantics and Continuous Algebras, J. Assoc. Comput. Mach. 24 (1977).","DOI":"10.1145\/321992.321997"},{"key":"18_CR3","unstructured":"ADJ (EGW, JWT, JBW), Free Continuous Theories, IBM Research Raport RC 6906 (1977)."},{"key":"18_CR4","unstructured":"ADJ (JWT, EGW, JBW), Notes on Algebraic Fundamentals for Theoretical Computer Science, Mathematical Centre Tracts 109 (1979)."},{"key":"18_CR5","unstructured":"R.M.Burstall, J.A. Goguen, Some Fundamentals Properties of Algebraic Theories: A Tool for Semantics of Computation, Theoret.Comput.Sci., 31 (1984)."},{"key":"18_CR6","unstructured":"V.E.C\u0102z\u0102nescu, Partial Flowcharts, Infinite Flowcharts and Rational Flowcharts, INCREST Preprint Series in Mathematics No.42 (1985)."},{"key":"18_CR7","unstructured":"M.Nivat, On the Interpretation of Polyadic Recursive Program Schemes, Symposia Mathematica, XV, Istituto Nazionale di Alta Matematica, Italy (1975)."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"M.P.Sch\u00fctzenberger, Pushdown Automata and Context-free Languages, Inform. and Control, 6 (1963).","DOI":"10.1016\/S0019-9958(63)90306-1"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"D.Scott, The Lattice of Flow Diagrams, Lecture Notes in Mathematics 188, Springer-Verlag (1971).","DOI":"10.1007\/BFb0059703"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1986"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0016247.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:35:37Z","timestamp":1607549737000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0016247"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540167838"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0016247","relation":{},"subject":[]}}