 |
 |
 |
|
|
||
|---|---|---|
| inria-00555008v1
Journal articles
Argument filterings and usable rules in higher-order rewrite systems IPSJ Transactions on Programming, IPSJ, 2011, 4 (2), pp.1-12 |
||
| |
||
| tel-01750475v1
Theses
Constructions d'ordres, analyse de la complexité Autre [cs.OH]. Institut National Polytechnique de Lorraine, 2000. Français. ⟨NNT : 2000INPL102N⟩ |
||
| hal-00763495v1
Conference papers
Automated verification of termination certificates 15th National Symposium of Selected ICT Problems, Dec 2012, Hanoi, Vietnam |
||
| hal-01424921v5
Journal articles
Size-based termination of higher-order rewriting Journal of Functional Programming, Cambridge University Press (CUP), 2018, ⟨10.1017/S0956796818000072⟩ |
||
| tel-01247115v2
Theses
View-based query determinacy and rewritings over graph databases Databases [cs.DB]. Université Paris-Saclay, 2015. English. ⟨NNT : 2015SACLN015⟩ |
||
| tel-01415945v1
Theses
Object-Oriented Mechanisms for Interoperability between Proof Systems Logic in Computer Science [cs.LO]. Conservatoire National Des Arts et Métiers, Paris, 2016. English |
||
| inria-00509486v2
Preprints, Working Papers, ...
Behavior Abstraction in Malware Analysis - Extended Version 2010 |
||
| inria-00370379v2
Preprints, Working Papers, ...
A completeness theorem for strong normalization in minimal deduction modulo 2009 |
||
| hal-02101787v1
Reports
Proof reconstruction (preliminary version). [Research Report] LIP 1996-26, Laboratoire de l'informatique du parallélisme. 1996, 2+14p |
||
| inria-00436070v1
Conference papers
Diagrammatic Confluence and Completion International Conference in Automata, Languages and Programming, Paul Spirakis, Jul 2009, Rhodes, Greece. ⟨10.1007/978-3-642-02930-1_18⟩  |
||
| hal-01377667v1
Book sections
Interaction-based Programming in MGS Andrew Adamatzky. Advances in Unconventional Computing - Volume 1: Theory, 22, Springer, pp.305-342, 2017, Series: Emergence, Complexity and Computation, 978-3-319-33923-8. ⟨10.1007/978-3-319-33924-5⟩  |
||
| lirmm-00764341v3
Conference papers
A Sound and Complete Backward Chaining Algorithm for Existential Rules RR: Web Reasoning and Rule Systems, Sep 2012, Vienna, Austria. pp.122-138, ⟨10.1007/978-3-642-33203-6_10⟩ |
||
| tel-01752911v1
Theses
Définitions par réécriture dans le lambda-calcul : confluence, réductibilité et typage Autre [cs.OH]. Institut National Polytechnique de Lorraine, 2007. Français. ⟨NNT : 2007INPL102N⟩ |
||
| tel-00672699v1
Theses
Conception d'un noyau de vérification de preuves pour le λΠ-calcul modulo Logique en informatique [cs.LO]. Ecole Polytechnique X, 2011. Français |
||
| hal-02435522v1
Reports
Detecting interference through graph reduction [Research Report] Loria & Inria Grand Est. 1997 |
||
| inria-00180065v1
Preprints, Working Papers, ...
A formalization of diagrammatic proofs in abstract rewriting 2006 |
||
| tel-02161197v1
Habilitation à diriger des recherches
Rewriting methods in higher algebra Category Theory [math.CT]. Université Paris 7, 2019 |
||
| hal-01319677v1
Conference papers
Code Transformation by Direct Transformation of ASTs International Workshop on Smalltalk Technologies, Jul 2015, Brescia, Italy. ⟨10.1145/2811237.2811297⟩ |
||
| tel-00646395v1
Theses
Analyse de Programmes Malveillants par Abstraction de Comportements Logique en informatique [cs.LO]. Institut National Polytechnique de Lorraine - INPL, 2011. Français |
||
| tel-00724233v2
Habilitation à diriger des recherches
Terminaison des systèmes de réécriture d'ordre supérieur basée sur la notion de clôture de calculabilité Logique [math.LO]. Université Paris-Diderot - Paris VII, 2012 |
||
| tel-00656766v1
Habilitation à diriger des recherches
Complexité implicite des calculs : interprétation de programmes Complexité [cs.CC]. Institut National Polytechnique de Lorraine - INPL, 2011 |
||
| tel-01749159v2
Theses
A type system for embedded rewriting programming Software Engineering [cs.SE]. Université de Lorraine, 2012. English. ⟨NNT : 2012LORR0015⟩ |
||
| lirmm-00825634v1
Reports
On the Exploration of the Query Rewriting Space with Existential Rules [Research Report] RR-13016, Lirmm. 2013 |
||
| hal-01097412v2
Conference papers
Translating HOL to Dedukti Fourth Workshop on Proof eXchange for Theorem Proving, PxTP'15, Aug 2015, Berlin, Germany. pp.74-88, ⟨10.4204/EPTCS.186.8⟩ |
||
| hal-02901011v2
Journal articles
The Taming of the Rew: A Type Theory with Computational Assumptions Proceedings of the ACM on Programming Languages, ACM, In press, POPL 2021 |
||
| inria-00592271v1
Journal articles
Proving Weak Properties of Rewriting Theoretical Computer Science, Elsevier, 2011, 412, pp.4405-4438. ⟨10.1016/j.tcs.2011.04.028⟩ |
||
| hal-01191693v1
Journal articles
Termination of rewrite relations on λ-terms based on Girard's notion of reducibility Theoretical Computer Science, Elsevier, 2015, 611 (50-86), pp.37. ⟨10.1016/j.tcs.2015.07.045⟩ |
||
| hal-01112160v1
Journal articles
Characterizing polynomial time complexity of stream programs using interpretations Theoretical Computer Science, Elsevier, 2015, 585, pp.41-54. ⟨10.1016/j.tcs.2015.03.008⟩ |
||
| inria-00543157v1
Journal articles
CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2011, 21 (4), pp.827-859. ⟨10.1017/S0960129511000120⟩ |
||
|
|
||