Filtrer vos résultats
- 38
- 11
- 4
- 2
- 1
- 1
- 1
- 58
- 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
- 1
- 1
- 58
- 4
- 1
- 1
- 43
- 37
- 13
- 9
- 9
- 5
- 3
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 58
- 49
- 48
- 48
- 45
- 39
- 37
- 21
- 21
- 21
- 21
- 21
- 21
- 21
- 21
- 21
- 13
- 10
- 9
- 9
- 9
- 9
- 9
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 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
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 55
- 2
- 1
- 43
- 15
- 1
- 2
- 1
- 3
- 5
- 1
- 3
- 6
- 4
- 6
- 3
- 12
- 2
- 1
- 1
- 2
- 3
- 2
|
|
|
triés par
|
|
|
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
|
||
|
|
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
|
||
|
|
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
|
||
On the complexity of Abstract Categorial GrammarsMathematics of Language, MOL 10, 2007, Ireland
Communication dans un congrès
hal-00306231v1
|
|||
|
|
Game semantics and uniqueness of type inhabitance in the simply typed lambda-calculusTyped Lambda-Calculi and Applications, Apr 2011, Novi Sad, Serbia. pp.61-75
Communication dans un congrès
hal-00719044v1
|
||
|
|
Loader and Urzyczyn Are Logically RelatedICALP, 2012, Warwick, France. pp.364-376
Communication dans un congrès
hal-00959623v1
|
||
|
|
Parsing TAG with Abstract Categorial Grammar.TAG+8: Workshop On Tree Adjoining Grammar And Related Formalisms, 2006, Sidney, Australia
Communication dans un congrès
inria-00334009v1
|
||
Syntactic Descriptions: a Type System for Solving Matching Equations in the Linear lambda-Calculus.17th International Conference on Rewriting Techniques and Applications, RTA 2006, 2006, Seattle, United States. pp.151-165
Communication dans un congrès
inria-00334006v1
|
|||
|
|
A Datalog recognizer for almost affine lambda-CFGsMathematics of Language, Sep 2011, Nara, Japan. pp.21-38, ⟨10.1007/978-3-642-23211-4⟩
Communication dans un congrès
hal-00740701v1
|
||
|
|
Using models to model-check recursive schemesTLCA 2013, 2013, Eindhoven, Netherlands. pp.189-204
Communication dans un congrès
hal-00741077v2
|
||
On the membership problem for Non-linear Abstract Categorial GrammarsNew Directions in Type Theoretic Grammars, 2007, Ireland. pp.43--50
Communication dans un congrès
hal-00306230v1
|
|||
|
|
A logical approach to grammar descriptionJournal of Language Modelling, 2015, Special issue on High-level methodologies for grammar engineering, 3 (1), pp. 87-143 ⟨10.15398/jlm.v3i1.94⟩
Article dans une revue
hal-01251222v1
|
||
|
|
Krivine machines and higher-order schemes[Research Report] 2011, pp.17
Rapport
inria-00589407v1
|
||
Recognizability in the Simply Typed Lambda-Calculus16th Workshop on Logic, Language, Information and Computation, 2009, Tokyo, Japan
Communication dans un congrès
inria-00412654v1
|
|||
|
|
On the Complexity of Free Word OrdersFormal Grammar, 2013, Tuebingen, Germany
Communication dans un congrès
hal-00945516v1
|
||
|
|
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
|
||
|
|
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
|
||
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
|
|||
|
|
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
|
||
|
|
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
|
||
|
|
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
|
||
|
|
The IO and OI hierarchies revisitedICALP (2), Jul 2013, Riga, Latvia
Communication dans un congrès
hal-00818069v1
|
||
|
|
On IO-Copying and Mildly-Context Sensitive FormalismsFormal Grammar 2012, 2012, Opole, Poland. pp.1-16
Communication dans un congrès
hal-00959620v1
|
||
|
|
A model for divergence insensitive properties of lambdaY-terms2015
Pré-publication, Document de travail
hal-01169352v1
|
||
|
|
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
|
||
|
|
A Faithful Representation of Non-Associative Lambek Grammars in Abstract Categorial GrammarsJournal of Logic, Language and Information, 2010, 19 (2), pp.185--200
Article dans une revue
inria-00409557v1
|
||
Vector Addition Tree Automata19th Annual IEEE Symposium on Logic in Computer Science - LICS'04, 2004, Turku, Finland, France. pp.64-73
Communication dans un congrès
inria-00100081v1
|
|||
|
|
Well-Nestedness Properly Subsumes Strict Derivational MinimalismLogical Aspects of Computational Linguistics - 6th international conference, 2011, Montpellier, France. pp.112-128
Communication dans un congrès
hal-00959629v1
|
||
On the complexity of higher-order matching in the linear $\lambda$-calculusInternational Conference on Rewriting Techniques and Applications - RTA'2003, Jun 2003, Valencia, Spain, pp.234-245
Communication dans un congrès
inria-00099593v1
|
|||
|
|
Krivine machines and higher-order schemesInformation and Computation, 2014, 239, pp.340-355. ⟨10.1016/j.ic.2014.07.012⟩
Article dans une revue
hal-01121744v1
|
- 1
- 2