Filtrer vos résultats
- 85
- 18
- 42
- 32
- 21
- 5
- 2
- 1
- 19
- 103
- 3
- 790
- 659
- 609
- 589
- 535
- 478
- 431
- 391
- 370
- 324
- 322
- 317
- 312
- 307
- 305
- 294
- 290
- 283
- 266
- 259
- 251
- 226
- 220
- 218
- 218
- 218
- 216
- 215
- 213
- 212
- 211
- 205
- 202
- 201
- 200
- 197
- 196
- 194
- 192
- 191
- 191
- 189
- 183
- 182
- 179
- 179
- 178
- 176
- 174
- 171
- 170
- 168
- 164
- 162
- 161
- 161
- 159
- 157
- 157
- 156
- 155
- 154
- 154
- 152
- 152
- 152
- 150
- 150
- 149
- 148
- 147
- 147
- 144
- 142
- 142
- 141
- 141
- 141
- 140
- 139
- 139
- 139
- 138
- 137
- 137
- 136
- 136
- 136
- 136
- 136
- 135
- 135
- 133
- 132
- 131
- 131
- 131
- 131
- 131
- 128
- 2
- 4
- 2
- 5
- 5
- 1
- 1
- 1
- 6
- 1
- 3
- 6
- 5
- 5
- 4
- 7
- 9
- 4
- 3
- 5
- 4
- 3
- 5
- 3
- 4
- 4
- 1
- 98
- 5
- 55
- 47
- 15
- 14
- 10
- 9
- 7
- 6
- 5
- 5
- 5
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 25
- 24
- 19
- 12
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 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
- 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
|
|
Refinement Types as Higher Order Dependency Pairs[Research Report] 2011, pp.19
Rapport
inria-00552046v2
|
||
|
|
On Computational Interpretations of the Modal Logic S4 IIIb. Confluence, Termination of the $\lambda\mbox{ev}Q_H$-Calculus[Research Report] RR-3164, INRIA. 1997
Rapport
inria-00073524v1
|
||
Encoding the Hydra battle as a rewrite systemInternational Symposium on the Mathematical Foundations of Computer Science - MFCS'98, Aug 1998, Brno, Czech Republic, pp.267-276
Communication dans un congrès
inria-00098575v1
|
|||
|
|
Dependency Pairs Termination in Dependent Type Theory Modulo RewritingFSCD 2019 - 4th International Conference on Formal Structures for Computation and Deduction, Jun 2019, Dortmund, Germany. ⟨10.4230/LIPIcs.FSCD.2019.9⟩
Communication dans un congrès
hal-01943941v4
|
||
|
|
Static analysis by abstract interpretation of functional temporal properties of programsOther [cs.OH]. Ecole normale supérieure - ENS PARIS, 2015. English. ⟨NNT : 2015ENSU0017⟩
Thèse
tel-01176641v2
|
||
|
|
The Heart of Intersection Type Assignment[Research Report] RR-5984, INRIA. 2006, pp.34
Rapport
inria-00096419v2
|
||
|
|
Inference of ranking functions for proving temporal properties by abstract interpretationComputer Languages, Systems and Structures, 2015, ⟨10.1016/j.cl.2015.10.001⟩
Article dans une revue
hal-01312239v1
|
||
|
|
On strong normalisation of explicit substitution calculi[Research Report] LIP RR-1999-37, Laboratoire de l'informatique du parallélisme. 1999, 2+11p
Rapport
hal-02101760v1
|
||
|
|
HORPO with Computability Closure : A Reconstruction14th International Conference on Logic for Programming Artificial Intelligence and Reasoning, Oct 2007, Yerevan, Armenia
Communication dans un congrès
inria-00168304v1
|
||
|
|
Induction for Positive Almost Sure Termination - Extended version[Research Report] 2007, pp.16
Rapport
inria-00147450v2
|
||
|
|
A3PAT, an Approach for Certified Automated Termination Proofs2010 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, ACM, Jan 2010, Madrid, Spain. pp.63-72, ⟨10.1145/1706356.1706370⟩
Communication dans un congrès
inria-00535655v1
|
||
|
|
Computability Closure: Ten Years LaterColloquium in honor of Jean-Pierre Jouannaud, Jun 2007, Cachan, France. ⟨10.1007/978-3-540-73147-4_4⟩
Communication dans un congrès
inria-00161092v1
|
||
Outermost ground termination - Extended version[Intern report] A02-R-493 || fissore02d, 2002, 38 p
Rapport
inria-00101079v1
|
|||
|
|
CARIBOO: An Induction Based Proof Tool for Termination with StrategiesFourth International Conference on Principles and Practice of Declarative Programming - PPDP'02, Oct 2002, Pittsburgh, USA, 12 p
Communication dans un congrès
inria-00107557v1
|
||
|
|
Modular termination of C programs[Research Report] RR-8166, INRIA. 2012
Rapport
hal-00760917v2
|
||
|
|
Induction for termination with local strategies - Extended version[Intern report] A01-R-177 || fissore01b, 2001, 29 p
Rapport
inria-00107541v1
|
||
|
|
CoLoR: a Coq library on rewriting and terminationEighth International Workshop on Termination - WST 2006, Aug 2006, Seattle, United States
Communication dans un congrès
inria-00084835v2
|
||
|
|
CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificatesMathematical Structures in Computer Science, 2011, 21 (4), pp.827-859. ⟨10.1017/S0960129511000120⟩
Article dans une revue
inria-00543157v1
|
||
A Computability Path Ordering for Polymorphic Terms11th International Workshop on Termination, Jul 2010, Edinburgh, United Kingdom
Communication dans un congrès
inria-00497405v1
|
|||
|
|
The Taming of the Rew: A Type Theory with Computational AssumptionsProceedings of the ACM on Programming Languages, 2021, POPL 2021, ⟨10.1145/3434341⟩
Article dans une revue
hal-02901011v2
|
||
|
|
Size-based termination of higher-order rewritingJournal of Functional Programming, 2018, ⟨10.1017/S0956796818000072⟩
Article dans une revue
hal-01424921v5
|
||
|
|
Definitions by rewriting in the Calculus of ConstructionsMathematical Structures in Computer Science, 2005, 15 (1), pp.37-92. ⟨10.1017/S0960129504004426⟩
Article dans une revue
inria-00105648v1
|
||
|
|
Estimation of Parallel Complexity with Rewriting TechniquesWorkshop on Termination, Sep 2016, Obergurgl, Austria
Communication dans un congrès
hal-01345914v1
|
||
|
|
Computing Constructor Forms with Non Terminating Rewrite Programs - Extended version[Research Report] 2006, pp.17
Rapport
inria-00113146v1
|
||
|
|
Termination of Rewriting under StrategiesACM Transactions on Computational Logic, 2009, 10 (2), pp.1-52. ⟨10.1145/1462179.1462182⟩
Article dans une revue
inria-00182432v1
|
||
|
|
Higher-order dependency pairsEighth International Workshop on Termination - WST 2006, Aug 2006, Seattle, United States
Communication dans un congrès
inria-00084821v3
|
||
|
|
Complete Lattices and Up-to Techniques5th Asian Symposium on Programming Languages and Systems, Joxan Jaffar, 2007, Singapore, Singapore. pp.351-366, ⟨10.1007/978-3-540-76637-7_24⟩
Communication dans un congrès
ensl-00155308v2
|
||
|
|
Divergence and unique solution of equationsLogical Methods in Computer Science, 2019, ⟨10.23638/LMCS-15(3:12)2019⟩
Article dans une revue
hal-02376814v1
|
||
|
|
fkcc: the Farkas Calculator[Research Report] RR-9313, Inria. 2019
Rapport
hal-02414224v1
|
||
|
|
Coverability and Termination in Recursive Petri NetsPetri Nets 2019 / ACSD 2019 - 40th International Conference on Application and Theory of Petri Nets and Concurrency, Jun 2019, Aachen, Germany
Communication dans un congrès
hal-02081019v1
|