On the Complexity of Higher-Order Matching in the Linear lambda-Calculus. - Sylvain Salvati; Philippe de Groote (RTA, 2003)

Higher-Order Matching in the Linear lambda-calculus with Pairing. - Philippe de Groote; Sylvain Salvati (CSL, 2004)

Vector Addition Tree Automata. - Philippe de Groote; Bruno Guillaume; Sylvain Salvati (LICS, 2004)

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 (2005)

Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear lambda-Calculus. - Sylvain Salvati (RTA, 2006)

Parsing TAG with Abstract Categorial Grammar. - Sylvain Salvati (TAG, 2006)

A Note on the Complexity of Abstract Categorial Grammars. - Sylvain Salvati (MOL, 2009)

Recognizability in the Simply Typed Lambda-Calculus. - Sylvain Salvati (WoLLIC, 2009)

The Copying Power of Well-Nested Multiple Context-Free Grammars. - Makoto Kanazawa; Sylvain Salvati (LATA, 2010)

A Faithful Representation of Non-Associative Lambek Grammars in Abstract Categorial Grammars. - Christian Retoré; Sylvain Salvati (J. Log. Lang. Inf., 2010)

On the Membership Problem for Non-Linear Abstract Categorial Grammars. - Sylvain Salvati (J. Log. Lang. Inf., 2010)

Minimalist Grammars in the Light of Logic. - Sylvain Salvati (Logic and Grammar, 2011)

Well-Nestedness Properly Subsumes Strict Derivational Minimalism. - Makoto Kanazawa; Jens Michaelis; Sylvain Salvati; Ryo Yoshinaka (LACL, 2011)

A Datalog Recognizer for Almost Affine λ-CFGs. - Pierre Bourreau; Sylvain Salvati (MOL, 2011)

Game Semantics and Uniqueness of Type Inhabitance in the Simply-Typed λ-Calculus. - Pierre Bourreau; Sylvain Salvati (TLCA, 2011)

MIX Is Not a Tree-Adjoining Language. - Makoto Kanazawa; Sylvain Salvati (ACL (1), 2012)

On IO-Copying and Mildly-Context Sensitive Formalisms. - Pierre Bourreau; Laura Kallmeyer; Sylvain Salvati (FG, 2012)

Loader and Urzyczyn Are Logically Related. - Sylvain Salvati; Giulio Manzonetto; Mai Gehrke; Henk Barendregt (ICALP (2), 2012)

Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata. - Sylvain Salvati; Igor Walukiewicz (RP, 2012)

The String-Meaning Relations Definable by Lambek Grammars and Context-Free Grammars. - Makoto Kanazawa; Sylvain Salvati (FG, 2013)

On the Complexity of Free Word Orders. - Jérôme Kirman; Sylvain Salvati (FG, 2013)

Evaluation is MSOL-compatible. - Sylvain Salvati; Igor Walukiewicz (FSTTCS, 2013)

The T-calculus: towards a structured programing of (musical) time and space. - David Janin; Florent Berthaut; Myriam Desainte-Catherine; Yann Orlarey; Sylvain Salvati (FARM@ICFP, 2013)

Building PMCFG Parsers as Datalog Program Transformations. - Arthur Ball; Pierre Bourreau; Émeric Kien; Sylvain Salvati (LACL, 2014)

Krivine machines and higher-order schemes. - Sylvain Salvati; Igor Walukiewicz (Inf. Comput., 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)

Lambda-calculus and formal language theory. - Sylvain Salvati (2015)

A Model for Behavioural Properties of Higher-order Programs. - Sylvain Salvati; Igor Walukiewicz (CSL, 2015)

Ordered Tree-Pushdown Systems. - Lorenzo Clemente; Pawel Parys; Sylvain Salvati; Igor Walukiewicz (FSTTCS, 2015)

Non-linear Second Order Abstract Categorial Grammars and Deletion. - Sylvain Salvati (NLCS@ICALP/LICS, 2015)

Using models to model-check recursive schemes. - Sylvain Salvati; Igor Walukiewicz (Log. Methods Comput. Sci., 2015)

The IO and OI hierarchies revisited. - Gregory M. Kobele; Sylvain Salvati (Inf. Comput., 2015)

MIX is a 2-MCFL and the word problem in Z2 is captured by the IO and the OI hierarchies. - Sylvain Salvati (J. Comput. Syst. Sci., 2015)

A logical approach to grammar description. - Lionel Clément; Jérôme Kirman; Sylvain Salvati (J. Lang. Model., 2015)

The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. - Lorenzo Clemente; Pawel Parys; Sylvain Salvati; Igor Walukiewicz (LICS, 2016)

Simply typed fixpoint calculus and collapsible pushdown automata. - Sylvain Salvati; Igor Walukiewicz (Math. Struct. Comput. Sci., 2016)

On the Decomposition of Finite-Valued Streaming String Transducers. - Paul Gallot; Anca Muscholl; Gabriele Puppis; Sylvain Salvati (STACS, 2017)

Typing weak MSOL properties. - Sylvain Salvati; Igor Walukiewicz (Log. Methods Comput. Sci., 2017)

On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems. - Vincent Penelle; Sylvain Salvati; Grégoire Sutre (FSTTCS, 2018)

Linear High-Order Deterministic Tree Transducers with Regular Look-Ahead. - Paul Gallot; Aurélien Lemay; Sylvain Salvati (MFCS, 2020)

On is an n-MCFL. - Kilian Gebhardt; Frédéric Meunier; Sylvain Salvati (CoRR, 2020)

Jumping Evaluation of Nested Regular Path Queries. - Joachim Niehren; Sylvain Salvati; Rustam Azimov (ICLP Technical Communications / Doctoral Consortium, 2022)

On is an n-MCFL. - Kilian Gebhardt; Frédéric Meunier; Sylvain Salvati (J. Comput. Syst. Sci., 2022)

An Algebraic Approach to Vectorial Programs. - Charles Paperman; Sylvain Salvati; Claire Soyez-Martin (STACS, 2023)

Containment of Regular Path Queries Under Path Constraints. - Sylvain Salvati; Sophie Tison (ICDT, 2024)

A Simple Algorithm for Worst Case Optimal Join and Sampling. - Florent Capelli; Oliver Irwin; Sylvain Salvati (ICDT, 2025)

Corrections to "On the data complexity of consistent query answering over graph databases [Journal of Computer and System Sciences 88 (2017) 164-194]". - Pablo Barceló; Gaëlle Fontaine; Sylvain Salvati; Sophie Tison (J. Comput. Syst. Sci., 2026)