Files
Jacques-Henri Jourdan 3f2f3138c0 Discriminate algebraic types.
That is, duplicate lemmas making use of an algebraic type (either by using a projection, a constructor or a pattern matching) which is tagged by the new meta alginst.

Also:
- Add new select metas for automatically tagging types with alginst
- edit relevent drivers so that discrimination happens before eliminate_algebraic:
    - CVC5
    - Z3 > 4.8.7
    - Vampire 4.5.1
    - why3-smt
2023-01-31 01:46:10 +01:00
..
2011-02-10 18:12:47 +01:00
2011-07-01 17:29:29 +02:00
2011-05-09 22:00:41 +02:00
2011-05-11 09:19:26 +02:00
2011-07-01 17:29:29 +02:00
2011-02-11 17:46:39 +01:00
2011-05-09 22:00:41 +02:00
2011-05-09 22:00:41 +02:00
2011-02-11 17:46:39 +01:00
2011-05-09 22:00:41 +02:00
2023-01-31 01:46:10 +01:00
2011-05-11 09:21:26 +02:00
2011-02-11 12:04:43 +01:00
2011-02-11 17:46:39 +01:00
2011-07-01 17:29:29 +02:00
2011-05-09 22:00:41 +02:00
2011-05-09 22:00:41 +02:00

How to reproduce the bench for "Expressing Polymorphic Types in a Many-Sorted Language" of FROCOS'11

The result of this bench can be reproduce using Why3 in the following way:

- You need to come back to version 69dd88e5c34808de3905aa3e257288d19e3b643c with
  git checkout 69dd88e5c34808de3905aa3e257288d19e3b643c, and
- You need to configure with --enable-local and compile why3.
- After that you should set in ./why.conf in the
  section [main] the variable "running_provers_max" to your own
  number of core. You need CVC3, Z3 and Yices.
- Run ./gen_allbench.sh generates one file, bench, by possible set of parameters
- Run ./run_bench.sh  (it takes 10 hours with 7 core). It runs the benchs used in the paper
- Run ./compute_result.sh (it takes 10seconds) to compute the comparison tables. It needs csvtool.

nb: bool_inf and unit_inf are used in order to be able to use explicit