Filter your results
- 53
- 1
- 31
- 10
- 6
- 2
- 2
- 1
- 1
- 1
- 53
- 7
- 31
- 28
- 2
- 1
- 3
- 3
- 2
- 2
- 1
- 1
- 2
- 4
- 2
- 3
- 2
- 4
- 6
- 3
- 4
- 2
- 2
- 3
- 1
- 1
- 49
- 5
- 20
- 20
- 18
- 15
- 14
- 8
- 6
- 5
- 4
- 3
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 54
- 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
54 Results
|
|
sorted by
|
|
Definitions by rewriting in the Calculus of ConstructionsMathematical Structures in Computer Science, 2005, 15 (1), pp.37-92. ⟨10.1017/S0960129504004426⟩
Journal articles
inria-00105648v1
|
||
|
Higher-order dependency pairsEighth International Workshop on Termination - WST 2006, Aug 2006, Seattle, United States
Conference papers
inria-00084821v3
|
||
|
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
|
||
|
The Computability Path OrderingLogical Methods in Computer Science, 2015, ⟨10.2168/LMCS-11(4:3)2015⟩
Journal articles
hal-01163091v2
|
||
|
Définition de la classe de réécriture à intégrer[Contrat] A04-R-487 || blanqui04c, 2004, 7 p
Reports
inria-00099930v1
|
||
|
Argument filterings and usable rules in higher-order rewrite systemsIPSJ Transactions on Programming, 2011, 4 (2), pp.1-12
Journal articles
inria-00555008v1
|
||
|
Higher-Order Termination: from Kruskal to Computability13th International Conference on Logic for Programming, Artificial Intelligence and Reasoning - LPAR 2006, Nov 2006, Phnom Penh, Cambodia. pp.1-14, ⟨10.1007/11916277_1⟩
Conference papers
inria-00091308v2
|
||
|
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
|
||
|
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
|
||
|
Type theory and rewriting2001
Other publications
inria-00105525v2
|
||
|
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
|
||
|
Decidability of Type-checking in the Calculus of Algebraic Constructions with Size Annotations14th Annual Conference of the EACSL, Aug 2005, Oxford, United Kingdom. pp.135--150, ⟨10.1007/11538363_11⟩
Conference papers
inria-00000200v2
|
||
|
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
|
||
|
A point on fixpoints in posets2014
Preprints, Working Papers, ...
hal-01097809v1
|
||
|
Argument filterings and usable rules in higher-order rewrite systems[Research Report] IEICE-TR-SS2010-24.Vol110.N169, 2010
Reports
inria-00543160v1
|
||
|
A type-based termination criterion for dependently-typed higher-order rewrite systems15th International Conference on Rewriting Techniques and Applications - RTA'04, 2004, Aachen, Germany
Conference papers
inria-00100254v1
|
||
|
Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems13th International Conference on Logic for Programming, Artificial Intelligence and Reasoning - LPAR 2006, Nov 2006, Phnom Penh, Cambodia. ⟨10.1007/11916277_8⟩
Conference papers
inria-00084837v2
|
||
|
Static Dependency Pair Method based on Strong Computability for Higher-Order Rewrite SystemsIEICE Transactions on Information and Systems, 2009
Journal articles
inria-00397820v1
|
||
|
An Isabelle formalization of protocol-independent secrecy with an application to e-commerce2002
Other publications
inria-00105606v1
|
||
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
|
|||
|
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
|
||
|
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
|
||
|
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
|
||
|
Automated verification of termination certificates15th National Symposium of Selected ICT Problems, Dec 2012, Hanoi, Vietnam
Conference papers
hal-00763495v1
|
||
|
Inductive types in the Calculus of Algebraic ConstructionsFundamenta Informaticae, 2005, 65 (1-2), pp.61-86
Journal articles
inria-00105655v1
|
||
|
Definitions by Rewriting in the Calculus of Constructions16th Annual IEEE Symposium on Logic in Computer Science, Jun 2001, Boston, United States
Conference papers
inria-00105568v1
|
||
|
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
|
||
|
(HO)RPO Revisited[Research Report] RR-5972, INRIA. 2006, pp.20
Reports
inria-00090488v3
|
||
|
Inductive types in the Calculus of Algebraic ConstructionsTyped Lambda Calculi and Applications, 6th International Conference, TLCA 2003, Jun 2003, Valencia, Spain
Conference papers
inria-00105617v1
|
||
|
Proposition d'architecture du moteur de test de conversion[Contrat] A04-R-488 || blanqui04d, 2004, 7 p
Reports
inria-00099931v1
|
- 1
- 2