Abstract
We describe an automatic, semantics preserving translation between HOL, the higher-order logic supported by the HOL4 theorem proving environment, and a deep embedding of the first order logic supported by ACL2. An implementation of this translation allows ACL2 to be used as a symbolic execution engine for functions defined in HOL.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gordon, M.J.C., Reynolds, J., Hunt, W.A., Kaufmann, M.: An integration of hol and acl2. fmcad 0, 153–160 (2006)
Gordon, M.J.C., Hunt, W.A., Kaufmann, M., Reynolds, J.: An embedding of the acl2 logic in hol. ACL2 Workshop 0, 40–46 (2006)
Reynolds, J.: A hol implementation of the arm fp co-processor programmer’s model. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol. 3603, Springer, Heidelberg (2005)
Slind, K., Hurd, J.: Applications of polytypism in theorem proving. In: Basin, D., Wolff, B. (eds.) TPHOLs 2003. LNCS, vol. 2758, pp. 103–119. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reynolds, J. (2007). Automatically Translating Type and Function Definitions from HOL to ACL2. In: Schneider, K., Brandt, J. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2007. Lecture Notes in Computer Science, vol 4732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74591-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-74591-4_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74590-7
Online ISBN: 978-3-540-74591-4
eBook Packages: Computer ScienceComputer Science (R0)