Sylvain Salvati

56 papers A* 2A 5B 7C 2Journal 17Unranked 21
YearRankTypeTitle / Venue / Authors
2026 J jnl
Corrections to "On the data complexity of consistent query answering over graph databases [Journal of Computer and System Sciences 88 (2017) 164-194]".
J. Comput. Syst. Sci.
Pablo Barceló, Gaëlle Fontaine, Sylvain Salvati, Sophie Tison
2026 J jnl
Direct Access for Conjunctive Queries with Negations.
Log. Methods Comput. Sci.
Florent Capelli, Nofar Carmeli, Oliver Irwin, Sylvain Salvati
2026 A conf
On the Complexity of Language Membership for Probabilistic Words.
STACS
Antoine Amarilli, Mikaël Monet, Paul Raphaël, Sylvain Salvati
2025 A conf
A Simple Algorithm for Worst Case Optimal Join and Sampling.
ICDT
Florent Capelli, Oliver Irwin, Sylvain Salvati
2025 J jnl
On the Complexity of Language Membership for Probabilistic Words.
CoRR
Antoine Amarilli, Mikaël Monet, Paul Raphaël, Sylvain Salvati
2024 J jnl
A Simple Algorithm for Worst-Case Optimal Join and Sampling.
CoRR
Florent Capelli, Oliver Irwin, Sylvain Salvati
2024 A conf
Containment of Regular Path Queries Under Path Constraints.
ICDT
Sylvain Salvati, Sophie Tison
2023 A conf
An Algebraic Approach to Vectorial Programs.
STACS
Charles Paperman, Sylvain Salvati, Claire Soyez-Martin
2022 — conf
Jumping Evaluation of Nested Regular Path Queries.
ICLP Technical Communications / Doctoral Consortium
Joachim Niehren, Sylvain Salvati, Rustam Azimov
2020 B conf
Linear High-Order Deterministic Tree Transducers with Regular Look-Ahead.
MFCS
Paul Gallot, Aurélien Lemay, Sylvain Salvati
2020 J jnl
O
CoRR
Kilian Gebhardt, Frédéric Meunier, Sylvain Salvati
2018 — conf
On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems.
FSTTCS
Vincent Penelle, Sylvain Salvati, Grégoire Sutre
2017 A conf
On the Decomposition of Finite-Valued Streaming String Transducers.
STACS
Paul Gallot, Anca Muscholl, Gabriele Puppis, Sylvain Salvati
2017 J jnl
Typing weak MSOL properties.
Log. Methods Comput. Sci.
Sylvain Salvati, Igor Walukiewicz
2016 J jnl
Simply typed fixpoint calculus and collapsible pushdown automata.
Math. Struct. Comput. Sci.
Sylvain Salvati, Igor Walukiewicz
2016 A* conf
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable.
LICS
Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz
2016 J jnl
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable.
CoRR
Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz
2015 B conf
A Model for Behavioural Properties of Higher-order Programs.
CSL
Sylvain Salvati, Igor Walukiewicz
2015 J jnl
A logical approach to grammar description.
J. Lang. Model.
Lionel Clément, Jérôme Kirman, Sylvain Salvati
2015 — book
Lambda-calculus and formal language theory.
Sylvain Salvati
2015 J jnl
MIX is a 2-MCFL and the word problem in Z
J. Comput. Syst. Sci.
Sylvain Salvati
2015 — conf
Non-linear Second Order Abstract Categorial Grammars and Deletion.
NLCS@ICALP/LICS
Sylvain Salvati
2015 — conf
Ordered Tree-Pushdown Systems.
FSTTCS
Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz
2015 J jnl
Ordered Tree-Pushdown Systems.
CoRR
Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz
2015 J jnl
The IO and OI hierarchies revisited.
Inf. Comput.
Gregory M. Kobele, Sylvain Salvati
2015 B conf
Typing Weak MSOL Properties.
FoSSaCS
Sylvain Salvati, Igor Walukiewicz
2015 J jnl
Using models to model-check recursive schemes.
Log. Methods Comput. Sci.
Sylvain Salvati, Igor Walukiewicz
2014 — conf
Building PMCFG Parsers as Datalog Program Transformations.
LACL
Arthur Ball, Pierre Bourreau, Émeric Kien, Sylvain Salvati
2014 J jnl
Krivine machines and higher-order schemes.
Inf. Comput.
Sylvain Salvati, Igor Walukiewicz
2014 J jnl
The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages.
Theory Comput. Syst.
Makoto Kanazawa, Gregory M. Kobele, Jens Michaelis, Sylvain Salvati, Ryo Yoshinaka
2013 — conf
Evaluation is MSOL-compatible.
FSTTCS
Sylvain Salvati, Igor Walukiewicz
2013 B conf
On the Complexity of Free Word Orders.
FG
Jérôme Kirman, Sylvain Salvati
2013 — conf
The IO and OI Hierarchies Revisited.
ICALP (2)
Gregory M. Kobele, Sylvain Salvati
2013 B conf
The String-Meaning Relations Definable by Lambek Grammars and Context-Free Grammars.
FG
Makoto Kanazawa, Sylvain Salvati
2013 — conf
The T-calculus: towards a structured programing of (musical) time and space.
FARM@ICFP
David Janin, Florent Berthaut, Myriam Desainte-Catherine, Yann Orlarey, Sylvain Salvati
2013 — conf
Using Models to Model-Check Recursive Schemes.
TLCA
Sylvain Salvati, Igor Walukiewicz
2012 — conf
Loader and Urzyczyn Are Logically Related.
ICALP (2)
Sylvain Salvati, Giulio Manzonetto, Mai Gehrke, Henk Barendregt
2012 — conf
MIX Is Not a Tree-Adjoining Language.
ACL (1)
Makoto Kanazawa, Sylvain Salvati
2012 B conf
On IO-Copying and Mildly-Context Sensitive Formalisms.
FG
Pierre Bourreau, Laura Kallmeyer, Sylvain Salvati
2012 — conf
Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata.
RP
Sylvain Salvati, Igor Walukiewicz
2011 — conf
A Datalog Recognizer for Almost Affine λ-CFGs.
MOL
Pierre Bourreau, Sylvain Salvati
2011 — conf
Game Semantics and Uniqueness of Type Inhabitance in the Simply-Typed
TLCA
Pierre Bourreau, Sylvain Salvati
2011 — conf
Krivine Machines and Higher-Order Schemes.
ICALP (2)
Sylvain Salvati, Igor Walukiewicz
2011 — conf
Minimalist Grammars in the Light of Logic.
Logic and Grammar
Sylvain Salvati
2011 — conf
Well-Nestedness Properly Subsumes Strict Derivational Minimalism.
LACL
Makoto Kanazawa, Jens Michaelis, Sylvain Salvati, Ryo Yoshinaka
2010 J jnl
A Faithful Representation of Non-Associative Lambek Grammars in Abstract Categorial Grammars.
J. Log. Lang. Inf.
Christian Retoré, Sylvain Salvati
2010 J jnl
On the Membership Problem for Non-Linear Abstract Categorial Grammars.
J. Log. Lang. Inf.
Sylvain Salvati
2010 C conf
The Copying Power of Well-Nested Multiple Context-Free Grammars.
LATA
Makoto Kanazawa, Sylvain Salvati
2009 — conf
A Note on the Complexity of Abstract Categorial Grammars.
MOL
Sylvain Salvati
2009 C conf
Recognizability in the Simply Typed Lambda-Calculus.
WoLLIC
Sylvain Salvati
2006 — conf
Parsing TAG with Abstract Categorial Grammar.
TAG
Sylvain Salvati
2006 — conf
Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear
RTA
Sylvain Salvati
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
2004 B conf
Higher-Order Matching in the Linear lambda-calculus with Pairing.
CSL
Philippe de Groote, Sylvain Salvati
2004 A* conf
Vector Addition Tree Automata.
LICS
Philippe de Groote, Bruno Guillaume, Sylvain Salvati
2003 — conf
On the Complexity of Higher-Order Matching in the Linear lambda-Calculus.
RTA
Sylvain Salvati, Philippe de Groote