{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T04:36:46Z","timestamp":1747888606281,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662466773"},{"type":"electronic","value":"9783662466780"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46678-0_3","type":"book-chapter","created":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T13:42:21Z","timestamp":1427895741000},"page":"41-55","source":"Crossref","is-referenced-by-count":7,"title":["An Infinitary Model of Linear Logic"],"prefix":"10.1007","author":[{"given":"Charles","family":"Grellois","sequence":"first","affiliation":[]},{"given":"Paul-Andr\u00e9","family":"Melli\u00e8s","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/2071368.2071370","volume":"13","author":"D. Baelde","year":"2012","unstructured":"Baelde, D.: Least and greatest fixed points in linear logic. ACM Trans. Comput. Log.\u00a013(1), 2 (2012)","journal-title":"ACM Trans. Comput. Log."},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/BFb0014046","volume-title":"Typed Lambda Calculi and Applications","author":"G.M. Bierman","year":"1995","unstructured":"Bierman, G.M.: What is a categorical model of intuitionistic linear logic? In: Dezani-Ciancaglini, M., Plotkin, G. (eds.) TLCA 1995. LNCS, vol.\u00a0902, pp. 78\u201393. Springer, Heidelberg (1995)"},{"doi-asserted-by":"crossref","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration theories: the equational logic of iterative processes. EATCS monographs on theoretical computer science. Springer (1993)","key":"3_CR3","DOI":"10.1007\/978-3-642-78034-9_6"},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(95)00010-0","volume":"155","author":"S.L. Bloom","year":"1996","unstructured":"Bloom, S.L., \u00c9sik, Z.: Fixed-point operations on ccc\u2019s. part i. Theoretical Computer Science\u00a0155(1), 1\u201338 (1996)","journal-title":"Theoretical Computer Science"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-15205-4_16","volume-title":"Computer Science Logic","author":"A. Carraro","year":"2010","unstructured":"Carraro, A., Ehrhard, T., Salibra, A.: Exponentials with infinite multiplicities. In: Dawar, A., Veith, H. (eds.) CSL 2010. LNCS, vol.\u00a06247, pp. 170\u2013184. Springer, Heidelberg (2010)"},{"unstructured":"Fortier, J., Santocanale, L.: Cuts for circular proofs: semantics and cut-elimination. In: Rocca, S.R.D. (ed.) CSL. LIPIcs, vol.\u00a023, pp. 248\u2013262. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2013)","key":"3_CR6"},{"doi-asserted-by":"crossref","unstructured":"Grellois, C., Melli\u00e8s, P.-A.: Tensorial logic with colours and higher-order model checking (submitted, 2015), http:\/\/arxiv.org\/abs\/1501.04789","key":"3_CR7","DOI":"10.4204\/EPTCS.177.4"},{"doi-asserted-by":"crossref","unstructured":"Hasegawa, M.: Models of Sharing Graphs: A Categorical Semantics of Let and Letrec. Distinguished dissertations series, vol.\u00a01192. Springer (1999)","key":"3_CR8","DOI":"10.1007\/978-1-4471-0865-8"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1017\/S0305004100074338","volume":"119","author":"A. Joyal","year":"1996","unstructured":"Joyal, A., Street, R., Verity, D.: Traced monoidal categories. Mathematical Proceedings of the Cambridge Philosophical Society\u00a0119, 447\u2013468 (1996)","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"doi-asserted-by":"crossref","unstructured":"Kobayashi, N., Luke Ong, C.-H.: A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes. In: LICS, pp. 179\u2013188. IEEE Computer Society (2009)","key":"3_CR10","DOI":"10.1109\/LICS.2009.29"},{"unstructured":"Melli\u00e8s, P.-A.: Categorical semantics of linear logic. In: Interactive models of computation and program behaviour, pp. 1\u2013196 (2009)","key":"3_CR11"},{"unstructured":"Miquel, A.: Le calcul des constructions implicites: syntaxe et s\u00e9mantique. PhD thesis, Universit\u00e9 Paris 7 (2001)","key":"3_CR12"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-44904-3_18","volume-title":"Typed Lambda Calculi and Applications","author":"R. Montelatici","year":"2003","unstructured":"Montelatici, R.: Polarized proof nets with cycles and fixpoints semantics. In: Hofmann, M.O. (ed.) TLCA 2003. LNCS, vol.\u00a02701, pp. 256\u2013270. Springer, Heidelberg (2003)"},{"doi-asserted-by":"crossref","unstructured":"Salvati, S., Walukiewicz, I.: Evaluation is msol-compatible. In: Seth, A., Vishnoi, N.K. (eds.) FSTTCS. LIPIcs, vol.\u00a024, pp. 103\u2013114. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2013)","key":"3_CR14","DOI":"10.1002\/ev.20050"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-642-38946-7_15","volume-title":"Typed Lambda Calculi and Applications","author":"S. Salvati","year":"2013","unstructured":"Salvati, S., Walukiewicz, I.: Using models to model-check recursive schemes. In: Hasegawa, M. (ed.) TLCA 2013. LNCS, vol.\u00a07941, pp. 189\u2013204. Springer, Heidelberg (2013)"},{"doi-asserted-by":"crossref","unstructured":"Salvati, S., Walukiewicz, I.: Typing weak MSOL properties (September 2014)","key":"3_CR16","DOI":"10.1007\/978-3-662-46678-0_22"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/3-540-45931-6_25","volume-title":"Foundations of Software Science and Computation Structures","author":"L. Santocanale","year":"2002","unstructured":"Santocanale, L.: A calculus of circular proofs and its categorical semantics. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol.\u00a02303, pp. 357\u2013371. Springer, Heidelberg (2002)"},{"issue":"2","key":"3_CR18","first-page":"195","volume":"36","author":"L. Santocanale","year":"2002","unstructured":"Santocanale, L.: \u03bc-bicomplete categories and parity games. ITA\u00a036(2), 195\u2013227 (2002)","journal-title":"ITA"},{"doi-asserted-by":"crossref","unstructured":"Seely, R.A.G.: Linear logic, *-autonomous categories and cofree coalgebras. In: Categories in Computer Science and Logic, pp. 371\u2013382. American Mathematical Society (1989)","key":"3_CR19","DOI":"10.1090\/conm\/092\/1003210"},{"doi-asserted-by":"crossref","unstructured":"Simpson, A.K., Plotkin, G.D.: Complete axioms for categorical fixed-point operators. In: LICS 2000, USA, June 26-29, pp. 30\u201341. IEEE Computer Society (2000)","key":"3_CR20","DOI":"10.1109\/LICS.2000.855753"},{"unstructured":"Terui, K.: Semantic evaluation, intersection types and complexity of simply typed lambda calculus. In: Tiwari, A. (ed.) RTA. LIPIcs, vol.\u00a015, pp. 323\u2013338. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)","key":"3_CR21"},{"doi-asserted-by":"crossref","unstructured":"Tsukada, T., Luke Ong, C.-H.: Compositional higher-order model checking via \u03c9-regular games over b\u00f6hm trees. In: Henzinger, T.A., Miller, D. (eds.) CSL-LICS 2014, Vienna, Austria, July 14-18, p. 78. ACM (2014)","key":"3_CR22","DOI":"10.1145\/2603088.2603133"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46678-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T19:57:48Z","timestamp":1747857468000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46678-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662466773","9783662466780"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46678-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}