Abstract

. This paper describes a system to support reasoning about lazy functional programs. We describe an approach based on combining a deep embedding of the language in HOL and a set of proof tools to raise the level of interaction with the theorem prover. This approach allows meta-theoretic reasoning about the semantics and reasoning about undefined programs while still supporting practical reasoning about programs in the language. 1 Introduction It is often claimed that functional programming languages, and in particular pure functional languages, are suitable for formal reasoning. This claim is supported by the fact that many people in the functional programming community do reason about their programs in a formal or semi-formal way. Depending on the nature of the problem, different styles of reasoning, such as equational reasoning, induction and co-induction, are used. This paper discusses some of the technical issues involved in constructing a proof tool, using HOL [4], for reasoning ...

Citations

184	Melham, editors. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic - Gordon, F - 1993
109	Bisimilarity as a theory of functional programming - Gordon - 1995
27	A package for inductive relation definitions in HOL - Melham - 1992
20	Inductive definitions: Automation and application - Harrison - 1995
20	Reasoning with the formal definition of Standard ML - Syme - 1993
8	A Theory of Finite Maps - Collins, Syme - 1995
5	Studying the ML module system in HOL - Maharaj, Gunter - 1994
3	Supporting Reasoning about Functional Programs : An Operational Approach - Collins - 1995