max/lean4-htt
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions 2
lean4-htt/library/tools/super
History
Leonardo de Moura edd5e97045 feat(frontends/lean/elaborator): coercion from (decidable) Prop to bool 
This is a hard coded extra case. It is not an instance of has_coe.
Even if we change has_coe to accomodate this case, it will not be a
satisfactory solution because this coercion depends on the element and
not the type, and the element usually contains metavariables.

We should eventually write a tactic for synthesizing coercions.
2017-02-14 18:41:32 -08:00
..
cdcl.lean feat(tools/super): use congruence closure 2017-01-10 09:07:37 -08:00
cdcl_solver.lean feat(tools/super): use congruence closure 2017-01-10 09:07:37 -08:00
clause.lean refactor(library/init/meta): avoid '_core' idiom using default parameters 2017-02-14 09:46:55 -08:00
clause_ops.lean chore(library/tools/super/clause_ops): remove unnecessary type annotations 2017-01-10 09:07:37 -08:00
clausifier.lean refactor(library/init/meta): remove whnf_core 2017-02-14 18:39:57 -08:00
datatypes.lean feat(frontends/lean/elaborator): add extra coercion resolution rule for monads 2016-12-31 13:50:15 -08:00
default.lean chore(tools/super): add copyright 2016-12-16 19:06:50 -08:00
defs.lean feat(tools/super/defs): unfold definitions using dunfold_expr_core 2017-01-12 21:47:46 +01:00
demod.lean feat(tools/super/demod): demodulation 2017-01-10 09:07:37 -08:00
equality.lean chore(library/tools/super): replace ↣ with ^. 2016-12-16 19:14:05 -08:00
factoring.lean feat(frontends/lean/elaborator): add extra coercion resolution rule for monads 2016-12-31 13:50:15 -08:00
inhabited.lean feat(tools/super/inhabited): look in the local context as well 2017-01-12 21:47:46 +01:00
lpo.lean feat(frontends/lean/elaborator): coercion from (decidable) Prop to bool 2017-02-14 18:41:32 -08:00
misc_preprocessing.lean fix(tools/super/misc_preprocessing): normalize clauses during preprocessing 2017-01-12 21:47:46 +01:00
prover.lean feat(frontends/lean/definition_cmds): allow meta recursive definitions without recursive equations 2017-02-04 13:44:05 -08:00
prover_state.lean feat(frontends/lean/elaborator): coercion from (decidable) Prop to bool 2017-02-14 18:41:32 -08:00
resolution.lean refactor(library/init/meta): avoid '_core' idiom using default parameters 2017-02-14 09:46:55 -08:00
selection.lean chore(library/tools/super): replace ↣ with ^. 2016-12-16 19:14:05 -08:00
simp.lean refactor(library/init/meta/simp_tactic): use default field values at simplify_config 2017-01-23 10:22:48 -08:00
splitting.lean feat(frontends/lean/elaborator): add extra coercion resolution rule for monads 2016-12-31 13:50:15 -08:00
subsumption.lean feat(frontends/lean/elaborator): add extra coercion resolution rule for monads 2016-12-31 13:50:15 -08:00
superposition.lean refactor(library/init/meta): remove whnf_core 2017-02-14 18:39:57 -08:00
trim.lean perf(tools/super/trim): make trim much cheaper 2017-01-12 21:47:46 +01:00
utils.lean chore(library/tools/super): replace ↣ with ^. 2016-12-16 19:14:05 -08:00