Filter your results
- 31
- 10
- 7
- 2
- 2
- 1
- 1
- 1
- 55
- 6
- 3
- 3
- 3
- 3
- 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
- 54
- 8
- 20
- 20
- 18
- 16
- 14
- 8
- 6
- 5
- 5
- 3
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 53
- 48
- 47
- 47
- 32
- 26
- 26
- 26
- 26
- 25
- 21
- 20
- 20
- 20
- 20
- 20
- 20
- 19
- 16
- 14
- 14
- 14
- 14
- 14
- 12
- 12
- 12
- 11
- 11
- 9
- 9
- 8
- 8
- 8
- 8
- 8
- 8
- 8
- 7
- 7
- 7
- 7
- 6
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 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
- 49
- 6
- 31
- 28
- 54
- 1
- 1
- 2
- 1
- 3
- 3
- 2
- 2
- 1
- 1
- 2
- 4
- 2
- 3
- 2
- 4
- 6
- 3
- 4
- 2
- 2
- 3
- 1
- 1
|
|
sorted by
|
|
Recommandations sur les « éditeurs de la zone grise »Inria. 2023, pp.1-3
Reports
hal-04001505v1
|
||
|
Translating proofs from an impredicative type system to a predicative one2022
Preprints, Working Papers, ...
hal-03848584v1
|
||
Encoding Type Universes Without Using Matching Modulo Associativity and CommutativityFSCD 2022 - 7th International Conference on Formal Structures for Computation and Deduction, Aug 2022, Haifa, Israel. pp.14, ⟨10.4230/LIPIcs.FSCD.2022.24⟩
Conference papers
hal-03708036v1
|
|||
|
Some Axioms for MathematicsFSCD 2021 - 6th International Conference on Formal Structures for Computation and Deduction, Jul 2021, Buenos Aires / Virtual, Argentina. ⟨10.4230/LIPIcs.FSCD.2021.20⟩
Conference papers
hal-03279749v1
|
||
|
The New Rewriting Engine of DeduktiFSCD 2020 - 5th International Conference on Formal Structures for Computation and Deduction, Jun 2020, Paris, France. pp.16, ⟨10.4230/LIPIcs.FSCD.2020.35⟩
Conference papers
hal-02981561v2
|
||
|
Type safety of rewrite rules in dependent typesFSCD 2020 - 5th International Conference on Formal Structures for Computation and Deduction, Jun 2020, Paris, France. pp.14, ⟨10.4230/LIPIcs.FSCD.2020.13⟩
Conference papers
hal-02981528v1
|
||
|
Encoding of Predicate Subtyping with Proof Irrelevance in the λΠ-Calculus Modulo TheoryTYPES 2020 - 26th International Conference on Types for Proofs and Programs, Mar 2020, Turino, Italy. ⟨10.4230/LIPIcs.TYPES.2020.6⟩
Conference papers
hal-03279766v2
|
||
|
Ekstrakto A tool to reconstruct Dedukti proofs from TSTP files (extended abstract)PxTP 2019 - Sixth Workshop on Proof eXchange for Theorem Proving, Aug 2019, Natal, Brazil. pp.27-35, ⟨10.4204/EPTCS.301.5⟩
Conference papers
hal-02200548v1
|
||
|
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⟩
Conference papers
hal-01943941v4
|
||
|
Dependency Pairs Termination in Dependent Type Theory Modulo RewritingTYPES 2019 - 25th International Conference on Types for Proofs and Programs, Jun 2019, Oslo, Norway. pp.30-31
Conference papers
hal-02442484v1
|
||
|
Termination of λΠ modulo rewriting using the size-change principle (work in progress)16th International Workshop on Termination, Jul 2018, Oxford, United Kingdom. pp. 10-14
Conference papers
hal-01944731v1
|
||
|
Size-based termination of higher-order rewritingJournal of Functional Programming, 2018, ⟨10.1017/S0956796818000072⟩
Journal articles
hal-01424921v5
|
||
|
Termination of rewrite relations on λ-terms based on Girard's notion of reducibilityTheoretical Computer Science, 2015, 611 (50-86), pp.37. ⟨10.1016/j.tcs.2015.07.045⟩
Journal articles
hal-01191693v1
|
||
|
The Computability Path OrderingLogical Methods in Computer Science, 2015, ⟨10.2168/LMCS-11(4:3)2015⟩
Journal articles
hal-01163091v2
|
||
|
A point on fixpoints in posets2014
Preprints, Working Papers, ...
hal-01097809v1
|
||
|
Elements of mathematics and logic for computer program analysisMaster. Institute of Applied Mechanics and Informatics (IAMA) of the Vietnamese Academy of Sciences and Technology (VAST) at Ho Chi Minh City, Vietnam, 2013, pp.37
Lectures
cel-00934160v1
|
||
|
Automated verification of termination certificates15th National Symposium of Selected ICT Problems, Dec 2012, Hanoi, Vietnam
Conference papers
hal-00763495v1
|
||
|
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
Habilitation à diriger des recherches
tel-00724233v2
|
||
|
First steps towards the certification of an ARM simulator using CompcertFirst International Conference on Certified Programs and Proofs, Dec 2011, Hengchun, Taiwan. ⟨10.1007/978-3-642-25379-9_25⟩
Conference papers
inria-00624833v1
|
||
|
Argument filterings and usable rules in higher-order rewrite systemsIPSJ Transactions on Programming, 2011, 4 (2), pp.1-12
Journal articles
inria-00555008v1
|
||
|
Designing a CPU model: from a pseudo-formal document to fast code3rd Workshop on: Rapid Simulation and Performance Evaluation: Methods and Tools, Jan 2011, Heraklion, Greece
Conference papers
inria-00546228v1
|
||
|
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⟩
Journal articles
inria-00543157v1
|
||
|
On the confluence of lambda-calculus with conditional rewritingTheoretical Computer Science, 2010, 411 (37), pp.3301-3327. ⟨10.1016/j.tcs.2009.07.058⟩
Journal articles
inria-00509054v1
|
||
|
Argument filterings and usable rules in higher-order rewrite systems[Research Report] IEICE-TR-SS2010-24.Vol110.N169, 2010
Reports
inria-00543160v1
|
||
|
On the relation between sized-types based termination and semantic labelling18th EACSL Annual Conference on Computer Science Logic - CSL 09, Sep 2009, Coimbra, Portugal
Conference papers
inria-00397689v1
|
||
|
Automated Verification of Termination Certificates[Research Report] RR-6949, INRIA. 2009, pp.24
Reports
inria-00390902v1
|
||
|
Static Dependency Pair Method based on Strong Computability for Higher-Order Rewrite SystemsIEICE Transactions on Information and Systems, 2009
Journal articles
inria-00397820v1
|
||
|
The computability path ordering: the end of a quest7th EACSL Annual Conference on Computer Science Logic - CSL'08, Sep 2008, Bertinoro, Italy
Conference papers
inria-00288209v2
|
||
|
From formal proofs to mathematical proofs: a safe, incremental way for building in first-order decision procedures5th IFIP International Conference on Theoretical Computer Science - TCS 2008, Sep 2008, Milan, Italy. ⟨10.1007/978-0-387-09680-3_24⟩
Conference papers
inria-00275382v1
|
||
|
HORPO with Computability Closure : A Reconstruction14th International Conference on Logic for Programming Artificial Intelligence and Reasoning, Oct 2007, Yerevan, Armenia
Conference papers
inria-00168304v1
|
- 1
- 2