Thérèse Hardin

992 total citations
18 papers, 365 citations indexed

About

Thérèse Hardin is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Thérèse Hardin has authored 18 papers receiving a total of 365 indexed citations (citations by other indexed papers that have themselves been cited), including 16 papers in Artificial Intelligence, 14 papers in Computational Theory and Mathematics and 2 papers in Computer Networks and Communications. Recurrent topics in Thérèse Hardin's work include Logic, programming, and type systems (16 papers), Logic, Reasoning, and Knowledge (10 papers) and Formal Methods in Verification (9 papers). Thérèse Hardin is often cited by papers focused on Logic, programming, and type systems (16 papers), Logic, Reasoning, and Knowledge (10 papers) and Formal Methods in Verification (9 papers). Thérèse Hardin collaborates with scholars based in France, United States and Canada. Thérèse Hardin's co-authors include Gilles Dowek, Claude Kirchner, Pierre-Louis Curien, Jean-Jacques Lévy, Luc Maranget, Bruno Pagano, Frank Pfenning, Damien Doligez and Christèle Faure and has published in prestigious journals such as SHILAP Revista de lepidopterología, Journal of the ACM and Theoretical Computer Science.

In The Last Decade

Thérèse Hardin

18 papers receiving 305 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Thérèse Hardin France	11	357	237	33	32	19	18	365
Fairouz Kamareddine United Kingdom	10	246 0.7×	167 0.7×	28 0.8×	11 0.3×	8 0.4×	48	260
Andrzej S. Murawski United Kingdom	10	278 0.8×	218 0.9×	30 0.9×	31 1.0×	21 1.1×	41	299
Alban Ponse Netherlands	9	185 0.5×	202 0.9×	22 0.7×	23 0.7×	9 0.5×	46	243
G. Huet France	5	458 1.3×	302 1.3×	41 1.2×	46 1.4×	56 2.9×	6	501
Patricia Johann United States	11	334 0.9×	209 0.9×	57 1.7×	55 1.7×	51 2.7×	40	351
Ugo de’Liguoro Italy	9	302 0.8×	214 0.9×	75 2.3×	30 0.9×	29 1.5×	45	325
Venanzio Capretta United Kingdom	6	195 0.5×	133 0.6×	47 1.4×	38 1.2×	16 0.8×	13	222
Geoffrey Burn United Kingdom	7	179 0.5×	124 0.5×	41 1.2×	68 2.1×	23 1.2×	16	214
Nils Anders Danielsson Sweden	9	233 0.7×	182 0.8×	31 0.9×	32 1.0×	31 1.6×	21	252
Zhaozhong Ni United States	7	243 0.7×	136 0.6×	60 1.8×	66 2.1×	9 0.5×	11	249

Countries citing papers authored by Thérèse Hardin

Since Specialization

Citations

This map shows the geographic impact of Thérèse Hardin's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Thérèse Hardin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Thérèse Hardin more than expected).

Fields of papers citing papers by Thérèse Hardin

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Thérèse Hardin. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Thérèse Hardin. The network helps show where Thérèse Hardin may publish in the future.

Co-authorship network of co-authors of Thérèse Hardin

This figure shows the co-authorship network connecting the top 25 collaborators of Thérèse Hardin. A scholar is included among the top collaborators of Thérèse Hardin based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Thérèse Hardin. Thérèse Hardin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

18 of 18 papers shown

Doligez, Damien, et al.. (2015). Avoiding Security Pitfalls with Functional Programming: A Report on the Development of a Secure XML Validator. 2015 IEEE/ACM 37th IEEE International Conference on Software Engineering. 5667. 209–218. 2 indexed citations

Doligez, Damien, et al.. (2014). Experience in using a typed functional language for the development of a security application. SHILAP Revista de lepidopterología. 149. 58–63. 1 indexed citations

Hardin, Thérèse, et al.. (2009). Development Life-cycle of Critical Software Under FoCaL. Electronic Notes in Theoretical Computer Science. 243. 15–31. 6 indexed citations

Hardin, Thérèse, et al.. (2004). Les objets des mathématiques. SPIRE - Sciences Po Institutional REpository. 10(4). 83–118. 2 indexed citations

Dowek, Gilles, Thérèse Hardin, & Claude Kirchner. (2003). Theorem Proving Modulo. Journal of Automated Reasoning. 31(1). 33–72. 57 indexed citations

Dowek, Gilles, Thérèse Hardin, & Claude Kirchner. (2002). Higher-order unification via explicit substitutions. 366–374. 11 indexed citations

Dowek, Gilles, Thérèse Hardin, & Claude Kirchner. (2001). HOL-λσ: an intentional first-order expression of higher-order logic. Mathematical Structures in Computer Science. 11(1). 21–45. 19 indexed citations

Dowek, Gilles, Thérèse Hardin, & Claude Kirchner. (2000). Higher Order Unification via Explicit Substitutions. Information and Computation. 157(1-2). 183–235. 39 indexed citations

Hardin, Thérèse, et al.. (1999). On the way to certify Computer Algebra Systems. Electronic Notes in Theoretical Computer Science. 23(3). 370–385. 4 indexed citations

10.

Hardin, Thérèse, Luc Maranget, & Bruno Pagano. (1998). Functional runtime systems within the lambda-sigma calculus. Journal of Functional Programming. 8(2). 131–176. 41 indexed citations

11.

Dowek, Gilles, Thérèse Hardin, Claude Kirchner, & Frank Pfenning. (1996). Unification via Explicit Substitutions: The Case of Higher-Order Patterns.. OpenGrey (Institut de l'Information Scientifique et Technique). 259–273. 39 indexed citations

12.

Hardin, Thérèse, Luc Maranget, & Bruno Pagano. (1996). Functional back-ends within the lambda-sigma calculus. ACM SIGPLAN Notices. 31(6). 25–33. 2 indexed citations

13.

Hardin, Thérèse, Luc Maranget, & Bruno Pagano. (1996). Functional back-ends within the lambda-sigma calculus. 25–33. 16 indexed citations

14.

Curien, Pierre-Louis, Thérèse Hardin, & Jean-Jacques Lévy. (1996). Confluence properties of weak and strong calculi of explicit substitutions. Journal of the ACM. 43(2). 362–397. 66 indexed citations

15.

Dowek, Gilles, Thérèse Hardin, & Claude Kirchner. (1995). Higher-order unification via explicit substitutions Extended Abstract. 366–374. 12 indexed citations

16.

Curien, Pierre-Louis & Thérèse Hardin. (1994). Theoretical Pearl Yet yet a counterexample for λ+SP. Journal of Functional Programming. 4(1). 113–115. 2 indexed citations

17.

Hardin, Thérèse. (1989). Confluence results for the pure strong categorical logic CCL. λ-calculi as subsystems of CCL. Theoretical Computer Science. 65(3). 291–342. 26 indexed citations

18.

Hardin, Thérèse, et al.. (1986). Proof of termination of the rewriting system subst on CCL. Theoretical Computer Science. 46. 305–312. 20 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact