Christian RETORÉ
Christian RETORÉ
professeur d'informatique, université de Montpellier
Adresse e-mail validée de lirmm.fr - Page d'accueil
Titre
Citée par
Citée par
Année
Derivational minimalism
E Stabler
International Conference on Logical Aspects of Computational Linguistics, 68-95, 1996
5901996
The logic of categorial grammars
R Moot, C Retoré
Springer LNCS, 2012
134*2012
The logic of categorial grammars: a deductive account of natural language syntax and semantics
Moot, Richard, C Retoré
Springer, 2012
1342012
Pomset logic: a non-commutative extension of classical linear logic
C Retoré
International Conference on Typed Lambda Calculi and Applications, 300-318, 1997
1081997
The mix rule
A Fleury, C Retoré
Mathematical Structures in Computer Science 4 (2), 273-285, 1994
811994
Réseaux et séquents ordonnés
C Retoré
801993
Handsome proof-nets: perfect matchings and cographs
C Retoré
Theoretical Computer Science 294 (3), 473-488, 2003
632003
Towards a type-theoretical account of lexical semantics
C Bassac, B Mery, C Retoré
Journal of Logic, Language and Information 19 (2), 229-245, 2010
612010
On the semantic readings of proof-nets
P De Groote, C Retoré
611996
An automata-theoretic approach to minimalism
GM Kobele, C Retoré, S Salvati
Model theoretic syntax at 10, 71-80, 2007
592007
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
591997
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
582001
Calcul de Lambek et logique linéaire
C Retoré
Traitement Automatique des Langues 37 (2), 39-70, 1996
531996
Proof nets for the Lambek calculus—an overview
F Lamarche, C Retoré
Proceedings 1996 Roma Workshop. Proofs and Linguistic Categories, 241-262, 1996
521996
The montagovian generative lexicon lambda tyn: a type theoretical framework for natural language semantics
C Retoré
19th international conference on types for proofs and programs (TYPES 2013 …, 2014
492014
Learning rigid lambek grammars and minimalist grammars from structured sentences
R Bonato, C Retoré
Third workshop on learning language in logic, Strasbourg, 23-34, 2001
432001
Pomset logic as an alternative categorial grammar
A Lecomte, C Retoré
Formal Grammar, 181-196, 1995
351995
Meaning, logic and ludics
A Lecomte
Imperial College Press, 2011
342011
A semantic characterisation of the correctness of a proof net
C Retoré
Mathematical Structures in Computer Science 7 (5), 445-452, 1997
341997
Pomset logic as a calculus of directed cographs
C Retoré
321999
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20