| .. |
|
actions
|
feat(library/blast): use discrimination trees instead of head_map for indexing hypotheses
|
2015-12-28 09:08:18 -08:00 |
|
backward
|
chore(library/blast/backward): remove unnecessary include
|
2015-12-28 14:26:18 -08:00 |
|
forward
|
feat(library/blast/forward/ematch): add option 'blast.ematch.max_instances'
|
2015-12-29 20:36:11 -08:00 |
|
grinder
|
refactor(library/blast/backward): use priority_queue, make sure head is normalized when building index
|
2015-12-28 12:26:06 -08:00 |
|
simplifier
|
feat(library/blast): add 'ematch_simp' strategy for blast and msimp shortcut for it.
|
2015-12-29 20:04:31 -08:00 |
|
strategies
|
refactor(library/blast/strategies): rename 'debug_action_strategy' to 'action_strategy'
|
2015-12-29 20:45:24 -08:00 |
|
unit
|
refactor(library/blast/simplifier): use priority_queue to store simp/congr lemmas, use name convention used at forward/backward lemmas, normalize lemmas when blast starts, cache get_simp_lemmas
|
2015-12-28 17:52:57 -08:00 |
|
action_result.h
|
feat(library/blast): add action based on congruence closure module
|
2015-11-19 12:30:45 -08:00 |
|
blast.cpp
|
feat(library/blast): include strategies failure states in the tactic_exception
|
2015-12-29 17:14:55 -08:00 |
|
blast.h
|
feat(library/blast): include strategies failure states in the tactic_exception
|
2015-12-29 17:14:55 -08:00 |
|
blast_exception.h
|
feat(library/blast): include strategies failure states in the tactic_exception
|
2015-12-29 17:14:55 -08:00 |
|
blast_tactic.cpp
|
feat(library/blast): include strategies failure states in the tactic_exception
|
2015-12-29 17:14:55 -08:00 |
|
blast_tactic.h
|
feat(library/blast): parse blast tactic and invoke stub
|
2015-09-25 12:45:16 -07:00 |
|
choice_point.cpp
|
refactor(library/blast): add strategy abstract object
|
2015-11-15 13:12:21 -08:00 |
|
choice_point.h
|
fix(library/blast): uninitialized variables
|
2015-11-18 18:56:19 -08:00 |
|
CMakeLists.txt
|
feat(library/blast): add discrimination trees
|
2015-12-28 09:08:17 -08:00 |
|
congruence_closure.cpp
|
refactor(library/blast/simplifier): use priority_queue to store simp/congr lemmas, use name convention used at forward/backward lemmas, normalize lemmas when blast starts, cache get_simp_lemmas
|
2015-12-28 17:52:57 -08:00 |
|
congruence_closure.h
|
feat(library/blast/congruence_closure): avoid unnecessary propagations in the congruence closure module
|
2015-12-09 12:17:51 -08:00 |
|
discr_tree.cpp
|
chore(library/blast): style
|
2015-12-28 09:08:18 -08:00 |
|
discr_tree.h
|
chore(library/blast): style
|
2015-12-28 09:08:18 -08:00 |
|
gexpr.cpp
|
feat(library/blast/backward/backward_action): display lemma name in backward action
|
2015-12-09 11:07:53 -08:00 |
|
gexpr.h
|
refactor(library/blast/backward): use priority_queue, make sure head is normalized when building index
|
2015-12-28 12:26:06 -08:00 |
|
hypothesis.cpp
|
chore(library/blast): remove "leftover" file used in the old blast architecture
|
2015-12-04 17:34:56 -08:00 |
|
hypothesis.h
|
fix(library/blast/hypothesis): incorrect method being invoked
|
2015-12-05 16:53:47 -08:00 |
|
imp_extension.cpp
|
chore(library/blast/imp_extension): fix unused argument warning
|
2015-12-04 08:34:20 -08:00 |
|
imp_extension.h
|
chore(library/blast/imp_extension): style
|
2015-12-04 08:26:03 -08:00 |
|
init_module.cpp
|
feat(library/blast): add discrimination trees
|
2015-12-28 09:08:17 -08:00 |
|
init_module.h
|
feat(library/blast): parse blast tactic and invoke stub
|
2015-09-25 12:45:16 -07:00 |
|
options.cpp
|
refactor(library/blast): move to new tracing infrastructure
|
2015-12-08 19:37:06 -08:00 |
|
options.h
|
refactor(library/blast): move to new tracing infrastructure
|
2015-12-08 19:37:06 -08:00 |
|
proof_expr.cpp
|
refactor(library/blast): get_hypothesis_decl return a reference
|
2015-11-18 18:20:02 -08:00 |
|
proof_expr.h
|
feat(library/blast): add proof_expr thin layer for creating proof terms at blast
|
2015-11-10 10:50:58 -08:00 |
|
revert.cpp
|
refactor(library/blast): make sure all actions return action_result, add macros for simplifying strategy definition
|
2015-11-18 12:29:43 -08:00 |
|
revert.h
|
refactor(library/blast): make sure all actions return action_result, add macros for simplifying strategy definition
|
2015-11-18 12:29:43 -08:00 |
|
state.cpp
|
chore(library/blast): style
|
2015-12-28 09:08:18 -08:00 |
|
state.h
|
chore(library/blast): style
|
2015-12-28 09:08:18 -08:00 |
|
strategy.cpp
|
feat(library/blast): include strategies failure states in the tactic_exception
|
2015-12-29 17:14:55 -08:00 |
|
strategy.h
|
feat(library/blast): trace strategy name
|
2015-12-09 17:13:28 -08:00 |
|
trace.cpp
|
feat(library/blast): refine trace messages
|
2015-12-09 18:38:20 -08:00 |
|
trace.h
|
feat(library/blast/forward/ematch): add option 'blast.ematch.max_instances'
|
2015-12-29 20:36:11 -08:00 |
|
util.cpp
|
feat(library/blast/unit/unit_propagate): make sure unif_propagate works even if 'not' is marked as '[reducible]'
|
2015-12-04 16:49:21 -08:00 |
|
util.h
|
feat(library/blast/unit/unit_propagate): make sure unif_propagate works even if 'not' is marked as '[reducible]'
|
2015-12-04 16:49:21 -08:00 |
251b53c669