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

feat(frontends/lean/calc): expose get_calc_subst_info and get_calc_refl_info APIs

Browse source
This commit is contained in:
Leonardo de Moura 2014-10-30 23:56:38 -07:00
parent 5f23179388
commit 42dba5cc98
2 changed files with 28 additions and 13 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

39
src/frontends/lean/calc.cpp
View file

@ -60,8 +60,8 @@ struct calc_entry {
}; };
struct calc_state { struct calc_state {
typedef name_map<pair<name, unsigned>> refl_table; typedef name_map<std::tuple<name, unsigned, unsigned>> refl_table;
typedef name_map<pair<name, unsigned>> subst_table; typedef name_map<std::tuple<name, unsigned, unsigned>> subst_table;
typedef name_map<std::tuple<name, unsigned, unsigned>> symm_table; typedef name_map<std::tuple<name, unsigned, unsigned>> symm_table;
typedef rb_map<name_pair, std::tuple<name, name, unsigned>, name_pair_quick_cmp> trans_table; typedef rb_map<name_pair, std::tuple<name, name, unsigned>, name_pair_quick_cmp> trans_table;
trans_table m_trans_table; trans_table m_trans_table;
@ -72,22 +72,26 @@ struct calc_state {
void add_calc_subst(environment const & env, name const & subst) { void add_calc_subst(environment const & env, name const & subst) {
buffer<expr> arg_types; buffer<expr> arg_types;
expr r_type = extract_arg_types(env, subst, arg_types); auto p = extract_arg_types_core(env, subst, arg_types);
unsigned nargs = arg_types.size(); expr r_type = p.first;
unsigned nunivs = p.second;
unsigned nargs = arg_types.size();
if (nargs < 2) if (nargs < 2)
throw exception("invalid calc substitution theorem, it must have at least 2 arguments"); throw exception("invalid calc substitution theorem, it must have at least 2 arguments");
name const & rop = get_fn_const(arg_types[nargs-2], "invalid calc substitution theorem, argument penultimate argument must be an operator application"); name const & rop = get_fn_const(arg_types[nargs-2], "invalid calc substitution theorem, argument penultimate argument must be an operator application");
m_subst_table.insert(rop, mk_pair(subst, nargs)); m_subst_table.insert(rop, std::make_tuple(subst, nargs, nunivs));
} }
void add_calc_refl(environment const & env, name const & refl) { void add_calc_refl(environment const & env, name const & refl) {
buffer<expr> arg_types; buffer<expr> arg_types;
expr r_type = extract_arg_types(env, refl, arg_types); auto p = extract_arg_types_core(env, refl, arg_types);
unsigned nargs = arg_types.size(); expr r_type = p.first;
unsigned nunivs = p.second;
unsigned nargs = arg_types.size();
if (nargs < 1) if (nargs < 1)
throw exception("invalid calc reflexivity rule, it must have at least 1 argument"); throw exception("invalid calc reflexivity rule, it must have at least 1 argument");
name const & rop = get_fn_const(r_type, "invalid calc reflexivity rule, result type must be an operator application"); name const & rop = get_fn_const(r_type, "invalid calc reflexivity rule, result type must be an operator application");
m_refl_table.insert(rop, mk_pair(refl, nargs)); m_refl_table.insert(rop, std::make_tuple(refl, nargs, nunivs));
} }
void add_calc_trans(environment const & env, name const & trans) { void add_calc_trans(environment const & env, name const & trans) {
@ -180,15 +184,24 @@ void register_calc_cmds(cmd_table & r) {
add_cmd(r, cmd_info("calc_symm", "set the symmetry rule for an operator, this command is relevant for the calculational proof '{...}' notation", calc_symm_cmd)); add_cmd(r, cmd_info("calc_symm", "set the symmetry rule for an operator, this command is relevant for the calculational proof '{...}' notation", calc_symm_cmd));
} }
optional<std::tuple<name, unsigned, unsigned>> get_calc_symm_info(environment const & env, name const & rop) { static optional<std::tuple<name, unsigned, unsigned>> get_info(name_map<std::tuple<name, unsigned, unsigned>> const & table, name const & op) {
auto const & s = calc_ext::get_state(env); if (auto it = table.find(op)) {
if (auto it = s.m_symm_table.find(rop)) {
return optional<std::tuple<name, unsigned, unsigned>>(*it); return optional<std::tuple<name, unsigned, unsigned>>(*it);
} else { } else {
return optional<std::tuple<name, unsigned, unsigned>>(); return optional<std::tuple<name, unsigned, unsigned>>();
} }
} }
optional<std::tuple<name, unsigned, unsigned>> get_calc_refl_info(environment const & env, name const & op) {
return get_info(calc_ext::get_state(env).m_refl_table, op);
}
optional<std::tuple<name, unsigned, unsigned>> get_calc_subst_info(environment const & env, name const & op) {
return get_info(calc_ext::get_state(env).m_subst_table, op);
}
optional<std::tuple<name, unsigned, unsigned>> get_calc_symm_info(environment const & env, name const & op) {
return get_info(calc_ext::get_state(env).m_symm_table, op);
}
static expr mk_calc_annotation_core(expr const & e) { return mk_annotation(*g_calc_name, e); } static expr mk_calc_annotation_core(expr const & e) { return mk_annotation(*g_calc_name, e); }
static expr mk_calc_annotation(expr const & pr) { static expr mk_calc_annotation(expr const & pr) {
if (is_by(pr) || is_begin_end_annotation(pr) || is_sorry(pr)) { if (is_by(pr) || is_begin_end_annotation(pr) || is_sorry(pr)) {
@ -254,9 +267,9 @@ static void parse_calc_proof(parser & p, buffer<calc_pred> const & preds, std::v
for (auto const & pred : preds) { for (auto const & pred : preds) {
if (auto refl_it = state.m_refl_table.find(pred_op(pred))) { if (auto refl_it = state.m_refl_table.find(pred_op(pred))) {
if (auto subst_it = state.m_subst_table.find(pred_op(pred))) { if (auto subst_it = state.m_subst_table.find(pred_op(pred))) {
expr refl = mk_op_fn(p, refl_it->first, refl_it->second-1, pos); expr refl = mk_op_fn(p, std::get<0>(*refl_it), std::get<1>(*refl_it)-1, pos);
expr refl_pr = p.mk_app(refl, pred_lhs(pred), pos); expr refl_pr = p.mk_app(refl, pred_lhs(pred), pos);
expr subst = mk_op_fn(p, subst_it->first, subst_it->second-2, pos); expr subst = mk_op_fn(p, std::get<0>(*subst_it), std::get<1>(*subst_it)-2, pos);
expr subst_pr = p.mk_app({subst, pr, refl_pr}, pos); expr subst_pr = p.mk_app({subst, pr, refl_pr}, pos);
steps.emplace_back(pred, subst_pr); steps.emplace_back(pred, subst_pr);
} }

2
src/frontends/lean/calc.h
View file

@ -15,6 +15,8 @@ bool is_calc_annotation(expr const & e);
Return none if the operator does not have a symmetry rule associated with it. Return none if the operator does not have a symmetry rule associated with it.
*/ */
optional<std::tuple<name, unsigned, unsigned>> get_calc_symm_info(environment const & env, name const & op); optional<std::tuple<name, unsigned, unsigned>> get_calc_symm_info(environment const & env, name const & op);
optional<std::tuple<name, unsigned, unsigned>> get_calc_refl_info(environment const & env, name const & op);
optional<std::tuple<name, unsigned, unsigned>> get_calc_subst_info(environment const & env, name const & op);
void initialize_calc(); void initialize_calc();
void finalize_calc(); void finalize_calc();
} }