Denis Béchet

Denis Béchet, Alexandre Ja. Dikovsky, Annie Foret: Categorial grammars with iterated types form a strict hierarchy of k-valued languages. Theor. Comput. Sci. 450: 22-30 (2012)

Ramadan Alfared, Denis Béchet: On the Adequacy of Three POS Taggers and a Dependency Parser. CICLing (1) 2012: 104-116

Denis Béchet, Alexander Ja. Dikovsky (Eds.): Logical Aspects of Computational Linguistics - 7th International Conference, LACL 2012, Nantes, France, July 2-4, 2012. Proceedings. Lecture Notes in Computer Science 7351, Springer 2012, isbn 978-3-642-31261-8

Denis Béchet, Alexander Ja. Dikovsky, Annie Foret: On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types. LACL 2011: 80-95

Denis Béchet, Alexander Ja. Dikovsky, Annie Foret: Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued Languages. CIAA 2011: 42-52

Denis Béchet, Alexander Ja. Dikovsky, Annie Foret: Two Models of Learning Iterated Dependencies. FG 2010: 17-32

Denis Béchet, Sylvain Lippi: Universal Boolean Systems. Electr. Notes Theor. Comput. Sci. 203(1): 19-30 (2008)

Denis Béchet, Sylvain Lippi: Hard combinators. Electr. Notes Theor. Comput. Sci. 203(1): 31-48 (2008)

Denis Béchet, Alexander Ja. Dikovsky, Annie Foret, Emmanuelle Garel: Optional and Iterated Types for Pregroup Grammars. LATA 2008: 88-100

Denis Béchet: Parsing Pregroup Grammars and Lambek Calculus Using Partial Composition. Studia Logica 87(2-3): 199-224 (2007)

Denis Béchet, Annie Foret, Isabelle Tellier: Learnability of Pregroup Grammars. Studia Logica 87(2-3): 225-252 (2007)

Denis Béchet, Annie Foret: Fully Lexicalized Pregroup Grammars. WoLLIC 2007: 12-25

Denis Béchet, Annie Foret: k-Valued non-associative Lambek grammars are learnable from generalized functor-argument structures. Theor. Comput. Sci. 355(2): 139-152 (2006)

Denis Béchet, Annie Foret: k-Valued Non-associative Lambek Grammars (Without Product) Form a Strict Hierarchy of Languages. LACL 2005: 1-17

Denis Béchet, Alexander Ja. Dikovsky, Annie Foret: Dependency Structure Grammars. LACL 2005: 18-34

Denis Béchet, Annie Foret, Isabelle Tellier: Learnability of Pregroup Grammars. ICGI 2004: 65-76

Denis Béchet, Annie Foret: k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures. Electr. Notes Theor. Comput. Sci. 84: 60-72 (2003)

Denis Béchet, Annie Foret: k-Valued Non-Associative Lambek Categorial Grammars are not Learnable from Strings. ACL 2003: 351-358

Denis Béchet: Universal Interaction Systems with Only Two Agents. RTA 2001: 3-14

Denis Béchet: Minimality of the correctness criterion for multiplicative proof nets. Mathematical Structures in Computer Science 8(6): 543-558 (1998)

Denis Béchet, Philippe de Groote, Christian Retoré: A Complete Axiomatisation for the Inclusion of Series-Parallel Partial Orders. RTA 1997: 230-240

Denis Béchet: Removing Value Encoding Using Alternative Values in Partial Evaluation of Strongly-Typed Languages. ESOP 1996: 77-91

Denis Béchet, Philippe de Groote: Constructing Different Phonological Bracketings from a Proof Net. LACL 1996: 118-133

Denis Béchet: Partial Evaluation of Interaction Nets. WSA 1992: 331-338