{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T20:39:51Z","timestamp":1649191191652},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,12,1]],"date-time":"1983-12-01T00:00:00Z","timestamp":439084800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10821,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1983,12]]},"DOI":"10.1016\/0022-0000(83)90050-8","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"400-433","source":"Crossref","is-referenced-by-count":18,"title":["Deterministic and nondeterministic flowchart interpretations"],"prefix":"10.1016","volume":"27","author":[{"given":"Richard J.","family":"Lorentz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David B.","family":"Benson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(83)90050-8_BIB1","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0021-8693(80)90212-4","article-title":"Partially-additive categories and flow-diagram semantics","volume":"62","author":"Arbib","year":"1980","journal-title":"J. Algebra"},{"key":"10.1016\/0022-0000(83)90050-8_BIB2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/S0022-0000(76)80003-7","article-title":"The existence and construction of free iterative theories","volume":"12","author":"Bloom","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90050-8_BIB3","article-title":"Vector Iteration in Pointed Iterative Theories","author":"Bloom","year":"1978","journal-title":"IBM Research Report, RC 7322"},{"key":"10.1016\/0022-0000(83)90050-8_BIB4","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01744293","article-title":"Infinite trees in normal form and recursive equations having a unique solution","volume":"13","author":"Courcelle","year":"1979","journal-title":"Math. System Theory"},{"key":"10.1016\/0022-0000(83)90050-8_BIB5","series-title":"Proceedings 17th Annula IEEE Foundations of Computer Science Symposium","first-page":"137","article-title":"Algebraic families of interpretations","author":"Courcelle","year":"1976"},{"key":"10.1016\/0022-0000(83)90050-8_BIB6","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02238820","article-title":"The common algebraic structure of exit-automata and machines","volume":"6","author":"Elgot","year":"1970","journal-title":"Computing"},{"key":"10.1016\/0022-0000(83)90050-8_BIB7","series-title":"Symposium on Semantics of Algorithmic Languages","article-title":"Algebraic theories and program schemes","author":"Elgot","year":"1971"},{"key":"10.1016\/0022-0000(83)90050-8_BIB8","series-title":"Proceedings Logic Colloquium 73","first-page":"175","article-title":"Monadic computation and iterative algebraic theories","author":"Elgot","year":"1976"},{"key":"10.1016\/0022-0000(83)90050-8_BIB9","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/TSE.1976.233800","article-title":"Structured programming with and without go to statements","volume":"SE-2","author":"Elgot","year":"1976","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/0022-0000(83)90050-8_BIB10","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0021-8693(76)90106-X","article-title":"Matricial theories","volume":"42","author":"Elgot","year":"1976","journal-title":"J. Algebra"},{"key":"10.1016\/0022-0000(83)90050-8_BIB11","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/3-540-09510-1_20","article-title":"Recursion Schemes and Generalized Interpretations","volume":"Vol. 71","author":"Gallier","year":"1979","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/0022-0000(83)90050-8_BIB12","article-title":"Nondeterministic flowchart programs with recursive procedures: Semantics and correctness I and II","volume":"13-2, 13-3","author":"Gallier","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(83)90050-8_BIB13","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0022-0000(79)90032-1","article-title":"Regular trees and the free iterative theory","volume":"18","author":"Ginali","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90050-8_BIB14","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/S0022-0000(74)80028-0","article-title":"On homomorphisms, correctness, termination, unfoldments, and equivalence of flow diagram programs","author":"Goguen","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90050-8_BIB15","article-title":"An Introduction to Categories, Algebraic Theories, and Algebras","author":"Goguen","year":"1975"},{"key":"10.1016\/0022-0000(83)90050-8_BIB16","series-title":"Proceedings 17th Symposium Foundations of Computing","article-title":"Rational algebraic theories and fixed-point solutions","author":"Goguen","year":"1976"},{"key":"10.1016\/0022-0000(83)90050-8_BIB17","article-title":"Theory of Program Structures: Schemes, Semantics, Verification","volume":"Vol. 36","author":"Greibach","year":"1975"},{"key":"10.1016\/0022-0000(83)90050-8_BIB18","series-title":"Category Theory","author":"Herrlich","year":"1979"},{"key":"10.1016\/0022-0000(83)90050-8_BIB19","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0021-8693(70)90084-0","article-title":"On modules over a semiring","volume":"15","author":"Johnson","year":"1970","journal-title":"J. Algebra"},{"key":"10.1016\/0022-0000(83)90050-8_BIB20","series-title":"Algebraic Theories","author":"Manes","year":"1976"},{"key":"10.1016\/0022-0000(83)90050-8_BIB21","series-title":"Categories and Functors","author":"Pareigis","year":"1970"},{"key":"10.1016\/0022-0000(83)90050-8_BIB22","series-title":"Categories","author":"Schubert","year":"1972"},{"key":"10.1016\/0022-0000(83)90050-8_BIB23","first-page":"16","article-title":"Programming Languages as Mathematical Objects","volume":"Vol. 64","author":"Thatcher","year":"1978","journal-title":"Lecture Notes in Computer Science"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900508?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900508?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:51:17Z","timestamp":1550307077000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000083900508"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,12]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,12]]}},"alternative-id":["0022000083900508"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(83)90050-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1983,12]]}}}