2 commits

Author	SHA1	Message	Date
Leonardo de Moura	064ecd3e3d	refactor(library/data/nat): declare lt and le asap using inductive definitions, and make key theorems transparent for definitional package ... We also define key theorems that will be used to generate the automatically generated a well-founded subterm relation for inductive datatypes. We also prove decidability and wf theorems asap.	2014-11-22 00:19:39 -08:00
Leonardo de Moura	1f92751c4d	test(tests/lean/run): fibonacci using well_founded recursion	2014-11-10 12:46:55 -08:00