Filtrer vos résultats
- 252
- 200
- 223
- 142
- 65
- 6
- 6
- 5
- 3
- 1
- 1
- 47
- 15
- 3
- 446
- 3
- 101
- 90
- 39
- 31
- 28
- 27
- 27
- 26
- 26
- 24
- 23
- 22
- 21
- 21
- 2
- 4
- 40
- 36
- 25
- 36
- 48
- 46
- 46
- 43
- 49
- 58
- 6
- 2
- 6
- 3
- 1
- 1
- 407
- 45
- 452
- 452
- 16
- 10
- 9
- 7
- 6
- 6
- 5
- 5
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 103
- 85
- 53
- 42
- 42
- 34
- 28
- 17
- 17
- 17
- 16
- 14
- 12
- 11
- 10
- 10
- 10
- 9
- 9
- 9
- 9
- 8
- 8
- 8
- 8
- 8
- 7
- 7
- 7
- 7
- 7
- 7
- 7
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
452 résultats
|
|
The graph rewriting calculus: confluence and expressiveness9th Italian Conference on Theoretical Computer Science, ICTCS 2005, Oct 2005, Italie, pp.113 - 127
Communication dans un congrès
inria-00000744v1
|
||
|
|
On Semi-Completeness of Term Rewriting Systems[Research Report] RR-3327, INRIA. 1997, pp.11
Rapport
inria-00073362v1
|
||
|
|
Positive and negative results for higher-order disunification[Research Report] RR-2492, INRIA. 1995, pp.36
Rapport
inria-00074183v1
|
||
|
|
Observational Proofs by Implicit Context Induction[Research Report] RR-3151, INRIA. 1997, pp.35
Rapport
inria-00073538v1
|
||
Distributive rewriting calculusSixth International Workshop on Reduction Strategies in Rewriting and Programming, Apr 2006, Vienna, Austria. pp.95-111
Communication dans un congrès
inria-00110867v1
|
|||
|
|
Algorithms and Reductions for Rewriting Problems[Research Report] RR-3258, INRIA. 1997, pp.21
Rapport
inria-00073431v1
|
||
Prototyping and verfication with rules and strategiesCyber Assist International Symposium, 2001, Tokyo, Japan
Communication dans un congrès
inria-00100678v1
|
|||
Aide à la preuve et à la validation en programmation par règles[Stage] A03-R-500 || chebbi03a, 2003, 132 p
Rapport
inria-00099734v1
|
|||
|
|
Un calcul des séquents extensible[Stage] 2006, pp.64
Rapport
inria-00133578v1
|
||
Algebraic System Specification and Developement:Survey and Annotated BibliographyShaker Verlag, 230 p, 1999, Monographs of the Bremen Institute of Safe Systems
Ouvrages
inria-00098980v1
|
|||
ELANJournées Francophones de Programmation Logique et programmation par Contraintes - JFPLC'99, F.Fages, 1999, Lyon, France, pp.241--248
Communication dans un congrès
inria-00098996v1
|
|||
|
|
Rules, strategies and objects in ELAN[Intern report] A00-R-245 || dubois00c, 2000, 39 p
Rapport
inria-00099055v1
|
||
Compiling nondeterministic computations[Intern report] 98-R-005 || moreau98a, 1998, 16 p
Rapport
inria-00098559v1
|
|||
Rewriting as a Unified Specification Tool for Logic and Control: The ELAN LanguageSecond International Workshop on the Theory and Practice of Algebraic Specifications, 1998, Amsterdam, N.L., 10 p
Communication dans un congrès
inria-00098626v1
|
|||
|
|
The Polymorphic Rewriting Calculus: Type checking vs. Type inferenceProceedings of the Fifth International Workshop on Rewriting Logic and Its Applications (WRLA 2004) Rewriting Logic and Its Applications 2004, Narciso Marti-Oliet, Mar 2004, Barcelona, Spain. pp.89-111, ⟨10.1016/j.entcs.2004.06.027⟩
Communication dans un congrès
inria-00099910v1
|
||
Implantation de l'algorithme de Stalmarck dans le cadre de la cooperation COQ/ELAN[Stage] A00-R-359 || kacem00e, 2000, 76 p
Rapport
inria-00099219v1
|
|||
Integrating decision procedures in Spike[Intern report] 99-R-037 || armando99a, 1999
Rapport
inria-00098930v1
|
|||
Vérification et réécritureJournées Systèmes Infinis, A. Bouajjani, 2001, Paris, France
Communication dans un congrès
inria-00100557v1
|
|||
|
|
Achilles and the tortoise climbing up the hyper-arithmetical hiearchyTheoretical Computer Science, 1999, 210 (1), pp.21-71. ⟨10.1016/S0304-3975(98)00096-6⟩
Article dans une revue
inria-00100818v1
|
||
Safe Recursion Over an Arbitrary Structure: PAR, PH and DPHFifth International Workshop on Implicit Computational Complexity - ICC'2003, Jun 2003, Ottawa, Canada, 13 p
Communication dans un congrès
inria-00099619v1
|
|||
|
|
Deciding stability and mortality of piecewise affine dynamical systemsTheoretical Computer Science, 2001, 255 (1-2), pp.687-696. ⟨10.1016/S0304-3975(00)00399-6⟩
Article dans une revue
inria-00100820v1
|
||
|
|
Termination Proofs Using gpo Ordering Constraints : Extended Version[Research Report] RR-3087, INRIA. 1997, pp.37
Rapport
inria-00073604v1
|
||
|
|
Compact Normalisation Trace via Lazy Rewriting1st International Workshop on Reduction Strategies in Rewriting and Programming - WRS'2001, S. Lucas and B. Gramlich, 2001, Utrecht, Pays-Bas, pp.79-96
Communication dans un congrès
inria-00107874v1
|
||
External rewriting for skeptical proof assistantsJournal of Automated Reasoning, 2002, 29 (3-4), pp.309-336
Article dans une revue
inria-00101009v1
|
|||
|
|
Normalization in Supernatural deduction and in Deduction modulo2007
Pré-publication, Document de travail
inria-00141720v3
|
||
|
|
Termination of rewriting strategies: a generic approachProceedings of the third Workshop on Applied Semantics APPSEM'05, APPSEM II & Ludwig Maximilians Universität München, Sep 2005, Chiemsee, Germany
Communication dans un congrès
inria-00172897v1
|
||
Inversion StrategiesThird Workshop on Rule-Based Constraint Reasoning and Programming - RCoRP'01, Dec 2001, Paphos, Cyprus, 15 p
Communication dans un congrès
inria-00100570v1
|
|||
|
|
Proving weak termination also provides the right way to terminate - Extended version[Intern report] A04-R-522 || fissore04b, 2004, 54 p
Rapport
inria-00099872v1
|
||
Expressing Combinatory Reduction Systems Derivations in the Rewriting CalculusHigher-Order and Symbolic Computation, 2006
Article dans une revue
inria-00110869v1
|
|||
Innermost sufficient completeness[Intern report] A03-R-131 || gnaedig03a, 2003, 22 p
Rapport
inria-00099765v1
|