2007 |
31 | EE | Philippe de Groote,
Sarah Maarek,
Ryo Yoshinaka:
On Two Extensions of Abstract Categorial Grammars.
LPAR 2007: 273-287 |
2004 |
30 | EE | Philippe de Groote,
Sylvain Salvati:
Higher-Order Matching in the Linear lambda-calculus with Pairing.
CSL 2004: 220-234 |
29 | EE | Philippe de Groote,
Bruno Guillaume,
Sylvain Salvati:
Vector Addition Tree Automata.
LICS 2004: 64-73 |
28 | EE | Philippe de Groote,
Sylvain Pogodalla:
On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms.
Journal of Logic, Language and Information 13(4): 421-438 (2004) |
2003 |
27 | EE | Sylvain Salvati,
Philippe de Groote:
On the Complexity of Higher-Order Matching in the Linear lambda-Calculus.
RTA 2003: 234-245 |
2002 |
26 | EE | Philippe de Groote:
On the Strong Normalisation of Intuitionistic Natural Deduction with Permutation-Conversions.
Inf. Comput. 178(2): 441-464 (2002) |
25 | | Philippe de Groote,
François Lamarche:
Classical Non-Associative Lambek Calculus.
Studia Logica 71(3): 355-388 (2002) |
2001 |
24 | | Philippe de Groote,
Glyn Morrill,
Christian Retoré:
Logical Aspects of Computational Linguistics, 4th International Conference, LACL 2001, Le Croisic, France, June 27-29, 2001, Proceedings
Springer 2001 |
23 | EE | Philippe de Groote:
Towards Abstract Categorial Grammars.
ACL 2001: 148-155 |
22 | EE | Philippe de Groote:
Strong Normalization of Classical Natural Deduction with Disjunction.
TLCA 2001: 182-196 |
21 | EE | Guillaume Bonfante,
Philippe de Groote:
Stochastic Lambek Categorial Grammars.
Electr. Notes Theor. Comput. Sci. 53: (2001) |
2000 |
20 | EE | Philippe de Groote:
Proof-Search in Implicative Linear Logic as a Matching Problem.
LPAR 2000: 257-274 |
19 | | Philippe de Groote:
Linear Higher-Order Matching Is NP-Complete.
RTA 2000: 127-140 |
1999 |
18 | EE | Philippe de Groote:
A dynamic programming approach to categorial deduction.
CADE 1999: 1-15 |
17 | EE | Philippe de Groote:
On the Strong Normalisation of Natural Deduction with Permutation-Conversions.
RTA 1999: 45-59 |
16 | | Philippe de Groote:
The Non-Associative Lambek Calculus with Product in Polynomial Time.
TABLEAUX 1999: 128-139 |
15 | EE | Philippe de Groote:
An Algebraic Correctness Criterion for Intuitionistic Multiplicative Proof-Nets.
Theor. Comput. Sci. 224(1-2): 115-134 (1999) |
1998 |
14 | | Philippe de Groote,
Guy Perrier:
A Note on Kobayashi's and Yonezawa's ``Asynchronous Communication Model Based on Linear Logic''.
Formal Asp. Comput. 10(2): 160-170 (1998) |
13 | | Philippe de Groote:
An environment machine for the lambda-mu-calculus.
Mathematical Structures in Computer Science 8(6): 637-669 (1998) |
1997 |
12 | | Philippe de Groote:
Typed Lambda Calculi and Applications, Third International Conference on Typed Lambda Calculi and Applications, TLCA '97, Nancy, France, April 2-4, 1997, Proceedings
Springer 1997 |
11 | | Philippe de Groote:
An Algebraic Correctness Criterion for Intuitionistic Proof-Nets.
LFCS 1997: 130-140 |
10 | | Denis Béchet,
Philippe de Groote,
Christian Retoré:
A Complete Axiomatisation for the Inclusion of Series-Parallel Partial Orders.
RTA 1997: 230-240 |
1996 |
9 | EE | Denis Béchet,
Philippe de Groote:
Constructing Different Phonological Bracketings from a Proof Net.
LACL 1996: 118-133 |
1995 |
8 | | Philippe de Groote:
Linear Logic with Isabelle: Pruning the Proof Search Tree.
TABLEAUX 1995: 263-277 |
7 | | Philippe de Groote:
A Simple Calculus of Exception Handling.
TLCA 1995: 201-215 |
1994 |
6 | | Philippe de Groote:
A CPS-Translation of the Lambda-µ-Calculus.
CAAP 1994: 85-99 |
5 | | Philippe de Groote:
Strong Normalization in a Non-Deterministic Typed Lambda-Calculus.
LFCS 1994: 142-152 |
4 | | Philippe de Groote:
On the Relation between the Lambda-Mu-Calculus and the Syntactic Theory of Sequential Control.
LPAR 1994: 31-43 |
1993 |
3 | | Philippe de Groote:
Defining Lambda-Typed Lambda-Calculi by Axiomatizing the Typing Relation.
STACS 1993: 712-723 |
2 | | Philippe de Groote:
The Conservation Theorem revisited.
TLCA 1993: 163-178 |
1992 |
1 | | Philippe de Groote:
Denotations for Classical Proofs - Preliminary Results.
LFCS 1992: 105-116 |