Search the dblp DataBase
Frédéric Blanqui :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Frédéric Blanqui Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations. [Citation Graph (0, 0)][DBLP ] CSL, 2005, pp:135-150 [Conf ] Frédéric Blanqui , Claude Kirchner , Colin Riba On the Confluence of lambda -Calculus with Conditional Rewriting. [Citation Graph (0, 0)][DBLP ] FoSSaCS, 2006, pp:382-397 [Conf ] Frédéric Blanqui Definitions by Rewriting in the Calculus of Constructions. [Citation Graph (0, 0)][DBLP ] LICS, 2001, pp:9-18 [Conf ] Frédéric Blanqui , Jean-Pierre Jouannaud , Albert Rubio Higher-Order Termination: From Kruskal to Computability. [Citation Graph (0, 0)][DBLP ] LPAR, 2006, pp:1-14 [Conf ] Frédéric Blanqui , Colin Riba Combining Typing and Size Constraints for Checking the Termination of Higher-Order Conditional Rewrite Systems. [Citation Graph (0, 0)][DBLP ] LPAR, 2006, pp:105-119 [Conf ] Frédéric Blanqui Rewriting Modulo in Deduction Modulo. [Citation Graph (0, 0)][DBLP ] RTA, 2003, pp:395-409 [Conf ] Frédéric Blanqui A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems. [Citation Graph (0, 0)][DBLP ] RTA, 2004, pp:24-39 [Conf ] Frédéric Blanqui , Jean-Pierre Jouannaud , Mitsuhiro Okada The Calculus of algebraic Constructions. [Citation Graph (0, 0)][DBLP ] RTA, 1999, pp:301-316 [Conf ] Frédéric Blanqui Termination and Confluence of Higher-Order Rewrite Systems. [Citation Graph (0, 0)][DBLP ] RTA, 2000, pp:47-61 [Conf ] Frédéric Blanqui Inductive Types in the Calculus of Algebraic Constructions. [Citation Graph (0, 0)][DBLP ] TLCA, 2003, pp:46-59 [Conf ] Frédéric Blanqui Inductive types in the Calculus of Algebraic Constructions. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2005, v:65, n:1-2, pp:61-86 [Journal ] Frédéric Blanqui Definitions by rewriting in the Calculus of Constructions. [Citation Graph (0, 0)][DBLP ] Mathematical Structures in Computer Science, 2005, v:15, n:1, pp:37-92 [Journal ] Frédéric Blanqui , Jean-Pierre Jouannaud , Mitsuhiro Okada Inductive-data-type systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:272, n:1-2, pp:41-68 [Journal ] Frédéric Blanqui Computability Closure: Ten Years Later. [Citation Graph (0, 0)][DBLP ] Rewriting, Computation and Proof, 2007, pp:68-88 [Conf ] Frédéric Blanqui , Jean-Pierre Jouannaud , Pierre-Yves Strub Building Decision Procedures in the Calculus of Inductive Constructions. [Citation Graph (0, 0)][DBLP ] CSL, 2007, pp:328-342 [Conf ] Frédéric Blanqui , Thérèse Hardin , Pierre Weis On the Implementation of Construction Functions for Non-free Concrete Data Types. [Citation Graph (0, 0)][DBLP ] ESOP, 2007, pp:95-109 [Conf ] Frédéric Blanqui , Jean-Pierre Jouannaud , Albert Rubio HORPO with Computability Closure: A Reconstruction. [Citation Graph (0, 0)][DBLP ] LPAR, 2007, pp:138-150 [Conf ] Frédéric Blanqui , Thérèse Hardin , Pierre Weis On the implementation of construction functions for non-free concrete data types [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Frédéric Blanqui A type-based termination criterion for dependently-typed higher-order rewrite systems [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Frédéric Blanqui , Jean-Pierre Jouannaud , Mitsuhiro Okada The Calculus of Algebraic Constructions [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Frédéric Blanqui Termination and Confluence of Higher-Order Rewrite Systems [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Frédéric Blanqui Definitions by Rewriting in the Calculus of Constructions [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Frédéric Blanqui , Jean-Pierre Jouannaud , Mitsuhiro Okada Inductive-data-type Systems [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Frédéric Blanqui Type theory and rewriting [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Frédéric Blanqui An Isabelle formalization of protocol-independent secrecy with an application to e-commerce [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Frédéric Blanqui Inductive types in the Calculus of Algebraic Constructions [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Frédéric Blanqui Rewriting modulo in Deduction modulo [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Frédéric Blanqui Definitions by rewriting in the Calculus of Constructions [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Frédéric Blanqui Inductive types in the Calculus of Algebraic Constructions [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Frédéric Blanqui , Claude Kirchner , Colin Riba On the confluence of lambda-calculus with conditional rewriting [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Frédéric Blanqui , Colin Riba Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Frédéric Blanqui (HO)RPO Revisited [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Frédéric Blanqui , Jean-Pierre Jouannaud , Albert Rubio Higher-Order Termination: from Kruskal to Computability [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Frédéric Blanqui Decidability of Type-checking in the Calculus of Algebraic Constructions with Size Annotations [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Frédéric Blanqui , Jean-Pierre Jouannaud , Pierre-Yves Strub Building Decision Procedures in the Calculus of Inductive Constructions [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Frédéric Blanqui Computability Closure: Ten Years Later [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Frédéric Blanqui , Jean-Pierre Jouannaud , Albert Rubio HORPO with Computability Closure : A Reconstruction [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] The Computability Path Ordering: The End of a Quest. [Citation Graph (, )][DBLP ] On the Relation between Sized-Types Based Termination and Semantic Labelling. [Citation Graph (, )][DBLP ] From Formal Proofs to Mathematical Proofs: A Safe, Incremental Way for Building in First-order Decision Procedures. [Citation Graph (, )][DBLP ] From formal proofs to mathematical proofs: a safe, incremental way for building in first-order decision procedures [Citation Graph (, )][DBLP ] The computability path ordering: the end of a quest [Citation Graph (, )][DBLP ] On the relation between size-based termination and semantic labelling [Citation Graph (, )][DBLP ] Search in 0.006secs, Finished in 0.008secs