michael/lean2
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

feat(frontends/lean/placeholder_elaborator): include type in class-instance resolution trace

Browse source
This commit is contained in:
Leonardo de Moura 2014-11-09 12:06:16 -08:00
parent 1d9a0a6265
commit df5a17cdce
2 changed files with 4 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
src/frontends/lean/placeholder_elaborator.cpp
View file

@ -164,7 +164,7 @@ struct placeholder_elaborator : public choice_iterator {
return cons(c, to_list(cs.begin(), cs.end())); return cons(c, to_list(cs.begin(), cs.end()));
} }
void trace(expr const & r) { void trace(expr const & t, expr const & r) {
if (!m_C->trace_instances()) if (!m_C->trace_instances())
return; return;
auto out = diagnostic(m_C->env(), m_C->ios()); auto out = diagnostic(m_C->env(), m_C->ios());
@ -181,7 +181,7 @@ struct placeholder_elaborator : public choice_iterator {
out << " "; out << " ";
if (m_depth > 0) if (m_depth > 0)
out << "[" << m_depth << "] "; out << "[" << m_depth << "] ";
out << m_meta << " := " << r << endl; out << m_meta << " : " << t << " := " << r << endl;
} }
optional<constraints> try_instance(expr const & inst, expr const & inst_type) { optional<constraints> try_instance(expr const & inst, expr const & inst_type) {
@ -216,7 +216,7 @@ struct placeholder_elaborator : public choice_iterator {
type = instantiate(binding_body(type), arg); type = instantiate(binding_body(type), arg);
} }
r = Fun(locals, r); r = Fun(locals, r);
trace(r); trace(meta_type, r);
bool relax = m_C->m_relax; bool relax = m_C->m_relax;
constraint c = mk_eq_cnstr(m_meta, r, m_jst, relax); constraint c = mk_eq_cnstr(m_meta, r, m_jst, relax);
return optional<constraints>(mk_constraints(c, cs)); return optional<constraints>(mk_constraints(c, cs));

1
tests/lean/run/class8.lean
View file

@ -25,6 +25,7 @@ definition assump := eassumption
tactic_hint assump tactic_hint assump
theorem tst {A B : Type} (H : inh B) : inh (A → B → B) theorem tst {A B : Type} (H : inh B) : inh (A → B → B)
set_option elaborator.trace_instances true
theorem T1 {A B C D : Type} {P : C → Prop} (a : A) (H1 : inh B) (H2 : ∃x, P x) : inh ((A → A) × B × (D → C) × Prop) := theorem T1 {A B C D : Type} {P : C → Prop} (a : A) (H1 : inh B) (H2 : ∃x, P x) : inh ((A → A) × B × (D → C) × Prop) :=
have h1 [visible] : inh A, from inh.intro a, have h1 [visible] : inh A, from inh.intro a,