The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Frédéric Blanqui: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. Frédéric Blanqui
    Definitions by Rewriting in the Calculus of Constructions. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:9-18 [Conf]
  4. 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]
  5. 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]
  6. Frédéric Blanqui
    Rewriting Modulo in Deduction Modulo. [Citation Graph (0, 0)][DBLP]
    RTA, 2003, pp:395-409 [Conf]
  7. 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]
  8. 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]
  9. Frédéric Blanqui
    Termination and Confluence of Higher-Order Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 2000, pp:47-61 [Conf]
  10. Frédéric Blanqui
    Inductive Types in the Calculus of Algebraic Constructions. [Citation Graph (0, 0)][DBLP]
    TLCA, 2003, pp:46-59 [Conf]
  11. 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]
  12. 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]
  13. 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]
  14. Frédéric Blanqui
    Computability Closure: Ten Years Later. [Citation Graph (0, 0)][DBLP]
    Rewriting, Computation and Proof, 2007, pp:68-88 [Conf]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. Frédéric Blanqui
    Termination and Confluence of Higher-Order Rewrite Systems [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  22. Frédéric Blanqui
    Definitions by Rewriting in the Calculus of Constructions [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  23. 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]
  24. Frédéric Blanqui
    Type theory and rewriting [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  25. 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]
  26. Frédéric Blanqui
    Inductive types in the Calculus of Algebraic Constructions [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  27. Frédéric Blanqui
    Rewriting modulo in Deduction modulo [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  28. Frédéric Blanqui
    Definitions by rewriting in the Calculus of Constructions [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  29. Frédéric Blanqui
    Inductive types in the Calculus of Algebraic Constructions [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  30. 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]
  31. 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]
  32. Frédéric Blanqui
    (HO)RPO Revisited [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  33. 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]
  34. 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]
  35. 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]
  36. Frédéric Blanqui
    Computability Closure: Ten Years Later [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  37. 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]

  38. The Computability Path Ordering: The End of a Quest. [Citation Graph (, )][DBLP]


  39. On the Relation between Sized-Types Based Termination and Semantic Labelling. [Citation Graph (, )][DBLP]


  40. From Formal Proofs to Mathematical Proofs: A Safe, Incremental Way for Building in First-order Decision Procedures. [Citation Graph (, )][DBLP]


  41. From formal proofs to mathematical proofs: a safe, incremental way for building in first-order decision procedures [Citation Graph (, )][DBLP]


  42. The computability path ordering: the end of a quest [Citation Graph (, )][DBLP]


  43. On the relation between size-based termination and semantic labelling [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.301secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002