{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:15Z","timestamp":1760202615511},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240587"},{"type":"electronic","value":"9783540305385"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30538-5_18","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:40:30Z","timestamp":1268401230000},"page":"211-223","source":"Crossref","is-referenced-by-count":8,"title":["Adjunct Elimination Through Games in Static Ambient Logic"],"prefix":"10.1007","author":[{"given":"Anuj","family":"Dawar","sequence":"first","affiliation":[]},{"given":"Philippa","family":"Gardner","sequence":"additional","affiliation":[]},{"given":"Giorgio","family":"Ghelli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"215","DOI":"10.2307\/421090","volume":"5","author":"P. O\u2019Hearn","year":"1999","unstructured":"O\u2019Hearn, P., Pym, D.: The logic of bunched implications. Bulletin of Symbolic Logic\u00a05, 215\u2013244 (1999)","journal-title":"Bulletin of Symbolic Logic"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1017\/S0960129504004141","volume":"14","author":"L. Cardelli","year":"2004","unstructured":"Cardelli, L., Ghelli, G.: TQL: A query language for semistructured data based on the ambient logic. Mathematical Structures in Comp. Sci.\u00a014, 285\u2013327 (2004)","journal-title":"Mathematical Structures in Comp. Sci."},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-36576-1_14","volume-title":"Foundations of Software Science and Computational Structures","author":"L. Cardelli","year":"2003","unstructured":"Cardelli, L., Gardner, P., Ghelli, G.: Manipulating trees with hidden labels. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol.\u00a02620, pp. 216\u2013232. Springer, Heidelberg (2003)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Gordon, A.: Anytime, anywhere: modal logics for mobile ambients. In: Proc. of POPL 2000., pp. 365\u2013377 (2000)","DOI":"10.1145\/325694.325742"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Ishtiaq, S., O\u2019Hearn, P.: BI as an assertion language for mutable data structures. In: Proc. of POPL 2001., pp. 14\u201326 (2001)","DOI":"10.1145\/373243.375719"},{"key":"18_CR6","unstructured":"Yang, H.: An example of local reasoning in BI pointer logic: the Schorr-Waite graph marking algorithm. In: Proc. of SPACE 2001 Workshop, London (2001)"},{"key":"18_CR7","unstructured":"Lozes, E.: Adjuncts elimination in the static ambient logic. In: Proc. of Express 2003, Marseille (2003)"},{"key":"18_CR8","volume-title":"Finite Model Theory","author":"H.D. Ebbinghaus","year":"1999","unstructured":"Ebbinghaus, H.D., Flum, J.: Finite Model Theory, vol.\u00a02. Springer, Heidelberg (1999)"},{"key":"18_CR9","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, pp. 140\u2013155. Springer, Heidelberg (1998)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/3-540-45413-6_8","volume-title":"Typed Lambda Calculi and Applications","author":"L. Cardelli","year":"2001","unstructured":"Cardelli, L., Gordon, A.D.: Logical properties of name restriction. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol.\u00a02044, pp. 46\u201360. Springer, Heidelberg (2001)"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects of Computing (2002)","DOI":"10.1007\/s001650200016"},{"key":"18_CR12","unstructured":"Caires, L.: A specification logic for mobility. Technical Report 4\/2000, DI\/FCT\/UNL (2000)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45500-0_1","volume-title":"Theoretical Aspects of Computer Software","author":"L. Caires","year":"2001","unstructured":"Caires, L., Cardelli, L.: A spatial logic for concurrency (Part I). In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol.\u00a02215, pp. 1\u201337. Springer, Heidelberg (2001)"},{"key":"18_CR14","unstructured":"Dawar, A., Ghelli, G., Gardner, P.: Adjunct elimination through games (unpublished)"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30538-5_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:58:46Z","timestamp":1605761926000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30538-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240587","9783540305385"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30538-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}