Philippe de Groote.
Définition et Propriétés d'un
métacalcul de représentation de théories.
Thèse de Doctorat, Université Catholique
de Louvain, Faculté des Sciences Appliquées, Février
1991.
Philippe de Groote.
Nederpelt's calculus extended with a notion of context
as a logical framework.
In G. Huet and G. Plotkin, editors,
Logical Frameworks,
pages
69-86. Cambridge University Press, 1991.
Philippe de Groote.
Denotations
for classical proofs - preliminary results.
In A. Nerode and M. Taitslin, editors,
Second International
Symposium on Logical Foundations of Computer Science, Tver'92, volume
620 of
Lecture Notes in Computer Science, pages 105-116. Springer,
1992.
Philippe de Groote.
The
conservation theorem revisited.
In M. Bezem and J.F. Groote, editors,
International
Conference on Typed Lambda Calculi and Applications, TLCA'93,
volume
664 of
Lecture Notes in Computer Science,
pages 163-178. Springer,
1993.
Philippe de Groote.
Defining
lambda-typed lambda-calculi by axiomatizing the typing relation.
In P. Enjalbert, A. Finkel, and K.W. Wagner, editors,
10th
Annual Symposium on Theoretical Aspects of Computer Science, STACS'93,
volume
665 of Lecture Notes in Computer Science,
pages 712-723. Springer,
1993.
Philippe de Groote.
A
CPS-translation of the lambda-mu-calculus.
In S. Tison, editor, 19th International Colloquium
on Trees in Algebra and Programming, CAAP'94,
volume 787 of Lecture
Notes in Computer Science, pages 85-99. Springer, 1994.
Philippe de Groote.
On
the relation between the lambda-mu-calculus and the syntactic theory of
sequential control.
In F. Pfenning, editor,
5th International Conference
on Logic Programming and Automated Reasoning, LPAR'94,
volume 822 of
Lecture
Notes in Artificial Intelligence,
pages 31-43. Springer, 1994.
Philippe de Groote.
Strong
normalization in a non-deterministic typed lambda-calculus.
In A. Nerode and Yu. V. Matiyasevich, editors,
3rd
international symposium on Logical Foundations of Computer Science, St
Petersburg'94, volume 813 of Lecture Notes in Computer Science,
pages
142-152. Springer, 1994.
Philippe de Groote, editor.
The Curry-Howard Isomorphism, volume 8 of Cahier
du centre de Logique.
Université Catholique de Louvain,
Academia, 1995.
Philippe de Groote.
A
simple calculus of exception handling.
In M. Dezani and G. Plotkin, editors, Second International
Conference on Typed Lambda Calculi and Applications, TLCA'95,
volume
902 of Lecture Notes in Computer Science, pages 201-215. Springer,
1995.
Philippe de Groote.
Linear
logic with Isabelle: pruning the proof search tree.
In P. Baumgartner, R. Hahnle and J. Posegga, editors,
4th
Workshop on Theorem Proving with Analytic Tableaux and Related Methods,
volume
918 of
Lecture Notes in Artificial Intelligence, pages 263-277.
Springer, 1995.
Denis Bechet and Philippe de Groote.
Constructing
Different Phonological Bracketings from a Proof Net
In C. Retoré, editor,
Logical Aspects of Computational
Linguistics, LACL'96,
volume 1328 of
Lecture Notes in Artificial
Intelligence, pages 118-133. Springer, 1997.
Philippe de Groote and Christian Retoré.
On
the semantic readings of proof nets,
In G.-J. Kruijff, G. Morrill, D. Oehrle, editors, Formal
Grammar,
, FoLLI, p. 57-70, Prague, august 1996.
Philippe de Groote.
Classical Logic and Exception Handling,
In J.M. H. Ehrig, F. von Henke and M. Wirsing, editors,
Specification
and Semantics,
Dagstuhl-Seminar-Report 151, 1996, pp. 11-12.
Philippe de Groote.
Partially
commutative linear logic: sequent calculus and phase semantics,
In V.M. Abrusci and C. Casadio, editors,
Proofs and
Linguistic Categories, Application of Logic tot the Analysis and Implementation
of Natural Langugae
Proceedings 1996 Roma Workshop, pp. 199-208, Cooperativa
Libraria Universitaria Editrice Bologna, 1996.
Philippe de Groote and J. Roger Hindley, editors.
Typed Lambda Calculi and Applications, Third International
Conference on Typed Lambda Calculi and Applications, TLCA'97, volume
1210 of Lecture Notes in Computer Science, Springer, 1997.
Denis Bechet, Philippe de Groote and Christian Retoré.
A
complete axiomatisation for the inclusion of series-parallel partial orders.
In H. Comon, editor,
Rewriting Techniques and Applications,
RTA'97
volume 1232 of
Lecture Notes in Computer Science, pages
230-240. Springer, 1997.
Philippe de Groote.
An
algebraic correctness criterion for intuitionistic proof-nets.
In S. Adian and A. Nerode, editors, 4th International
Symposium on Logical Foundations of Computer Science, LFCS'97
volume
1234 of Lecture Notes in Computer Science, pages 130-140. Springer,
1997.
Philippe de Groote.
On
the expressive power of the Lambek calculus extended with a structural
modality - Abstract.
In R. de Queiroz, 4th Workshop on Logic, Language,
Information and Computation, WoLLIC'97, Logic Journal of the IGPL,
Volume 6, pages 886-889, November 1997.
Ph. de Groote and G. Perrier
A
note on Kobayashi's and Yonezawa's ``Asynchronous Communication Model Based
on Linear Logic''.
Formal Aspects of Computing, 10:160-170, 1998.
Ph. de Groote
An
environment machine for the lambda-mu-calculus.
Mathematical Structure in Computer Science, 8:637-669,
1998.
Ph. de Groote
An
algebraic correctness criterion for intuitionistic multiplicative proofnets.
Theoretical Computer Science, 224:115-134, 1999.
Ph. de Groote.
The Non-associative Lambek calculus with product in polynomial
time.
In N. V. Murray, editor, Automatic Reasoning with
Analytic Tableaux and Related Methods, volume 1617 of Lecture Notes
in Artificial Intelligence, pages 128-139. Springer Verlag, 1999.
Ph. de Groote.
On the Strong Normalisation of Natural Deduction with
Permutation-Conversions.
In P. Narendran and M. Rusinowitch, editors, 10th
International Conference on Rewriting Techniques and Applications, RTA'99,
volume 1631 of Lecture Notes in Computer Science, pages 45-59. Springer
Verlag, 1999.
Ph. de Groote.
A dynamic programming approach to categorial deduction.
In H. Ganzinger, editor, 16th International Conference
on Automated Deduction, volume 1632 of Lecture Notes in Artificial
Intelligence, pages 1-15. Springer Verlag, 1999.
Ph. de Groote.
Higher-order linear matching is NP-complete.
In L. Bachmair, editor, 11th International Conference
on Rewriting Techniques and Applications, RTA 2000, volume 1833 of
Lecture
Notes in Computer Science, pages 127-140. Springer Verlag, 2000.
Ph. de Groote.
Proof-search in implicative linear logic as a matching
problem.
In M. Parigot and A. Voronkov, editors, 7th International
Conference on Logic Programming and Automated Reasoning, LPAR 2000,
volume 1955 of Lecture Notes in Artificial Intelligence, pages 257-274.
Springer Verlag, 2000.
Ph. de Groote.
Strong Normalization of Classical Natural Deduction with
Disjunction
In S. Abramsky, editor, Fifth International Conference
on Typed Lambda Calculi and Applications, TLCA'01, volume 2044 of Lecture
Notes in Computer Science, pages 182-196. Springer Verlag, 2001.
Ph. de Groote, G. Morrill and C. Retoré, editors.
Logical Aspects of Computational Linguistics, Fourth
International Conference, LACL'01. Volume 2099 of Lecture Notes
in Artificial Intelligence, Springer Verlag, 2001.
Ph. de Groote.
Towards Abstract Categorial Grammars
In: Association for Computational Linguistics, 39th
Annual Meeting and 10th Conference of the European Chapter, Proceedings
of the Conference, pages 148-155, Toulouse, France, 2001.
Ph. de Groote
Type raising, continuations, and classical logic.
In R. van Rooy and M. Stokhof, editors, Thirteenth
Amsterdam Colloquium, pages 97-101, Institute for Logic, Language and
Computation, Universiteit van Amsterdam, 2001.
Ph. de Groote.
Tree-Adjoining Grammars as Abstract Categorial Grammars.
In: TAG+6, Proceedings of the sixth International
Workshop on Tree Adjoining Grammars and Related Frameworks, pages 145-150,
Università di Venezia, May 2002.,