{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T11:04:48Z","timestamp":1770289488687,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642548291","type":"print"},{"value":"9783642548307","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54830-7_26","type":"book-chapter","created":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T13:30:31Z","timestamp":1395408631000},"page":"396-410","source":"Crossref","is-referenced-by-count":20,"title":["Models of a Non-associative Composition"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Munch-Maccagnoni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"26_CR1","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1017\/S0960129503003980","volume":"13","author":"S. Abramsky","year":"2003","unstructured":"Abramsky, S.: Sequentiality vs. concurrency in games and logic. Math. Struct. Comput. Sci.\u00a013(4), 531\u2013565 (2003)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"3","key":"26_CR2","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1017\/S0956796807006612","volume":"18","author":"Z.M. Ariola","year":"2008","unstructured":"Ariola, Z.M., Herbelin, H.: Control Reduction Theories: the Benefit of Structural Substitution. Journal of Functional Programming\u00a018(3), 373\u2013419 (2008)","journal-title":"Journal of Functional Programming"},{"issue":"1-3","key":"26_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0168-0072(92)90073-9","volume":"56","author":"A. Blass","year":"1992","unstructured":"Blass, A.: A game semantics for linear logic. Ann. Pure Appl. Logic\u00a056(1-3), 183\u2013220 (1992)","journal-title":"Ann. Pure Appl. Logic"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1145\/357766.351262","volume":"35","author":"P.L. Curien","year":"2000","unstructured":"Curien, P.L., Herbelin, H.: The duality of computation. ACM SIGPLAN Notices\u00a035, 233\u2013243 (2000)","journal-title":"ACM SIGPLAN Notices"},{"issue":"3","key":"26_CR5","doi-asserted-by":"publisher","first-page":"755","DOI":"10.2307\/2275572","volume":"62","author":"V. Danos","year":"1997","unstructured":"Danos, V., Joinet, J.B., Schellinx, H.: A New Deconstructive Logic: Linear Logic. Journal of Symbolic Logic\u00a062(3), 755\u2013807 (1997)","journal-title":"Journal of Symbolic Logic"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S1571-0661(04)80078-1","volume":"20","author":"C. F\u00fchrmann","year":"1999","unstructured":"F\u00fchrmann, C.: Direct Models for the Computational Lambda Calculus. Electr. Notes Theor. Comput. Sci.\u00a020, 245\u2013292 (1999)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"3","key":"26_CR7","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1017\/S0960129500001328","volume":"1","author":"J.Y. Girard","year":"1991","unstructured":"Girard, J.Y.: A new constructive logic: Classical logic. Math. Struct. Comp. Sci.\u00a01(3), 255\u2013296 (1991)","journal-title":"Math. Struct. Comp. Sci."},{"key":"26_CR8","unstructured":"Herbelin, H.: C\u2019est maintenant qu\u2019on calcule, au c\u0153ur de la dualit\u00e9, Habilitation thesis (2005)"},{"issue":"2","key":"26_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0304-3975(93)90169-T","volume":"107","author":"B. Jacobs","year":"1993","unstructured":"Jacobs, B.: Comprehension categories and the semantics of type dependency. Theor. Comput. Sci.\u00a0107(2), 169\u2013207 (1993)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR10","unstructured":"Lafont, Y., Reus, B., Streicher, T.: Continuation Semantics or Expressing Implication by Negation. Technical report, University of Munich (1993)"},{"key":"26_CR11","unstructured":"Laurent, O.: Etude de la polarisation en logique. Th\u00e8se de doctorat, Universit\u00e9 Aix-Marseille\u00a0II (March 2002)"},{"issue":"2-3","key":"26_CR12","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.apal.2004.11.002","volume":"134","author":"O. Laurent","year":"2005","unstructured":"Laurent, O., Quatrini, M., Tortora de Falco, L.: Polarized and focalized linear and classical proofs. Ann. Pure Appl. Logic\u00a0134(2-3), 217\u2013264 (2005)","journal-title":"Ann. Pure Appl. Logic"},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/3-540-48959-2_17","volume-title":"Typed Lambda Calculi and Applications","author":"P.B. Levy","year":"1999","unstructured":"Levy, P.B.: Call-by-Push-Value: A Subsuming Paradigm. In: Girard, J.-Y. (ed.) TLCA 1999. LNCS, vol.\u00a01581, pp. 228\u2013243. Springer, Heidelberg (1999)"},{"key":"26_CR14","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/S1571-0661(04)80568-1","volume":"69","author":"Paul Blain Levy","year":"2003","unstructured":"Levy, P.B.: Adjunction models for call-by-push-value with stacks. In: Proc. Cat. Th. and Comp. Sci. ENTCS, vol.\u00a069 (2005)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"26_CR15","unstructured":"Loday, J.L.: Generalized bialgebras and triples of operads. arXiv preprint math\/0611885 (2006)"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.entcs.2004.06.057","volume":"122","author":"P.A. Melli\u00e8s","year":"2005","unstructured":"Melli\u00e8s, P.A.: Asynchronous Games 3 An Innocent Model of Linear Logic. Electr. Notes Theor. Comput. Sci.\u00a0122, 171\u2013192 (2005)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"5","key":"26_CR17","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1016\/j.apal.2009.07.018","volume":"161","author":"P.A. Melli\u00e8s","year":"2010","unstructured":"Melli\u00e8s, P.A., Tabareau, N.: Resource modalities in tensor logic. Ann. Pure Appl. Logic\u00a0161(5), 632\u2013653 (2010)","journal-title":"Ann. Pure Appl. Logic"},{"key":"26_CR18","unstructured":"Moggi, E.: Computational Lambda-Calculus and Monads. In: LICS (1989)"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-642-04027-6_30","volume-title":"Computer Science Logic","author":"G. Munch-Maccagnoni","year":"2009","unstructured":"Munch-Maccagnoni, G.: Focalisation and classical realisability. In: Gr\u00e4del, E., Kahle, R. (eds.) CSL 2009. LNCS, vol.\u00a05771, pp. 409\u2013423. Springer, Heidelberg (2009)"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Munch-Maccagnoni, G.: Syntax and Models of a non-Associative Composition of Programs and Proofs. PhD thesis, Univ. Paris Diderot (2013)","DOI":"10.1007\/978-3-642-54830-7_26"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Murthy, C.R.: A Computational Analysis of Girard\u2019s Translation and LC. In: LICS, pp. 90\u2013101. IEEE Computer Society (1992)","DOI":"10.1109\/LICS.1992.185523"},{"key":"26_CR22","unstructured":"Selinger, P.: Re: co-exponential question. Message to the Category Theory mailing list (July 1999), http:\/\/permalink.gmane.org\/gmane.science.mathematics.categories\/1181"},{"issue":"2","key":"26_CR23","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1017\/S096012950000311X","volume":"11","author":"P. Selinger","year":"2001","unstructured":"Selinger, P.: Control Categories and Duality: On the Categorical Semantics of the Lambda-Mu Calculus. Math. Struct in Comp. Sci.\u00a011(2), 207\u2013260 (2001)","journal-title":"Math. Struct in Comp. Sci."},{"key":"26_CR24","unstructured":"Thielecke, H.: Categorical Structure of Continuation Passing Style. PhD thesis, University of Edinburgh (1997)"},{"issue":"1-3","key":"26_CR25","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.apal.2008.01.001","volume":"153","author":"Noam Zeilberger","year":"2008","unstructured":"Zeilberger, N.: On the unity of duality. Ann. Pure and App. Logic\u00a0153(1) (2008)","journal-title":"Annals of Pure and Applied Logic"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54830-7_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T03:46:52Z","timestamp":1746157612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54830-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642548291","9783642548307"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54830-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}