On the membership problem for non-linear abstract categorial grammars

Journal of Logic, Language and Information

Volumn 19, Issue 2, 2010, Pages 163-183

  Salvati, Sylvain ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

Formal grammars; Intersection types; Lambda calculus; Montague semantics; Text generation

Indexed keywords

EID: 77952090144     PISSN: 09258531     EISSN: 15729583     Source Type: Journal    
DOI: 10.1007/s10849-009-9110-0     Document Type: Article

References (23)

1. Aoto T., Ono H. (1994) Non-uniqueness of normal proofs for minimal formulas in implication-conjunction fragment of BCK. Bulletin of the Section of Logic 23(3): 104-112.
2. Aoto T. (1999) Uniqueness of normal proofs in implicational intuitionistic logic. Journal of Logic, Language and Information 8(2): 217-242.
3. Barendregt, H. P. (1984). The lambda calculus: Its syntax and semantics, Vol. 103. Studies in logic and the foundations of mathematics. Amsterdam: North-Holland. revised edition.
4. Babaev A. A., & Soloviev S. V. (1982). Coherence theorem for canonical maps in cartesian closed categories. Journal of Soviet Mathematics, 20.
5. Damm W. (1982) The IO- and OI-hierarchies. Theoretical Computer Science 20: 95-207.
6. Dezani-Ciancaglini, M., Giovannetti, E., & de' Liguoro, U. (1998). Intersection types, lambda-models and Böhm trees. In MSJ-Memoir "Theories of Types and Proofs", Vol. 2, (pp. 45-97). Mathematical Society of Japan.
7. de Groote, P. (2001). Towards abstract categorial grammars. In Association for Computational Linguistic (Eds.), Proceedings 39th annual meeting and 10th conference of the European chapter, (pp. 148-155). Morgan Kaufmann Publishers.
8. de Groote, P. (2007). Towards a montagovian account of dynamics. In: Proceedings of semantics in linguistic theory XVI. CLC Publications.
9. Girard J. -Y., Taylor P., Lafont Y. (1989) Proofs and types. Cambridge University Press, Cambridge.
10. Hillebrand, G. G. (1994). Finite model theory in the simply typed lambda calculus. PhD thesis, Department of Computer Science, Brown University, Providence, Rhode Island 02912.
11. Hirokawa, S., & Tatsuta, M. (2000). Long D-normal form yields uniqueness of proofs. In Proceedings of logic colloqium.
12. Huet, G. (1976). Résolution d'équations dans des langages d'ordre 1, 2,...,ω. Thèse de doctorat es sciences mathématiques, Université Paris VII.
13. Kanazawa M. (2006) Abstract families of abstract categorial languages. Electronic Notes in Theoretical Computer Science 165: 65-80.
14. Kanazawa, M. (2007). Parsing and generation as datalog queries. In Proceedings of the 45th annual meeting of the association for computational linguistics (pp. 176-183). Association for Computational Linguistics.
15. Loader, R. (2001) The undecidability of λ-definability. In C. A. Anderson & M. Zeleny (Eds.), Logic, meaning and computation: Essays in memory of Alonzo church (pp. 331-342). Kluwer.
16. Montague R. (1974) Formal philosophy: Selected papers of Richard Montague. Yale University Press, New Haven, CT.
17. Pogodalla, S. (2001). Réseaux de preuve et génération pour les grammaires de types logiques. PhD thesis, Institut National Polytechnique de Lorraine.
18. Pogodalla, S. (2004). Computing semantic representation: Towards ACG abstract terms as derivation trees. In Proceedings of the seventh international workshop on tree adjoining grammar and related formalisms (TAG+7) (pp. 64-71).
19. Salvati, S. (2005). Problèmes de filtrage et problèmes d'analyse pour les grammaires catégorielles abstraites. PhD thesis, Institut National Polytechnique de Lorraine.
20. Seki H., Matsumura T., Fujii M., Kasami T. (1991) On multiple context free grammars. Theoretical Computer Science 88(2): 191-229.
21. Statman R. (1979) The typed lambda-calculus is not elementary recursive. Theoretical Computer Science 9: 73-81.
22. Takahashi M., Joshi A. K., Levy L. S. (1975) Tree adjunct grammars. Journal of Computer and System Sciences 10(1): 136-163.
23. Tatsuta, M. (1999). Uniqueness of d-normal proofs. In Proceedings of 7th Asian logic conference (pp. 41-42).