michael/lean2
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions
lean2/tests/lean/run
History
Leonardo de Moura faee08591f fix(*): make sure elaborator and type_checker use the same "rules" for treating opaque definitions 
This is a big change because we have to store in constraints whether we can use the "relaxed" rules or not.
The "relaxed" case says that when type checking the value of an opaque definition we can treat other opaque definitions in the same module as transparent.

Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>
2014-07-27 12:12:54 -07:00
..
algebra1.lean feat(frontends/lean): search for identifiers in the stack of namespaces; reject non-atomic names as local names 2014-07-07 19:00:06 -07:00
alias1.lean feat(frontends/lean/elaborator): keep postponing delayed coercions until the type can be inferred 2014-07-07 12:50:43 -07:00
alias2.lean feat(frontends/lean/elaborator): keep postponing delayed coercions until the type can be inferred 2014-07-07 12:50:43 -07:00
alias3.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
basic.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
booltst.lean test(tests/lean/run): add some 'lost' tests 2014-07-23 08:22:53 -07:00
bug5.lean test(tests/lean/run): add some 'lost' tests 2014-07-23 08:22:53 -07:00
bug6.lean fix(frontends/lean/elaborator): bug when mixing implicit arguments and sections 2014-07-19 09:55:34 +01:00
calc.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
class1.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
class2.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
class3.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
class4.lean fix(*): make sure elaborator and type_checker use the same "rules" for treating opaque definitions 2014-07-27 12:12:54 -07:00
class5.lean test(tests/lean/run/class5): improve test 2014-07-13 22:39:16 +01:00
class6.lean feat(library/standard): add namespace 'pair' 2014-07-07 14:48:19 -07:00
class7.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
class8.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
coe1.lean fix(frontends/lean/pp): universe pretty printer 2014-07-09 19:17:28 -07:00
coe2.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
coe3.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
coe4.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
coe5.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
decidable.lean refactor(library/standard): rename bit to bool 2014-07-22 09:49:54 -07:00
e1.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
e2.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
e3.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
e4.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
e5.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
e6.lean test(tests/lean/run): add simple overloading test 2014-06-26 09:32:12 -07:00
e7.lean test(tests/lean/run): add test demonstrating how to control ambiguity 2014-06-26 09:32:19 -07:00
e8.lean test(tests/lean/run): more tests on how to deal with ambiguity 2014-06-26 09:32:26 -07:00
e9.lean test(tests/lean/run): more tests on how to deal with ambiguity 2014-06-26 09:32:26 -07:00
e10.lean fix(frontends/lean): bugs in notation management 2014-07-07 09:31:42 -07:00
e11.lean fix(frontends/lean/elaborator): bug when mixing implicit arguments and sections 2014-07-19 09:55:34 +01:00
e12.lean test(tests/lean/run): add another example on how to deal with ambiguity 2014-06-26 10:18:35 -07:00
e13.lean feat(library/scoped_ext): do not import 'children' namespace objects 2014-06-26 10:32:34 -07:00
e14.lean feat(kernel): add infer implicit, and use it to infer implicit arguments of inductive datatype eliminators, and tag whether parameters should be implicit or not in introduction rules in the module inductive_cmd 2014-06-28 13:57:36 -07:00
e15.lean feat(kernel): add infer implicit, and use it to infer implicit arguments of inductive datatype eliminators, and tag whether parameters should be implicit or not in introduction rules in the module inductive_cmd 2014-06-28 13:57:36 -07:00
e16.lean feat(kernel): add infer implicit, and use it to infer implicit arguments of inductive datatype eliminators, and tag whether parameters should be implicit or not in introduction rules in the module inductive_cmd 2014-06-28 13:57:36 -07:00
e17.lean feat(kernel): add infer implicit, and use it to infer implicit arguments of inductive datatype eliminators, and tag whether parameters should be implicit or not in introduction rules in the module inductive_cmd 2014-06-28 13:57:36 -07:00
e18.lean chore(tests): add missing tests 2014-06-29 09:03:51 -07:00
elim.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
elim2.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
full.lean feat(frontends/lean/pp): add option for displaying fully qualified names 2014-07-10 15:55:19 +01:00
fun.lean feat(library/standard): add function 'helper' module 2014-07-24 16:29:39 -07:00
goal.lean test(tests/lean/run): add some 'lost' tests 2014-07-23 08:22:53 -07:00
group.lean feat(frontends/lean): remove [class] annotation and 'class' command, they are redundant, we only need [instance] and 'instance' 2014-07-07 16:09:30 -07:00
group2.lean refactor(frontends/lean/elaborator): modify when tactic_hints are invoked, add the notion of strict placeholder 2014-07-14 02:53:02 +01:00
have1.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
have2.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
have3.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
have4.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
have5.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
have6.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
id.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
imp.lean fix(frontends/lean): '@' explicit mark 2014-06-28 07:30:36 -07:00
ind0.lean feat(frontends/lean): add inductive_cmd 2014-06-18 16:00:59 -07:00
ind1.lean feat(frontends/lean): add inductive_cmd 2014-06-18 16:00:59 -07:00
ind2.lean feat(frontends/lean): add inductive_cmd 2014-06-18 16:00:59 -07:00
ind3.lean refactor(frontends/lean/inductive_cmd): redesign inductive datatype elaboration, use the new elaborator, and use simpler algorithm to infer the resulting universe 2014-06-28 15:33:56 -07:00
ind4.lean feat(frontends/lean): add inductive_cmd 2014-06-18 16:00:59 -07:00
ind5.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
ind6.lean refactor(frontends/lean/inductive_cmd): redesign inductive datatype elaboration, use the new elaborator, and use simpler algorithm to infer the resulting universe 2014-06-28 15:33:56 -07:00
ind7.lean feat(frontends/lean): add inductive_cmd 2014-06-18 16:00:59 -07:00
induniv.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
is_nil.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
let1.lean test(tests/lean/run): add nested let-expr test 2014-07-10 15:56:15 +01:00
local_using.lean feat(frontends/lean): add notation overwrite 2014-06-23 16:10:36 -07:00
n1.lean feat(frontends/lean/parser): expand Lua parser API 2014-06-18 08:03:17 -07:00
n2.lean feat(frontends/lean/parser): add local_scope object to Lua API 2014-06-18 08:38:23 -07:00
n3.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
n4.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
n5.lean feat(frontends/lean/notation_cmd): reuse existing precedence to increase compatibility with existing notation 2014-07-03 17:23:29 -07:00
nat_bug.lean feat(frontends/lean/elaborator): distribute application over choice, this feature improves the support for overloaded aliases 2014-07-24 23:43:40 -07:00
nat_bug2.lean fix(library/inductive_unifier_plugin): unification problem failure on problems with inductive datatypes 2014-07-25 13:49:45 -07:00
nat_bug3.lean fix(library/unifier): do not let a unification plugin to 'prioritize' a flex-flex constraint, and add missing case 2014-07-25 15:03:57 -07:00
nat_bug4.lean fix(library/inductive_unifier_plugin): do not try to solve type incorrect constraints 2014-07-25 16:00:38 -07:00
nat_bug5.lean fix(library/unifier): eager whnf application 2014-07-26 10:37:02 -07:00
nat_bug6.lean fix(library/unifier): eager whnf application 2014-07-26 10:37:02 -07:00
num.lean feat(frontends/lean): parse numerals as expressions of type 'num.num' 2014-07-02 08:09:33 -07:00
ptst.lean feat(library/standard): add namespace 'pair' 2014-07-07 14:48:19 -07:00
root.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
section1.lean fix(frontends/lean): bug in section management 2014-07-14 05:04:01 +01:00
set.lean test(tests/lean/run): add some 'lost' tests 2014-07-23 08:22:53 -07:00
set2.lean test(tests/lean/run): add some 'lost' tests 2014-07-23 08:22:53 -07:00
simple.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
string.lean feat(frontends/lean): parse strings as expressions of type 'string.string' 2014-07-02 10:00:55 -07:00
t1.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
t2.lean feat(frontends/lean/parser): add parse_level 2014-06-12 12:34:55 -07:00
t4.lean feat(frontends/lean/parser): allow explicit universe level to be provided to aliases and locals 2014-06-13 18:00:52 -07:00
t5.lean test(lean/run): add overload test 2014-06-13 18:06:44 -07:00
t6.lean feat(frontends/lean): add let-expr pretty printer, reduce default indentation to 2 2014-07-09 18:47:10 -07:00
t7.lean feat(frontends/lean/builtin_exprs): parse '_' placeholder 2014-06-16 10:41:08 -07:00
t8.lean feat(library/tactic): rename 'exact' to 'assumption', 'exact' is a different tactic 2014-07-02 18:10:42 -07:00
t9.lean feat(frontends/lean/notation_cmd): make the notation for setting precedence uniform 2014-07-01 16:55:41 -07:00
t10.lean feat(frontends/lean/builtin_cmds): add 'print options' command 2014-06-16 17:31:28 -07:00
t11.lean feat(frontends/lean/builtin_cmds): change notation for marking implicit/cast parameter in sections 2014-06-22 17:51:00 -07:00
tactic1.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
tactic2.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
tactic3.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
tactic4.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
tactic5.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
tactic6.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
tactic7.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
tactic8.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
tactic9.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
tactic10.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
tactic11.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
tactic12.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
tactic13.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
tactic14.lean fix(tests/lean/run/tactic14): remove not_intro, it is not needed anymore 2014-07-24 23:41:23 -07:00
tactic15.lean test(tests/lean/run): add 'apply subst' test 2014-07-03 09:07:56 -07:00
tactic16.lean feat(library/tactic): add apply tactic 2014-07-03 09:20:01 -07:00
tactic17.lean fix(library/unifier): missing case 2014-07-03 10:51:59 -07:00
tactic18.lean fix(library/unifier): missing case 2014-07-03 10:51:59 -07:00
tactic19.lean fix(library/unifier): missing case 2014-07-03 10:51:59 -07:00
tactic20.lean feat(library/tactic): add eassumption tactic, and remove redundant 'subgoals' from apply tactic 2014-07-03 13:04:46 -07:00
tactic21.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
tactic22.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
tactic23.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
tactic24.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
tactic25.lean refactor(*): rename Bool to Prop 2014-07-22 09:43:18 -07:00
tactic26.lean feat(frontends/lean): use the same universe in declarations such as (A B : Type) 2014-07-10 13:18:52 +01:00
tactic27.lean feat(library/tactic/apply_tactic): add option for 'refreshing' universe metavariables in the 'apply' tactic 2014-07-08 16:55:23 -07:00
tactic28.lean feat(frontends/lean): use the same universe in declarations such as (A B : Type) 2014-07-10 13:18:52 +01:00
tactic29.lean fix(frontends/lean): more bugs in section management 2014-07-14 06:27:36 +01:00
tactic30.lean fix(frontends/lean): more bugs in section management 2014-07-14 06:27:36 +01:00
test_single.sh feat(tests/lean/run): add test_single script that sets the LEAN_PATH 2014-06-29 07:47:46 -07:00
trick.lean feat(library/unifier): case split on constraints of the form (f ...) =?= (f ...), where f can be unfolded, and there are metavariables in the arguments 2014-07-05 15:52:40 -07:00
uni.lean fix(*): make sure elaborator and type_checker use the same "rules" for treating opaque definitions 2014-07-27 12:12:54 -07:00
uni2.lean fix(*): make sure elaborator and type_checker use the same "rules" for treating opaque definitions 2014-07-27 12:12:54 -07:00
uni_issue1.lean fix(frontends/lean): fix (and simplify) parameter universe inference 2014-07-06 16:56:54 -07:00
univ1.lean test(tests/lean/run): add Cody's file to test suite 2014-07-27 08:17:46 -07:00
univ2.lean fix(*): make sure elaborator and type_checker use the same "rules" for treating opaque definitions 2014-07-27 12:12:54 -07:00