HOL
Higher Order Logic (HOL) is a programming environment in which theorems can be proved and proof tools implemented. Built-in decision procedures and theorem provers can automatically establish many simple theorems. An Oracle mechanism gives access to external programs such as SAT and BDD engines. HOL 4 is particularly suitable as a platform for implementing combinations of deduction, execution, and property checking.
(Source: http://freecode.com/)
Keywords for this software
References in zbMATH (referenced in 417 articles , 1 standard article )
Showing results 1 to 20 of 417.
Sorted by year (- 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)
- Abdulaziz, Mohammad; Norrish, Michael; Gretton, Charles: Formally verified algorithms for upper-bounding state space diameters (2018)
- Bannister, Callum; Höfner, Peter; Klein, Gerwin: Backwards and forwards with separation logic (2018)
- Bottesch, Ralph; Haslbeck, Max W.; Thiemann, René: A verified efficient implementation of the LLL basis reduction algorithm (2018)
- Carette, Jacques; Farmer, William M.; Laskowski, Patrick: HOL Light QE (2018)
- Cauderlier, Raphaël: Tactics and certificates in Meta Dedukti (2018)
- Czajka, Łukasz; Kaliszyk, Cezary: Hammer for Coq: automation for dependent type theory (2018)
- Farmer, William M.: Incorporating quotation and evaluation into Church’s type theory (2018)
- Goertzel, Zarathustra; Jakubův, Jan; Schulz, Stephan; Urban, Josef: Proofwatch: watchlist guidance for large theories in E (2018)
- Guttmann, Walter: An algebraic framework for minimum spanning tree problems (2018)
- Guttmann, Walter: Verifying minimum spanning tree algorithms with Stone relation algebras (2018)
- Melham, Tom: Symbolic trajectory evaluation (2018)
- Paulson, Lawrence C.: Computational logic: its origins and applications (2018)
- Piotrowski, Bartosz; Urban, Josef: ATPboost: learning premise selection in binary setting with ATP feedback (2018)
- Shankar, Natarajan: Combining model checking and deduction (2018)
- Shi, Ling; Zhao, Yongxin; Liu, Yang; Sun, Jun; Dong, Jin Song; Qin, Shengchao: A UTP semantics for communicating processes with shared variables and its formal encoding in PVS (2018)
- Shi, Zhiping; Wu, Aixuan; Yang, Xiumei; Guan, Yong; Li, Yongdong; Song, Xiaoyu: Formal analysis of the kinematic Jacobian in screw theory (2018)
- Syeda, Hira Taqdees; Klein, Gerwin: Program verification in the presence of cached address translation (2018)
- Zhao, Chunna; Li, Shanshan: Formalization of fractional order PD control systems in HOL4 (2018)