Theoretical Computer Science
Monadic second-order definable graph transductions: a survey
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
LACL '96 Selected papers from the First International Conference on Logical Aspects of Computational Linguistics
Derivational Minimalism Is Mildly Context-Sensitive
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
On the Distinction between Model-Theoretic and Generative-Enumerative Syntactic Frameworks
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Linear context-free rewriting systems and deterministic tree-walking transducers
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
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
Movement-generalized minimalist grammars
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
Controlling extraction in abstract categorial grammars
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Hi-index | 0.00 |
In this paper, we aim at understanding the derivations of minimalist grammars without the shortest move constraint. This leads us to study the relationship of those derivations with logic. In particular we show that the membership problem of minimalist grammars without the shortest move constraint is as difficult as provability in Multiplicative Exponential Linear Logic. As a byproduct, this result gives us a new representation of those derivations with linear λ-terms. We show how to interpret those terms in a homomorphic way so as to recover the sentence they analyse. As the homorphisms we describe are rather evolved, we turn to a proof-net representation and explain how Monadic Second Order Logic and related techniques allow us both to define those proof-nets and to retrieve the sentence they analyse.