( en | de | ru )

 

Disambiguation of "Hardin, Thérèse"

Author of the publication

copydeleteadd this publication to your clipboard
Development Life-cycle of Critical Software Under FoCaL.

, , and . TTSS, volume 243 of Electronic Notes in Theoretical Computer Science, page 15-31. Elsevier, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Bert Hardin

Almut Hardin

Thérèse Hémery

Thérèse Goritzka

Thérèse Lojewski

 

Other publications of authors with the same name

Building certified components within FOCAL., , and . Trends in Functional Programming, volume 5 of Trends in Functional Programming, page 33-48. Intellect, (2004)Eta-Conversion for the Languages of Explicit Substitutions.. Appl. Algebra Eng. Commun. Comput., (1994)HOL-lambdasigma: An Intentional First-Order Expression of Higher-Order Logic., , and . RTA, volume 1631 of Lecture Notes in Computer Science, page 317-331. Springer, (1999)Functional Runtime Systems Within the Lambda-Sigma Calculus., and . J. Funct. Program., 8 (2): 131-176 (1998)Unification via Explicit Substitutions: The Case of Higher-Order Patterns., , , and . JICSLP, page 259-273. MIT Press, (1996)Eta-conversion for the Languages of Explicit Substitutions.. ALP, volume 632 of Lecture Notes in Computer Science, page 306-321. Springer, (1992)Higher Order Unification via Explicit Substitutions., , and . Inf. Comput., 157 (1-2): 183-235 (2000)Development Life-cycle of Critical Software Under FoCaL., , and . TTSS, volume 243 of Electronic Notes in Theoretical Computer Science, page 15-31. Elsevier, (2008)Theorem Proving Modulo., , and . J. Autom. Reason., 31 (1): 33-72 (2003)Binding Logic: Proofs and Models., , and . LPAR, volume 2514 of Lecture Notes in Computer Science, page 130-144. Springer, (2002)