15#ifndef MCRL2_DATA_CONSISTENCY_H
16#define MCRL2_DATA_CONSISTENCY_H
bool empty() const
Returns true if the list's size is 0.
existential quantification.
universal quantification.
bool is_false_function_symbol(const atermpp::aterm &e)
Recogniser for function false.
bool is_or_application(const atermpp::aterm &e)
Recogniser for application of ||.
bool is_bool(const sort_expression &e)
Recogniser for sort expression Bool.
const basic_sort & bool_()
Constructor for sort expression Bool.
const function_symbol & implies()
Constructor for function symbol =>.
bool is_implies_application(const atermpp::aterm &e)
Recogniser for application of =>.
const function_symbol & and_()
Constructor for function symbol &&.
const function_symbol & false_()
Constructor for function symbol false.
bool is_and_application(const atermpp::aterm &e)
Recogniser for application of &&.
const function_symbol & or_()
Constructor for function symbol ||.
bool is_true_function_symbol(const atermpp::aterm &e)
Recogniser for function true.
bool is_not_application(const atermpp::aterm &e)
Recogniser for application of !.
const function_symbol & not_()
Constructor for function symbol !.
const function_symbol & true_()
Constructor for function symbol true.
data_expression not_(const data_expression &x)
bool is_not_equal_to_application(const DataExpression &e)
Recogniser for application of !=.
bool is_or(const data_expression &x)
Test if x is a disjunction.
bool is_false(const data_expression &x)
Test if x is false.
data_expression make_exists_(const data::variable_list &v, const data_expression &x)
Make an existential quantification. It checks for an empty variable list, which is not allowed.
data_expression make_forall_(const data::variable_list &v, const data_expression &x)
Make a universal quantification. It checks for an empty variable list, which is not allowed.
data_expression or_(const data_expression &x, const data_expression &y)
bool is_not(const data_expression &x)
Test if x is a negation.
data_expression and_(const data_expression &x, const data_expression &y)
const data_expression & false_()
bool is_true(const data_expression &x)
Test if x is true.
bool is_not_equal_to(const data_expression &x)
Test if x is an inequality.
const data_expression & true_()
bool is_imp(const data_expression &x)
Test if x is an implication.
bool is_equal_to(const data_expression &x)
Test if x is an equality.
data_expression imp(const data_expression &x, const data_expression &y)
bool is_bool(const sort_expression &x)
bool is_equal_to_application(const DataExpression &e)
Recogniser for application of ==.
bool is_and(const data_expression &x)
Test if x is a conjunction.
A class that takes a linear process specification and checks all tau-summands of that LPS for conflue...