- 14 Mar, 2014 3 commits
-
-
Jean-Christophe Filliâtre authored
-
Jean-Christophe Filliâtre authored
-
MARCHE Claude authored
-
- 13 Mar, 2014 1 commit
-
-
MARCHE Claude authored
-
- 07 Mar, 2014 1 commit
-
-
Jean-Christophe Filliâtre authored
-
- 06 Mar, 2014 2 commits
-
-
Jean-Christophe Filliâtre authored
(OCaml polymorphic equality fails on big nums)
-
Jean-Christophe Filliâtre authored
sudoku example now uses arrays only
-
- 05 Mar, 2014 1 commit
-
-
Jean-Christophe Filliâtre authored
-
- 04 Mar, 2014 2 commits
-
-
MARCHE Claude authored
-
Jean-Christophe Filliâtre authored
-
- 27 Feb, 2014 1 commit
-
-
Jean-Christophe Filliâtre authored
support for 31/32/63/64-bit integers in extracted code
-
- 26 Feb, 2014 2 commits
-
-
Jean-Christophe Filliâtre authored
-
Jean-Christophe Filliâtre authored
All files are extracted to the target repository, even those corresponding to files from the Why3 standard library. Some of these files may be empty (e.g. ref__Ref.ml) when everything is overridden by the OCaml driver. You can ignore these files when compiling the extracted OCaml code.
-
- 25 Feb, 2014 1 commit
-
-
Jean-Christophe Filliâtre authored
everything is contained in the driver (ocaml.drv) with possible references to OCaml modules contained in why3extract.cma (currently why3__Prelude, why3__BigInt, why3__Map)
-
- 21 Feb, 2014 2 commits
-
-
MARCHE Claude authored
-
MARCHE Claude authored
-
- 19 Feb, 2014 4 commits
-
-
Jean-Christophe Filliâtre authored
-
Jean-Christophe Filliâtre authored
-
Jean-Christophe Filliâtre authored
-
Guillaume Melquiond authored
-
- 18 Feb, 2014 2 commits
-
-
François Bobot authored
in order to be more platform independent
-
Jean-Christophe Filliâtre authored
(and less axioms)
-
- 17 Feb, 2014 5 commits
-
-
Jean-Christophe Filliâtre authored
-
Jean-Christophe Filliâtre authored
-
MARCHE Claude authored
-
Andrei Paskevich authored
Will be supported in programs as soon, as we enable lambdas.
-
Andrei Paskevich authored
-
- 16 Feb, 2014 3 commits
-
-
Andrei Paskevich authored
Since we are going to handle partial application of logical symbols, there is no need to be rigid about currying: (((=) 0) 1) should be (0 = 1) and not (((\ x y. x = y) @ 0) @ 1).
-
Andrei Paskevich authored
We do not want to generate distinct liftings for every single partial application of a function or predicate symbol. Canonical closures have an easily recognizable shape, thus we can detect them and replace them with a unique constant "f_closure".
-
MARCHE Claude authored
-
- 15 Feb, 2014 3 commits
-
-
MARCHE Claude authored
-
MARCHE Claude authored
-
MARCHE Claude authored
-
- 14 Feb, 2014 4 commits
-
-
MARCHE Claude authored
-
Andrei Paskevich authored
The old syntax: abstract expr [spec]... The semicolon binds more loosely than "abstract" and the specification clauses are optional, so that "abstract e1; e2" is the same as "(abstract e1); e2" and "abstract e1; e2; ensures {...}" is a syntax error. The new syntax: abstract [spec]... expr end This allows to put sequences of expressions under "abstract" without ambiguity and moves the specification clauses to the beginning. In other words, "abstract" becomes a "begin" with a specification attached. The spec-at-the-top is consistent with the syntax of functions and the whole seems to be more natural for the intented use of "abstract" (a logical cut).
-
Andrei Paskevich authored
Examples: begin ... expr; end let fn x y = ... expr ; in ... match ... with pat -> ... expr ; | pat -> ... expr ; end In this way, it's much easier to add and remove additional assertions at the end of ()-typed blocks.
-
Andrei Paskevich authored
-
- 13 Feb, 2014 1 commit
-
-
Jean-Christophe Filliâtre authored
-
- 12 Feb, 2014 2 commits
-
-
Andrei Paskevich authored
-
Andrei Paskevich authored
-