A brief overview of HOL4
K Slind, M Norrish - International Conference on Theorem Proving in …, 2008 - Springer
A Brief Overview of HOL4 Page 1 A Brief Overview of HOL4 Konrad Slind1 and Michael
Norrish2 1 School of Computing, University of Utah slind@cs.utah.edu 2 National ICT …
Norrish2 1 School of Computing, University of Utah slind@cs.utah.edu 2 National ICT …
[PDF][PDF] A tutorial on (co) algebras and (co) induction
Algebraic structures which are generated by a collection of constructors| like natural
numbers (generated by a zero and a successor) or nite lists and trees| are of well …
numbers (generated by a zero and a successor) or nite lists and trees| are of well …
Toward verified artificial intelligence
Toward verified artificial intelligence Page 1 46 COMMUNICATIONS OF THE ACM | JULY
2022 | VOL. 65 | NO. 7 contributed articles ILL US TRA TION B Y PETER CRO W THER A …
2022 | VOL. 65 | NO. 7 contributed articles ILL US TRA TION B Y PETER CRO W THER A …
A formal proof of the Kepler conjecture
T Hales, M Adams, G Bauer, TD Dang… - … of mathematics, Pi, 2017 - cambridge.org
A FORMAL PROOF OF THE KEPLER CONJECTURE Page 1 Forum of Mathematics, Pi (2017),
Vol. 5, e2, 29 pages doi:10.1017/fmp.2017.1 1 A FORMAL PROOF OF THE KEPLER …
Vol. 5, e2, 29 pages doi:10.1017/fmp.2017.1 1 A FORMAL PROOF OF THE KEPLER …
[图书][B] Principles of model checking
A comprehensive introduction to the foundations of model checking, a fully automated
technique for finding flaws in hardware and software; with extensive examples and both …
technique for finding flaws in hardware and software; with extensive examples and both …
[图书][B] Isabelle/HOL: a proof assistant for higher-order logic
T Nipkow, M Wenzel, LC Paulson - 2002 - Springer
This chapter outlines the concepts and techniques that underlie reasoning in Isabelle. Until
now, we have proved everything using only induction and simplification, but any serious …
now, we have proved everything using only induction and simplification, but any serious …
[图书][B] Interactive theorem proving and program development: Coq'Art: the calculus of inductive constructions
Y Bertot, P Castéran - 2013 - books.google.com
Coq is an interactive proof assistant for the development of mathematical theories and
formally certified software. It is based on a theory called the calculus of inductive …
formally certified software. It is based on a theory called the calculus of inductive …
[图书][B] Isabelle: A generic theorem prover
LC Paulson - 1994 - Springer
The theory ZF implements Zermelo-Fraenkel set theory [23, 56] as an extension of FOL,
classical first-order logic. The theory includes a collection of derived natural deduction rules …
classical first-order logic. The theory includes a collection of derived natural deduction rules …
[图书][B] Handbook of knowledge representation
Handbook of Knowledge Representation describes the essential foundations of Knowledge
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …
[图书][B] Refinement calculus: a systematic introduction
RJ Back, J Wright - 2012 - books.google.com
Much current research in computer science is concerned with two questions: is a program
correct? And how can we improve a correct program preserving correctness? This latter …
correct? And how can we improve a correct program preserving correctness? This latter …