HOL Light
HOL Light: an overview. HOL Light is an interactive proof assistant for classical higher-order logic, intended as a clean and simplified version of Mike Gordon’s original HOL system. Theorem provers in this family use a version of ML as both the implementation and interaction language; in HOL Light’s case this is Objective CAML (OCaml). Thanks to its adherence to the so-called `LCF approach’, the system can be extended with new inference rules without compromising soundness. While retaining this reliability and programmability from earlier HOL systems, HOL Light is distinguished by its clean and simple design and extremely small logical kernel. Despite this, it provides powerful proof tools and has been applied to some non-trivial tasks in the formalization of mathematics and industrial formal verification.
Keywords for this software
References in zbMATH (referenced in 293 articles )
Showing results 1 to 20 of 293.
Sorted by year (- Mahboubi, Assia; Sibut-Pinote, Thomas: A formal proof of the irrationality of (\zeta(3)) (2021)
- Abrahamsson, Oskar: A verified proof checker for higher-order logic (2020)
- Barbosa, Haniel; Blanchette, Jasmin Christian; Fleury, Mathias; Fontaine, Pascal: Scalable fine-grained proofs for formula processing (2020)
- Carneiro, Mario: Metamath Zero: designing a theorem prover prover (2020)
- Chen, Shanyan; Wang, Guohui; Li, Ximeng; Zhang, Qianying; Shi, Zhiping; Guan, Yong: Formalization of camera pose estimation algorithm based on Rodrigues formula (2020)
- Rashid, Adnan; Hasan, Osman: Formal verification of robotic cell injection systems up to 4-DOF using \textsfHOLLight (2020)
- Shi, Zhiping; Guan, Yong; Li, Ximeng: Formalization of complex analysis and matrix theory (2020)
- Beeson, Michael; Narboux, Julien; Wiedijk, Freek: Proof-checking Euclid (2019)
- Beillahi, Sidi Mohamed; Mahmoud, Mohamed Yousri; Tahar, Sofiène: A modeling and verification framework for optical quantum circuits (2019)
- Brown, Chad E.; Gauthier, Thibault; Kaliszyk, Cezary; Sutcliffe, Geoff; Urban, Josef: GRUNGE: a grand unified ATP challenge (2019)
- Carette, Jacques; Farmer, William M.: Towards specifying symbolic computation (2019)
- Färber, Michael; Kaliszyk, Cezary: Certification of nonclausal connection tableaux proofs (2019)
- Gauthier, Thibault; Kaliszyk, Cezary: Aligning concepts across proof assistant libraries (2019)
- Kunčar, Ondřej; Popescu, Andrei: From types to sets by local type definition in higher-order logic (2019)
- Kunčar, Ondřej; Popescu, Andrei: A consistent foundation for Isabelle/HOL (2019)
- Li, Li-Ming; Shi, Zhi-Ping; Guan, Yong; Zhang, Qian-Ying; Li, Yong-Dong: Formalization of geometric algebra in HOL Light (2019)
- Magron, Victor; Safey El Din, Mohab; Schweighofer, Markus: Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials (2019)
- Marić, Filip: Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points (2019)
- Miller, Dale: Mechanized metatheory Revisited (2019)
- Müller, Dennis; Rabe, Florian; Sacerdoti Coen, Claudio: The Coq library as a theory graph (2019)