dblp.uni-trier.dewww.uni-trier.de

Denis Béchet Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

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

Coauthor Index

1Alexander Ja. Dikovsky [10] [18]
2Annie Foret [7] [8] [9] [10] [11] [12] [13] [15] [18]
3Emmanuelle Garel [18]
4Philippe de Groote [2] [4]
5Sylvain Lippi [16] [17]
6Christian Retoré [4]
7Isabelle Tellier [9] [13]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)