Filtrer vos résultats
- 20
- 12
- 15
- 9
- 3
- 2
- 2
- 1
- 1
- 32
- 1
- 1
- 2
- 1
- 2
- 1
- 3
- 4
- 2
- 2
- 2
- 3
- 1
- 2
- 1
- 3
- 1
- 31
- 1
- 32
- 5
- 3
- 2
- 32
- 11
- 5
- 4
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
32 résultats
|
|
|
triés par
|
Termination of Linear Bounded Term Rewriting Systems21st International Conference on Rewriting Techniques and Applications, Jul 2010, Edinburgh, United Kingdom. pp.341--356
Communication dans un congrès
hal-00506552v1
|
|||
|
|
Model Checking with Fly-AutomataMing-Yang Kao Encyclopedia of Algorithms, second edition., Chapitre 20, 2015, 978-3-642-27848-8. ⟨10.1007/978-3-642-27848-8_692-1⟩
Chapitre d'ouvrage
hal-01299432v1
|
||
|
|
Bootstrapping Common Lisp using Common LispEUROPEAN LISP SYMPOSIUM, Apr 2019, GENOVA, Italy. ⟨10.5281/zenodo.2634314⟩
Communication dans un congrès
hal-02417646v1
|
||
|
|
Bidirectional leveled enumerators13th European Lisp Symposium, Apr 2020, On Line, Switzerland. ⟨10.5281/zenodo.3740554⟩
Communication dans un congrès
hal-03197935v1
|
||
Bottom-up rewriting for words and termsJournal of Symbolic Computer Science, 2014, to appear, pp.1--41
Article dans une revue
hal-00958709v1
|
|||
|
|
A Case Study of the Convergence of Mildly Context-Sensitive Formalisms for Natural Language Syntax: from Minimalist Grammars to Multiple Context-Free Grammars[Research Report] RR-6042, INRIA. 2006, pp.67
Rapport
inria-00117306v3
|
||
Bottom-up rewriting for words and termsJournal of Symbolic Computation, 2014, 67, pp.93-121. ⟨10.1016/j.jsc.2014.06.00⟩
Article dans une revue
hal-01073778v1
|
|||
Decidable Call-by-Need Computations in Term RewritingInformation and Computation, 2005, 2 (196), pp.95-126
Article dans une revue
hal-00338565v1
|
|||
Processing List Elements in Reverse Order8th European Lisp Symposium, Apr 2015, Londres, United Kingdom
Communication dans un congrès
hal-01757764v1
|
|||
|
|
On using SAT solvers for graph computations2022
Pré-publication, Document de travail
hal-03668884v1
|
||
|
|
Termination of Linear Bounded Term Rewriting SystemsRewriting Techniques and Applications 2010, Jul 2010, France. p. 341--356
Communication dans un congrès
hal-00949526v1
|
||
|
|
Fly-automata, model-checking and recognizability2014
Rapport
hal-01065434v1
|
||
Verifying monadic second order graph properties with tree automata3rd European Lisp Symposium, May 2010, Lisboa, France. pp.7--21
Communication dans un congrès
hal-00522586v1
|
|||
|
|
On defining linear orders by automata2019
Pré-publication, Document de travail
hal-02397982v1
|
||
Reasoning about qualitative temporal information with S-words and S-languagesEuropean Lisp Symposium, May 2008, France. pp.1-15
Communication dans un congrès
hal-00306276v1
|
|||
|
|
Automata for the verification of monadic second-order graph propertiesJournal of Applied Logic, 2012, 10, pp.368-409
Article dans une revue
hal-00611853v2
|
||
|
|
Computations by fly-automata beyond monadic second-order logicTheoretical Computer Science, 2016, 619, pp.32-67
Article dans une revue
hal-00828211v2
|
||
|
|
Partial Inlining Using Local Graph Rewriting11th European Lisp Symposium, Apr 2018, Marbella, Spain
Communication dans un congrès
hal-01887233v1
|
||
Fast, Maintainable, and Portable Sequence Functions10th European Lisp Symposium, Apr 2017, Bruxelles, Belgium
Communication dans un congrès
hal-01757758v1
|
|||
Autowrite: A Tool for Term Rewrite Systems and Tree AutomataElectronic Notes in Computer Science, 2005, 124 (2), pp.29--49
Article dans une revue
hal-00338572v1
|
|||
Fly-automata, their properties and applications16th International Conference on Implementation and Application of Automata, Jul 2011, Blois, France. pp.264-272
Communication dans un congrès
hal-00588456v1
|
|||
Bounded, Strongly Sequential and Forward-branching Term Rewriting SystemsJournal of Symbolic Computation, 1994, 18, pp.319--352
Article dans une revue
hal-00344335v1
|
|||
Removing redundant tests by replicating control paths10th European Lisp Symposium, Apr 2017, Bruxelles, Belgium
Communication dans un congrès
hal-01757756v1
|
|||
Bottom-up rewriting for words and termsJournal of Symbolic Computation, 2014, pp.1-40
Article dans une revue
hal-00948955v1
|
|||
|
|
Bottom-up rewriting for words and terms2009
Pré-publication, Document de travail
hal-00645515v1
|
||
A tool for reasoning about qualitative temporal information: the theory of S-languages with a Lisp implementationJournal of Universal Computer Science, 2008, 14 (20), pp.3282-3306
Article dans une revue
hal-00350036v1
|
|||
Model Checking with Fly-AutomataEncyclopedia of Algorithms, 2015
Chapitre d'ouvrage
hal-01757763v1
|
|||
Object Enumeration5th European Lisp Symposium, Apr 2012, Zadar, Croatia. pp.43-57
Communication dans un congrès
hal-00694000v1
|
|||
|
|
Call by need computations in orthogonal term rewriting systemsAutre [cs.OH]. Université Sciences et Technologies - Bordeaux I, 2005
HDR
tel-00599195v1
|
||
Implementing Huge Term Automata4th European Lisp Symposium, Mar 2011, Hambourg, Germany. pp.17-27
Communication dans un congrès
hal-00588445v1
|
- 1
- 2