A Hoare Logic for Call-by-Value Functional Programs

by Yann Régis-gianas , François Pottier

Citations:

11 - 1 self

Datum	Value	Source
TITLE	A Hoare Logic for Call-by-Value Functional Programs	SVM HeaderParse 0.2
AUTHOR NAME	Yann Régis-gianas	SVM HeaderParse 0.2
AUTHOR AFFIL	1	SVM HeaderParse 0.2
AUTHOR ADDR	INRIA Saclay- Île-de-France, ProVal, Orsay, F-91893; LRI, Université Paris-Sud, CNRS, Orsay, F-91405	SVM HeaderParse 0.2
AUTHOR NAME	François Pottier	SVM HeaderParse 0.2
AUTHOR AFFIL	1	SVM HeaderParse 0.2
AUTHOR ADDR	INRIA Saclay- Île-de-France, ProVal, Orsay, F-91893; LRI, Université Paris-Sud, CNRS, Orsay, F-91405	SVM HeaderParse 0.2
ABSTRACT	Abstract. We present a Hoare logic for a call-by-value programming language equipped with recursive, higher-order functions, algebraic data types, and a polymorphic type system in the style of Hindley and Milner. It is the theoretical basis for a tool that extracts proof obligations out of programs annotated with logical assertions. These proof obligations, expressed in a typed, higher-order logic, are discharged using off-theshelf automated or interactive theorem provers. Although the technical apparatus that we exploit is by now standard, its application to callby-value functional programming languages appears to be new, and (we claim) deserves attention. As a sample application, we check the partial correctness of a balanced binary search tree implementation. 1	SVM HeaderParse 0.2
CITATIONS	63 found	ParsCit 1.0