{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:34Z","timestamp":1725663394455},"publisher-location":"Berlin, Heidelberg","reference-count":47,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540190202"},{"type":"electronic","value":"9783540389200"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-19020-1_5","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:55:53Z","timestamp":1330199753000},"page":"85-120","source":"Crossref","is-referenced-by-count":6,"title":["Assertional categories"],"prefix":"10.1007","author":[{"given":"Ernie","family":"Manes","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"5_CR1","unstructured":"M. A. Arbib and E. G. Manes, Functorial iteration, Notices Amer. Math. Soc. 25, 1978, A-381."},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0021-8693(80)90212-4","volume":"62","author":"M. A. Arbib","year":"1980","unstructured":"M. A. Arbib and E. G. Manes, Partially-additive categories and the semantics of flow diagrams, J. Algebra 62, 1980, 203\u2013227.","journal-title":"J. Algebra"},{"key":"5_CR3","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1145\/322307.322325","volume":"29","author":"M. A. Arbib","year":"1982","unstructured":"M. A. Arbib and E. G. Manes, The pattern-of-calls expansion is the canonical fix-point for recursive definitions, J. Assoc. Comput. Mach. 29, 1982, 557\u2013602.","journal-title":"J. Assoc. Comput. Mach."},{"key":"5_CR4","first-page":"613","volume":"21","author":"J. Backus","year":"1978","unstructured":"J. Backus, Can programming be liberated from the von Neumann Style? A functional style and its algebra of programs, Commun. Assoc. Comput. Mach. 21, 1978, 613\u2013641.","journal-title":"Commun. Assoc. Comput. Mach."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"J. Backus, The algebra of functional programs: function level reasoning, linear equations and extended definitions, in J. Diaz and T. Ramos (eds.), Formalization of programming concepts, Lecture Notes in Computer Science 107, Springer-Verlag, 1981, 1\u201343.","DOI":"10.1007\/3-540-10699-5_91"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1137\/0209002","volume":"9","author":"S. L. Bloom","year":"1980","unstructured":"S. L. Bloom, C. C. Elgot and J. B. Wright, Solutions of the iteration equation and extensions of the scalar iteration operation, SIAM J. Comput. 9, 1980, 25\u201345.","journal-title":"SIAM J. Comput."},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1137\/0209039","volume":"9","author":"S. L. Bloom","year":"1980","unstructured":"S. L. Bloom, C. C. Elgot and J. B. Wright, Vector iteration in pointed iterative theories, SIAM J. Comput. 9, 1980a, 525\u2013540.","journal-title":"SIAM J. Comput."},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0022-0000(85)90059-5","volume":"31","author":"S. L. Bloom","year":"1985","unstructured":"S. L. Bloom and Z. Esik, Axiomatizing schemes and their behaviors, J. Comput. Sys. Sci. 31, 1985, 375\u2013393.","journal-title":"J. Comput. Sys. Sci."},{"key":"5_CR9","volume-title":"Regular Algebra and Finite Machines","author":"J. H. Conway","year":"1971","unstructured":"J. H. Conway, Regular Algebra and Finite Machines, Chapman and Hall, London, 1971."},{"key":"5_CR10","unstructured":"E. W. Dijkstra, A Discipline of Programming, Prentice-Hall, 1976."},{"key":"5_CR11","unstructured":"S. Eilenberg, Automata, Languages, and Machines, Vol. A, Academic Press, 1974."},{"key":"5_CR12","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1090\/S0002-9947-1945-0013131-6","volume":"58","author":"S. Eilenberg","year":"1945","unstructured":"S. Eilenberg and S. Mac Lane, General theory of natural equivalences, Trans. Amer. Math. Soc. 58, 1945, 231\u2013294.","journal-title":"Trans. Amer. Math. Soc."},{"key":"5_CR13","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0049-237X(08)71949-9","volume-title":"Logic Colloquium '73, Proceedings of the Logic Colloquium","author":"Calvin C. Elgot","year":"1975","unstructured":"C. C. Elgot, Monadic computation and iterative algebraic theories, in H. E. Rose and J. C. Shepherdson (eds.), Proc. Logic Colloq. '73, North-Holland, 1975, 175\u2013230."},{"key":"5_CR14","unstructured":"C. C. Elgot and J. C. Shepherdson, An equational axiomatization of reducible flowchart schemes, IBM Research Report RC-8221, April 1980; in S. L. Bloom (ed.), Calvin C. Elgot, Selected Papers, Springer-Verlag, 1982, 361\u2013409."},{"key":"5_CR15","doi-asserted-by":"crossref","first-page":"77","DOI":"10.2307\/2371742","volume":"68","author":"C. J. Everett","year":"1946","unstructured":"C. J. Everett and S. Ulam, Projective algebra I, Amer. J. Math. 68, 1946, 77\u201388.","journal-title":"Amer. J. Math."},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"M. J. Fischer","year":"1979","unstructured":"M. J. Fischer and R. E. Ladner, Propositional dynamic logic of regular programs, J. Comput. Sys. Sci. 18, 1979, 194\u2013211.","journal-title":"J. Comput. Sys. Sci."},{"key":"5_CR17","unstructured":"P. Freyd, Abelian Categories, Harper and Row, 1964."},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"D. Harel, First-order Dynamic Logic, Lecture Notes in Computer Science 68, Springer-Verlag, 1979.","DOI":"10.1007\/3-540-09237-4"},{"key":"5_CR19","first-page":"576","volume":"12","author":"C. A. R. R. Hoare","year":"1969","unstructured":"C. A. R. Hoare, An axiomatic basis for computer programming, Comm. Assoc. Comput. Mach. 12, 1969, 576\u2013580, 583.","journal-title":"Comm. Assoc. Comput. Mach."},{"key":"5_CR20","unstructured":"B. Jonsson and A. Tarski, Representation problems for relation algebras, abstract 89t, Bull. Amer. Math. Soc. 54, 1948, 80."},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"D. Kozen, A representation theorem for models of *-free PDL, in J. W. de Bakker and J. Van Leeuwen (eds.), Automata, Languages and Programming, ICALP '80, Lecture Notes in Computer Science 85, Springer-Verlag, 1980, 351\u2013362.","DOI":"10.1007\/3-540-10003-2_83"},{"key":"5_CR22","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0025782","volume":"131","author":"D. Kozen","year":"1981","unstructured":"D. Kozen, On induction vs. *-continuity, in E. Engeler (ed.), Logics of Programs, Lecture Notes in Computer Science 131, 1981, 167\u2013176.","journal-title":"Logics of Programs, Lecture Notes in Computer Science"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"F. W. Lawvere, Functorial semantics of algebraic theories, Ph.D. Dissertation, Columbia University, 1963.","DOI":"10.1073\/pnas.50.5.869"},{"key":"5_CR24","doi-asserted-by":"crossref","first-page":"707","DOI":"10.2307\/1969375","volume":"51","author":"R. C. Lyndon","year":"1950","unstructured":"R. C. Lyndon, The representation of relation algebras, Ann. Math. 51, 1950, 707\u2013729.","journal-title":"Ann. Math."},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"E. G. Manes, Additive domains, in A. Melton (ed.), Mathematical Foundations of Programming Semantics, Lecture Notes in Computer Science 239, Springer-Verlag, 1985, 184\u2013195.","DOI":"10.1007\/3-540-16816-8_32"},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BF01187560","volume":"21","author":"E. G. Manes","year":"1985","unstructured":"E. G. Manes, Guard modules, Algebra Universalis 21, 1985a, 103\u2013110.","journal-title":"Algebra Universalis"},{"key":"5_CR27","unstructured":"E. G. Manes, A transformational characterization of if-then-else, to appear."},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"E. G. Manes and M. A. Arbib, Algebraic Approaches to Program Semantics, Springer-Verlag, 1986.","DOI":"10.1007\/978-1-4612-4962-7"},{"key":"5_CR29","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF02572645","volume":"31","author":"E. G. Manes","year":"1985","unstructured":"E. G. Manes and D. B. Benson, The inverse semigroup of a sum-ordered semiring, Semigroup Forum 31, 1985, 129\u2013152.","journal-title":"Semigroup Forum"},{"key":"5_CR30","doi-asserted-by":"crossref","first-page":"85","DOI":"10.2307\/2266861","volume":"5","author":"J. C. C. C. McKinsey","year":"1940","unstructured":"J. C. C. McKinsey, Postulates for the calculus of binary relations, J. Symbolic Logic 5, 1940, 85\u201397.","journal-title":"J. Symbolic Logic"},{"key":"5_CR31","volume-title":"A Theory of Programming Language Semantics, Parts a and b","author":"R. Milne","year":"1976","unstructured":"R. Milne and C. Strachey, A Theory of Programming Language Semantics, Parts a and b, Chapman and Hall, London, 1976."},{"key":"5_CR32","unstructured":"B. Mitchell, Theory of Categories, Academic Press, 1965."},{"key":"5_CR33","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-3975(83)90014-2","volume":"25","author":"E. Nelson","year":"1983","unstructured":"E. Nelson, Iterative algebras, Theoret. Comp. Sci. 25, 1983, 67\u201394.","journal-title":"Theoret. Comp. Sci."},{"key":"5_CR34","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1007\/3-540-11160-3_4","volume":"125","author":"R. Parikh","year":"1981","unstructured":"R. Parikh, Propositional dynamic logics of programs: a survey, in E. Engeler (ed.), Logic of Programs, Lecture Notes in Computer Science 125, 1981, 102\u2013144.","journal-title":"Logic of Programs, Lecture Notes in Computer Science"},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"V. R. Pratt, Models of program logics, Proc. 20th IEEE Symp. Found. Comp. Sci., IEEE 79CH1471-2C, 1979, 115\u2013122.","DOI":"10.1109\/SFCS.1979.24"},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"V. R. Pratt, Dynamic algebras and the nature of induction, Proc. 12th ACM Symposium on Theory of Computing, May 1980, 22\u201328.","DOI":"10.1145\/800141.804649"},{"key":"5_CR37","doi-asserted-by":"crossref","unstructured":"J. Reiterman and V. Trnkov\u00e1, Dynamic algebras which are not Kripke structures, Proc. 9th Symposium on Mathematical Foundations of Computer Science, Aug. 1980, 528\u2013538.","DOI":"10.1007\/BFb0022530"},{"key":"5_CR38","unstructured":"K. Segerburg, A completeness theorem in the modal logic of programs, Notices Amer. Math. Soc. 24, 1977, A-522."},{"key":"5_CR39","unstructured":"M. E. Steenstrup, Sum-ordered partial semirings, Ph.D. Dissertation, University of Massachusetts at Amherst, 1985."},{"key":"5_CR40","first-page":"37","volume":"40","author":"M. H. Stone","year":"1936","unstructured":"M. H. Stone, The theory of representations for Boolean algebras, Trans. Amer. Math. Soc. 40, 1936, 37\u2013111.","journal-title":"Trans. Amer. Math. Soc."},{"key":"5_CR41","unstructured":"J. E. Stoy, Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, M. I. T. Press, 1977."},{"key":"5_CR42","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/BF01111003","volume":"83","author":"N. V. Subrahmanyam","year":"1964","unstructured":"N. V. Subrahmanyam, Boolean vector spaces I, Math. Zeit. 83, 1964, 422\u2013433.","journal-title":"Math. Zeit."},{"key":"5_CR43","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF01111721","volume":"87","author":"N. V. Subrahmanyam","year":"1965","unstructured":"N. V. Subrahmanyam, Boolean vector spaces II, Math. Zeit. 87, 1965, 401\u2013419.","journal-title":"Math. Zeit."},{"key":"5_CR44","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01109738","volume":"100","author":"N. V. Subrahmanyam","year":"1967","unstructured":"N. V. Subrahmanyam, Boolean vector spaces, III, Math. Zeit. 100, 1967, 295\u2013313.","journal-title":"Math. Zeit."},{"key":"5_CR45","doi-asserted-by":"crossref","first-page":"73","DOI":"10.2307\/2268577","volume":"6","author":"A. Tarski","year":"1941","unstructured":"A. Tarski, On the calculus of relations, J. Symbolic Logic 6, 1941, 73\u201389.","journal-title":"J. Symbolic Logic"},{"key":"5_CR46","first-page":"229","volume":"13","author":"J. Tiuryn","year":"1981","unstructured":"J. Tiuryn, Unique fixed points vs. least fixed points, Theoret. Comput. Sci. 13, 1981, 229\u2013254.","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR47","unstructured":"E. G. Wagner, S. L. Bloom and J. W. Thatcher, Why algebraic theories?, in M. Nivat and J. C. Reynolds (eds.), Algebraic Methods in Semantics, Cambridge Univ. Press, 1985, 607\u2013634."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Programming Language Semantics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-19020-1_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:16:08Z","timestamp":1605644168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-19020-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540190202","9783540389200"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/3-540-19020-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}