{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:51:59Z","timestamp":1725537119149},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642040801"},{"type":"electronic","value":"9783642040818"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04081-8_22","type":"book-chapter","created":{"date-parts":[[2009,8,31]],"date-time":"2009-08-31T12:27:08Z","timestamp":1251721628000},"page":"321-337","source":"Crossref","is-referenced-by-count":2,"title":["Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs"],"prefix":"10.1007","author":[{"given":"Richard","family":"Garner","sequence":"first","affiliation":[]},{"given":"Tom","family":"Hirschowitz","sequence":"additional","affiliation":[]},{"given":"Aur\u00e9lien","family":"Pardon","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0028008","volume-title":"Computer Science Logic","author":"A. Barber","year":"1998","unstructured":"Barber, A., Gardner, P., Hasegawa, M., Plotkin, G.: From action calculi to linear logic. In: Nielsen, M. (ed.) CSL 1997. LNCS, vol.\u00a01414. Springer, Heidelberg (1998)"},{"volume-title":"LICS 1999","year":"1999","author":"R. Bruni","key":"22_CR2","unstructured":"Bruni, R., Montanari, U.: Cartesian closed double categories, their lambda-notation, and the pi-calculus. In: LICS 1999. IEEE Computer Society, Los Alamitos (1999)"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/BFb0053547","volume-title":"Foundations of Software Science and Computation Structures","author":"L. Cardelli","year":"1998","unstructured":"Cardelli, L., Gordon, A.: Mobile ambients. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol.\u00a01378, p. 140. Springer, Heidelberg (1998)"},{"key":"22_CR4","series-title":"ENTCS","volume-title":"CTCS 2002","author":"M. Coccia","year":"2003","unstructured":"Coccia, M., Gadducci, F., Montanari, U.: GS\u00b7\u039b theories: A syntax for higher-order graphs. In: CTCS 2002. ENTCS, vol.\u00a069. Elsevier, Amsterdam (2003)"},{"key":"22_CR5","unstructured":"Damgaard, T., Birkedal, L.: Axiomatizing binding bigraphs. Nordic Journal of Computing\u00a013(1-2) (2006)"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Danos, V., Regnier, L.: The structure of multiplicatives. Archive for Mathematical Logic\u00a028 (1989)","DOI":"10.1007\/BF01622878"},{"key":"22_CR7","unstructured":"Debois, S.: Sortings & bigraphs. PhD thesis, IT University of Copenhagen (2008)"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/BFb0014049","volume-title":"Typed Lambda Calculi and Applications","author":"J. Despeyroux","year":"1995","unstructured":"Despeyroux, J., Felty, A., Hirschowitz, A.: Higher-order abstract syntax in Coq. In: Dezani-Ciancaglini, M., Plotkin, G. (eds.) TLCA 1995. LNCS, vol.\u00a0902, pp. 124\u2013138. Springer, Heidelberg (1995)"},{"volume-title":"LICS 1999","year":"1999","author":"M. Fiore","key":"22_CR9","unstructured":"Fiore, M., Plotkin, G., Turi, D.: Abstract syntax and variable binding. In: LICS 1999. IEEE Computer Society, Los Alamitos (1999)"},{"volume-title":"LICS 1999","year":"1999","author":"M.J. Gabbay","key":"22_CR10","unstructured":"Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax involving binders. In: LICS 1999. IEEE Computer Society, Los Alamitos (1999)"},{"key":"22_CR11","unstructured":"Garner, R.H.G., Hirschowitz, T., Pardon, A.: Graphical presentations of symmetric monoidal closed theories. CoRR, abs\/0810.4420 (2008)"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-540-78499-9_24","volume-title":"Foundations of Software Science and Computational Structures","author":"P. Gianantonio Di","year":"2008","unstructured":"Di Gianantonio, P., Honsell, F., Lenisa, M.: RPO, second-order contexts, and \u03bb-calculus. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 334\u2013349. Springer, Heidelberg (2008)"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Girard, J.-Y.: Linear logic. Theoretical Comput. Sci.\u00a050 (1987)","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Grohmann, D., Miculan, M.: Directed bigraphs. ENTCS\u00a0173 (2007)","DOI":"10.1016\/j.entcs.2007.02.031"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-73445-1_16","volume-title":"Logic, Language, Information and Computation","author":"A. Hirschowitz","year":"2007","unstructured":"Hirschowitz, A., Maggesi, M.: Modules over monads and linearity. In: Leivant, D., de Queiroz, R. (eds.) WoLLIC 2007. LNCS, vol.\u00a04576, pp. 218\u2013237. Springer, Heidelberg (2007)"},{"key":"22_CR16","unstructured":"Hirschowitz, T., Pardon, A.: Binding bigraphs as symmetric monoidal closed theories. CoRR, abs\/0810.4419 (2008)"},{"volume-title":"LICS 1999","year":"1999","author":"M. Hofmann","key":"22_CR17","unstructured":"Hofmann, M.: Semantical analysis of higher-order abstract syntax. In: LICS 1999. IEEE Computer Society, Los Alamitos (1999)"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Honsell, F., Miculan, M., Scagnetto, I.: Pi-calculus in (co)inductive-type theory. Theor. Comput. Sci.\u00a0253(2) (2001)","DOI":"10.1016\/S0304-3975(00)00095-5"},{"key":"22_CR19","unstructured":"Hughes, D.J.D.: Simple free star-autonomous categories and full coherence. ArXiv Mathematics e-prints, math\/0506521 (June 2005)"},{"key":"22_CR20","unstructured":"Jensen, O.H., Milner, R.: Bigraphs and mobile processes (revised). Technical Report TR580, University of Cambridge (2004)"},{"volume-title":"POPL","year":"1990","author":"Y. Lafont","key":"22_CR21","unstructured":"Lafont, Y.: Interaction nets. In: POPL. ACM, New York (1990)"},{"volume-title":"Introduction to Higher-Order Categorical Logic","year":"1986","author":"J. Lambek","key":"22_CR22","unstructured":"Lambek, J., Scott, P.: Introduction to Higher-Order Categorical Logic. Cambridge University Press, Cambridge (1986)"},{"key":"22_CR23","series-title":"Graduate Texts in Mathematics","volume-title":"Categories for the Working Mathematician","author":"S. Mac Lane","year":"1998","unstructured":"Mac Lane, S.: Categories for the Working Mathematician, 2nd edn. Graduate Texts in Mathematics, vol.\u00a05. Springer, Heidelberg (1998)","edition":"2"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Melli\u00e8s, P.-A.: Double categories: a modular model of multiplicative linear logic. Mathematical Structures in Computer Science\u00a012 (2002)","DOI":"10.1017\/S0960129501003498"},{"key":"22_CR25","unstructured":"Milner, R.: Bigraphs whose names have multiple locality. Technical Report TR603, University of Cambridge (2004)"},{"key":"22_CR26","doi-asserted-by":"crossref","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. Information and Computation\u00a0100(1) (1992)","DOI":"10.1016\/0890-5401(92)90009-5"},{"volume-title":"PLDI 1988","year":"1988","author":"F. Pfenning","key":"22_CR27","unstructured":"Pfenning, F., Elliott, C.: Higher-order abstract syntax. In: PLDI 1988. ACM, New York (1988)"},{"volume-title":"TCS 2008","year":"2008","author":"J. Rathke","key":"22_CR28","unstructured":"Rathke, J., Sobocinski, P.: Deconstructing behavioural theories of mobility. In: TCS 2008. Springer, Heidelberg (2008)"},{"key":"22_CR29","doi-asserted-by":"crossref","unstructured":"Sassone, V., Soboci\u0144ski, P.: Deriving bisimulation congruences using 2-categories. Nordic Journal of Computing\u00a010(2) (2003)","DOI":"10.7146\/brics.v10i1.21772"},{"volume-title":"LICS 2005","year":"2005","author":"V. Sassone","key":"22_CR30","unstructured":"Sassone, V., Soboci\u0144ski, P.: Reactive systems over cospans. In: LICS 2005. IEEE Press, Los Alamitos (2005)"},{"key":"22_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1007\/3-540-44612-5_62","volume-title":"Mathematical Foundations of Computer Science 2000","author":"M. Tanaka","year":"2000","unstructured":"Tanaka, M.: Abstract syntax and variable binding for linear binders. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, p. 670. Springer, Heidelberg (2000)"},{"key":"22_CR32","unstructured":"Trimble, T.: Linear logic, bimodules, and full coherence for autonomous categories. PhD thesis, Rutgers University (1994)"},{"key":"22_CR33","unstructured":"Wadsworth, C.: Semantics and pragmatics of the lambda calculus. PhD thesis, University of Oxford (1971)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2009 - Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04081-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T04:47:26Z","timestamp":1558500446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04081-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642040801","9783642040818"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04081-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}
