The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Thérèse Hardin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gilles Dowek, Thérèse Hardin, Claude Kirchner
    Higher-Order Unification via Explicit Substitutions (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    LICS, 1995, pp:366-374 [Conf]
  2. Thérèse Hardin
    Eta-conversion for the Languages of Explicit Substitutions. [Citation Graph (0, 0)][DBLP]
    ALP, 1992, pp:306-321 [Conf]
  3. Thérèse Hardin, Luc Maranget, Bruno Pagano
    Functional Back-Ends within the Lambda-Sigma Calculus. [Citation Graph (0, 0)][DBLP]
    ICFP, 1996, pp:25-33 [Conf]
  4. Gilles Dowek, Thérèse Hardin, Claude Kirchner, Frank Pfenning
    Unification via Explicit Substitutions: The Case of Higher-Order Patterns. [Citation Graph (0, 0)][DBLP]
    JICSLP, 1996, pp:259-273 [Conf]
  5. Gilles Dowek, Thérèse Hardin, Claude Kirchner
    Binding Logic: Proofs and Models. [Citation Graph (0, 0)][DBLP]
    LPAR, 2002, pp:130-144 [Conf]
  6. Pierre-Louis Curien, Thérèse Hardin, Alejandro Ríos
    Strong Normalization of Substitutions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:209-217 [Conf]
  7. Gilles Dowek, Thérèse Hardin, Claude Kirchner
    HOL-lambdasigma: An Intentional First-Order Expression of Higher-Order Logic. [Citation Graph (0, 0)][DBLP]
    RTA, 1999, pp:317-331 [Conf]
  8. Virgile Prevosto, Damien Doligez, Thérèse Hardin
    Algebraic Structures and Dependent Records. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2002, pp:298-313 [Conf]
  9. Thérèse Hardin
    Eta-Conversion for the Languages of Explicit Substitutions. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1994, v:5, n:, pp:317-341 [Journal]
  10. Thérèse Hardin
    Eta-Conversion for Languages of Explicit Substitutions. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1995, v:6, n:4/5, pp:325- [Journal]
  11. Sylvain Boulmé, Thérèse Hardin, Daniel Hirschkoff, Valérie Ménissier-Morain, Renaud Rioboo
    On the way to certify Computer Algebra Systems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:23, n:3, pp:- [Journal]
  12. Gilles Dowek, Thérèse Hardin, Claude Kirchner
    Higher Order Unification via Explicit Substitutions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:157, n:1-2, pp:183-235 [Journal]
  13. Pierre-Louis Curien, Thérèse Hardin, Jean-Jacques Lévy
    Confluence Properties of Weak and Strong Calculi of Explicit Substitutions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1996, v:43, n:2, pp:362-397 [Journal]
  14. Gilles Dowek, Thérèse Hardin, Claude Kirchner
    Theorem Proving Modulo. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2003, v:31, n:1, pp:33-72 [Journal]
  15. Pierre-Louis Curien, Thérèse Hardin
    Yet Yet a Counterexample for lambda + SP. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1994, v:4, n:1, pp:113-115 [Journal]
  16. Thérèse Hardin, Luc Maranget
    Functional Runtime Systems Within the Lambda-Sigma Calculus. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1998, v:8, n:2, pp:131-176 [Journal]
  17. Pierre-Louis Curien, Thérèse Hardin, Alejandro Ríos
    Strong Normalizations of Substitutions. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1996, v:6, n:6, pp:799-817 [Journal]
  18. Gilles Dowek, Thérèse Hardin, Claude Kirchner
    HOL-[lambda][sigma]: an intentional first-order expression of higher-order logic. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2001, v:11, n:1, pp:21-45 [Journal]
  19. Thérèse Hardin
    Confluence Results for the Pure Strong Categorical Logic CCL: lambda-Calculi as Subsystems of CCL. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:65, n:3, pp:291-342 [Journal]
  20. 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]
  21. Catherine Dubois, Thérèse Hardin, Véronique Donzeau-Gouge
    Building certified components within FOCAL. [Citation Graph (0, 0)][DBLP]
    Trends in Functional Programming, 2004, pp:33-48 [Conf]
  22. 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]

  23. A Few Remarks about Formal Development of Secure Systems. [Citation Graph (, )][DBLP]


  24. Development of a Generic Voter under FoCal. [Citation Graph (, )][DBLP]


  25. Les objets des mathématiques. [Citation Graph (, )][DBLP]


  26. A Few Remarks About Formal Development of Secure Systems [Citation Graph (, )][DBLP]


  27. Yet Another Deep Embedding of B:Extending de Bruijn Notations [Citation Graph (, )][DBLP]


  28. Development Life-cycle of Critical Software Under FoCaL. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
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