Thérèse Hardin - Concepedia

Author

Thérèse Hardin

Institut national de recherche en sciences et technologies du numérique

Also Known As

Edition Hardin, First Hardin, Hardin, Thérèse, M Abadi, T. Hardin, THERESE HARDIN, THÉRÈSE HARDIN, Th. Hardin, Therese Hardin, Thérèse Hardin

Publications

992

Citations

H-Index

Concepts

All Affiliations

Institut national de recherche en sciences et technologies du numérique Sorbonne Université Centre Inria de l'Université de Lorraine École Normale Supérieure - PSL

About

Thérèse Hardin is an author at Institut national de recherche en sciences et technologies du numérique specializing in formal methods, engineering, and automated reasoning.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	9	9	407
2	Computer Science	6	6	278
3	Compilers	2	2	95
4	Language Studies	1	1	62
5	Systems Engineering	1	1	16

Thérèse Hardin

Publications

862

Citations

H-Index

Page 1

	Year	Citations
Theorem Proving Modulo Gilles Dowek, Thérèse Hardin, Claude Kirchner Journal of Automated Reasoning Diophantine AnalysisModulus ProblemComputational Number TheoryTheorem Proving Modulo	2003	212
Confluence properties of weak and strong calculi of explicit substitutions Pierre-Louis Curien, Thérèse Hardin, Jean-Jacques Lévy Journal of the ACM Generalized FunctionType TheoryMathematical FoundationsAlgebraic AnalysisCategorical Combinators	1996	149
Higher Order Unification via Explicit Substitutions Gilles Dowek, Thérèse Hardin, Claude Kirchner Information and Computation EngineeringAutomated ReasoningType TheoryFormal MethodsHigher Order Unification	2000	79
Unification via Explicit Substitutions: The Case of Higher-Order Patterns. Gilles Dowek, Thérèse Hardin, Claude Kirchner, OpenGrey (Institut de l'Information Scientifique et Technique)	1996	69
Functional runtime systems within the lambda-sigma calculus Thérèse Hardin, Luc Maranget, Bruno Pagano Journal of Functional Programming EngineeringFunctional Runtime SystemsFunctional AnalysisFormal VerificationCompilers	1998	63
HOL-λσ: an intentional first-order expression of higher-order logic Gilles Dowek, Thérèse Hardin, Claude Kirchner Mathematical Structures in Computer Science Formal LogicNon-monotonic LogicEngineeringFirst-order PresentationAutomated Reasoning	2001	62
Higher-order unification via explicit substitutions Gilles Dowek, Thérèse Hardin, Claude Kirchner EngineeringHigher-order UnificationAutomated ReasoningType TheoryExplicit Substitutions	2002	56
Confluence results for the pure strong categorical logic CCL. λ-calculi as subsystems of CCL Thérèse Hardin Theoretical Computer Science Computational LogicEngineeringAutomated ReasoningFormal MethodsComputer Science	1989	51
Proof of termination of the rewriting system subst on CCL Thérèse Hardin, Alain Laville Theoretical Computer Science EngineeringRegulated RewritingVerificationRewriting SystemFormal Methods	1986	34
Functional back-ends within the lambda-sigma calculus Thérèse Hardin, Luc Maranget, Bruno Pagano Theory Of ComputingEngineeringGeneralized FunctionAutomated ReasoningProgram Analysis	1996	32

Page 1