default search action
Sylvain Salvati
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c35]Sylvain Salvati, Sophie Tison
:
Containment of Regular Path Queries Under Path Constraints. ICDT 2024: 17:1-17:19 - [i4]Florent Capelli, Oliver Irwin, Sylvain Salvati:
A Simple Algorithm for Worst-Case Optimal Join and Sampling. CoRR abs/2409.14094 (2024) - 2023
- [c34]Charles Paperman, Sylvain Salvati, Claire Soyez-Martin:
An Algebraic Approach to Vectorial Programs. STACS 2023: 51:1-51:23 - 2022
- [j11]Kilian Gebhardt, Frédéric Meunier, Sylvain Salvati
On is an n-MCFL. J. Comput. Syst. Sci. 127: 41-52 (2022) - [c33]Joachim Niehren, Sylvain Salvati, Rustam Azimov:
Jumping Evaluation of Nested Regular Path Queries. ICLP Technical Communications / Doctoral Consortium 2022: 79-92 - 2020
- [c32]Paul Gallot, Aurélien Lemay, Sylvain Salvati:
Linear High-Order Deterministic Tree Transducers with Regular Look-Ahead. MFCS 2020: 38:1-38:13 - [i3]Kilian Gebhardt, Frédéric Meunier, Sylvain Salvati:
On is an n-MCFL. CoRR abs/2012.12100 (2020)
2010 – 2019
- 2018
- [c31]Vincent Penelle, Sylvain Salvati, Grégoire Sutre:
On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems. FSTTCS 2018: 44:1-44:20 - 2017
- [j10]Sylvain Salvati, Igor Walukiewicz:
Typing weak MSOL properties. Log. Methods Comput. Sci. 13(1) (2017) - [c30]Paul Gallot, Anca Muscholl, Gabriele Puppis
On the Decomposition of Finite-Valued Streaming String Transducers. STACS 2017: 34:1-34:14 - 2016
- [j9]Sylvain Salvati, Igor Walukiewicz:
Simply typed fixpoint calculus and collapsible pushdown automata. Math. Struct. Comput. Sci. 26(7): 1304-1350 (2016) - [c29]Lorenzo Clemente, Pawel Parys
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. LICS 2016: 96-105 - [i2]Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz:
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. CoRR abs/1605.00371 (2016) - 2015
- [b2]Sylvain Salvati:
Lambda-calculus and formal language theory. University of Bordeaux, France, 2015 - [j8]Sylvain Salvati, Igor Walukiewicz:
Using models to model-check recursive schemes. Log. Methods Comput. Sci. 11(2) (2015) - [j7]Gregory M. Kobele, Sylvain Salvati:
The IO and OI hierarchies revisited. Inf. Comput. 243: 205-221 (2015) - [j6]Sylvain Salvati:
MIX is a 2-MCFL and the word problem in Z2 is captured by the IO and the OI hierarchies. J. Comput. Syst. Sci. 81(7): 1252-1277 (2015) - [j5]Lionel Clément, Jérôme Kirman, Sylvain Salvati:
A logical approach to grammar description. J. Lang. Model. 3(1): 87-143 (2015) - [c28]Sylvain Salvati, Igor Walukiewicz:
A Model for Behavioural Properties of Higher-order Programs. CSL 2015: 229-243 - [c27]Sylvain Salvati, Igor Walukiewicz:
Typing Weak MSOL Properties. FoSSaCS 2015: 343-357 - [c26]Lorenzo Clemente, Pawel Parys
Ordered Tree-Pushdown Systems. FSTTCS 2015: 163-177 - [c25]Sylvain Salvati:
Non-linear Second Order Abstract Categorial Grammars and Deletion. NLCS@ICALP/LICS 2015: 64-72 - [i1]Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz:
Ordered Tree-Pushdown Systems. CoRR abs/1510.03278 (2015) - 2014
- [j4]Sylvain Salvati, Igor Walukiewicz:
Krivine machines and higher-order schemes. Inf. Comput. 239: 340-355 (2014) - [j3]Makoto Kanazawa, Gregory M. Kobele, Jens Michaelis
The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages. Theory Comput. Syst. 55(1): 250-278 (2014) - [c24]Arthur Ball, Pierre Bourreau, Émeric Kien, Sylvain Salvati:
Building PMCFG Parsers as Datalog Program Transformations. LACL 2014: 1-13 - 2013
- [c23]Makoto Kanazawa, Sylvain Salvati:
The String-Meaning Relations Definable by Lambek Grammars and Context-Free Grammars. FG 2013: 191-208 - [c22]Jérôme Kirman, Sylvain Salvati:
On the Complexity of Free Word Orders. FG 2013: 209-224 - [c21]Sylvain Salvati, Igor Walukiewicz:
Evaluation is MSOL-compatible. FSTTCS 2013: 103-114 - [c20]Gregory M. Kobele, Sylvain Salvati:
The IO and OI Hierarchies Revisited. ICALP (2) 2013: 336-348 - [c19]David Janin, Florent Berthaut
The T-calculus: towards a structured programing of (musical) time and space. FARM@ICFP 2013: 23-34 - [c18]Sylvain Salvati, Igor Walukiewicz:
Using Models to Model-Check Recursive Schemes. TLCA 2013: 189-204 - 2012
- [c17]Makoto Kanazawa, Sylvain Salvati:
MIX Is Not a Tree-Adjoining Language. ACL (1) 2012: 666-674 - [c16]Pierre Bourreau, Laura Kallmeyer, Sylvain Salvati:
On IO-Copying and Mildly-Context Sensitive Formalisms. FG 2012: 1-16 - [c15]Sylvain Salvati, Giulio Manzonetto, Mai Gehrke, Henk Barendregt:
Loader and Urzyczyn Are Logically Related. ICALP (2) 2012: 364-376 - [c14]Sylvain Salvati, Igor Walukiewicz:
Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata. RP 2012: 6-20 - 2011
- [c13]Sylvain Salvati:
Minimalist Grammars in the Light of Logic. Logic and Grammar 2011: 81-117 - [c12]Sylvain Salvati, Igor Walukiewicz:
Krivine Machines and Higher-Order Schemes. ICALP (2) 2011: 162-173 - [c11]Makoto Kanazawa, Jens Michaelis
Well-Nestedness Properly Subsumes Strict Derivational Minimalism. LACL 2011: 112-128 - [c10]Pierre Bourreau, Sylvain Salvati:
A Datalog Recognizer for Almost Affine λ-CFGs. MOL 2011: 21-38 - [c9]Pierre Bourreau, Sylvain Salvati:
Game Semantics and Uniqueness of Type Inhabitance in the Simply-Typed λ-Calculus. TLCA 2011: 61-75 - 2010
- [j2]Sylvain Salvati:
On the Membership Problem for Non-Linear Abstract Categorial Grammars. J. Log. Lang. Inf. 19(2): 163-183 (2010) - [j1]Christian Retoré, Sylvain Salvati:
A Faithful Representation of Non-Associative Lambek Grammars in Abstract Categorial Grammars. J. Log. Lang. Inf. 19(2): 185-200 (2010) - [c8]Makoto Kanazawa, Sylvain Salvati:
The Copying Power of Well-Nested Multiple Context-Free Grammars. LATA 2010: 344-355
2000 – 2009
- 2009
- [c7]Sylvain Salvati:
A Note on the Complexity of Abstract Categorial Grammars. MOL 2009: 266-271 - [c6]Sylvain Salvati:
Recognizability in the Simply Typed Lambda-Calculus. WoLLIC 2009: 48-60 - 2006
- [c5]Sylvain Salvati:
Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear lambda-Calculus. RTA 2006: 151-165 - [c4]Sylvain Salvati:
Parsing TAG with Abstract Categorial Grammar. TAG 2006: 141-146 - 2005
- [b1]Sylvain Salvati:
Problèmes de filtrage et problème d'analyse pour les grammaires catégorielles abstraites. (Matching problem and parsing problem for abstract categorial grammars). National Polytechnic Institute of Lorraine, Nancy, France, 2005 - 2004
- [c3]Philippe de Groote, Sylvain Salvati:
Higher-Order Matching in the Linear lambda-calculus with Pairing. CSL 2004: 220-234 - [c2]Philippe de Groote, Bruno Guillaume, Sylvain Salvati:
Vector Addition Tree Automata. LICS 2004: 64-73 - 2003
- [c1]Sylvain Salvati, Philippe de Groote:
On the Complexity of Higher-Order Matching in the Linear lambda-Calculus. RTA 2003: 234-245
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: