LACL '96 Selected papers from the First International Conference on Logical Aspects of Computational Linguistics
Journal of Functional Programming
Towards abstract categorial grammars
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Extending Lambek grammars: a logical account of minimalist grammars
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Hi-index | 0.01 |
Stabler proposes an implementation of the Chomskyan Minimalist Program [1] with Minimalist Grammars (MG) [2]. This framework inherits a long linguistic tradition. But the semantic calculus is more easily added if one uses the Curry-Howard isomorphism. Minimalist Categorial Grammars (MCG), based on an extension of the Lambek calculus, the mixed logic, were introduced to provide a theoretically-motivated syntax-semantics interface [3]. In this article, we give full definitions of MG with algebraic tree descriptions and of MCG, and take the first steps towards giving a proof of inclusion of their generated languages.