- N. D'ORDRE : UNIVERSITE PARIS XI
- On the confluence of lambda-calculus with conditional rewriting
- Rapport de DEA -Paris, 18 Septembre 1998 The Calculus
- Designing a CPU model: from a pseudo-formal document to fast code F. Blanqui1,2, C. Helmstetter1,2,, V. Joloboff1,2, J.-F. Monin1,3,4 and X. Shi1,4
- de recherche SN0249-6399ISRNINRIA/RR--6949--FR+ENG
- Termination and confluence of higher-order rewrite systems
- Inductive Data Type Systems Frederic Blanqui, Jean-Pierre Jouannaud
- Building Decision Procedures in the Calculus of Inductive Constructions
- Z {0, +, -} 0 0 - 1 + 2
- Inductive types in the Calculus of Algebraic Constructions
- HORPO with Computability Closure : A Reconstruction
- Argument Filterings and Usable Rules in Higher-Order Rewrite Systems
- SimSoC-CERT: a Certified Simulator for Systems on Chip
- A type-based termination criterion for dependently-typed higher-order rewrite systems
- Under consideration for publication in Math. Struct. in Comp. Science CoLoR: a Coq library on well-founded rewrite
- On the confluence of -calculus with conditional rewriting
- Universit de Paris VII -Denis Diderot D.E.A. Smantique, Preuves, Langages
- Departement de formation doctorale en informatique Ecole doctorale IAEM Lorraine
- IPSJ Transactions on Programming Vol. 4 No. 2 112 (Feb. 2011) Regular Paper
- A size-based termination criterion for dependently-typed higher-order
- IEICE TRANS. INF. & SYST., VOL.Exx??, NO.xx XXXX 200x Static Dependency Pair Method based on
- On the relation between sized-types based termination and semantic labelling
- The Computability Path Ordering: the End of a Quest
- From Formal Proofs to Mathematical Proofs: A Safe, Incremental Way for Building in
- On the implementation of construction functions for non-free concrete data types
- Higher-Order Termination: From Kruskal to Computability
- Combining typing and size constraints for checking the termination of higher-order
- 1 Higher-order dependency pairs Frdric Blanqui
- 1 CoLoR: a Coq Library on Rewriting and termination
- Decidability of Type-checking in the Calculus of Algebraic Constructions with Size Annotations
- Fundamenta Informaticae 65(1-2), 61-86, 2005 1 Inductive types in the Calculus of Algebraic Constructions
- Math. Struct. in Comp. Science (2005), vol. 15(1), pp. 3792. c 2005 Cambridge University DOI: 10.1017/S0960129504004426 Printed in the United Kingdom
- An Isabelle formalization of protocol-independent secrecy
- Universite Paris XI Orsay, France
- Definitions by Rewriting in the Calculus of Constructions
- The Calculus of Algebraic Constructions Frederic Blanqui
- We apologize: the interpretation function f, required in the strong normal-ization Theorem 33 and defined in Definition 36 does not satisfy the conditions
- Software development suffers from a number of well known difficulties, both technical and managerial [2]. A technical
- cole Polytechnique prsente pour obtenir
- Termination and confluence of higher-order rewrite systems
- Decidability of Type-checking in the Calculus of Algebraic Constructions with Size Annotations
- Computability Closure: Ten Years Later Frdric Blanqui
- On the confluence of -calculus with conditional rewriting
- de recherche ISSN0249-6399ISRNINRIA/RR--5972--FR+ENG
- Rewriting modulo in Deduction modulo Frdric Blanqui
- A type-based termination criterion for dependently-typed higher-order rewrite systems
- First Steps Towards the Certification of an ARM Simulator
- Formal proof of decision procedures for the combinations of equational theories
- First Steps Towards the Certification of an ARM Simulator
