Leonardo de Moura 829a50ccf7 test(tests/playground/partial_eq_lemma): partial equation lemmas ... @kha I added this example as a template for what the equation compiler will have to do. The plan is: - We can use `partial` to define any function if the result type is inhabited. - If the result type is of the form `Partial a`, the equation compiler generates lemmas of the form: ``` theorem fooEq args : terminates (foo args) → foo args = lhs ``` The new test contains an example.		2019-03-26 18:06:04 -07:00
..
compiler	chore(tests/compiler/str): fix test	2019-03-22 17:26:43 -07:00
ir	chore(tests): port tests, fix at least compiler tests	2019-03-21 15:11:05 -07:00
lean	chore(library/init/core): HasLt => HasLess, HasLe => HasLessEq, ...	2019-03-23 10:07:46 -07:00
playground	test(tests/playground/partial_eq_lemma): partial equation lemmas	2019-03-26 18:06:04 -07:00