default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThérèse Hardin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i4]Gilles Dowek, Thérèse Hardin, Claude Kirchner:
Binding Logic: proofs and models. CoRR abs/2305.15782 (2023)
2010 – 2019
- 2015
- [c16]Damien Doligez, Christèle Faure, Thérèse Hardin, Manuel Maarek
:
Avoiding Security Pitfalls with Functional Programming: A Report on the Development of a Secure XML Validator. ICSE (2) 2015: 209-218 - 2014
- [c15]Damien Doligez, Christèle Faure, Thérèse Hardin, Manuel Maarek:
Experience in using a typed functional language for the development of a security application. F-IDE 2014: 58-63
2000 – 2009
- 2009
- [c14]Philippe Ayrault, Thérèse Hardin, François Pessaux:
Development of a Generic Voter under FoCal. TAP@TOOLS 2009: 10-26 - [i3]Éric Jaeger, Thérèse Hardin:
A Few Remarks About Formal Development of Secure Systems. CoRR abs/0902.3861 (2009) - [i2]Éric Jaeger, Thérèse Hardin:
Yet Another Deep Embedding of B:Extending de Bruijn Notations. CoRR abs/0902.3865 (2009) - 2008
- [c13]Éric Jaeger, Thérèse Hardin:
A Few Remarks about Formal Development of Secure Systems. HASE 2008: 165-174 - [c12]Philippe Ayrault, Thérèse Hardin, François Pessaux:
Development Life-cycle of Critical Software Under FoCaL. TTSS 2008: 15-31 - 2007
- [c11]Frédéric Blanqui, Thérèse Hardin, Pierre Weis:
On the Implementation of Construction Functions for Non-free Concrete Data Types. ESOP 2007: 95-109 - [i1]Frédéric Blanqui, Thérèse Hardin, Pierre Weis:
On the implementation of construction functions for non-free concrete data types. CoRR abs/cs/0701031 (2007) - 2004
- [j12]Thérèse Hardin, Renaud Rioboo:
Les objets des mathématiques. Obj. Logiciel Base données Réseaux 10(4): 83-118 (2004) - [c10]Catherine Dubois, Thérèse Hardin, Véronique Donzeau-Gouge:
Building certified components within FOCAL. Trends in Functional Programming 2004: 33-48 - 2003
- [j11]Gilles Dowek, Thérèse Hardin, Claude Kirchner:
Theorem Proving Modulo. J. Autom. Reason. 31(1): 33-72 (2003) - 2002
- [c9]Gilles Dowek, Thérèse Hardin, Claude Kirchner:
Binding Logic: Proofs and Models. LPAR 2002: 130-144 - [c8]Virgile Prevosto, Damien Doligez, Thérèse Hardin:
Algebraic Structures and Dependent Records. TPHOLs 2002: 298-313 - 2001
- [j10]Gilles Dowek, Thérèse Hardin, Claude Kirchner:
HOL-λσ: an intentional first-order expression of higher-order logic. Math. Struct. Comput. Sci. 11(1): 21-45 (2001) - 2000
- [j9]Gilles Dowek, Thérèse Hardin, Claude Kirchner:
Higher Order Unification via Explicit Substitutions. Inf. Comput. 157(1-2): 183-235 (2000)
1990 – 1999
- 1999
- [c7]Gilles Dowek, Thérèse Hardin, Claude Kirchner:
HOL-lambdasigma: An Intentional First-Order Expression of Higher-Order Logic. RTA 1999: 317-331 - [c6]Sylvain Boulmé, Thérèse Hardin, Daniel Hirschkoff, Valérie Ménissier-Morain, Renaud Rioboo:
On the way to certify Computer Algebra Systems. Calculemus 1999: 370-385 - 1998
- [j8]Thérèse Hardin, Luc Maranget:
Functional Runtime Systems Within the Lambda-Sigma Calculus. J. Funct. Program. 8(2): 131-176 (1998) - 1996
- [j7]Pierre-Louis Curien, Thérèse Hardin, Jean-Jacques Lévy:
Confluence Properties of Weak and Strong Calculi of Explicit Substitutions. J. ACM 43(2): 362-397 (1996) - [j6]Pierre-Louis Curien, Thérèse Hardin, Alejandro Ríos:
Strong Normalizations of Substitutions. J. Log. Comput. 6(6): 799-817 (1996) - [c5]Thérèse Hardin, Luc Maranget, Bruno Pagano:
Functional Back-Ends within the Lambda-Sigma Calculus. ICFP 1996: 25-33 - [c4]Gilles Dowek, Thérèse Hardin, Claude Kirchner, Frank Pfenning:
Unification via Explicit Substitutions: The Case of Higher-Order Patterns. JICSLP 1996: 259-273 - 1995
- [j5]Thérèse Hardin:
Eta-conversion for the languages of explicit substitutions. Appl. Algebra Eng. Commun. Comput. 6(4/5): 325 (1995) - [c3]Gilles Dowek, Thérèse Hardin, Claude Kirchner:
Higher-Order Unification via Explicit Substitutions (Extended Abstract). LICS 1995: 366-374 - 1994
- [j4]Thérèse Hardin:
Eta-Conversion for the Languages of Explicit Substitutions. Appl. Algebra Eng. Commun. Comput. 5: 317-341 (1994) - [j3]Pierre-Louis Curien, Thérèse Hardin:
Yet Yet a Counterexample for lambda + SP. J. Funct. Program. 4(1): 113-115 (1994) - 1992
- [c2]Thérèse Hardin:
Eta-conversion for the Languages of Explicit Substitutions. ALP 1992: 306-321 - [c1]Pierre-Louis Curien, Thérèse Hardin, Alejandro Ríos:
Strong Normalization of Substitutions. MFCS 1992: 209-217
1980 – 1989
- 1989
- [j2]Thérèse Hardin:
Confluence Results for the Pure Strong Categorical Logic CCL: lambda-Calculi as Subsystems of CCL. Theor. Comput. Sci. 65(3): 291-342 (1989) - 1986
- [j1]Thérèse Hardin, Alain Laville:
Proof of termination of the rewriting system subst on CCL. Theor. Comput. Sci. 46: 305-312 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
