- 8

This is the distribution directory for the Kananaskis release of HOL4. See http://hol-theorem-prover.org for online resources. The following is a brief listing of what's available in the distribution.

https://hol-theorem-prover.orghttps://github.com/HOL-Theorem-Prover/HOL

Tags | theorem-proving lambda-calculus higher-order-logic |

Implementation | Standard ML |

License | Public |

Platform |

HOL is a system for proving theorems in Higher Order Logic. It comes with a large variety of existing theories formalising various parts of mathematics and theoretical computer science.

CakeML is a verified implementation of a significant subset of Standard ML. The source and proofs for CakeML are developed in the HOL4 theorem prover. We use the latest development version of HOL4, which we build on PolyML 5.7. Example build instructions can be found in build-instructions.sh.

programming-language formal-verification formal-semantics compiler theorem-proving hol smlAn ML-based automated theorem prover for propositional logic making use of an algorithm in the intercalation calculus.

Stable and nightly binary releases of Lean are available on the homepage. For building Lean from source, see the build instructions.

programming-language theorem-proving type-theory verification dependent-types leanSpecifically, Certigrad is a system for optimizing over stochastic computation graphs, that we debugged systematically in the Lean Theorem Prover, and ultimately proved correct in terms of the underlying mathematics. Stochastic computation graphs extend the computation graphs that underlie systems like TensorFlow and Theano by allowing nodes to represent random variables and by defining the loss function to be the expected value of the sum of the leaf nodes over all the random choices in the graph. Certigrad allows users to construct arbitrary stochastic computation graphs out of the primitives that we provide. The main purpose of the system is to take a program describing a stochastic computation graph and to run a randomized algorithm (stochastic backpropagation) that, in expectation, samples the gradients of the loss function with respect to the parameters.

machine-learning theorem-proving lean verificationThe Deepmath project seeks to improve automated theorem proving using deep learning and other machine learning techniques. Deepmath is a collaboration between Google Research and several universities. The source code in this repository is not an official Google product, but is a research collaboration with external research teams.

CVC4 is an efficient open-source automatic theorem prover for satisfiability modulo theories (SMT) problems.

Z3 is a theorem prover from Microsoft Research. It is licensed under the MIT license. If you are not familiar with Z3, you can start here.

A beginners' level theorem prover project for logic students. Okitsune is written in Haskell and open for contributions.

Coq is a formal proof management system. It provides a formal language to write mathematical definitions, executable algorithms and theorems together with an environment for semi-interactive development of machine-checked proofs. Download the pre-built packages of the latest release for Windows and MacOS; read the help page on how to install Coq with OPAM; or refer to the INSTALL file for the procedure to install from source.

proof-assistant coq theorem-proving dependent-typesThe F* tutorial provides a first taste of verified programming in F*, explaining things by example. The F* wiki contains additional, usually more in-depth, technical documentation on F*.

programming-language verification dependent-types smt theorem-proving proof-assistant ocaml f-sharp c-language fstarThe Archive of Formal Proofs is a collection of proof libraries, examples, and larger scientifc developments, mechanically checked in the theorem prover Isabelle. It is organized in the way of a scientific journal. Submissions are refereed.

ManTa is an equational specification language and tools to support it: theorem prover, code generators (C and Ocaml), frontends.

IsaPlanner is a collection of reasoning tools: a proof planner for Isabelle, implementing a Rippling based inductive theorem prover; theory synthesis tools for Isabelle; an open-graph based tool for reasoning about quantum information (quantomatic);

Note that this README is only about Agda, not its standard library. See the Agda Wiki for information about the library.

dependent-types programming-language proof-assistant agda type-theoryNo subject appears to be more controversial to distributed systems engineers than the oft-quoted, oft-misunderstood CAP theorem. The purpose of this FAQ is to explain what is known about CAP, so as to help those new to the theorem get up to speed quickly, and to settle some common misconceptions or points of disagreement. Of course, there's every possibility I've made superficial or completely thorough mistakes here. Corrections and comments are welcome: let me have them.

Morte is a super-optimizing intermediate language for functional languages. morte centers around a single idea: a strongly normalizing, typed, and polymorphic lambda calculus is the ideal language for super-optimization of programs. Optimization is just normalization of lambda terms. All abstractions desugar to lambda abstraction.

Hosting home-made software which is mathematically proven to be correct. We make use of tools like HOL, PVS, ...

We have large collection of open source products. Follow the tags from
Tag Cloud >>

Open source products are scattered around the web. Please provide information
about the open source projects you own / you use.
**Add Projects.**