Derivational minimalism E Stabler International conference on logical aspects of computational linguistics, 68-95, 1996 | 678 | 1996 |
The logic of categorial grammars R Moot, C Retoré Springer LNCS, 2012 | 189* | 2012 |
The logic of categorial grammars: a deductive account of natural language syntax and semantics Moot, Richard, C Retoré Springer, 2012 | 189 | 2012 |
Pomset logic: a non-commutative extension of classical linear logic C Retoré International Conference on Typed Lambda Calculi and Applications, 300-318, 1997 | 133 | 1997 |
The mix rule A Fleury, C Retoré Mathematical Structures in Computer Science 4 (2), 273-285, 1994 | 103 | 1994 |
Réseaux et séquents ordonnés C Retoré Université Paris-Diderot-Paris VII, 1993 | 91 | 1993 |
A complete axiomatisation for the inclusion of series-parallel partial orders D Bechet, P De Groote, C Retoré International Conference on Rewriting Techniques and Applications, 230-240, 1997 | 88 | 1997 |
Handsome proof-nets: perfect matchings and cographs C Retoré Theoretical Computer Science 294 (3), 473-488, 2003 | 87 | 2003 |
An automata-theoretic approach to minimalism GM Kobele, C Retoré, S Salvati Model theoretic syntax at 10, 71-80, 2007 | 76 | 2007 |
The Montagovian generative lexicon λTyn: a type theoretical framework for natural language semantics C Retoré 19th international conference on types for proofs and programs (TYPES 2013 …, 2014 | 70 | 2014 |
Towards a type-theoretical account of lexical semantics C Bassac, B Mery, C Retoré Journal of Logic, Language and Information 19, 229-245, 2010 | 65 | 2010 |
On the semantic readings of proof-nets P De Groote, C Retoré Formal grammar 1996, 57--70, 1996 | 64 | 1996 |
Extending Lambek grammars: a logical account of minimalist grammars A Lecomte, C Retoré Proceedings of the 39th Annual Meeting of the Association for Computational …, 2001 | 63 | 2001 |
Proof nets for the Lambek calculus—an overview F Lamarche, C Retoré Proceedings of the Third Roma Workshop” Proofs and Linguistic Categories …, 1996 | 63 | 1996 |
Calcul de Lambek et logique linéaire C Retoré Traitement Automatique des Langues 37 (2), 39-70, 1996 | 60 | 1996 |
Pomset logic as a calculus of directed cographs C Retoré INRIA, 1999 | 51 | 1999 |
Learning rigid lambek grammars and minimalist grammars from structured sentences R Bonato, C Retoré Third workshop on learning language in logic, Strasbourg 21, 431-454, 2001 | 45 | 2001 |
A semantic characterisation of the correctness of a proof net C Retoré Mathematical Structures in Computer Science 7 (5), 445-452, 1997 | 41 | 1997 |
Pomset logic as an alternative categorial grammar A Lecomte, C Retoré Formal Grammar, 181-196, 1995 | 40 | 1995 |
Perfect matchings and series-parallel graphs: multiplicatives proof nets as r&b-graphs C Retoré Electronic Notes in Theoretical Computer Science 3, 167-182, 1996 | 33 | 1996 |