Christian RETORÉ
Christian RETORÉ
professeur d'informatique, université de Montpellier
lirmm.fr üzerinde doğrulanmış e-posta adresine sahip - Ana Sayfa
Başlık
Alıntı yapanlar
Alıntı yapanlar
Yıl
Derivational minimalism
E Stabler
International Conference on Logical Aspects of Computational Linguistics, 68-95, 1996
6031996
The logic of categorial grammars
R Moot, C Retoré
Springer LNCS, 2012
145*2012
The logic of categorial grammars: a deductive account of natural language syntax and semantics
Moot, Richard, C Retoré
Springer, 2012
1452012
Pomset logic: a non-commutative extension of classical linear logic
C Retoré
International Conference on Typed Lambda Calculi and Applications, 300-318, 1997
1181997
The mix rule
A Fleury, C Retoré
Mathematical Structures in Computer Science 4 (2), 273-285, 1994
871994
Réseaux et séquents ordonnés
C Retoré
Université Paris-Diderot-Paris VII, 1993
791993
Handsome proof-nets: perfect matchings and cographs
C Retoré
Theoretical Computer Science 294 (3), 473-488, 2003
702003
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
701997
An automata-theoretic approach to minimalism
GM Kobele, C Retoré, S Salvati
Model theoretic syntax at 10, 71-80, 2007
652007
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
642010
On the semantic readings of proof-nets
P De Groote, C Retoré
Formal grammar 1996, 57--70, 1996
621996
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
572001
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
542014
Calcul de Lambek et logique linéaire
C Retoré
Traitement Automatique des Langues 37 (2), 39-70, 1996
541996
Proof nets for the Lambek calculus—an overview
F Lamarche, C Retoré
Proceedings of the Third Roma Workshop” Proofs and Linguistic Categories …, 1996
521996
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
452001
Pomset logic as a calculus of directed cographs
C Retoré
INRIA, 1999
371999
A semantic characterisation of the correctness of a proof net
C Retoré
Mathematical Structures in Computer Science 7 (5), 445-452, 1997
351997
Pomset logic as an alternative categorial grammar
A Lecomte, C Retoré
Formal Grammar, 181-196, 1995
351995
Towards a minimal logic for minimalist grammars
A Lecomte, C Retoré
Proceedings, Formal Grammar 99, 1999
321999
Sistem, işlemi şu anda gerçekleştiremiyor. Daha sonra yeniden deneyin.
Makaleler 1–20