{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:16:48Z","timestamp":1725574608717},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540253884"},{"type":"electronic","value":"9783540319825"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31982-5_10","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T07:29:02Z","timestamp":1294990142000},"page":"155-169","source":"Crossref","is-referenced-by-count":3,"title":["Free-Algebra Models for the \u03c0-Calculus"],"prefix":"10.1007","author":[{"given":"Ian","family":"Stark","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","first-page":"104","volume-title":"Conf. Rec. POPL\u00a02001","author":"M. Abadi","year":"2001","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Conf. Rec. POPL\u00a02001, pp. 104\u2013115. ACM Press, New York (2001)"},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.ic.2003.12.003","volume":"190","author":"G.L. Cattani","year":"2004","unstructured":"Cattani, G.L., Sewell, P.: Models for name-passing processes: Interleaving and causal. Inf. Comput.\u00a0190(2), 136\u2013178 (2004)","journal-title":"Inf. Comput."},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/BFb0026984","volume-title":"Category Theory and Computer Science","author":"G.L. Cattani","year":"1997","unstructured":"Cattani, G.L., Stark, I., Winskel, G.: Presheaf models for the \u03c0-calculus. In: Moggi, E., Rosolini, G. (eds.) CTCS 1997. LNCS, vol.\u00a01290, pp. 106\u2013126. Springer, Heidelberg (1997)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-11494-7_1","volume-title":"International Symposium on Programming","author":"B.J. Day","year":"1982","unstructured":"Day, B.J.: On closed categories of functors. In: Dezani-Ciancaglini, M., Montanari, U. (eds.) Programming 1982. LNCS, vol.\u00a0137, pp. 1\u201338. Springer, Heidelberg (1982)"},{"key":"10_CR5","first-page":"193","volume-title":"Proc. LICS 1999","author":"M. Fiore","year":"1999","unstructured":"Fiore, M., Plotkin, G., Turi, D.: Abstract syntax and variable binding. In: Proc. LICS 1999, pp. 193\u2013202. IEEE Comp. Soc. Press, Los Alamitos (1999)"},{"key":"10_CR6","series-title":"ENTCS 106","first-page":"91","volume-title":"Proc. CMCS 2004","author":"M. Fiore","year":"2004","unstructured":"Fiore, M., Staton, S.: Comparing operational models of name-passing process calculi. In: Proc. CMCS 2004. ENTCS 106, pp. 91\u2013104. Elsevier, Amsterdam (2004)"},{"key":"10_CR7","first-page":"93","volume-title":"Proc. LICS 2001","author":"M. Fiore","year":"2001","unstructured":"Fiore, M., Turi, D.: Semantics of name and value passing. In: Proc. LICS 2001, pp. 93\u2013104. IEEE Comp. Soc. Press, Los Alamitos (2001)"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1006\/inco.2002.2968","volume":"179","author":"M.P. Fiore","year":"2002","unstructured":"Fiore, M.P., Moggi, E., Sangiorgi, D.: A fully-abstract model for the \u03c0-calculus. Inf. Comput.\u00a0179(1), 76\u2013117 (2002)","journal-title":"Inf. Comput."},{"issue":"3\u20135","key":"10_CR9","first-page":"341","volume":"13","author":"M.J. Gabbay","year":"2001","unstructured":"Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Asp. Comput.\u00a013(3\u20135), 341\u2013363 (2001)","journal-title":"Formal Asp. Comput."},{"issue":"1\u20132","key":"10_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0304-3975(00)00331-5","volume":"278","author":"M. Hennessy","year":"2002","unstructured":"Hennessy, M.: A fully abstract denotational semantics for the \u03c0-calculus. Theor. Comput. Sci.\u00a0278(1\u20132), 53\u201389 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR11","first-page":"474","volume-title":"Proc. TCS\u00a02002","author":"J.M.E. Hyland","year":"2002","unstructured":"Hyland, J.M.E., Plotkin, G., Power, A.J.: Combining computational effects: Commutativity and sum. In: Proc. TCS\u00a02002, pp. 474\u2013484. Kluwer, Dordrecht (2002)"},{"key":"10_CR12","unstructured":"Hyland, J.M.E., Plotkin, G., Power, A.J.: Combining effects: Sum and tensor (2004) (to appear)"},{"key":"10_CR13","unstructured":"Jones, M.P., Duponcheel, L.: Composing monads. Research Report YALEU\/DCS\/RR-1004, Yale University Department of Computer Science (1993)"},{"key":"10_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. J. Pure Appl. Algebra\u00a089, 163\u2013179 (1993)","journal-title":"J. Pure Appl. Algebra"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/199448.199528","volume-title":"Conf. Rec. POPL 1995","author":"S. Liang","year":"1995","unstructured":"Liang, S., Hudak, P., Jones, M.P.: Monad transformers and modular interpreters. In: Conf. Rec. POPL 1995, pp. 333\u2013343. ACM Press, New York (1995)"},{"key":"10_CR16","unstructured":"Milner, R.: Communicating and Mobile Systems: The Pi-Calculus. CUP (1999)"},{"key":"10_CR17","unstructured":"Moggi, E.: An abstract view of programming languages. Technical Report ECS-LFCS-90-113, Laboratory for Foundations of Computer Science, University of Edinburgh (1990)"},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E. Moggi","year":"1991","unstructured":"Moggi, E.: Notions of computation and monads. Inf. Comput.\u00a093(1), 55\u201392 (1991)","journal-title":"Inf. Comput."},{"key":"10_CR19","unstructured":"Newburn, J.: All about monads, v1.1.0, \n                    \n                      http:\/\/www.nomaware.com\/monads"},{"issue":"3","key":"10_CR20","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1145\/210346.210425","volume":"42","author":"P.W. O\u2019Hearn","year":"1995","unstructured":"O\u2019Hearn, P.W., Tennent, R.D.: Parametricity and local variables. J. ACM\u00a042(3), 658\u2013709 (1995); Reprinted in [21]","journal-title":"J. ACM"},{"volume-title":"Algol-like Languages","year":"1996","key":"10_CR21","unstructured":"O\u2019Hearn, P.W., Tennent, R.D. (eds.): Algol-like Languages. Birkh\u00e4user, Basel (1996)"},{"key":"10_CR22","unstructured":"Oles, F.J.: Functor categories and store shapes. Chapter 11 of [21]"},{"key":"10_CR23","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/B978-044482830-9\/50026-6","volume-title":"Handbook of Process Algebra","author":"J. Parrow","year":"2001","unstructured":"Parrow, J.: An introduction to the \u03c0-calculus. In: Handbook of Process Algebra, pp. 479\u2013543. Elsevier, Amsterdam (2001)"},{"key":"10_CR24","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0890-5401(03)00138-X","volume":"186","author":"A.M. Pitts","year":"2004","unstructured":"Pitts, A.M.: Nominal logic, a first order theory of names and binding. Inf. Comput.\u00a0186, 165\u2013193 (2004); Errata (September 2004)","journal-title":"Inf. Comput."},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-57182-5_8","volume-title":"Mathematical Foundations of Computer Science 1993","author":"A.M. Pitts","year":"1993","unstructured":"Pitts, A.M., Stark, I.: Observable properties of higher order functions that dynamically create local names, or: What\u2019s new? In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol.\u00a0711, pp. 122\u2013141. Springer, Heidelberg (1993)"},{"key":"10_CR26","unstructured":"Plotkin, G., Power, A.J.: Computational effects and operations: An overview (2002) (submitted for publication)"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-45931-6_24","volume-title":"Foundations of Software Science and Computation Structures","author":"G. Plotkin","year":"2002","unstructured":"Plotkin, G., Power, J.: Notions of computation determine monads. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol.\u00a02303, pp. 342\u2013356. Springer, Heidelberg (2002)"},{"issue":"1","key":"10_CR28","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. Appl. Categ. Struct.\u00a011(1), 69\u201394 (2003)","journal-title":"Appl. Categ. Struct."},{"issue":"7","key":"10_CR29","first-page":"83","volume":"6","author":"A.J. Power","year":"1999","unstructured":"Power, A.J.: Enriched Lawvere theories. Theory Appl. Categ.\u00a06(7), 83\u201393 (1999)","journal-title":"Theory Appl. Categ."},{"key":"10_CR30","first-page":"345","volume-title":"Proc. 1981 Int. Symp. on Algorithmic Languages","author":"J.C. Reynolds","year":"1981","unstructured":"Reynolds, J.C.: The essence of Algol. In: Proc. 1981 Int. Symp. on Algorithmic Languages, pp. 345\u2013372. North-Holland, Amsterdam (1981); Reprinted in [21]"},{"issue":"3\u20135","key":"10_CR31","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 Asp. Comput.\u00a013(3\u20135), 308\u2013326 (2002)","journal-title":"Formal Asp. Comput."},{"key":"10_CR32","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-Calculus: A Theory of Mobile Processes. CUP (2001)"},{"key":"10_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-540-30124-0_20","volume-title":"Computer Science Logic","author":"U. Sch\u00f6pp","year":"2004","unstructured":"Sch\u00f6pp, U., Stark, I.: A dependent type theory with names and binding. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol.\u00a03210, pp. 235\u2013249. Springer, Heidelberg (2004)"},{"key":"10_CR34","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1145\/944705.944729","volume-title":"Proc. ICFP 2003","author":"M.R. Shinwell","year":"2003","unstructured":"Shinwell, M.R., Pitts, A.M., Gabbay, M.J.: FreshML: Programming with binders made simple. In: Proc. ICFP 2003, pp. 263\u2013274. ACM Press, New York (2003); Erratum (May 2004)"},{"issue":"1","key":"10_CR35","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01806033","volume":"9","author":"I. Stark","year":"1996","unstructured":"Stark, I.: Categorical models for local names. LISP Symb. Comput.\u00a09(1), 77\u2013107 (1996)","journal-title":"LISP Symb. Comput."},{"key":"10_CR36","first-page":"36","volume-title":"Proc. LICS 1996","author":"I. Stark","year":"1996","unstructured":"Stark, I.: A fully abstract domain model for the \u03c0-calculus. In: Proc. LICS 1996, pp. 36\u201342. IEEE Comp. Soc. Press, Los Alamitos (1996)"},{"key":"10_CR37","first-page":"134","volume-title":"Proc. 1992 Glasgow Workshop on Functional Programming","author":"P. Wadler","year":"1993","unstructured":"Wadler, P., King, D.: Combining monads. In: Proc. 1992 Glasgow Workshop on Functional Programming, pp. 134\u2013143. Springer, Heidelberg (1993)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31982-5_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:44:41Z","timestamp":1620013481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31982-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540253884","9783540319825"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31982-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}