{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:53:31Z","timestamp":1725490411088},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734192"},{"type":"electronic","value":"9783540734208"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73420-8_53","type":"book-chapter","created":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T14:58:43Z","timestamp":1188053923000},"page":"607-618","source":"Crossref","is-referenced-by-count":7,"title":["Equational Systems and Free Constructions (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Marcelo","family":"Fiore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chung-Kil","family":"Hur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"53_CR1","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"S. Abramsky","year":"1994","unstructured":"Abramsky, S., Jung, A.: Domain theory. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, pp. 1\u2013168. Oxford University Press, Oxford (1994)"},{"key":"53_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-0021-0","volume-title":"Toposes, Triples and Theories","author":"M. Barr","year":"1985","unstructured":"Barr, M., Wells, C.: Toposes, Triples and Theories. Springer, Heidelberg (1985)"},{"key":"53_CR3","series-title":"ENTCS","first-page":"80","volume-title":"Proc. 3rd International Workshop on Coalgebraic Methods in Computer Science","author":"C. C\u00eerstea","year":"2000","unstructured":"C\u00eerstea, C.: An algebra-coalgebra framework for system specification. In: Proc. 3rd International Workshop on Coalgebraic Methods in Computer Science. ENTCS, vol.\u00a033, pp. 80\u2013110. Elsevier, Amsterdam (2000)"},{"key":"53_CR4","series-title":"LNM","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0060438","volume-title":"Reports of the Midwest Category Seminar IV","author":"B. Day","year":"1970","unstructured":"Day, B.: On closed categories of functors. In: Reports of the Midwest Category Seminar IV. LNM, vol.\u00a0137, pp. 1\u201338. Springer, Heidelberg (1970)"},{"issue":"1","key":"53_CR5","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1006\/inco.2002.2968","volume":"179","author":"M. Fiore","year":"2002","unstructured":"Fiore, M., Moggi, E., Sangiorgi, D.: A fully abstract model for the \u03c0-calculus. Information and Computation\u00a0179(1), 76\u2013117 (2002)","journal-title":"Information and Computation"},{"key":"53_CR6","first-page":"193","volume-title":"Proc. 14th IEEE Symp. Logic in Computer Science","author":"M. Fiore","year":"1999","unstructured":"Fiore, M., Plotkin, G., Turi, D.: Abstract syntax and variable binding. In: Proc. 14th IEEE Symp. Logic in Computer Science, pp. 193\u2013202. IEEE Computer Society Press, Los Alamitos (1999)"},{"issue":"1","key":"53_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0960129500000852","volume":"6","author":"M. Fokkinga","year":"1996","unstructured":"Fokkinga, M.: Datatype laws without signatures. Mathematical Structures in Computer Science\u00a06(1), 1\u201332 (1996)","journal-title":"Mathematical Structures in Computer Science"},{"key":"53_CR8","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001650200016","volume":"13","author":"M.J. Gabbay","year":"2001","unstructured":"Gabbay, M.J., Pitts, A.: A new approach to abstract syntax with variable binding. Formal Aspects of Computing\u00a013, 341\u2013363 (2001)","journal-title":"Formal Aspects of Computing"},{"issue":"4","key":"53_CR9","first-page":"290","volume":"10","author":"N. Ghani","year":"2003","unstructured":"Ghani, N., L\u00fcth, C.: Rewriting via coinserters. Nordic Journal of Computing\u00a010(4), 290\u2013312 (2003)","journal-title":"Nordic Journal of Computing"},{"issue":"2","key":"53_CR10","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1017\/S0960129502003912","volume":"13","author":"N. Ghani","year":"2003","unstructured":"Ghani, N., L\u00fcth, C., De Marchi, F., Power, A.J.: Dualising initial algebras. Mathematical Structures in Computer Science\u00a013(2), 349\u2013370 (2003)","journal-title":"Mathematical Structures in Computer Science"},{"key":"53_CR11","first-page":"80","volume-title":"Current Trends in Programming Methodology: Software Specification and Design","author":"J. Goguen","year":"1978","unstructured":"Goguen, J., Thatcher, J., Wagner, E.: An initial algebra approach to the specification, correctness and implementation of abstract data types. In: Yeh, R. (ed.) Current Trends in Programming Methodology: Software Specification and Design, vol.\u00a0IV, chapter\u00a05, pp. 80\u2013149. Prentice Hall, Englewood Cliffs (1978)"},{"key":"53_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/978-3-540-30477-7_23","volume-title":"Programming Languages and Systems","author":"M. Hamana","year":"2004","unstructured":"Hamana, M.: Free \u03a3-monoids: A higher-order syntax with metavariables. In: Wei-Ngan Chin (ed.) Second Asian Symp. Programming Languages and Systems. LNCS, vol.\u00a03302, pp. 348\u2013363. Springer, Heidelberg (2004)"},{"key":"53_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/3-540-09526-8_8","volume-title":"Mathematical Foundations of Computer Science","author":"M. Hennessy","year":"1979","unstructured":"Hennessy, M., Plotkin, G.: Full abstraction for a simple parallel programming language. In: Becvar, J. (ed.) Mathematical Foundations of Computer Science. LNCS, vol.\u00a074, pp. 108\u2013120. Springer, Heidelberg (1979)"},{"key":"53_CR14","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0022-4049(93)90092-8","volume":"89","author":"G.M. Kelly","year":"1993","unstructured":"Kelly, G.M., Power, A.J.: Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads. Journal of Pure and Applied Algebra\u00a089, 163\u2013179 (1993)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"53_CR15","doi-asserted-by":"crossref","unstructured":"Kock, A.: Strong functors and monoidal monads. Archiv der Mathematik\u00a023 (1972)","DOI":"10.1007\/BF01304852"},{"key":"53_CR16","unstructured":"Plotkin, G.: Domains. Pisa Notes on Domain Theory (1983)"},{"issue":"1","key":"53_CR17","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1023\/A:1023064908962","volume":"11","author":"G. Plotkin","year":"2003","unstructured":"Plotkin, G., Power, A.J.: Algebraic operations and generic effects. Applied Categorical Structures\u00a011(1), 69\u201394 (2003)","journal-title":"Applied Categorical Structures"},{"key":"53_CR18","series-title":"ENTCS","first-page":"149","volume-title":"Proc. Workshop on Domains VI","author":"G. Plotkin","year":"2004","unstructured":"Plotkin, G., Power, A.J.: Computational effects and operations: An overview. In: Proc. Workshop on Domains VI. ENTCS, vol.\u00a073, pp. 149\u2013163. Elsevier, Amsterdam (2004)"},{"key":"53_CR19","first-page":"83","volume":"6","author":"A.J. Power","year":"1999","unstructured":"Power, A.J.: Enriched Lawvere theories. Theory and Applications of Categories\u00a06, 83\u201393 (1999)","journal-title":"Theory and Applications of Categories"},{"issue":"3\u20135","key":"53_CR20","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/s001650200014","volume":"13","author":"E. Robinson","year":"2002","unstructured":"Robinson, E.: Variations on algebra: Monadicity and generalisations of equational theories. Formal Aspects of Computing\u00a013(3\u20135), 308\u2013326 (2002)","journal-title":"Formal Aspects of Computing"},{"key":"53_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/978-3-540-31982-5_10","volume-title":"Foundations of Software Science and Computational Structures","author":"I. Stark","year":"2005","unstructured":"Stark, I.: Free-algebra models for the \u03c0-calculus. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 155\u2013169. Springer, Heidelberg (2005)"},{"key":"53_CR22","series-title":"ENTCS","volume-title":"Proc. 2nd International Workshop on Coalgebraic Methods in Computer Science","author":"J. Worrell","year":"1999","unstructured":"Worrell, J.: Terminal sequences for accessible endofunctors. In: Proc. 2nd International Workshop on Coalgebraic Methods in Computer Science. ENTCS, vol.\u00a019, Elsevier, Amsterdam (1999)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73420-8_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:11:16Z","timestamp":1619518276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73420-8_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734192","9783540734208"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73420-8_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}