Leonardo de Moura
835b3a10cc
chore(library/init): consistent names
2018-11-14 13:08:57 -08:00
Leonardo de Moura
71dd8653bc
feat(library/init/core): decidable_eq is a proper class
...
We need this to take advantage of the new indexing structure we are
going to add to improve performance.
2018-09-07 16:38:11 -07:00
Leonardo de Moura
af4f831a9f
feat(library/init/data/hashmap): hash function produces an uint32 instead of nat
...
Most efficient hash functions use uint32/uint64 and produce values
that do not fit in out small nat representation. Thus, GMP big numbers
would have to be created.
2018-05-03 17:56:10 -07:00
Leonardo de Moura
50328d62e1
feat(library/init/data): add uint16 and make sure uint* - uses wraparound semantics like most programming languages
2018-04-20 18:27:13 -07:00
Leonardo de Moura
1ad1080f11
refactor(library): keep only basic nat theorems
...
All theorems are proved without using the tactic framework.
Thus, we can define `fin/uint32/uint64` types and their operations
before we define the tactic framework.
2018-04-11 16:47:54 -07:00
Leonardo de Moura
e421808b8c
refactor(library/init/data/char, library/init/data/fin): has_lt, has_le for char and fin
2017-11-13 15:09:08 -08:00
Mario Carneiro
387c7d46b4
refactor(init/data/fin/basic): shorten fin dec eq proof
2017-07-05 12:37:54 -07:00
Mario Carneiro
39e7e5cba8
feat(data/vector): more vector operations
2017-05-27 04:14:02 -04:00
Leonardo de Moura
8b32f3e7a9
chore(library/init/data/fin/basic): pretty print fin.mk using anonymous constructor notation
2017-05-16 13:54:12 -07:00
Leonardo de Moura
87932f1c56
feat(frontends/lean): change notation for inaccessible patterns
...
The following are accepted
.(t)
._
We don't accept .t anymore because it will conflict with the field
access notation.
2017-03-28 16:09:15 -07:00
Leonardo de Moura
8feacb27a6
feat(library/data): add buffer
2017-03-21 18:47:50 -07:00
Leonardo de Moura
e11fd8820a
refactor(library/init): create init.data folder
2016-12-02 14:23:06 -08:00
