michael/lean2
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions
lean2/tests/lean/simp26.lean.expected.out

22 lines
837 B
Text
Raw Normal View History

fix(library/simplifier): move to locally nameless approach in the simplifier. Contextual simplification may add rewriting rules with free variables, and it is a mess to manage them when using de Bruijn indices Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>
2014-01-25 18:49:36 +00:00
Set: pp::colors
Set: pp::unicode
Assumed: a
Assumed: b
Assumed: f
λ x : ℕ, a = 1 → x > f (λ y : ℕ, y + 1)
funext (λ x : ℕ,
imp_congr
refactor(builtin/kernel): reorder congr1 arguments Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>
2014-02-10 00:15:44 +00:00
(congr1 (congr2 eq (Nat::add_zeror a)) 1)
feat(library/simplifier): support for dependent simplification in lambda expressions Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>
2014-01-26 00:54:42 +00:00
(λ C::4 : a = 1, congr2 (Nat::gt x) (congr2 f (funext (λ y : ℕ, congr2 (Nat::add y) C::4)))))
fix(library/simplifier): move to locally nameless approach in the simplifier. Contextual simplification may add rewriting rules with free variables, and it is a mess to manage them when using de Bruijn indices Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>
2014-01-25 18:49:36 +00:00
λ x : ℕ, a = 1 → x = 2 → 2 > f (λ y : ℕ, y + 1 + 2)
funext (λ x : ℕ,
imp_congr
refactor(builtin/kernel): reorder congr1 arguments Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>
2014-02-10 00:15:44 +00:00
(congr1 (congr2 eq (Nat::add_zeror a)) 1)
feat(library/simplifier): support for dependent simplification in lambda expressions Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>
2014-01-26 00:54:42 +00:00
(λ C::8 : a = 1,
fix(library/simplifier): move to locally nameless approach in the simplifier. Contextual simplification may add rewriting rules with free variables, and it is a mess to manage them when using de Bruijn indices Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>
2014-01-25 18:49:36 +00:00
imp_congr
(refl (x = 2))
feat(library/simplifier): support for dependent simplification in lambda expressions Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>
2014-01-26 00:54:42 +00:00
(λ C::5 : x = 2,
congr (congr2 Nat::gt C::5)
fix(library/simplifier): move to locally nameless approach in the simplifier. Contextual simplification may add rewriting rules with free variables, and it is a mess to manage them when using de Bruijn indices Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>
2014-01-25 18:49:36 +00:00
(congr2 f
feat(library/simplifier): support for dependent simplification in lambda expressions Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>
2014-01-26 00:54:42 +00:00
(funext (λ y : ℕ, congr (congr2 Nat::add (congr2 (Nat::add y) C::8)) C::5))))))
Reference in a new issue Copy permalink