# “alt-ergo” 0.95.1-3 source package in Ubuntu

## Changelog

alt-ergo (0.95.1-3) unstable; urgency=low * make libalt-ergo-ocaml-dev conflict and replace with alt-ergo (<< 0.95.1-1) to resolve file conflict with versions of the package before the split into two binary packages (closes: #718010). -- Ralf Treinen <email address hidden> Sat, 24 Aug 2013 10:56:21 +0200

## Upload details

- Uploaded by:
- Debian OCaml Maintainers on 2013-08-24

- Uploaded to:
- Sid

- Original maintainer:
- Debian OCaml Maintainers

- Component:
- main

- Architectures:
- any

- Section:
- math

- Urgency:
- Low Urgency

## See full publishing history Publishing

Series | Published | Component | Section | |
---|---|---|---|---|

Saucy | release | on 2013-09-02 | universe | math |

## Downloads

File | Size | MD5 Checksum |
---|---|---|

alt-ergo_0.95.1-3.dsc | 1.5 KiB | 013e8189685cde0f62127f45a0966c9e |

alt-ergo_0.95.1.orig.tar.gz | 233.5 KiB | c0f1cbfdae04f1c37853ed5fd10154ec |

alt-ergo_0.95.1-3.debian.tar.gz | 14.1 KiB | beb6a54a3e8d645dad72d18dd7a61d8e |

### Available diffs

- diff from 0.95.1-2 to 0.95.1-3 (592 bytes)

## Binary packages built by this source

- alt-ergo: Automatic theorem prover dedicated to program verification
Alt-Ergo is an automatic theorem prover geared towards application in

program verification. It is based on CC(X), a congruence closure

algorithm parameterized by an equational theory X. Alt-Ergo has

built-in provers for propositional logic, linear arithmetic,

uninterpreted function symbols, associative-commutative function

symbols, polymorphic arrays, user-defined polymorphic record types

and polymorphic enumeration types. It has restricted support for

reasoning over arbitrary user-defined algebraic types, first-order

quantifiers, and non-linear arithmetic.

.

This package contains the prover as a command-line executable

as well as the graphical interface.

- libalt-ergo-ocaml-dev: Theorem prover dedicated to program verification - libraries
Alt-Ergo is an automatic theorem prover geared towards application in

program verification. It is based on CC(X), a congruence closure

algorithm parameterized by an equational theory X. Alt-Ergo has

built-in provers for propositional logic, linear arithmetic,

uninterpreted function symbols, associative-commutative function

symbols, polymorphic arrays, user-defined polymorphic record types

and polymorphic enumeration types. It has restricted support for

reasoning over arbitrary user-defined algebraic types, first-order

quantifiers, and non-linear arithmetic.

.

This package contains the development libraries that are useful when

writing OCaml programs linking to the alt-ergo API.