Sylvain Salvati

According to our database, Sylvain Salvati authored at least 45 papers between 2003 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Containment of Regular Path Queries Under Path Constraints.

Sylvain Salvati, Sophie Tison

Proceedings of the 27th International Conference on Database Theory, 2024

2023

An Algebraic Approach to Vectorial Programs.

Charles Paperman, Sylvain Salvati, Claire Soyez-Martin

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2022

<i>O</i>_<i>n</i> is an <i>n</i>-MCFL.

Kilian Gebhardt, Frédéric Meunier, Sylvain Salvati

J. Comput. Syst. Sci., 2022

Jumping Evaluation of Nested Regular Path Queries.

Joachim Niehren, Sylvain Salvati, Rustam Azimov

Proceedings of the Proceedings 38th International Conference on Logic Programming, 2022

2020

O_n is an n-MCFL.

Kilian Gebhardt, Frédéric Meunier, Sylvain Salvati

CoRR, 2020

Linear High-Order Deterministic Tree Transducers with Regular Look-Ahead.

Paul Gallot, Aurélien Lemay, Sylvain Salvati

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2018

On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems.

Vincent Penelle, Sylvain Salvati, Grégoire Sutre

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017

Typing weak MSOL properties.

Sylvain Salvati, Igor Walukiewicz

Log. Methods Comput. Sci., 2017

On the Decomposition of Finite-Valued Streaming String Transducers.

Paul Gallot, Anca Muscholl, Gabriele Puppis, Sylvain Salvati

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

2016

Simply typed fixpoint calculus and collapsible pushdown automata.

Sylvain Salvati, Igor Walukiewicz

Math. Struct. Comput. Sci., 2016

The Diagonal Problem for Higher-Order Recursion Schemes is Decidable.

Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015

A logical approach to grammar description.

Lionel Clément, Jérôme Kirman, Sylvain Salvati

J. Lang. Model., 2015

MIX is a 2-MCFL and the word problem in Z² is captured by the IO and the OI hierarchies.

Sylvain Salvati

J. Comput. Syst. Sci., 2015

The IO and OI hierarchies revisited.

Gregory M. Kobele, Sylvain Salvati

Inf. Comput., 2015

Using models to model-check recursive schemes.

Sylvain Salvati, Igor Walukiewicz

Log. Methods Comput. Sci., 2015

Non-linear Second Order Abstract Categorial Grammars and Deletion.

Sylvain Salvati

Proceedings of the Third Workshop on Natural Language and Computer Science, 2015

Ordered Tree-Pushdown Systems.

Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

A Model for Behavioural Properties of Higher-order Programs.

Sylvain Salvati, Igor Walukiewicz

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

Lambda-calculus and formal language theory.

Sylvain Salvati

, 2015

2014

The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages.

Makoto Kanazawa, Gregory M. Kobele, Jens Michaelis, Sylvain Salvati, Ryo Yoshinaka

Theory Comput. Syst., 2014

Krivine machines and higher-order schemes.

Sylvain Salvati, Igor Walukiewicz

Inf. Comput., 2014

Building PMCFG Parsers as Datalog Program Transformations.

Arthur Ball, Pierre Bourreau, Émeric Kien, Sylvain Salvati

Proceedings of the Logical Aspects of Computational Linguistics, 2014

2013

The T-calculus: towards a structured programing of (musical) time and space.

David Janin, Florent Berthaut, Myriam Desainte-Catherine, Yann Orlarey, Sylvain Salvati

Proceedings of the first ACM SIGPLAN workshop on Functional art, music, modeling & design, 2013

Evaluation is MSOL-compatible.

Sylvain Salvati, Igor Walukiewicz

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

On the Complexity of Free Word Orders.

Jérôme Kirman, Sylvain Salvati

Proceedings of the Formal Grammar, 2013

The String-Meaning Relations Definable by Lambek Grammars and Context-Free Grammars.

Makoto Kanazawa, Sylvain Salvati

Proceedings of the Formal Grammar, 2013

2012

Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata.

Sylvain Salvati, Igor Walukiewicz

Proceedings of the Reachability Problems - 6th International Workshop, 2012

Loader and Urzyczyn Are Logically Related.

Sylvain Salvati, Giulio Manzonetto, Mai Gehrke, Henk Barendregt

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

On IO-Copying and Mildly-Context Sensitive Formalisms.

Pierre Bourreau, Laura Kallmeyer, Sylvain Salvati

Proceedings of the Formal Grammar, 2012

MIX Is Not a Tree-Adjoining Language.

Makoto Kanazawa, Sylvain Salvati

Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, July 8-14, 2012, Jeju Island, Korea, 2012

2011

Game Semantics and Uniqueness of Type Inhabitance in the Simply-Typed <i>λ</i>-Calculus.

Pierre Bourreau, Sylvain Salvati

Proceedings of the Typed Lambda Calculi and Applications - 10th International Conference, 2011

A Datalog Recognizer for Almost Affine λ-CFGs.

Pierre Bourreau, Sylvain Salvati

Proceedings of the Mathematics of Language - 12th Biennial Conference, 2011

Well-Nestedness Properly Subsumes Strict Derivational Minimalism.

Makoto Kanazawa, Jens Michaelis, Sylvain Salvati, Ryo Yoshinaka

Proceedings of the Logical Aspects of Computational Linguistics, 2011

Minimalist Grammars in the Light of Logic.

Sylvain Salvati

Proceedings of the Logic and Grammar, 2011

2010

On the Membership Problem for Non-Linear Abstract Categorial Grammars.

Sylvain Salvati

J. Log. Lang. Inf., 2010

A Faithful Representation of Non-Associative Lambek Grammars in Abstract Categorial Grammars.

Christian Retoré, Sylvain Salvati

J. Log. Lang. Inf., 2010

The Copying Power of Well-Nested Multiple Context-Free Grammars.

Makoto Kanazawa, Sylvain Salvati

Proceedings of the Language and Automata Theory and Applications, 2010

2009

Recognizability in the Simply Typed Lambda-Calculus.

Sylvain Salvati

Proceedings of the Logic, 2009

A Note on the Complexity of Abstract Categorial Grammars.

Sylvain Salvati

Proceedings of the Mathematics of Language, 10th and 11th Biennial Conference, 2009

2006

Parsing TAG with Abstract Categorial Grammar.

Sylvain Salvati

Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms, 2006

Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear <i>lambda</i>-Calculus.

Sylvain Salvati

Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

2005

Problèmes de filtrage et problème d'analyse pour les grammaires catégorielles abstraites. (Matching problem and parsing problem for abstract categorial grammars).

Sylvain Salvati

PhD thesis, 2005

2004

Vector Addition Tree Automata.

Philippe de Groote, Bruno Guillaume, Sylvain Salvati

Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

Higher-Order Matching in the Linear lambda-calculus with Pairing.

Philippe de Groote, Sylvain Salvati

Proceedings of the Computer Science Logic, 18th International Workshop, 2004

2003

On the Complexity of Higher-Order Matching in the Linear lambda-Calculus.

Sylvain Salvati, Philippe de Groote

Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003