Open Source Haskell Mathematics Software

The Dolphin Project is intended to be a research project aggregating tools related to Open Source Satisfiability Solver tools and tools related to them like Bounded Model Checkers and Software Verifiers.

Agda is a system for incrementally developing proofs and programs. This is the sourceforge project for the PREVIOUS Agda (Agda 1). A newer version of Agda (Agda 2) in beta testing is available from: http://wiki.portal.chalmers.se/agda/

Alga is a library for algebraic construction and manipulation of graphs in Haskell. See this Haskell Symposium paper and the corresponding talk for the motivation behind the library, the underlying theory and implementation details. We can give semantics to the constructors in terms of the pair (V, E) of graph vertices and edges. Alga can handle graphs comprising millions of vertices and billions of edges in a matter of seconds, which is fast enough for many applications. We believe there is a lot of potential for improving the performance of the library, and this is one of our top priorities. If you come across a performance issue when using the library, please let us know.

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

BuddyScout is an interface between BuDDy (Binary Decision Diagram library) and GHC (Glasgow Haskell Compiler). It enables you to use the BDD library from within Haskell programs.

This is the extended euclidean algorithm implemented in haskell. It will put every single step of the algorithm in a file and show the actual result and everything in between.

A set of MediaWiki extensions and other tools developed for the Twelf wiki (http://twelf.plparty.org) that enable a wiki to naturally incorporate logic Twelf in a number of meaningful and useful ways.

bignum is a Miranda library and BigFloat a Haskell type for dealing with infinite-precision values with all arithmetic and scientific functions. Unlike most long-precision calculation systems, it guarantees that every digit it returns is correct.

This will be a graph generator, generating lists of graphs satisfying given conditions (filters).

Proof Logic is a functional and equational logical framework for theorem proving based on Combinatory Logic and Lambda Calculus, whose expressions are both terms and proofs proving the equality between two terms.