Proof-producing translation of higher-order logic into pure and stateful ML. Issue 2 (20th January 2014)

• Record Type: Journal Article
• Authors: MYREEN, MAGNUS O.; OWENS, SCOTT
• Is Part Of: Journal of functional programming. Volume 24:Issue 2/3(2014)
• Page Start: 284
• Page End: 315
• Publication Date: 2014-01-20
• Subjects: Functional programming (Computer science) -- Periodicals
• DOI: 10.1017/S0956796813000282
• Languages: English
• ISSNs: 0956-7968

Abstract

Abstract: The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of functional programs. However, to efficiently run these programs, they must be converted (or 'extracted') to functional programs in a programming language such as ML or Haskell. With current techniques, this step, which must be trusted, relates similar looking objects that have very different semantic definitions, such as the set-theoretic model of a logic and the operational semantics of a programming language. In this paper, we show how to increase the trustworthiness of this step with an automated technique. Given a functional program expressed in higher-order logic, our technique provides the corresponding program for a functional language defined with an operational semantics, and it provides a mechanically checked theorem relating the two. This theorem can then be used to transfer verified properties of the logical function to the program. We have implemented our technique in the HOL4 theorem prover, translating functions to a subset of Standard ML, and have applied the implementation to examples including functional data structures, a parser generator, cryptographic algorithms, a garbage collector and the 500-line kernel of the HOL light theorem prover. This paper extends our previous conference publication with new material that shows how functions defined in terms of a state-and-exception monad can be translated, with proofs, into stateful ML code. The HOL light example is also new.