Partial proof trees, resource sensitive logics and syntactic constraints

1. M. Abrusci. Phase semantics and sequent calculus for pure noncommutative classical linear prepositional logic. In The Journal of Symbolic Logic, 56(4):1403–1451, 1991.

   Article  MATH  MathSciNet  Google Scholar 

2. M. Abrusci, Ch. Fouqueré, J. Vauzeilles. Tree adjoining grammar and non-commutative linear logic. In this volume, 1997.

   Google Scholar 

3. 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.

   Google Scholar 

4. Jacques Garrigue and Hassan AÏt-Kaci. The typed polymorphic label-selective λ-calculus. POPL 1994.

   Google Scholar 

5. 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–42.

   Google Scholar 

6. Mark Johnson. Natural deduction and proof nets intuitionistic linear logic. Manuscript, Brown University. 1996.

   Google Scholar 

7. 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.

   Google Scholar 

8. 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, ‘Unfolded Types', was presented at the Logic and Language Workshop at LSA, Ohio State University, August 1993.

   Google Scholar 

9. Aravind Joshi and Seth Kulick Partial proof trees as building blocks for a categorial grammar. To appear in Linguistics and Philosophy, 1997.

   Google Scholar 

10. 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.

    Google Scholar 

11. 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.

    Google Scholar 

12. 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.

    Google Scholar 

13. Alain Lecomte and Christian Retoré. 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.

    Google Scholar 

14. Michael Moortgat. Categorial Investigations: Logical and Linguistic Aspects of the Lambek Calculus Foris, Dordrecht, 1988.

    Google Scholar 

15. Glyn Morrill. Type-logical grammar. Kluwer, Dordrecht.

    Google Scholar 

16. Glyn Morrill. Clausal Proofs and Discontinuity In Bulletin of the IGPL, Vol. 3, No. 2,3, pp. 403–427. 1995.

    MATH  MathSciNet  Google Scholar 

17. Christian Retoré. Calcul de Lambek et logique linéaire. Traitement Automatique des Langues 37(2):39–70.

    Google Scholar 

18. Dirk Roorda. Resource Logics: proof-theoretical investigations, Ph.D. dissertation, Universiteit van Amsterdam. 1991.

    Google Scholar 

19. K. Vijay-Shanker. 1992. Using descriptions of trees in a tree adjoining grammar. Computational Linguistics, 18(4):481–517.

    Google Scholar 

20. The XTAG-Group. A lexicalized tree adjoining grammar for english. Technical Report IRCS 95-03, University of Pennsylvania. 1995.

    Google Scholar 

21. D.N. Yetter. Quantales and (noncommutative) linear logic. In Journal of Symbolic Logic 55, pp. 41–64.

    Google Scholar 

Download references