Sylvain Salvati

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 12

Top Topics

Regular Path Queries

Top Venues

J. Comput. Syst. Sci.

Publications

Sylvain Salvati, Sophie Tison
Containment of Regular Path Queries Under Path Constraints. ICDT (2024)
Charles Paperman, Sylvain Salvati, Claire Soyez-Martin
An Algebraic Approach to Vectorial Programs. STACS (2023)
Kilian Gebhardt, Frédéric Meunier, Sylvain Salvati
-MCFL. J. Comput. Syst. Sci. 127 (2022)
Joachim Niehren, Sylvain Salvati, Rustam Azimov
Jumping Evaluation of Nested Regular Path Queries. ICLP Technical Communications / Doctoral Consortium (2022)
Paul Gallot, Aurélien Lemay, Sylvain Salvati
Linear High-Order Deterministic Tree Transducers with Regular Look-Ahead. MFCS (2020)
Kilian Gebhardt, Frédéric Meunier, Sylvain Salvati
is an n-MCFL. CoRR (2020)
Vincent Penelle, Sylvain Salvati, Grégoire Sutre
On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems. FSTTCS (2018)
Paul Gallot, Anca Muscholl, Gabriele Puppis, Sylvain Salvati
On the Decomposition of Finite-Valued Streaming String Transducers. STACS (2017)
Sylvain Salvati, Igor Walukiewicz
Typing weak MSOL properties. Log. Methods Comput. Sci. 13 (1) (2017)
Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. CoRR (2016)
Sylvain Salvati, Igor Walukiewicz
Simply typed fixpoint calculus and collapsible pushdown automata. Math. Struct. Comput. Sci. 26 (7) (2016)
Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. LICS (2016)
Sylvain Salvati, Igor Walukiewicz
Typing Weak MSOL Properties. FoSSaCS (2015)
Lionel Clément, Jérôme Kirman, Sylvain Salvati
A logical approach to grammar description. J. Lang. Model. 3 (1) (2015)
Gregory M. Kobele, Sylvain Salvati
The IO and OI hierarchies revisited. Inf. Comput. 243 (2015)
Sylvain Salvati
Non-linear Second Order Abstract Categorial Grammars and Deletion. NLCS@ICALP/LICS (2015)
Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz
Ordered Tree-Pushdown Systems. FSTTCS (2015)
Sylvain Salvati
is captured by the IO and the OI hierarchies. J. Comput. Syst. Sci. 81 (7) (2015)
Sylvain Salvati, Igor Walukiewicz
Using models to model-check recursive schemes. Log. Methods Comput. Sci. 11 (2) (2015)
Sylvain Salvati, Igor Walukiewicz
A Model for Behavioural Properties of Higher-order Programs. CSL (2015)
Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz
Ordered Tree-Pushdown Systems. CoRR (2015)
Makoto Kanazawa, Gregory M. Kobele, Jens Michaelis, Sylvain Salvati, Ryo Yoshinaka
The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages. Theory Comput. Syst. 55 (1) (2014)
Sylvain Salvati, Igor Walukiewicz
Krivine machines and higher-order schemes. Inf. Comput. 239 (2014)
Arthur Ball, Pierre Bourreau, Émeric Kien, Sylvain Salvati
Building PMCFG Parsers as Datalog Program Transformations. LACL (2014)
Jérôme Kirman, Sylvain Salvati
On the Complexity of Free Word Orders. FG (2013)
Gregory M. Kobele, Sylvain Salvati
The IO and OI Hierarchies Revisited. ICALP (2) (2013)
Makoto Kanazawa, Sylvain Salvati
The String-Meaning Relations Definable by Lambek Grammars and Context-Free Grammars. FG (2013)
David Janin, Florent Berthaut, Myriam Desainte-Catherine, Yann Orlarey, Sylvain Salvati
The T-calculus: towards a structured programing of (musical) time and space. FARM@ICFP (2013)
Sylvain Salvati, Igor Walukiewicz
Using Models to Model-Check Recursive Schemes. TLCA (2013)
Sylvain Salvati, Igor Walukiewicz
Evaluation is MSOL-compatible. FSTTCS (2013)
Sylvain Salvati, Igor Walukiewicz
Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata. RP (2012)
Pierre Bourreau, Laura Kallmeyer, Sylvain Salvati
On IO-Copying and Mildly-Context Sensitive Formalisms. FG (2012)
Sylvain Salvati, Giulio Manzonetto, Mai Gehrke, Henk Barendregt
Loader and Urzyczyn Are Logically Related. ICALP (2) (2012)
Makoto Kanazawa, Sylvain Salvati
MIX Is Not a Tree-Adjoining Language. ACL (1) (2012)
Pierre Bourreau, Sylvain Salvati
A Datalog Recognizer for Almost Affine λ-CFGs. MOL (2011)
Makoto Kanazawa, Jens Michaelis, Sylvain Salvati, Ryo Yoshinaka
Well-Nestedness Properly Subsumes Strict Derivational Minimalism. LACL (2011)
Sylvain Salvati
Minimalist Grammars in the Light of Logic. Logic and Grammar (2011)
Sylvain Salvati, Igor Walukiewicz
Krivine Machines and Higher-Order Schemes. ICALP (2) (2011)
Pierre Bourreau, Sylvain Salvati
-Calculus. TLCA (2011)
Christian Retoré, Sylvain Salvati
A Faithful Representation of Non-Associative Lambek Grammars in Abstract Categorial Grammars. J. Log. Lang. Inf. 19 (2) (2010)
Makoto Kanazawa, Sylvain Salvati
The Copying Power of Well-Nested Multiple Context-Free Grammars. LATA (2010)
Sylvain Salvati
On the Membership Problem for Non-Linear Abstract Categorial Grammars. J. Log. Lang. Inf. 19 (2) (2010)
Sylvain Salvati
Recognizability in the Simply Typed Lambda-Calculus. WoLLIC (2009)
Sylvain Salvati
A Note on the Complexity of Abstract Categorial Grammars. MOL (2009)
Sylvain Salvati
Parsing TAG with Abstract Categorial Grammar. TAG (2006)
Sylvain Salvati
-Calculus. RTA (2006)
Philippe de Groote, Bruno Guillaume, Sylvain Salvati
Vector Addition Tree Automata. LICS (2004)
Philippe de Groote, Sylvain Salvati
Higher-Order Matching in the Linear lambda-calculus with Pairing. CSL (2004)
Sylvain Salvati, Philippe de Groote
On the Complexity of Higher-Order Matching in the Linear lambda-Calculus. RTA (2003)