3 commits

Author	SHA1	Message	Date
Leonardo de Moura	603dafbaf7	refactor(kernel): remove 'let'-expressions ... We simulate it in the following way: 1- An opaque 'let'-expressions (let x : t := v in b) is encoded as ((fun (x : t), b) v) We also use a macro (let-macro) to mark this pattern. Thus, the pretty-printer knows how to display it correctly. 2- Transparent 'let'-expressions are eagerly expanded by the parser. Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>	2014-06-24 16:27:27 -07:00
Leonardo de Moura	c5e8c10c9d	fix(library/normalize): bug in normalize ... Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>	2014-05-20 11:53:58 -07:00
Leonardo de Moura	11793e7998	feat(library): add simple normalization procedure ... Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>	2014-05-20 09:40:30 -07:00