Displaying 1 to 13 from 13 results

## coq - Coq is a formal proof management system

•    OCaml

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.

## lean - Lean Theorem Prover

•    C++

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

## FStar - Verification system for effectful programs

•    OCaml

The 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*.

## cakeml - CakeML: A Verified Implementation of ML

•    Standard

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.

## HOL - Canonical sources for HOL4 theorem-proving system

•    Standard

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.

## certigrad - Bug-free machine learning on stochastic computation graphs

•    Lean

Specifically, 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.

## pomagma - An inference engine for extensional untyped λ-calculus

•    C++

Pomagma is an inference engine for extensional untyped λ-join-calculus, a simple model of computation in which nondeterminism gives rise to an elegant gradual type system. Pomagma's base theory is being formally verified in the Hstar project.

## gapt - GAPT: General Architecture for Proof Theory

•    Scala

GAPT is a proof theory framework developed primarily at the Vienna University of Technology. GAPT contains data structures, algorithms, parsers and other components common in proof theory and automated deduction. In contrast to automated and interactive theorem provers whose focus is the construction of proofs, GAPT concentrates on the transformation and further processing of proofs. You can also use Prover9, Vampire, EProver, and lots of other provers instead of the built-in Escargot prover, if you have them installed. There are many more examples in the user manual, and you can look into the API documentation for reference as well.

## informatica-public - Public code developed during my MSc study at University of Bologna

•    Standard

Code and documents developed during Chun Tian's MSc of Computer Science study at University of Bologna (Italy).

## acl2 - ACL2 System and Books as Maintained by the Community

•    Common

WARNING: On rare occasions development versions of ACL2 may be incomplete, fragile, or unable to pass the usual regression tests. You may choose to download an official ACL2 release as described on the ACL2 Home Page or below in this README. The ACL2 theorem proving environment consists of two parts: The ACL2 System and The ACL2 Books. This repository contains both.

## ProvingGround - Proving Ground: Tools for Automated Mathematics

•    Scala

A system under development for (semi-)automated theorem proving, with foundations homotopy type theory, using machine learning, both by reinforcement learing using backward-propagation and using natural language processing to assimilate part of the mathematics literature. The principal developer is Siddhartha Gadgil (Department of Mathematics, Indian Institute of Science, Bangalore).

## first_order_logic_prover

•    C++

Dependency: See .pro. Use a lot of C++1y feature so need a good compiler. Build: This is a header only library. Include the header you want.

## tool_lists - Links to tools by subject

•

To the extent possible under law, the authors have waived all copyright and related or neighboring rights to this text. For copying conditions, consult COPYING.txt, which is the CC0 Public Domain Dedication.

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.