 | 2008 |
|---|
| 18 |       | Denis Béchet,
Alexander Ja. Dikovsky,
Annie Foret,
Emmanuelle Garel:
Optional and Iterated Types for Pregroup Grammars.
LATA 2008: 88-100 |
| 17 | | Denis Béchet,
Sylvain Lippi:
Universal Boolean Systems.
Electr. Notes Theor. Comput. Sci. 203(1): 19-30 (2008) |
| 16 | | Denis Béchet,
Sylvain Lippi:
Hard combinators.
Electr. Notes Theor. Comput. Sci. 203(1): 31-48 (2008) |
| 2007 |
|---|
| 15 | | Denis Béchet,
Annie Foret:
Fully Lexicalized Pregroup Grammars.
WoLLIC 2007: 12-25 |
| 14 | | Denis Béchet:
Parsing Pregroup Grammars and Lambek Calculus Using Partial Composition.
Studia Logica 87(2-3): 199-224 (2007) |
| 13 | | Denis Béchet,
Annie Foret,
Isabelle Tellier:
Learnability of Pregroup Grammars.
Studia Logica 87(2-3): 225-252 (2007) |
| 2006 |
|---|
| 12 | | 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) |
| 2005 |
|---|
| 11 | | Denis Béchet,
Annie Foret:
k-Valued Non-associative Lambek Grammars (Without Product) Form a Strict Hierarchy of Languages.
LACL 2005: 1-17 |
| 10 | | Denis Béchet,
Alexander Ja. Dikovsky,
Annie Foret:
Dependency Structure Grammars.
LACL 2005: 18-34 |
| 2004 |
|---|
| 9 | | Denis Béchet,
Annie Foret,
Isabelle Tellier:
Learnability of Pregroup Grammars.
ICGI 2004: 65-76 |
| 2003 |
|---|
| 8 | | Denis Béchet,
Annie Foret:
k-Valued Non-Associative Lambek Categorial Grammars are not Learnable from Strings.
ACL 2003: 351-358 |
| 7 | | Denis Béchet,
Annie Foret:
k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures.
Electr. Notes Theor. Comput. Sci. 84: (2003) |
| 2001 |
|---|
| 6 | | Denis Béchet:
Universal Interaction Systems with Only Two Agents.
RTA 2001: 3-14 |
| 1998 |
|---|
| 5 |  | Denis Béchet:
Minimality of the correctness criterion for multiplicative proof nets.
Mathematical Structures in Computer Science 8(6): 543-558 (1998) |
| 1997 |
|---|
| 4 | | Denis Béchet,
Philippe de Groote,
Christian Retoré:
A Complete Axiomatisation for the Inclusion of Series-Parallel Partial Orders.
RTA 1997: 230-240 |
| 1996 |
|---|
| 3 | | Denis Béchet:
Removing Value Encoding Using Alternative Values in Partial Evaluation of Strongly-Typed Languages.
ESOP 1996: 77-91 |
| 2 | | Denis Béchet,
Philippe de Groote:
Constructing Different Phonological Bracketings from a Proof Net.
LACL 1996: 118-133 |
| 1992 |
|---|
| 1 | | Denis Béchet:
Partial Evaluation of Interaction Nets.
WSA 1992: 331-338 |
