{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T08:55:16Z","timestamp":1754556916474,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637004"},{"type":"electronic","value":"9783540696315"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0052149","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T04:43:12Z","timestamp":1149655392000},"page":"21-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Partial proof trees, resource sensitive logics and syntactic constraints"],"prefix":"10.1007","author":[{"given":"Aravind K.","family":"Joshi","sequence":"first","affiliation":[]},{"given":"Seth","family":"Kulick","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,16]]},"reference":[{"issue":"4","key":"2_CR1","doi-asserted-by":"publisher","first-page":"1403","DOI":"10.2307\/2275485","volume":"56","author":"M. Abrusci","year":"1991","unstructured":"M. Abrusci. Phase semantics and sequent calculus for pure noncommutative classical linear prepositional logic. In The Journal of Symbolic Logic, 56(4):1403\u20131451, 1991.","journal-title":"The Journal of Symbolic Logic"},{"doi-asserted-by":"crossref","unstructured":"M. Abrusci, Ch. Fouquer\u00e9, J. Vauzeilles. Tree adjoining grammar and non-commutative linear logic. In this volume, 1997.","key":"2_CR2","DOI":"10.1007\/BFb0052153"},{"unstructured":"G. Barry, M. Hepple, N. Leslie, G. Morrill. Proof figures and structural operators for categorial grammar. In Proceedings of the Fifth Conference of the European Chapter of the Association for Computational Linguistics.","key":"2_CR3"},{"doi-asserted-by":"crossref","unstructured":"Jacques Garrigue and Hassan A\u00cft-Kaci. The typed polymorphic label-selective \u03bb-calculus. POPL 1994.","key":"2_CR4","DOI":"10.1145\/174675.174434"},{"doi-asserted-by":"crossref","unstructured":"Jean-Yves Girard. Linear Logic: Its syntax and semantics. In Girard, Lafont, and Regnier, eds., Advances in Linear Logic, Cambridge University Press, Cambridge, England, pp. 1\u201342.","key":"2_CR5","DOI":"10.1017\/CBO9780511629150.002"},{"unstructured":"Mark Johnson. Natural deduction and proof nets intuitionistic linear logic. Manuscript, Brown University. 1996.","key":"2_CR6"},{"unstructured":"Aravind K. Joshi, K. Vijay-Shanker, and David Weir. The convergence of mildly context-sensitive grammar formalisms. In P. Sells, S. Shieber, and T. Wasow, eds., Foundational Issues in Natural Language Processing, Cambridge, MA:MIT Press.","key":"2_CR7"},{"key":"2_CR8","volume-title":"TAGs in categorial clothing, presented at the Tree Adjoining Grammar Workshop (TAG+)","author":"A. K. Joshi","year":"1992","unstructured":"Aravind K. Joshi. TAGs in categorial clothing, presented at the Tree Adjoining Grammar Workshop (TAG+), Institute for Research in Cognitive Science, University of Pennsylvania, Philadelphia, June 1992. A revised version, \u2018Unfolded Types', was presented at the Logic and Language Workshop at LSA, Ohio State University, August 1993."},{"unstructured":"Aravind Joshi and Seth Kulick Partial proof trees as building blocks for a categorial grammar. To appear in Linguistics and Philosophy, 1997.","key":"2_CR9"},{"key":"2_CR10","volume-title":"Handbook of Formal Languages and Automata, Vol. 3","author":"A. K. Joshi","year":"1997","unstructured":"Aravind K. Joshi and Yves Schabes. Tree adjoining grammars. To appear in Arto Saolmaa and Gzegorz Rosenberg, eds., Handbook of Formal Languages and Automata, Vol. 3, Springer-Verlag, Heidelberg, 1997."},{"unstructured":"R. Kasper, B. Kiefer, K. Netter, and K. Vijay-Shanker. Compilation of HPSG to TAG. In 30th Annual Meeting of the Association for Computational Linguistics.","key":"2_CR11"},{"unstructured":"Anthony S. Kroch and Aravind K. Joshi. The linguistic relevance of tree adjoining grammars. Technical Report MS-CIS-85-16, Department of Computer and Information Science, University of Pennsylvania, 1985.","key":"2_CR12"},{"key":"2_CR13","volume-title":"Words as Modules: a lexicalised grammar in the framework of linear logic proof nets","author":"A. Lecomte","year":"1997","unstructured":"Alain Lecomte and Christian Retor\u00e9. Words as Modules: a lexicalised grammar in the framework of linear logic proof nets. In Carlos Martin-Vide, editor, Proceedings of the 2nd International Conference on Mathematical Linguistics, John Benjamins Publishing Company, Amsterdam, 1997."},{"key":"2_CR14","doi-asserted-by":"crossref","DOI":"10.1515\/9783112329580","volume-title":"Categorial Investigations: Logical and Linguistic Aspects of the Lambek Calculus","author":"M. Moortgat","year":"1988","unstructured":"Michael Moortgat. Categorial Investigations: Logical and Linguistic Aspects of the Lambek Calculus Foris, Dordrecht, 1988."},{"unstructured":"Glyn Morrill. Type-logical grammar. Kluwer, Dordrecht.","key":"2_CR15"},{"issue":"No.2","key":"2_CR16","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1093\/jigpal\/3.2-3.403","volume":"3","author":"G. Morrill","year":"1995","unstructured":"Glyn Morrill. Clausal Proofs and Discontinuity In Bulletin of the IGPL, Vol. 3, No. 2,3, pp. 403\u2013427. 1995.","journal-title":"Bulletin of the IGPL"},{"unstructured":"Christian Retor\u00e9. Calcul de Lambek et logique lin\u00e9aire. Traitement Automatique des Langues 37(2):39\u201370.","key":"2_CR17"},{"unstructured":"Dirk Roorda. Resource Logics: proof-theoretical investigations, Ph.D. dissertation, Universiteit van Amsterdam. 1991.","key":"2_CR18"},{"issue":"4","key":"2_CR19","first-page":"481","volume":"18","author":"K. Vijay-Shanker","year":"1992","unstructured":"K. Vijay-Shanker. 1992. Using descriptions of trees in a tree adjoining grammar. Computational Linguistics, 18(4):481\u2013517.","journal-title":"Computational Linguistics"},{"unstructured":"The XTAG-Group. A lexicalized tree adjoining grammar for english. Technical Report IRCS 95-03, University of Pennsylvania. 1995.","key":"2_CR20"},{"doi-asserted-by":"crossref","unstructured":"D.N. Yetter. Quantales and (noncommutative) linear logic. In Journal of Symbolic Logic 55, pp. 41\u201364.","key":"2_CR21","DOI":"10.2307\/2274953"}],"container-title":["Lecture Notes in Computer Science","Logical Aspects of Computational Linguistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052149","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T23:18:02Z","timestamp":1676675882000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0052149"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637004","9783540696315"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0052149","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"16 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}