Leonardo de Moura 5ca52d81ec feat(frontends/lean): ML-like notation for match and recursive equations		2015-02-25 16:20:44 -08:00
..
path.hlean	refactor(hott): use nested begin-end blocks, use cases tactic	2015-02-24 13:27:57 -08:00
pi.hlean	refactor(hott): use nested begin-end blocks, use cases tactic	2015-02-24 13:27:57 -08:00
pointed.hlean	feat(hott): rename definition and cleanup in HoTT library	2015-02-20 21:40:42 -05:00
prod.hlean	refactor(hott): use nested begin-end blocks, use cases tactic	2015-02-24 13:27:57 -08:00
sigma.hlean	feat(frontends/lean): ML-like notation for match and recursive equations	2015-02-25 16:20:44 -08:00
trunc.hlean	feat(frontends/lean): add 'assert H : A, ...' as notation for 'have H [visible] : A, ...'	2015-02-25 14:30:42 -08:00
W.hlean	feat(hott): rename definition and cleanup in HoTT library	2015-02-20 21:40:42 -05:00