Filtrer vos résultats
- 42
- 15
- 37
- 11
- 4
- 1
- 1
- 1
- 1
- 1
- 3
- 57
- 4
- 1
- 1
- 1
- 3
- 2
- 1
- 1
- 2
- 12
- 3
- 6
- 4
- 6
- 3
- 1
- 6
- 2
- 1
- 2
- 1
- 54
- 2
- 1
- 43
- 37
- 13
- 8
- 8
- 5
- 3
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 57
- 14
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
57 résultats
|
|
|
triés par
|
|
|
Simply typed fixpoint calculus and collapsible pushdown automataMathematical Structures in Computer Science, 2016, 26, pp.1304 - 1350. ⟨10.1017/S0960129514000590⟩
Article dans une revue
hal-01394828v1
|
||
|
|
Linear high-order deterministic tree transducers with regular look-aheadMFCS 2020 : The 45th International Symposium on Mathematical Foundations of Computer Science, Andreas Feldmann; Michal Koucky; Anna Kotesovcova, Aug 2020, Prague, Czech Republic. ⟨10.4230/LIPIcs.MFCS.2020.34⟩
Communication dans un congrès
hal-02902853v2
|
||
|
|
On IO-Copying and Mildly-Context Sensitive FormalismsFormal Grammar 2012, 2012, Opole, Poland. pp.1-16
Communication dans un congrès
hal-00959620v1
|
||
|
|
The IO and OI hierarchies revisitedInformation and Computation, 2015, 243, pp.205-221. ⟨10.1016/j.ic.2014.12.015⟩
Article dans une revue
hal-01251097v1
|
||
|
|
The Diagonal Problem for Higher-Order Recursion Schemes is DecidableLICS, Jun 2016, New York, United States. pp.96 - 105, ⟨10.1145/2933575.2934527⟩
Communication dans un congrès
hal-01394830v1
|
||
|
|
A model for divergence insensitive properties of lambdaY-terms2015
Pré-publication, Document de travail
hal-01169352v1
|
||
|
|
The IO and OI hierarchies revisitedICALP (2), Jul 2013, Riga, Latvia
Communication dans un congrès
hal-00818069v1
|
||
Recognizability in the Simply Typed Lambda-Calculus16th Workshop on Logic, Language, Information and Computation, 2009, Tokyo, Japan
Communication dans un congrès
inria-00412654v1
|
|||
|
|
Using Models to Model-check Recursive SchemesLogical Methods in Computer Science, 2015, Selected Papers of the Conference "Typed Lambda Calculi and Applications [TLCA] 2013, ⟨10.2168/LMCS-???⟩
Article dans une revue
hal-01251224v1
|
||
|
|
On the Complexity of Free Word OrdersFormal Grammar, 2013, Tuebingen, Germany
Communication dans un congrès
hal-00945516v1
|
||
Problèmes de filtrage et problème d'analyse pour les grammaires catégorielles abstraitesAutre [cs.OH]. Institut National Polytechnique de Lorraine, 2005. Français. ⟨NNT : 2005INPL050N⟩
Thèse
tel-01750002v1
|
|||
|
|
MIX is a 2-MCFL and the word problem in $\mathbb{Z}^2$ is solved by a third-order collapsible pushdown automatonJournal of Computer and System Sciences, 2015, 81 (7), pp.1252 - 1277
Article dans une revue
inria-00564552v1
|
||
|
|
On the Membership Problem for Non-Linear Abstract Categorial GrammarsJournal of Logic, Language and Information, 2010, 19 (2), pp.163-183. ⟨10.1007/s10849-009-9110-0⟩
Article dans une revue
istex
inria-00446785v1
|
||
|
|
Non-linear Second order Abstract Categorial Grammars and deletionNLCS 2015: Natural Language and Computer Science, Makoto Kanazawa, 2015, Kyoto, Japan
Communication dans un congrès
hal-01251127v1
|
||
|
|
Typing Weak MSOL PropertiesFOSSACS, 2015, London, United Kingdom. pp.343 - 357, ⟨10.1007/978-3-662-46678-0_22⟩
Communication dans un congrès
hal-01394824v1
|
||
On the complexity of Abstract Categorial GrammarsMathematics of Language, MOL 10, 2007, Ireland
Communication dans un congrès
hal-00306231v1
|
|||
|
|
Jumping Evaluation of Nested Regular Path QueriesICPL 2022 - 38th International Conference on Logic Programming, Jul 2022, Haifa, Israel
Communication dans un congrès
hal-02492780v6
|
||
Generating control languages with Abstract Categorial GrammarsFormal Grammar FG 2007, 2007, Ireland
Communication dans un congrès
hal-00306222v1
|
|||
Encoding second order string ACG with Deterministic Tree Walking Transducers.The 11th conference on Formal Grammar, Paola Monachesi; Gerald Penn; Giorgio Satta; Shuly Wintner, 2006, Malaga, Spain. pp.143-156
Communication dans un congrès
inria-00333886v1
|
|||
|
|
Minimalist Grammars in the Light of Logic[Research Report] 2011, pp.39
Rapport
inria-00563807v1
|
||
|
|
Lambda-calculus and formal language theoryComputer Science [cs]. Université de Bordeaux, 2015
HDR
tel-01253426v1
|
||
|
|
Addition LemmaLogiciel hal-03787033v1 |
||
|
|
MIX Is Not a Tree-Adjoining LanguageACL 2012, 2012, South Korea. pp.666-674
Communication dans un congrès
hal-00959618v1
|
||
|
|
Typing weak MSOL propertiesFOSSACS'15, Apr 2015, London, United Kingdom
Communication dans un congrès
hal-01061202v2
|
||
|
|
Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata2012
Rapport
hal-00717718v2
|
||
An Automata-Theoretic Approach to MinimalismModel Theoretic Syntax at 10, Aug 2007, Unknown, Ireland. pp.73--82
Communication dans un congrès
hal-00306226v1
|
|||
|
|
The Failure of the Strong Pumping Lemma for Multiple Context-Free LanguagesTheory of Computing Systems, 2014, 55 (1), pp.250-278. ⟨10.1007/s00224-014-9534-z⟩
Article dans une revue
hal-01251232v1
|
||
|
|
Using Models to Model-Check Recursive SchemesLogical Methods in Computer Science, 2015, 11, pp.189 - 204. ⟨10.1007/978-3-642-38946-7_15⟩
Article dans une revue
hal-01394822v1
|
||
|
|
Indicateurs de suivi de l'activité scientifique de l'Inria[Rapport de recherche] Inria. 2020
Rapport
hal-03033764v1
|
||
Higher-order Matching in the Linear lambda-calculus with Pairing18th International Workshop on Computer Science Logic - CSL'2004, Sep 2004, Karpacz, Poland, pp.220-234
Communication dans un congrès
inria-00100082v1
|
- 1
- 2