Leonardo de Moura 5a560b6d43 feat(library/init/data): add hashmap ... We use the same approach used to define rbtree: 1- Structure with minimal number of invariants, AND 2- well_formed inductive predicate We can use the well_formed predicate to prove auxiliary invariants later. Example: the keys stored in every bucket have the correct hash code. This implementation does not depend on the tactic framework, and it is not a mess like the one in mathlib.		2018-04-30 18:28:29 -07:00
..
basic.lean	feat(library/init/data): add hashmap	2018-04-30 18:28:29 -07:00