This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# 1. Find implications over a conditional grammar | |
# 2. Find total rules over a term grammar | |
# 3. Use implications and conditions to find conditional rules | |
def run_chompy(): | |
term_egraph = new_egraph() | |
rules = [] | |
# (map from pvecs to conditions, assumption propagations) | |
(pvec_to_conditions, impl_rules) = get_conditional_structures(cond_egraph) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# 1. Find implications over a conditional grammar | |
# 2. Find total rules over a term grammar | |
# 3. Use implications and conditions to find conditional rules | |
def run_chompy(): | |
term_egraph = new_egraph() | |
rules = [] | |
# (map from pvecs to conditions, assumption propagations) | |
(pvec_to_conditions, impl_rules) = get_conditional_structures(cond_egraph) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def run_chompy(): | |
term_egraph = new_egraph() | |
cond_egraph = new_egraph() | |
rules = [] | |
# Find condition implications | |
condition_workload = enumerate_condition_workload() | |
# A series of rules which simplify conditions into **equivalent** forms. | |
# e.g., (a <= 0) <==> (0 >= a) |