https://github.com/EasyCrypt/easycrypt

sort by:
Revision Author Date Message Commit Date
592d84e Improve matching of quantifiers. [fix #17277] 09 December 2015, 15:22:00 UTC
32e528c Nits in bigops && lists. 09 December 2015, 14:48:27 UTC
eaff014 New tactic: `suff`. Similar to `have`, but apply the optional tactic to the main goal, and swap the cut and the main goal when compared to `have`. 09 December 2015, 14:48:16 UTC
48f9f9f add Sample become abstract 09 December 2015, 11:11:10 UTC
990f751 `bigi` is now a notation. 09 December 2015, 11:04:33 UTC
0701cb7 `(-)` (Int/Real/Ring) is now an abbrev. 09 December 2015, 10:55:43 UTC
443d2a4 Additions and typos in NewFMap. 09 December 2015, 10:51:23 UTC
4321103 conseq (_:P) stands for cones (_:_==>P). 09 December 2015, 10:51:22 UTC
30c2fd2 fixing previous merge ... 09 December 2015, 10:51:21 UTC
2bbc82f improve location and error message of NotAFunction. 09 December 2015, 10:51:20 UTC
29b9ac4 Allow pruning abbrev. from abstract theories. 08 December 2015, 21:36:14 UTC
faae8f1 Add an option to clear abbrev. when cloning. Syntax is `clear abbrev names+` + proof/renaming/clear can now be interleaved. 08 December 2015, 20:21:34 UTC
29d5540 Fix notations import + allow partial appl. of abbrev. 08 December 2015, 19:22:38 UTC
3f68858 Abbreviation are now parsed and expanded. Abbrev. are now assumed to work fully. 08 December 2015, 14:16:04 UTC
009c962 Top-level assumption duplication does not require a name anymore. The syntax is `move=> ^`. This i-p duplicates the top-assumption, pushing the duplicate as the new top-assumption. This strictly generalizes the `move=> ^h` syntax. 08 December 2015, 10:10:02 UTC
3fd09bb Clear generalization pattern. Syntax is `move: {id1 ... idn}` and can be followed by regular generalization patterns. 08 December 2015, 10:08:46 UTC
0de39c7 Internal refactoring: operator selection. 07 December 2015, 20:43:16 UTC
f8e5bd6 In pp, use active memory when translating an expr to a form. 07 December 2015, 19:36:37 UTC
f0e00b0 Fix pretty-printing of polymorphic abbrev. 06 December 2015, 21:41:26 UTC
44d46e9 Pretty-printing notations. But still not parsing them :) 06 December 2015, 20:14:23 UTC
c279481 Add new options to the matching algo: - fix: fm_conv is now respected - new: fm_horder: when false no higher-order matching is performed. 06 December 2015, 18:10:37 UTC
6177a35 Register notations into a database located in the env. 06 December 2015, 17:56:12 UTC
9de0f56 Nits in pretty-printer. 04 December 2015, 11:36:29 UTC
c35ae8f Better lemmas clearing strategy. + update stdlib w.r.t. this new strategy. 04 December 2015, 11:36:27 UTC
999775a `ring` is now callable from `rewrite`. Syntax is `rewrite #ring`. The syntax `rewrite #tactic` might be generic in a near future, but currently, only `ring` is plugged-in. 04 December 2015, 09:21:55 UTC
a241ea1 Replug pp for proof-term typing errors. 04 December 2015, 09:21:55 UTC
3679fcd List: last_rev. 04 December 2015, 09:21:55 UTC
51b6ca3 List: re-normalized `last` related lemmas' names. 04 December 2015, 09:21:55 UTC
1c4206c Merge commit '987395315d36ddf36600d635513e295bf32d2422' into phl 04 December 2015, 09:17:37 UTC
b44ee94 Refactoring more exn printers. 03 December 2015, 16:50:34 UTC
08e0fd4 Do not select notations as operators. 03 December 2015, 16:50:33 UTC
9873953 Refactoring more exn printers. 03 December 2015, 16:50:12 UTC
c9434a4 Do not select notations as operators. 03 December 2015, 16:50:02 UTC
eca348a Bind abbreviations in the env. 03 December 2015, 16:30:43 UTC
1535b3a Bind abbreviations in the env. 03 December 2015, 16:30:35 UTC
e279c60 Expressions are now printed using the formulas pp. 03 December 2015, 15:59:03 UTC
3f1d954 Expressions are now printed using the formulas pp. 03 December 2015, 15:55:11 UTC
e1e1792 `clear` now applies on axioms. Axioms are only cleared when proven via the cloning mechanism. 03 December 2015, 15:33:17 UTC
3c6d3bb Fix printing of various hint databases. 03 December 2015, 15:33:16 UTC
57561d6 Fix pruning of lemmas from various databases on th. closing. 03 December 2015, 15:33:13 UTC
9f44d3e `clear` now applies on axioms. Axioms are only cleared when proven via the cloning mechanism. 03 December 2015, 15:31:55 UTC
9b64af4 Fix printing of various hint databases. 03 December 2015, 15:29:42 UTC
bed175e Fix pruning of lemmas from various databases on th. closing. 03 December 2015, 15:01:01 UTC
876b7ee Push user error messages to a top-level module. This should allow using some hi-level modules in the pretty-printer module. 03 December 2015, 14:34:43 UTC
2ccfd90 Fix compilation issues introduced by cherry-pick 000ed59. 03 December 2015, 14:34:42 UTC
9241f03 Push user error messages to a top-level module. This should allow using some hi-level modules in the pretty-printer module. 03 December 2015, 14:27:58 UTC
62c3921 print type of added operators 03 December 2015, 11:41:44 UTC
b465dbe print type of added operators 03 December 2015, 10:17:27 UTC
4a454f3 add return type when printing operator 03 December 2015, 10:16:56 UTC
000ed59 allows underscore in pattern matching for fix point 03 December 2015, 09:00:35 UTC
4563255 allows underscore in pattern matching for fix point 03 December 2015, 08:58:44 UTC
a1d4e7c `congr` handles goal of the form `P <=> Q` [fix #17275] 02 December 2015, 19:58:04 UTC
bd34470 `congr` handles goal of the form `P <=> Q` [fix #17275] 02 December 2015, 19:57:53 UTC
e596e75 PG keywords updated 02 December 2015, 16:38:31 UTC
c8346a6 Type-checking of abbreviations. 02 December 2015, 16:38:15 UTC
8b7c8f3 PG keywords updated 02 December 2015, 16:38:05 UTC
693c114 Type-checking of abbreviations. 02 December 2015, 16:36:54 UTC
00c9f37 Type checking of notations. 02 December 2015, 16:01:47 UTC
5710919 Type checking of notations. 02 December 2015, 16:01:34 UTC
f290f1a Simplify BG proof :) 02 December 2015, 13:50:08 UTC
9c9fe65 Simplify BG proof :) 02 December 2015, 13:49:45 UTC
8200aec Add lemma mkseqP 02 December 2015, 13:45:05 UTC
ac800ec Remove unusable /#= rw action + add /# as a i-p. 02 December 2015, 13:44:56 UTC
c1e46d7 Remove unusable /#= rw action + add /# ats a i-p. 02 December 2015, 13:44:48 UTC
7ec2538 Add lemma mkseqP 02 December 2015, 13:31:56 UTC
6f2d37b Parsing rules for notations/abbreviations. 02 December 2015, 11:50:12 UTC
16caef0 Parsing rules for notations/abbreviations. 02 December 2015, 11:50:03 UTC
f97c4dd Refactor parsing rules for operators decl/def. 02 December 2015, 11:43:56 UTC
d394f11 Refactor parsing rules for operators decl/def. 02 December 2015, 11:43:07 UTC
2ba835a README.md: update dependencies 02 December 2015, 11:19:22 UTC
91d4454 remove useless space in lemmas printing. 02 December 2015, 11:19:15 UTC
6cd962a fix bug in printing of abstract theory. 02 December 2015, 11:17:31 UTC
fabbf27 README.md: update dependencies 02 December 2015, 11:16:02 UTC
c29fc84 remove useless space in lemmas printing. 02 December 2015, 11:14:36 UTC
4be5d7a fix bug in printing of abstract theory. 02 December 2015, 11:14:36 UTC
26ad56f improve PY proof script. 02 December 2015, 09:07:13 UTC
311ad83 fixing error message for typing of module expressions. 02 December 2015, 09:07:07 UTC
30389e6 Refactor op-app destructor. 02 December 2015, 09:06:31 UTC
bba28f7 Allow the use of `_` in tuple patterns. As in: `op ['a 'b] fst (x : 'a * 'b) = let (z, _) = x in x` 02 December 2015, 09:06:31 UTC
88b45b4 Refactoring muhoare view implementation. 02 December 2015, 08:41:57 UTC
d0fa4cd Refactor op-app destructor. 02 December 2015, 08:41:19 UTC
cbd608f Allow the use of `_` in tuple patterns. As in: `op ['a 'b] fst (x : 'a * 'b) = let (z, _) = x in x` 02 December 2015, 08:22:51 UTC
99156b6 improve PY proof script. 02 December 2015, 08:18:55 UTC
0b16322 fixing error message for typing of module expressions. 02 December 2015, 08:13:27 UTC
7a77090 Core fact about words. 02 December 2015, 07:28:46 UTC
e14c433 Core fact about words. 02 December 2015, 07:28:38 UTC
90ece64 improve error messages for module application, and there localizations. 01 December 2015, 21:55:03 UTC
36ad55c improve error messages for module application, and there localizations. 01 December 2015, 21:51:05 UTC
cc67710 Removing old quantifier negations from stdlib. 01 December 2015, 21:12:10 UTC
91a1969 NewLogic: add lemmas for negation of existentials. This is so we can stop using 'the other ones'. 01 December 2015, 21:12:09 UTC
8f229a1 Useful lemmas on random permutations. Needs cleaning up. 01 December 2015, 21:12:08 UTC
3915c77 PRFs and PRP-PRF switching lemma. 01 December 2015, 21:12:07 UTC
1de78d7 Fixing up new PRP libs and adding them back into the test suite. 01 December 2015, 21:12:06 UTC
c4da5f6 Removing old quantifier negations from stdlib. 01 December 2015, 21:02:59 UTC
4a65689 NewLogic: add lemmas for negation of existentials. This is so we can stop using 'the other ones'. 01 December 2015, 20:51:59 UTC
42a4a3b Useful lemmas on random permutations. Needs cleaning up. 01 December 2015, 20:37:28 UTC
af346b2 PRFs and PRP-PRF switching lemma. 01 December 2015, 20:16:02 UTC
9fe4d23 Fixing up new PRP libs and adding them back into the test suite. 01 December 2015, 20:10:56 UTC
2998c27 Hint database for auto-exact. Add a new hint mechanism for auto-applying lemmas. Lemmas are added to the auto base with: `hint exact : L1 ... Ln.` `trivial` (and all relatives) now tries to close any goal it is presented by applying one of the lemmas of the database --- closing any generated subgoal recursively. The lemmas in the hint database are not used when `trivial` tries to close the subgoals. Lemmas are applied using a rigid unification and with the view mechanism disabled. The current implementation is linear in the size of the database. A pre-selection mechanism may be necessary in case the hint database grows too much. 01 December 2015, 17:29:46 UTC
65eda54 Hint database for auto-exact. Add a new hint mechanism for auto-applying lemmas. Lemmas are added to the auto base with: `hint exact : L1 ... Ln.` `trivial` (and all relatives) now tries to close any goal it is presented by applying one of the lemmas of the database --- closing any generated subgoal recursively. The lemmas in the hint database are not used when `trivial` tries to close the subgoals. Lemmas are applied using a rigid unification and with the view mechanism disabled. The current implementation is linear in the size of the database. A pre-selection mechanism may be necessary in case the hint database grows too much. 01 December 2015, 17:10:55 UTC
back to top