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

feat(library/blast/congruence_closure): expose mk_ext_congr_lemma

Browse source
This commit is contained in:
Leonardo de Moura 2015-11-24 18:43:15 -08:00
parent 651e3834ba
commit c923120db5
2 changed files with 47 additions and 26 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

45
src/library/blast/congruence_closure.cpp
View file

@ -45,31 +45,24 @@ static list<optional<name>> rel_names_from_arg_kinds(list<congr_arg_kind> const
}); });
} }
struct ext_congr_lemma { ext_congr_lemma::ext_congr_lemma(congr_lemma const & H):
name m_R; m_R(get_eq_name()),
congr_lemma m_congr_lemma; // actual lemma m_congr_lemma(H),
list<optional<name>> m_rel_names; // relation congruence to be used with each child, none means child is ignored by congruence closure. m_rel_names(rel_names_from_arg_kinds(H.get_arg_kinds(), get_eq_name())),
unsigned m_lift_needed:1; // if true, m_congr_lemma is for equality, and we need to lift to m_R. m_lift_needed(false),
unsigned m_fixed_fun:1; // if true, we build equivalences for functions, and use generic congr lemma, and ignore m_congr_lemma m_fixed_fun(true) {}
ext_congr_lemma(congr_lemma const & H): ext_congr_lemma::ext_congr_lemma(name const & R, congr_lemma const & H, bool lift_needed):
m_R(get_eq_name()), m_R(R),
m_congr_lemma(H), m_congr_lemma(H),
m_rel_names(rel_names_from_arg_kinds(H.get_arg_kinds(), get_eq_name())), m_rel_names(rel_names_from_arg_kinds(H.get_arg_kinds(), get_eq_name())),
m_lift_needed(false), m_lift_needed(lift_needed),
m_fixed_fun(true) {} m_fixed_fun(true) {}
ext_congr_lemma(name const & R, congr_lemma const & H, bool lift_needed): ext_congr_lemma::ext_congr_lemma(name const & R, congr_lemma const & H, list<optional<name>> const & rel_names, bool lift_needed):
m_R(R), m_R(R),
m_congr_lemma(H), m_congr_lemma(H),
m_rel_names(rel_names_from_arg_kinds(H.get_arg_kinds(), get_eq_name())), m_rel_names(rel_names),
m_lift_needed(lift_needed), m_lift_needed(lift_needed),
m_fixed_fun(true) {} m_fixed_fun(true) {}
ext_congr_lemma(name const & R, congr_lemma const & H, list<optional<name>> const & rel_names, bool lift_needed):
m_R(R),
m_congr_lemma(H),
m_rel_names(rel_names),
m_lift_needed(lift_needed),
m_fixed_fun(true) {}
};
/* We use the following cache for user-defined lemmas and automatically generated ones. */ /* We use the following cache for user-defined lemmas and automatically generated ones. */
typedef std::unordered_map<congr_lemma_key, optional<ext_congr_lemma>, congr_lemma_key_hash_fn, congr_lemma_key_eq_fn> congr_cache; typedef std::unordered_map<congr_lemma_key, optional<ext_congr_lemma>, congr_lemma_key_hash_fn, congr_lemma_key_eq_fn> congr_cache;
@ -328,7 +321,7 @@ static optional<ext_congr_lemma> mk_ext_congr_lemma_core(name const & R, expr co
return optional<ext_congr_lemma>(R, *eq_congr, lift_needed); return optional<ext_congr_lemma>(R, *eq_congr, lift_needed);
} }
static optional<ext_congr_lemma> mk_ext_congr_lemma(name const & R, expr const & fn, unsigned nargs) { optional<ext_congr_lemma> mk_ext_congr_lemma(name const & R, expr const & fn, unsigned nargs) {
congr_lemma_key key(R, fn, nargs); congr_lemma_key key(R, fn, nargs);
auto it = g_congr_cache->find(key); auto it = g_congr_cache->find(key);
if (it != g_congr_cache->end()) if (it != g_congr_cache->end())

28
src/library/blast/congruence_closure.h
View file

@ -7,6 +7,7 @@ Author: Leonardo de Moura
#pragma once #pragma once
#include "kernel/expr.h" #include "kernel/expr.h"
#include "library/expr_lt.h" #include "library/expr_lt.h"
#include "library/congr_lemma_manager.h"
#include "library/blast/hypothesis.h" #include "library/blast/hypothesis.h"
namespace lean { namespace lean {
@ -234,6 +235,33 @@ public:
/** \brief Return the congruence closure object associated with the current state */ /** \brief Return the congruence closure object associated with the current state */
congruence_closure & get_cc(); congruence_closure & get_cc();
struct ext_congr_lemma {
/* Relation this lemma is a congruence for */
name m_R;
/* The basic congr_lemma object defined at congr_lemma_manager */
congr_lemma m_congr_lemma;
/* m_rel_names is the relation congruence to be used with each child, none means child is ignored by congruence closure.
An element is not none iff it corresponds to an Eq kind at m_congr_lemma.get_arg_kinds() */
list<optional<name>> m_rel_names;
/* If m_lift_needed is true, m_congr_lemma is for equality, and we need to lift to m_R. This is just a helper flag fo building
a proof from the equivalence argument proofs. */
unsigned m_lift_needed:1;
/* If m_fixed_fun is false, then we build equivalences for functions, and use generic congr lemma, and ignore m_congr_lemma.
That is, even the function can be treated as an Eq argument. */
unsigned m_fixed_fun:1;
ext_congr_lemma(congr_lemma const & H);
ext_congr_lemma(name const & R, congr_lemma const & H, bool lift_needed);
ext_congr_lemma(name const & R, congr_lemma const & H, list<optional<name>> const & rel_names, bool lift_needed);
name const & get_relation() const { return m_R; }
congr_lemma const & get_congr_lemma() const { return m_congr_lemma; }
list<optional<name>> const & get_arg_rel_names() const { return m_rel_names; }
};
/** \brief Build an extended congruence lemma for function \c fn with \c nargs expected arguments over relation \c R.
A subset of user-defined congruence lemmas is considered by this procedure. */
optional<ext_congr_lemma> mk_ext_congr_lemma(name const & R, expr const & fn, unsigned nargs);
void initialize_congruence_closure(); void initialize_congruence_closure();
void finalize_congruence_closure(); void finalize_congruence_closure();
}} }}