Nombre de documents


CV de Sylvain Salvati

Communication dans un congrès32 documents

  • Sylvain Salvati. Non-linear Second order Abstract Categorial Grammars and deletion. NLCS 2015: Natural Language and Computer Science, 2015, Kyoto, Japan. 2015. <hal-01251127>
  • Sylvain Salvati, Igor Walukiewicz. A model for behavioural properties of higher-order programs. 24th EACSL Annual Conference on Computer Science Logic, CSL 2015, Sep 2015, Berlin, Germany. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 41, <>. <10.4230/LIPIcs.CSL.2015.229>. <hal-01145494>
  • Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz. Ordered Tree-Pushdown Systems. FSTTCS 2015, Dec 2015, Bangalore, India. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 45, 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. <>. <hal-01145598>
  • Sylvain Salvati, Igor Walukiewicz. Typing Weak MSOL Properties. FOSSACS, 2015, London, United Kingdom. Springer, 9034, pp.343 - 357, 2015, FOSSACS. <10.1007/978-3-662-46678-0_22>. <hal-01394824>
  • Sylvain Salvati, Igor Walukiewicz. Typing weak MSOL properties. FOSSACS'15, Apr 2015, London, United Kingdom. FOSSACS 2015. <hal-01061202v2>
  • Jaime Arias, Myriam Desainte-Catherine, Sylvain Salvati, Camilo Rueda. Executing Hierarchical Interactive Scores in ReactiveML. Journées d'Informatique Musicale 2014, May 2014, Bourges, France. <hal-01095159>
  • Sylvain Salvati, Igor Walukiewicz. Using models to model-check recursive schemes. TLCA 2013, 2013, Eindhoven, Netherlands. 7941, pp.189-204, 2013, LNCS. <hal-00741077v2>
  • Makoto Kanazawa, Sylvain Salvati. The String-Meaning Relations Definable by Lambek Grammars and Context-Free Grammars. Formal Grammar, 2013, Tuebingen, Germany. 2013. <hal-00945526>
  • Jérôme Kirman, Sylvain Salvati. On the Complexity of Free Word Orders. Formal Grammar, 2013, Tuebingen, Germany. 2013. <hal-00945516>
  • Gregory Kobele, Sylvain Salvati. The IO and OI hierarchies revisited. ICALP (2), Jul 2013, Riga, Latvia. 2013. <hal-00818069>
  • Sylvain Salvati, Igor Walukiewicz. Evaluation is MSOL compatible. FSTTCS, 2013, Guwahati, India. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 24, pp.103-114, 2013, LIPIcs; FSTTCS. <10.4230/LIPIcs.FSTTCS.2013.103>. <hal-00773126v2>
  • David Janin, Florent Berthaut, Myriam Desainte-Catherine, Yann Orlarey, Sylvain Salvati. The T-Calculus : towards a structured programing of (musical) time and space. FARM 2013, 2013, Boston, United States. pp.23-34, 2013, <10.1145/2505341.2505347>. <hal-00789189v3>
  • Kanazawa Makoto, Sylvain Salvati. MIX Is Not a Tree-Adjoining Language. ACL 2012, 2012, South Korea. pp.666-674, 2012. <hal-00959618>
  • Pierre Bourreau, Laura Kallmeyer, Sylvain Salvati. On IO-Copying and Mildly-Context Sensitive Formalisms. Formal Grammar 2012, 2012, Opole, Poland. 8036, pp.1-16, 2012, LNCS. <hal-00959620>
  • Sylvain Salvati, Giulio Manzonetto, Mai Gehrke, Henk Barendregt. Loader and Urzyczyn Are Logically Related. ICALP, 2012, Warwick, France. 7392, pp.364-376, 2012, LNCS. <hal-00959623>
  • Makoto Kanazawa, Jens Michaelis, Sylvain Salvati, Ryo Yoshinaka. Well-Nestedness Properly Subsumes Strict Derivational Minimalism. Logical Aspects of Computational Linguistics - 6th international conference, 2011, Montpellier, France. 6736, pp.112-128, 2011. <hal-00959629>
  • Sylvain Salvati, Igor Walukiewicz. Krivine machines and higher-order schemes. ICALP, 2011, Switzerland. 6756, pp.162-173, 2011, LNCS. <hal-00570017v2>
  • Pierre Bourreau, Sylvain Salvati. Game semantics and uniqueness of type inhabitance in the simply typed lambda-calculus. Typed Lambda-Calculi and Applications, Apr 2011, Novi Sad, Serbia. 6878, pp.61-75, 2011. <hal-00719044>
  • Pierre Bourreau, Sylvain Salvati. A Datalog recognizer for almost affine lambda-CFGs. Springer. Mathematics of Language, Sep 2011, Nara, Japan. 6878, pp.21-38, 2011, <10.1007/978-3-642-23211-4>. <hal-00740701>
  • Kanazawa Makoto, Sylvain Salvati. The Copying Power of Well-Nested Multiple Context-Free Grammars. Adrian-Horia Dediu, Henning Fernau, and Carlos Martín-Vide. Language and Automata Theory and Applications, 2010, Trier, Germany. Springer, 6031, pp.344-355, 2010, LNCS; Language and Automata Theory and Applications, Fourth International Conference. <>. <10.1007/978-3-642-13089-2_29>. <inria-00525077>
  • Sylvain Salvati. Recognizability in the Simply Typed Lambda-Calculus. 16th Workshop on Logic, Language, Information and Computation, 2009, Tokyo, Japan. 2009. <inria-00412654>
  • Gregory Kobele, Christian Retoré, Sylvain Salvati. An Automata-Theoretic Approach to Minimalism. Model Theoretic Syntax at 10, Aug 2007, Ireland. J. Rogers and S. Kepser, pp.73--82, 2007. <hal-00306226>
  • Sylvain Salvati. On the membership problem for Non-linear Abstract Categorial Grammars. New Directions in Type Theoretic Grammars, 2007, Ireland. Reinhard Muskens, pp.43--50, 2007. <hal-00306230>
  • Makoto Kanazawa, Sylvain Salvati. Generating control languages with Abstract Categorial Grammars. Formal Grammar FG 2007, 2007, Ireland. Laura Kallmeyer and Paola Monachesi and Gerald Penn, 2007. <hal-00306222>
  • Sylvain Salvati. On the complexity of Abstract Categorial Grammars. Mathematics of Language, MOL 10, 2007, Ireland. 2007. <hal-00306231>
  • Christian Retoré, Sylvain Salvati. Non-Associative Categorial Grammars and Abstract Categorial Grammars. New Directions in Type Theoretic Grammars, Aug 2007, Ireland. R. Muskens, pp.51--58, 2007. <hal-00306393>
  • Sylvain Salvati. Encoding second order string ACG with Deterministic Tree Walking Transducers.. Shuly Wintner. The 11th conference on Formal Grammar, 2006, Malaga, Spain. CSLI Publications, pp.143-156, 2007, FG Online Proceedings; Proceedings FG 2006: the 11th conference on Formal Grammars. <inria-00333886>
  • Sylvain Salvati. Parsing TAG with Abstract Categorial Grammar.. TAG+8: Workshop On Tree Adjoining Grammar And Related Formalisms, 2006, Sidney, Australia. 2006. <inria-00334009>
  • Sylvain Salvati. Syntactic Descriptions: a Type System for Solving Matching Equations in the Linear lambda-Calculus.. Frank Pfenning. 17th International Conference on Rewriting Techniques and Applications, RTA 2006, 2006, Seattle, United States. Springer-Verlag, LNCS 4098, pp.151-165, 2006, Lecture Notes in Computer Science; RTA. <inria-00334006>
  • Philippe De Groote, Bruno Guillaume, Sylvain Salvati. Vertor Addition Tree Automata. 19th Annual IEEE Symposium on Logic in Computer Science - LICS'04, 2004, Turku, Finland, pp.64-73, 2004. <inria-00100081>
  • Philippe De Groote, Sylvain Salvati. Higher-order Matching in the Linear lambda-calculus with Pairing. Jerzy Marcinkowski, Andrzej Tarlecki. 18th International Workshop on Computer Science Logic - CSL'2004, Sep 2004, Karpacz, Poland, Springer, 3210, pp.220-234, 2004, Lecture notes in Computer Science. <inria-00100082>
  • Sylvain Salvati, Philippe De Groote. On the complexity of higher-order matching in the linear $\lambda$-calculus. Robert Nieuwenhuis. International Conference on Rewriting Techniques and Applications - RTA'2003, Jun 2003, Valencia, Spain, 2706, pp.234-245, 2003, Lecture notes in Computer Science. <inria-00099593>

Article dans une revue10 documents

Rapport3 documents

  • Sylvain Salvati, Igor Walukiewicz. Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata. 2012. <hal-00717718v2>
  • Sylvain Salvati. Minimalist Grammars in the Light of Logic. [Research Report] 2011, pp.39. <inria-00563807>
  • Sylvain Salvati, Igor Walukiewicz. Krivine machines and higher-order schemes. [Research Report] 2011, pp.17. <inria-00589407>

HDR1 document

  • Sylvain Salvati. Lambda-calculus and formal language theory. Computer Science [cs]. Université de Bordeaux, 2015. <tel-01253426>

Pré-publication, Document de travail1 document

  • Sylvain Salvati, Igor Walukiewicz. A model for divergence insensitive properties of lambdaY-terms. 2015. <hal-01169352>