Philippe de Groote

Affiliations:
  • INRIA, France


According to our database1, Philippe de Groote authored at least 48 papers between 1992 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Extending Abstract Categorial Grammars with Feature Structures: Theory and Practice.
Proceedings of the Logic and Engineering of Natural Language Semantics, 2023

On the Semantics of Dependencies: Relative Clauses and Open Clausal Complements.
Proceedings of the Logic and Engineering of Natural Language Semantics, 2023

2022
Multityped Abstract Categorial Grammars and Their Composition.
Proceedings of the Logic, Language, Information, and Computation, 2022

Quantification Annotation in ISO 24617-12, Second Draft.
Proceedings of the Thirteenth Language Resources and Evaluation Conference, 2022

Deriving Formal Semantic Representations from Dependency Structures.
Proceedings of the Logic and Engineering of Natural Language Semantics, 2022

2021
Introducing ⦇ <i>λ</i> ⦈, a <i>λ</i>-calculus for effectful computation.
Theor. Comput. Sci., 2021

2020
A French Version of the FraCaS Test Suite.
Proceedings of The 12th Language Resources and Evaluation Conference, 2020

On Dialogue Modeling: A Dynamic Epistemic Inquisitive Approach.
Proceedings of the New Frontiers in Artificial Intelligence, 2020

2015
Proof-Theoretic Aspects of the Lambek-Grishin Calculus.
Proceedings of the Logic, Language, Information, and Computation, 2015

Abstract Categorial Parsing as Linear Logic Programming.
Proceedings of the 14th Meeting on the Mathematics of Language, 2015

On Logical Relations and Conservativity.
Proceedings of the Third Workshop on Natural Language and Computer Science, 2015

2014
A Type-Logical Account of Quantification in Event Semantics.
Proceedings of the New Frontiers in Artificial Intelligence, 2014

2013
A Note on Intensionalization.
J. Log. Lang. Inf., 2013

A Type-Theoretic Account of Neg-Raising Predicates in Tree Adjoining Grammars.
Proceedings of the New Frontiers in Artificial Intelligence, 2013

2011
About Parallel and Syntactocentric Formalisms: A Perspective from the Encoding of Convergent Grammar into Abstract Categorial Grammar.
Fundam. Informaticae, 2011

Implicit Arguments: Event Modification or Option Type Categories?
Proceedings of the Logic, Language and Meaning - 18th Amsterdam Colloquium, 2011

2010
Presupposition Accommodation as Exception Handling.
Proceedings of the SIGDIAL 2010 Conference, 2010

2009
On the Syntax-Semantics Interface: From Convergent Grammar to Abstract Categorial Grammar.
Proceedings of the Logic, 2009

2007
On Two Extensions of Abstract Categorial Grammars.
Proceedings of the Logic for Programming, 2007

2004
On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms.
J. Log. Lang. Inf., 2004

Vector Addition Tree Automata.
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

Higher-Order Matching in the Linear lambda-calculus with Pairing.
Proceedings of the Computer Science Logic, 18th International Workshop, 2004

2003
On the Complexity of Higher-Order Matching in the Linear lambda-Calculus.
Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003

2002
Classical Non-Associative Lambek Calculus.
Stud Logica, 2002

On the Strong Normalisation of Intuitionistic Natural Deduction with Permutation-Conversions.
Inf. Comput., 2002

Tree-Adjoining Grammars as Abstract Categorial Grammars.
Proceedings of the Sixth International Workshop on Tree Adjoining Grammar and Related Frameworks, 2002

2001
Stochastic Lambek Categorial Grammars.
Proceedings of the joint meeting of the 6th Conference on Formal Grammar (FG) and the 7th Conference on Mathematics of Language (MOL), 2001

Strong Normalization of Classical Natural Deduction with Disjunction.
Proceedings of the Typed Lambda Calculi and Applications, 5th International Conference, 2001

Towards Abstract Categorial Grammars.
Proceedings of the Association for Computational Linguistic, 2001

2000
Linear Higher-Order Matching Is NP-Complete.
Proceedings of the Rewriting Techniques and Applications, 11th International Conference, 2000

Proof-Search in Implicative Linear Logic as a Matching Problem.
Proceedings of the Logic for Programming and Automated Reasoning, 2000

1999
An Algebraic Correctness Criterion for Intuitionistic Multiplicative Proof-Nets.
Theor. Comput. Sci., 1999

The Non-Associative Lambek Calculus with Product in Polynomial Time.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 1999

On the Strong Normalisation of Natural Deduction with Permutation-Conversions.
Proceedings of the Rewriting Techniques and Applications, 10th International Conference, 1999

A dynamic programming approach to categorial deduction.
Proceedings of the Automated Deduction, 1999

1998
An environment machine for the lambda-mu-calculus.
Math. Struct. Comput. Sci., 1998

A Note on Kobayashi's and Yonezawa's "Asynchronous Communication Model Based on Linear Logic".
Formal Aspects Comput., 1998

1997
A Complete Axiomatisation for the Inclusion of Series-Parallel Partial Orders.
Proceedings of the Rewriting Techniques and Applications, 8th International Conference, 1997

An Algebraic Correctness Criterion for Intuitionistic Proof-Nets.
Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

1996
Constructing Different Phonological Bracketings from a Proof Net.
Proceedings of the Logical Aspects of Computational Linguistics, 1996

1995
A Simple Calculus of Exception Handling.
Proceedings of the Typed Lambda Calculi and Applications, 1995

Linear Logic with Isabelle: Pruning the Proof Search Tree.
Proceedings of the Theorem Proving with Analytic Tableaux and Related Methods, 1995

1994
On the Relation between the Lambda-Mu-Calculus and the Syntactic Theory of Sequential Control.
Proceedings of the Logic Programming and Automated Reasoning, 5th International Conference, 1994

Strong Normalization in a Non-Deterministic Typed Lambda-Calculus.
Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994

A CPS-Translation of the Lambda-µ-Calculus.
Proceedings of the Trees in Algebra and Programming, 1994

1993
The Conservation Theorem revisited.
Proceedings of the Typed Lambda Calculi and Applications, 1993

Defining Lambda-Typed Lambda-Calculi by Axiomatizing the Typing Relation.
Proceedings of the STACS 93, 1993

1992
Denotations for Classical Proofs - Preliminary Results.
Proceedings of the Logical Foundations of Computer Science, 1992


  Loading...