https://github.com/EasyCrypt/easycrypt

sort by:
Revision Author Date Message Commit Date
7a77090 Core fact about words. 02 December 2015, 07:28:46 UTC
90ece64 improve error messages for module application, and there localizations. 01 December 2015, 21:55:03 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
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
7cc81de .gitignore 01 December 2015, 15:29:30 UTC
e1b70b4 Pattern matching work modulo unfolding of locals. 01 December 2015, 15:27:06 UTC
1731c7e improve error message: only monomorphic types are allowedt 01 December 2015, 14:57:45 UTC
ecaaf69 Exemplified new matching algo. 01 December 2015, 14:54:52 UTC
95a4b45 Better matching + matching always return a reduced subst. 01 December 2015, 14:54:45 UTC
df925d2 In proof-term, arguments can be partially constructed. As in: `apply (foo (x + _))` 01 December 2015, 13:31:40 UTC
0fcb523 algebra: do not use t_fail internally. 01 December 2015, 12:03:59 UTC
f8aee22 More precise [proof-term checking / apply] error messages. 01 December 2015, 11:50:02 UTC
b9ff6ff nits in Number (use proof terms) 01 December 2015, 10:26:29 UTC
e15bc1d Do not fail on non-flat unification problems. 01 December 2015, 10:26:29 UTC
9d31264 FSet: some cleanup and extensions. 01 December 2015, 10:26:28 UTC
95b5ca7 Adding info to Vagrantfile on how to set emacs up. 01 December 2015, 10:26:27 UTC
2044e32 List: nth_rev. 01 December 2015, 08:40:30 UTC
a12953c Importing some sha3 generic defs. 01 December 2015, 08:26:51 UTC
a0b80ad New rewrite construct: /#, /#= - /# stands for [smt ml=0] - /#= stands for [smt ml=0] + simplify. 30 November 2015, 14:45:33 UTC
ccd708f Better check when overridding operators with type parameters. 30 November 2015, 14:13:03 UTC
b1404f2 Better infer. types for body of cloned operators/predicates. 30 November 2015, 13:07:31 UTC
9843498 Parser/printer nits. - not bounded vars. are now printed as '_' - the syntax '_' is allowed for anonymous vars. - binders with several vars. with the same type can now be written as: `fun x y z : int => e` 30 November 2015, 11:19:09 UTC
0a4653f Bits in BitWord + oflist/tolist. 30 November 2015, 08:46:31 UTC
c4f2b14 Import bits chunking from sha3 dev. 30 November 2015, 08:24:10 UTC
24c586c Nits. 28 November 2015, 15:00:15 UTC
0e96fcf List: before_find / before_index. 28 November 2015, 13:54:08 UTC
67c363e In formulas, give priority to prog. vars over operators. 27 November 2015, 15:40:00 UTC
ace7b84 Replug `transitivity` 27 November 2015, 13:55:39 UTC
cfccd98 Proofs of cancelation of bs2int/int2bs. 27 November 2015, 10:04:38 UTC
d31699b Some progress on summation. 26 November 2015, 19:52:20 UTC
e468348 A first Vagrant file. This one is for use in an active version of the repository. Commented lines in the provisioning script can be used to use OPAM for everything and distribute only the Vagrantfile. TODO: Give recipes and provisioning scripts for a wider variety of archs. 26 November 2015, 19:44:01 UTC
b2e73f6 FSet: Some minor extensions. Need to make notations consistent throughout. 26 November 2015, 19:44:00 UTC
f67e461 NewFMap: dom_set. 26 November 2015, 19:43:58 UTC
560f448 Nits on arithmetic && lists. 26 November 2015, 15:37:55 UTC
d05a093 Kill all admits in RealSeq. 25 November 2015, 15:29:35 UTC
edccc8b Extend Number with RealField specific results. 25 November 2015, 15:29:34 UTC
f3fb324 fix smt in DList. 25 November 2015, 14:40:56 UTC
75690fb fix smt in NewFMap. 25 November 2015, 14:40:55 UTC
e4dd849 fix smt in List. 25 November 2015, 14:40:52 UTC
098dfb0 Progressing on countable summation, reducing all admits to ppties on limits. The lub operator has been pushed into its own theory. 25 November 2015, 11:11:30 UTC
ffe0d4f More on pmap + link between map/nth/range. 25 November 2015, 11:11:29 UTC
5bc7419 Word: rewrite as a refinement of arrays. 25 November 2015, 11:06:55 UTC
ec412c2 NewLogic: comment out overloadings of && and ||. At the moment, the theory cannot be imported without causing issues. 25 November 2015, 11:06:54 UTC
8f4435c NewLogic: Equivalences of quantified statements. 25 November 2015, 10:14:40 UTC
b57d8a5 fix printing of lvalue in program : x[e] ---> x.[e] 25 November 2015, 09:45:22 UTC
b57ee16 Pushing current status on real seq/series. 24 November 2015, 21:48:38 UTC
dc6856e Fix BitEncoding proofs. 24 November 2015, 21:01:36 UTC
d25415a Fixing Matrix. Removing Array import from RealSeq. 24 November 2015, 21:01:35 UTC
9b3d27b Clean Array theory. Word should be based off of this with fixed length and base type. 24 November 2015, 20:06:23 UTC
a334b84 runtest: when in recursive mode, scan also the root directory. 24 November 2015, 20:06:20 UTC
e73c89e More results on bigops. 24 November 2015, 13:36:26 UTC
b953aef fix syntax 24 November 2015, 12:50:08 UTC
6623704 More on divisibility and ordering. 24 November 2015, 12:29:36 UTC
d6c87af Start to generalize and incorporates some ad-hoc lemmas of IntDiv. 24 November 2015, 11:36:19 UTC
b0dffaf Integer divisibility def. + core ppties. 24 November 2015, 10:28:35 UTC
d9d5e00 Change ops. priority. Operators of the form %+(.) has the priority of \1. 24 November 2015, 10:28:34 UTC
6dcc4e0 More lemmas in IntDiv + notations change. Integer division is now denoted by %/ Notations priority/associativity still have to be fixed in some way. 24 November 2015, 09:29:27 UTC
07688b7 Prune old eucliden division. Some nosmt flags may have to be removed/added. Fix stdlib. 24 November 2015, 09:29:26 UTC
cca705e No more axioms in IntDiv. 2 quite simple admits in Number. 23 November 2015, 22:34:18 UTC
1d114d8 Killing some admits in IntDiv. 23 November 2015, 22:34:17 UTC
1c0b2d9 Start to fix admits in IntDiv. 23 November 2015, 22:34:16 UTC
020ace6 Yet again fixing IntDiv. 23 November 2015, 22:34:15 UTC
6b674da Dix def. on divz/modz. 23 November 2015, 11:47:47 UTC
efad303 Remove some busted (admitted) results in IntDiv. 23 November 2015, 11:11:55 UTC
ad6c299 Add internal structures for match in expr/form. 23 November 2015, 09:51:40 UTC
d2ea2ab When a rewrite reduces a goal to `true`, close it. This is a syntactical check (not done modulo any conversion) 21 November 2015, 21:36:49 UTC
7a12e71 `apply` in `rewrite` The syntax is `rewrite &pterm` and might change in a near future. 21 November 2015, 19:12:44 UTC
b0300a9 Some more std distributions. 21 November 2015, 19:12:38 UTC
1ea5fe4 # of perms (without duplicates). 20 November 2015, 13:43:39 UTC
01407ef Prove that we are not generating duplicates (in Perms) 20 November 2015, 13:43:38 UTC
d7b8fdb Generating all the permutations of a list. 20 November 2015, 13:43:34 UTC
3dc3e59 Encoding of bitstrings as integers. 19 November 2015, 15:14:34 UTC
839c366 Import some results on integer division. The proofs do not type-check in the stdlib and has to be fixed. These results should be derivable from IntDiv. 19 November 2015, 15:14:34 UTC
27cecfd Core results on mkseq (List) 19 November 2015, 15:14:33 UTC
c764cd3 Nits in IntDiv. Still admitted results. 19 November 2015, 15:14:32 UTC
46d475e Rework BitWord from new Word th. 19 November 2015, 11:41:58 UTC
35eebc6 Rework Word.eca Don't use Subtype (until this theory is stable) && use NewDistr. 19 November 2015, 10:56:07 UTC
e07964c Basic results on FinType. 19 November 2015, 10:56:07 UTC
7b9ab08 Lossless result on standard distributions. 19 November 2015, 10:56:06 UTC
b3e98cf Nits in Int/List. 19 November 2015, 10:56:05 UTC
bf155c7 Nits in List && Int. 18 November 2015, 20:55:04 UTC
697a2a8 Kill remaining admits in List. 18 November 2015, 20:12:02 UTC
985950d Nits in List. 18 November 2015, 18:36:36 UTC
3b99041 Proof of perm_allpairs 18 November 2015, 17:09:21 UTC
a0d5e83 Allow `apply` / `exact` to act using the top assumption. 18 November 2015, 17:08:50 UTC
2dbec85 Proof refactoring in List. 18 November 2015, 16:38:57 UTC
9f8c7a1 Nits in List. 18 November 2015, 15:44:36 UTC
491a6f4 sort the result of search, most relevant clause at the end. 18 November 2015, 14:42:00 UTC
b1c3bba improve theory Indepi. weaken hypothesis 18 November 2015, 14:38:30 UTC
7e470e4 Admit some properties about allpairs. 18 November 2015, 13:29:24 UTC
b7368cc Fix extra args. 18 November 2015, 12:59:29 UTC
63274eb Bits in bigops + big_allpairs. 18 November 2015, 12:36:39 UTC
aa567fe Nits on allpairs. 18 November 2015, 12:36:38 UTC
dafd55b Tuple: nits + some combinatorial results. 18 November 2015, 11:46:59 UTC
6799d54 List: allpairs def. + spec. (= cross-product \o map) 18 November 2015, 11:46:56 UTC
4091703 Nits in Lists (eq. spec. for cons/cat + hasPn). 18 November 2015, 11:46:55 UTC
back to top