( en | de | ru )

 

Disambiguation of "Hardin, Thérèse"

Author of the publication

copydeleteadd this publication to your clipboard
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)

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 Lojewski

Thérèse Goritzka

 

Other publications of authors with the same name

Higher Order Unification via Explicit Substitutions., , and . Inf. Comput., 157 (1-2): 183-235 (2000)Eta-conversion for the Languages of Explicit Substitutions.. ALP, volume 632 of Lecture Notes in Computer Science, page 306-321. Springer, (1992)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)Building certified components within FOCAL., , and . Trends in Functional Programming, volume 5 of Trends in Functional Programming, page 33-48. Intellect, (2004)Unification via Explicit Substitutions: The Case of Higher-Order Patterns., , , and . JICSLP, page 259-273. MIT Press, (1996)Binding Logic: Proofs and Models., , and . LPAR, volume 2514 of Lecture Notes in Computer Science, page 130-144. Springer, (2002)Binding Logic: proofs and models., , and . CoRR, (2023)Functional Back-Ends within the Lambda-Sigma Calculus., , and . ICFP, page 25-33. ACM, (1996)SIGPLAN Notices 31(6), June 1996.Avoiding Security Pitfalls with Functional Programming: A Report on the Development of a Secure XML Validator., , , and . ICSE (2), page 209-218. IEEE Computer Society, (2015)ISBN 978-1-4799-1934-5 (Vol. I + II ???).HOL-λσ: an intentional first-order expression of higher-order logic., , and . Math. Struct. Comput. Sci., 11 (1): 21-45 (2001)