-
Notifications
You must be signed in to change notification settings - Fork 1
Home
Formal Combinatorics
By "formal combinatorics" we mean studying combinatorics with a computer. This research activity includes the widespread use of a computer algebra system, but also programming of algorithms for the bounded-exhaustive or random generation of combinatorial objects, and implementation of exact or asymptotic formulas for their number for various size parameters, in various formal languages. Less popular are the uses of a proof assistant or an automatic prover to demonstrate combinatorial theorems or properties of combinatorial programs with a computer.
This project gathers contributions in formal combinatorics.
enum is a library of formally verified enumeration programs, still under development. The current release contains enumeration programs in Why3. Clone or download the project https://github.com/alaingiorgetti/enum. Then read the file Why3/README.md.
- Alain Giorgetti, University of Franche-Comté, FEMTO-ST Institute
- Rémi Lazarini, master student, University of Franche-Comté, 2018