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/)


References in zbMATH (referenced in 378 articles , 1 standard article )

Showing results 1 to 20 of 378.
Sorted by year (citations)

1 2 3 ... 17 18 19 next

  1. Gauthier, Thibault; Kaliszyk, Cezary: Aligning concepts across proof assistant libraries (2019)
  2. Kunčar, Ondřej; Popescu, Andrei: From types to sets by local type definition in higher-order logic (2019)
  3. Abdulaziz, Mohammad; Norrish, Michael; Gretton, Charles: Formally verified algorithms for upper-bounding state space diameters (2018)
  4. Czajka, Łukasz; Kaliszyk, Cezary: Hammer for Coq: automation for dependent type theory (2018)
  5. Farmer, William M.: Incorporating quotation and evaluation into Church’s type theory (2018)
  6. Guttmann, Walter: An algebraic framework for minimum spanning tree problems (2018)
  7. Guttmann, Walter: Verifying minimum spanning tree algorithms with Stone relation algebras (2018)
  8. Melham, Tom: Symbolic trajectory evaluation (2018)
  9. Paulson, Lawrence C.: Computational logic: its origins and applications (2018)
  10. Shankar, Natarajan: Combining model checking and deduction (2018)
  11. 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)
  12. Shi, Zhiping; Wu, Aixuan; Yang, Xiumei; Guan, Yong; Li, Yongdong; Song, Xiaoyu: Formal analysis of the kinematic Jacobian in screw theory (2018)
  13. Zhao, Chunna; Li, Shanshan: Formalization of fractional order PD control systems in HOL4 (2018)
  14. Benzmüller, Christoph: Cut-elimination for quantified conditional logic (2017)
  15. Berger, Ulrich; Hou, Tie: A realizability interpretation of Church’s simple theory of types (2017)
  16. Blanchette, Jasmin Christian; Bouzy, Aymeric; Lochbihler, Andreas; Popescu, Andrei; Traytel, Dmitriy: Friends with benefits. Implementing corecursion in foundational proof assistants (2017)
  17. Blanchette, Jasmin Christian; Popescu, Andrei; Traytel, Dmitriy: Soundness and completeness proofs by coinductive methods (2017)
  18. Bowles, Juliana; Caminati, Marco B.: A verified algorithm enumerating event structures (2017)
  19. Farmer, William M.: Theory morphisms in Church’s type theory with quotation and evaluation (2017)
  20. Gauthier, Thibault; Kaliszyk, Cezary; Urban, Josef: TacticToe: learning to reason with HOL4 tactics (2017)

1 2 3 ... 17 18 19 next