{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:19:41Z","timestamp":1725455981719},"publisher-location":"Berlin\/Heidelberg","reference-count":7,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354009525X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0025716","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T09:36:25Z","timestamp":1132392985000},"page":"127-138","source":"Crossref","is-referenced-by-count":2,"title":["Partially-additive monoids, graph-growing, and the algebraic semantics of recursive calls"],"prefix":"10.1007","author":[{"given":"M. A.","family":"Arbib","sequence":"first","affiliation":[]},{"given":"E. G.","family":"Manes","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0019-9958(68)90374-4","volume":"12","author":"M. A. Arbib","year":"1968","unstructured":"M. A. Arbib and Y. Give'on: Algebra automata I: Parallel programming as prolegomenon to the categorical approach, Information and Control\n12 (1968), 331\u2013345.","journal-title":"Information and Control"},{"key":"3_CR2","series-title":"COINS Technical Report","volume-title":"Partially-additive categories and computer program semantics","author":"M. A. Arbib","year":"1978","unstructured":"M. A. Arbib and E. G. Manes: Partially-additive categories and computer program semantics, COINS Technical Report 78-12, Department of Computer and Information Science, University of Massachusetts, Amherst, MA 01003 (1978), 39 pp."},{"key":"3_CR3","series-title":"COINS Tech. Report","volume-title":"Abstract theory of recursive calls","author":"M. A. Arbib","year":"1978","unstructured":"M. A. Arbib and E. G. Manes: Abstract theory of recursive calls, COINS Tech. Report 78-18, Department of Computer and Information Science, University of Massachusetts, Amherst, MA 01003 (August 1978)."},{"key":"3_CR4","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/359576.359579","volume":"21","author":"J. W. Backus","year":"1978","unstructured":"J. W. Backus: Can programming be liberated from the Von Neumann style? A functional style and its algebra of programs, Communications of the ACM\n21 (1978), 613\u2013641.","journal-title":"Communications of the ACM"},{"key":"3_CR5","first-page":"77","volume":"188","author":"C. C. Elgot","year":"1971","unstructured":"C. C. Elgot: Algebraic theories and program semantics, in Symposium on Semantics of Algorithmic Languages, (E. Engeler, Ed.), Springer Lecture Notes in Mathematics, 188 (1971), 77\u201388.","journal-title":"Symposium on Semantics of Algorithmic Languages"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"E. G. Manes: Algebraic Theories, Springer-Verlag (1976).","DOI":"10.1007\/978-1-4612-9860-1"},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BFb0059703","volume":"188","author":"D. Scott","year":"1971","unstructured":"D. Scott: The lattice of flow diagrams, in Symposium on Semantics of Algorithmic Languages, (E. Engeler, Ed.), Springer Lecture Notes in Mathematics, 188 (1971), 311\u2013366.","journal-title":"Symposium on Semantics of Algorithmic Languages"}],"container-title":["Lecture Notes in Computer Science","Graph-Grammars and Their Application to Computer Science and Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0025716.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:55:03Z","timestamp":1607550903000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0025716"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354009525X"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0025716","relation":{},"subject":[]}}