12#ifndef MCRL2_DATA_DETAIL_DATA_FUNCTIONAL_H
13#define MCRL2_DATA_DETAIL_DATA_FUNCTIONAL_H
15#include "mcrl2/data/basic_sort.h"
16#include "mcrl2/data/function_symbol.h"
27template <
typename Term>
39 template <
typename Term2>
82template <
typename Expression >
An integer term stores a single std::size_t value. It carries no arguments.
aterm_int(std::size_t value)
Constructs an integer term from a value.
aterm_string & operator=(aterm_string &&t) noexcept=default
aterm_string(const std::string &s)
Constructor that allows construction from a string.
const aterm & operator[](const size_type i) const
Returns the i-th argument.
aterm & operator=(const aterm &other) noexcept=default
const function_symbol & function() const
Returns the function symbol belonging to an aterm.
aterm(const aterm &other) noexcept=default
This class has user-declared copy constructor so declare default copy and move operators.
bool empty() const
Returns true if the term has no arguments.
size_type size() const
Returns the number of arguments of this term.
term_appl_iterator< aterm > const_iterator
Const iterator used to iterate through an term_appl.
bool operator!=(const function_symbol &f) const
Inequality test.
bool operator==(const function_symbol &f) const
Equality test.
void swap(unprotected_aterm_core &t) noexcept
Swaps this term with its argument.
bool operator==(const unprotected_aterm_core &t) const
Comparison operator.
bool type_is_appl() const noexcept
Dynamic check whether the term is an aterm.
bool operator!=(const unprotected_aterm_core &t) const
Inequality operator on two unprotected aterms.
bool type_is_int() const noexcept
Dynamic check whether the term is an aterm_int.
Traverser that defines functions for maintaining bound variables.
TraverserOrBuilder< Derived > super
std::multiset< variable_type >::size_type bind_count(const variable_type &v)
Returns the bind count of the variable v.
void decrease_bind_count(const Container &variables, typename atermpp::enable_if_container< Container, variable_type >::type *=nullptr)
Remove a sequence of variables from the multiset of bound variables.
void increase_bind_count(const Container &variables, typename atermpp::enable_if_container< Container, variable_type >::type *=nullptr)
Add a sequence of variables to the multiset of bound variables.
bool is_bound(variable_type const &v) const
Returns true if the variable v is bound.
const std::multiset< variable_type > & bound_variables() const
Returns the bound variables.
std::multiset< variable_type > m_bound_variables
void decrease_bind_count(const variable_type &var)
Remove a variable from the multiset of bound variables.
void increase_bind_count(const variable_type &var)
Add a variable to the multiset of bound variables.
Builder< apply_builder_arg1< Builder, Arg1 > > super
apply_builder_arg1(const Arg1 &arg1)
apply_builder_arg2(const Arg1 &arg1, const Arg2 &arg2)
Builder< apply_builder_arg2< Builder, Arg1, Arg2 > > super
Builder< apply_builder< Builder > > super
singleton_expression & operator=(singleton_expression &&)=delete
singleton_expression & operator=(const singleton_expression &)=delete
singleton_expression(singleton_expression &&)=delete
singleton_expression(const singleton_expression &)=delete
static const Expression & instance()
parse_node_exception(const std::string &message)
parse_node_exception(const parse_node &node, const std::string &message)
static std::string get_error_message(const parse_node &node, const std::string &user_message)
parse_node_unexpected_exception(const parser &p, const parse_node &node)
static std::string get_error_message(const parser &p, const parse_node &node)
update_apply_builder_arg1(const Function &f, const Arg1 &arg1)
Builder< update_apply_builder_arg1< Builder, Function, Arg1 > > super
void apply(T &result, const argument_type &x)
An abstraction expression.
const variable_list & variables() const
abstraction(const atermpp::aterm &term)
Constructor.
abstraction(const binder_type &binding_operator, const variable_list &variables, const data_expression &body)
Constructor.
abstraction(const abstraction &) noexcept=default
Move semantics.
abstraction(const binder_type &binding_operator, const Container &variables, const data_expression &body, typename atermpp::enable_if_container< Container, variable >::type *=nullptr)
Constructor.
abstraction & operator=(abstraction &&) noexcept=default
const data_expression & body() const
abstraction(abstraction &&) noexcept=default
abstraction()
Default constructor.
const binder_type & binding_operator() const
abstraction & operator=(const abstraction &) noexcept=default
alias()
\brief Default constructor X3.
alias(const alias &) noexcept=default
Move semantics.
alias & operator=(const alias &) noexcept=default
alias(const basic_sort &name, const sort_expression &reference)
\brief Constructor Z12.
alias(alias &&) noexcept=default
alias(const atermpp::aterm &term)
alias & operator=(alias &&) noexcept=default
const basic_sort & name() const
const sort_expression & reference() const
\brief Assignment expression
assignment_expression(assignment_expression &&) noexcept=default
assignment_expression()
\brief Default constructor X3.
assignment_expression & operator=(const assignment_expression &) noexcept=default
assignment_expression(const assignment_expression &) noexcept=default
Move semantics.
assignment_expression & operator=(assignment_expression &&) noexcept=default
assignment_expression(const atermpp::aterm &term)
\brief Assignment of a data expression to a variable
assignment(const variable &lhs, const data_expression &rhs)
\brief Constructor Z14.
const data_expression & rhs() const
assignment(const atermpp::aterm &term)
assignment(assignment &&) noexcept=default
assignment & operator=(assignment &&) noexcept=default
const variable & lhs() const
assignment & operator=(const assignment &) noexcept=default
assignment(const assignment &) noexcept=default
Move semantics.
assignment()
\brief Default constructor X3.
const data_expression & operator()(const variable &x) const
Applies the assignment to a variable.
\brief Binder for bag comprehension
bag_comprehension_binder(const atermpp::aterm &term)
bag_comprehension_binder & operator=(const bag_comprehension_binder &) noexcept=default
bag_comprehension_binder(const bag_comprehension_binder &) noexcept=default
Move semantics.
bag_comprehension_binder()
\brief Default constructor X3.
bag_comprehension_binder(bag_comprehension_binder &&) noexcept=default
bag_comprehension_binder & operator=(bag_comprehension_binder &&) noexcept=default
universal quantification.
bag_comprehension(const bag_comprehension &) noexcept=default
Move semantics.
bag_comprehension & operator=(bag_comprehension &&) noexcept=default
bag_comprehension & operator=(const bag_comprehension &) noexcept=default
bag_comprehension(const aterm &d)
bag_comprehension(bag_comprehension &&) noexcept=default
bag_comprehension(const Container &variables, const data_expression &body, typename atermpp::enable_if_container< Container, variable >::type *=nullptr)
\brief Container type for bags
bag_container(const bag_container &) noexcept=default
Move semantics.
bag_container(bag_container &&) noexcept=default
bag_container & operator=(bag_container &&) noexcept=default
bag_container()
\brief Default constructor X3.
bag_container(const atermpp::aterm &term)
bag_container & operator=(const bag_container &) noexcept=default
basic_sort(const basic_sort &) noexcept=default
Move semantics.
basic_sort()
\brief Default constructor X3.
basic_sort & operator=(const basic_sort &) noexcept=default
const core::identifier_string & name() const
basic_sort(basic_sort &&) noexcept=default
basic_sort(const core::identifier_string &name)
\brief Constructor Z14.
basic_sort(const std::string &name)
\brief Constructor Z2.
basic_sort & operator=(basic_sort &&) noexcept=default
basic_sort(const atermpp::aterm &term)
binder_type()
\brief Default constructor X3.
binder_type(binder_type &&) noexcept=default
binder_type & operator=(const binder_type &) noexcept=default
binder_type & operator=(binder_type &&) noexcept=default
binder_type(const binder_type &) noexcept=default
Move semantics.
binder_type(const atermpp::aterm &term)
container_sort()
\brief Default constructor X3.
container_sort & operator=(container_sort &&) noexcept=default
container_sort(const container_sort &) noexcept=default
Move semantics.
container_sort(const container_type &container_name, const sort_expression &element_sort)
\brief Constructor Z14.
container_sort(container_sort &&) noexcept=default
container_sort & operator=(const container_sort &) noexcept=default
const container_type & container_name() const
const sort_expression & element_sort() const
container_sort(const atermpp::aterm &term)
container_type(container_type &&) noexcept=default
container_type(const atermpp::aterm &term)
container_type & operator=(const container_type &) noexcept=default
container_type & operator=(container_type &&) noexcept=default
container_type(const container_type &) noexcept=default
Move semantics.
container_type()
\brief Default constructor X3.
data_equation(const atermpp::aterm &term)
data_equation()
\brief Default constructor X3.
const data_expression & lhs() const
const data_expression & condition() const
data_equation & operator=(data_equation &&) noexcept=default
data_equation(const Container &variables, const data_expression &lhs, const data_expression &rhs, typename atermpp::enable_if_container< Container, variable >::type *=nullptr)
Constructor.
const data_expression & rhs() const
data_equation(data_equation &&) noexcept=default
data_equation(const Container &variables, const data_expression &condition, const data_expression &lhs, const data_expression &rhs, typename atermpp::enable_if_container< Container, variable >::type *=nullptr)
\brief Constructor Z1.
data_equation(const variable_list &variables, const data_expression &condition, const data_expression &lhs, const data_expression &rhs)
\brief Constructor Z12.
const variable_list & variables() const
data_equation & operator=(const data_equation &) noexcept=default
data_equation(const data_expression &lhs, const data_expression &rhs)
Constructor.
data_equation(const data_equation &) noexcept=default
Move semantics.
data_expression & operator=(const data_expression &) noexcept=default
application operator()(const data_expression &e1, const data_expression &e2, const data_expression &e3, const data_expression &e4) const
Apply a data expression to four data expressions.
application operator()(const data_expression &e1, const data_expression &e2, const data_expression &e3) const
Apply a data expression to three data expressions.
data_expression(const atermpp::aterm &term)
data_expression()
\brief Default constructor X3.
application operator()(const data_expression &e1, const data_expression &e2) const
Apply a data expression to two data expressions.
data_expression & operator=(data_expression &&) noexcept=default
sort_expression sort() const
Returns the sort of the data expression.
const_iterator end() const
application operator()(const data_expression &e) const
Apply a data expression to a data expression.
data_expression(const data_expression &) noexcept=default
Move semantics.
data_expression(data_expression &&) noexcept=default
const_iterator begin() const
bool is_default_data_expression() const
A function to efficiently determine whether a data expression is made by the default constructor.
application operator()(const data_expression &e1, const data_expression &e2, const data_expression &e3, const data_expression &e4, const data_expression &e5) const
Apply a data expression to five data expressions.
application operator()(const data_expression &e1, const data_expression &e2, const data_expression &e3, const data_expression &e4, const data_expression &e5, const data_expression &e6) const
Apply a data expression to six data expressions.
\brief Binder for existential quantification
exists_binder(const exists_binder &) noexcept=default
Move semantics.
exists_binder & operator=(exists_binder &&) noexcept=default
exists_binder(exists_binder &&) noexcept=default
exists_binder & operator=(const exists_binder &) noexcept=default
exists_binder()
\brief Default constructor X3.
exists_binder(const atermpp::aterm &term)
existential quantification.
exists(const Container &variables, const data_expression &body, typename atermpp::enable_if_container< Container, variable >::type *=nullptr)
exists & operator=(exists &&) noexcept=default
exists(exists &&) noexcept=default
exists & operator=(const exists &) noexcept=default
exists(const exists &) noexcept=default
Move semantics.
\brief Container type for finite bags
fbag_container & operator=(const fbag_container &) noexcept=default
fbag_container()
\brief Default constructor X3.
fbag_container(const fbag_container &) noexcept=default
Move semantics.
fbag_container & operator=(fbag_container &&) noexcept=default
fbag_container(const atermpp::aterm &term)
fbag_container(fbag_container &&) noexcept=default
\brief Binder for universal quantification
forall_binder(const forall_binder &) noexcept=default
Move semantics.
forall_binder & operator=(forall_binder &&) noexcept=default
forall_binder(const atermpp::aterm &term)
forall_binder()
\brief Default constructor X3.
forall_binder(forall_binder &&) noexcept=default
forall_binder & operator=(const forall_binder &) noexcept=default
universal quantification.
forall(forall &&) noexcept=default
forall & operator=(const forall &) noexcept=default
forall(const Container &variables, const data_expression &body, typename atermpp::enable_if_container< Container, variable >::type *=nullptr)
forall & operator=(forall &&) noexcept=default
forall(const forall &) noexcept=default
Move semantics.
\brief Container type for finite sets
fset_container(fset_container &&) noexcept=default
fset_container(const fset_container &) noexcept=default
Move semantics.
fset_container(const atermpp::aterm &term)
fset_container()
\brief Default constructor X3.
fset_container & operator=(fset_container &&) noexcept=default
fset_container & operator=(const fset_container &) noexcept=default
const sort_expression & codomain() const
function_sort()
\brief Default constructor X3.
function_sort(const sort_expression_list &domain, const sort_expression &codomain)
\brief Constructor Z14.
function_sort & operator=(const function_sort &) noexcept=default
function_sort(const atermpp::aterm &term)
function_sort(const Container &domain, const sort_expression &codomain, typename atermpp::enable_if_container< Container, sort_expression >::type *=nullptr)
\brief Constructor Z2.
function_sort & operator=(function_sort &&) noexcept=default
function_sort(function_sort &&) noexcept=default
function_sort(const function_sort &) noexcept=default
Move semantics.
const sort_expression_list & domain() const
function_symbol(const core::identifier_string &name, const sort_expression &sort)
Constructor.
function_symbol(const function_symbol &) noexcept=default
Move semantics.
function_symbol & operator=(function_symbol &&) noexcept=default
function_symbol()
Default constructor.
function_symbol(function_symbol &&) noexcept=default
function_symbol(const atermpp::aterm &term)
Constructor.
const core::identifier_string & name() const
const sort_expression & sort() const
function_symbol & operator=(const function_symbol &) noexcept=default
function_symbol(const std::string &name, const sort_expression &sort)
Constructor.
Abstract base class for identifier generators. Identifier generators generate fresh names that do not...
virtual core::identifier_string operator()(const std::string &hint, bool add_to_context=true)
Returns a fresh identifier, with the given hint as prefix. The returned identifier is added to the co...
virtual ~identifier_generator()=default
Destructor.
virtual void add_identifier(const core::identifier_string &s)=0
Adds the identifier s to the context.
virtual bool has_identifier(const core::identifier_string &s) const =0
Returns true if the identifier s appears in the context.
identifier_generator()=default
Constructor.
void remove_identifiers(const std::set< core::identifier_string > &ids)
Remove a set of identifiers from the context.
virtual void remove_identifier(const core::identifier_string &s)=0
Removes the identifier s from the context.
virtual void clear_context()=0
Clears the context.
void add_identifiers(const std::set< core::identifier_string > &ids)
Add a set of identifiers to the context.
\brief Binder for lambda abstraction
lambda_binder & operator=(lambda_binder &&) noexcept=default
lambda_binder(const atermpp::aterm &term)
lambda_binder()
\brief Default constructor X3.
lambda_binder(lambda_binder &&) noexcept=default
lambda_binder & operator=(const lambda_binder &) noexcept=default
lambda_binder(const lambda_binder &) noexcept=default
Move semantics.
lambda(const Container &variables, const data_expression &body, typename atermpp::enable_if_container< Container, variable >::type *=nullptr)
lambda(const variable &variable, const data_expression &body)
lambda & operator=(const lambda &) noexcept=default
lambda(const lambda &) noexcept=default
Move semantics.
lambda(lambda &&) noexcept=default
lambda & operator=(lambda &&) noexcept=default
\brief Container type for lists
list_container(list_container &&) noexcept=default
list_container()
\brief Default constructor X3.
list_container & operator=(list_container &&) noexcept=default
list_container & operator=(const list_container &) noexcept=default
list_container(const list_container &) noexcept=default
Move semantics.
list_container(const atermpp::aterm &term)
machine_number()
\brief Default constructor X2.
machine_number & operator=(machine_number &&) noexcept=default
machine_number & operator=(const machine_number &) noexcept=default
std::size_t value() const
machine_number(const machine_number &) noexcept=default
Move semantics.
machine_number(std::size_t value)
\brief Constructor Z13.
machine_number(machine_number &&) noexcept=default
machine_number(const atermpp::aterm &term)
Identifier generator that stores the identifiers of the context in a multiset. If an identifier occur...
bool has_identifier(const core::identifier_string &s) const override
Returns true if the identifier s appears in the context.
void remove_identifier(const core::identifier_string &s) override
Removes one occurrence of the identifier s from the context.
void add_identifier(const core::identifier_string &s) override
Adds the identifier s to the context.
void clear_context() override
Clears the context.
const std::multiset< core::identifier_string > & context() const
Returns the context.
std::multiset< core::identifier_string > m_identifiers
The context of the identifier generator.
multiset_identifier_generator()=default
Constructor.
\brief Binder for set comprehension
set_comprehension_binder(const atermpp::aterm &term)
set_comprehension_binder & operator=(set_comprehension_binder &&) noexcept=default
set_comprehension_binder & operator=(const set_comprehension_binder &) noexcept=default
set_comprehension_binder()
\brief Default constructor X3.
set_comprehension_binder(set_comprehension_binder &&) noexcept=default
set_comprehension_binder(const set_comprehension_binder &) noexcept=default
Move semantics.
universal quantification.
set_comprehension & operator=(set_comprehension &&) noexcept=default
set_comprehension(set_comprehension &&) noexcept=default
set_comprehension(const Container &variables, const data_expression &body, typename atermpp::enable_if_container< Container, variable >::type *=nullptr)
set_comprehension & operator=(const set_comprehension &) noexcept=default
set_comprehension(const aterm &d)
set_comprehension(const set_comprehension &) noexcept=default
Move semantics.
\brief Container type for sets
set_container()
\brief Default constructor X3.
set_container(const set_container &) noexcept=default
Move semantics.
set_container(set_container &&) noexcept=default
set_container & operator=(set_container &&) noexcept=default
set_container & operator=(const set_container &) noexcept=default
set_container(const atermpp::aterm &term)
Identifier generator that stores the identifiers of the context in a set. Using the operator()() and ...
const std::set< core::identifier_string > & context() const
Returns the context.
void remove_identifier(const core::identifier_string &s) override
Removes one occurrence of the identifier s from the context.
set_identifier_generator()=default
Constructor.
void clear_context() override
Clears the context.
void add_identifier(const core::identifier_string &s) override
Adds the identifier s to the context.
std::set< core::identifier_string > m_identifiers
The context of the identifier generator.
bool has_identifier(const core::identifier_string &s) const override
Returns true if the identifier s appears in the context.
sort_expression & operator=(const sort_expression &) noexcept=default
sort_expression(const sort_expression &) noexcept=default
Move semantics.
sort_expression & operator=(sort_expression &&) noexcept=default
const sort_expression & target_sort() const
Returns the target sort of this expression.
sort_expression(sort_expression &&) noexcept=default
sort_expression()
\brief Default constructor X3.
sort_expression(const atermpp::aterm &term)
std::map< sort_expression, sort_expression > m_normalised_aliases
Table containing how sorts should be mapped to normalised sorts.
const std::set< sort_expression > & context_sorts() const
Return the user defined context sorts of the current specification.
void remove_sort(const sort_expression &s)
Removes sort from the user defined sorts in the specification. Note that this does not remove aliases...
void add_system_defined_sort(const sort_expression &s)
Adds a sort to this specification, and marks it as system defined.
basic_sort_vector m_user_defined_sorts
The basic sorts and structured sorts in the specification.
bool operator==(const sort_specification &other) const
std::set< sort_expression > m_sorts_in_context
The sorts that occur are needed in this sort specification but are not explicitly defined as user def...
const std::map< sort_expression, sort_expression > & sort_alias_map() const
Gets a normalisation mapping that maps each sort to its unique normalised sort.
const std::set< sort_expression > & sorts() const
Gets the normalised sort declarations including those that are system defined. This is the set with a...
void add_context_sorts(const Container &c, typename atermpp::enable_if_container< Container >::type *=nullptr)
Adds the sorts in c to the context sorts.
const basic_sort_vector & user_defined_sorts() const
Gets all sorts defined by a user (excluding the system defined sorts).
bool m_normalised_data_is_up_to_date
The variable below indicates whether a surrounding data specification is up to data with respect to s...
alias_vector m_user_defined_aliases
The basic sorts and structured sorts in the specification.
void add_predefined_basic_sorts()
sort_specification()
Default constructor.
void sorts_are_not_necessarily_normalised_anymore() const
void data_is_not_necessarily_normalised_anymore() const
void add_alias(const alias &a)
Adds an alias (new name for a sort) to this specification.
void add_sort(const basic_sort &s)
Adds a sort to this specification.
void reconstruct_m_normalised_aliases() const
sort_specification(const basic_sort_vector &sorts, const alias_vector &aliases)
std::set< sort_expression > m_normalised_sorts
Set containing all the sorts, including the system defined ones.
void remove_alias(const alias &a)
Removes a user defined //alias from specification.
void add_context_sort(const sort_expression &s)
Adds the sort s to the context sorts.
void normalise_sort_specification_if_required() const
void check_for_alias_loop(const sort_expression &s, std::set< sort_expression > sorts_already_seen, const bool toplevel=true) const
void import_system_defined_sorts(const CONTAINER &sorts)
const alias_vector & user_defined_aliases() const
Gets the user defined aliases.
bool m_normalised_sorts_are_up_to_date
This boolean indicates whether the variables m_normalised_constructors, m_mappings,...
void import_system_defined_sort(const sort_expression &sort)
Adds the system defined sorts in a sequence. The second argument is used to check which sorts are add...
\brief An argument of a constructor of a structured sort
structured_sort_constructor_argument(const sort_expression &sort)
Constructor.
structured_sort_constructor_argument(const std::string &name, const sort_expression &sort)
\brief Constructor Z1.
structured_sort_constructor_argument(const atermpp::aterm &term)
structured_sort_constructor_argument(const core::identifier_string &name, const sort_expression &sort)
\brief Constructor Z12.
const core::identifier_string & name() const
structured_sort_constructor_argument(structured_sort_constructor_argument &&) noexcept=default
structured_sort_constructor_argument()
\brief Default constructor X3.
structured_sort_constructor_argument(const char(&name)[S], const sort_expression &sort)
structured_sort_constructor_argument & operator=(const structured_sort_constructor_argument &) noexcept=default
structured_sort_constructor_argument(const structured_sort_constructor_argument &) noexcept=default
Move semantics.
structured_sort_constructor_argument & operator=(structured_sort_constructor_argument &&) noexcept=default
const sort_expression & sort() const
\brief A constructor for a structured sort
function_symbol constructor_function(const sort_expression &s) const
Returns the constructor function for this constructor, assuming it is internally represented with sor...
const core::identifier_string & name() const
structured_sort_constructor & operator=(structured_sort_constructor &&) noexcept=default
structured_sort_constructor(const char(&name)[S], const Container &arguments, const char(&recogniser)[S0], typename atermpp::enable_if_container< Container, structured_sort_constructor_argument >::type *=nullptr)
structured_sort_constructor & operator=(const structured_sort_constructor &) noexcept=default
structured_sort_constructor(const structured_sort_constructor &) noexcept=default
Move semantics.
structured_sort_constructor(const core::identifier_string &name, const structured_sort_constructor_argument_list &arguments, core::identifier_string &recogniser)
\brief Constructor Z12.
structured_sort_constructor(const core::identifier_string &name, const core::identifier_string &recogniser)
Constructor.
function_symbol_vector projection_functions(const sort_expression &s) const
Returns the projection functions for this constructor.
structured_sort_constructor(structured_sort_constructor &&) noexcept=default
const core::identifier_string & recogniser() const
function_symbol recogniser_function(const sort_expression &s) const
Returns the function corresponding to the recogniser of this constructor, such that it is usable in t...
structured_sort_constructor(const atermpp::aterm &term)
const structured_sort_constructor_argument_list & arguments() const
structured_sort_constructor()
\brief Default constructor X3.
void argument_sorts(OutIter out) const
Returns the sorts of the arguments in an output iterator.
structured_sort_constructor(const core::identifier_string &name)
Constructor.
data_equation_vector recogniser_equations() const
Generate equations for the recognisers of this sort, assuming that this sort is referred to with s.
function_symbol smaller_arguments_function(const sort_expression &s) const
structured_sort & operator=(const structured_sort &) noexcept=default
function_symbol_vector recogniser_functions(const sort_expression &s) const
function_symbol to_pos_function(const sort_expression &s) const
structured_sort(const structured_sort &) noexcept=default
Move semantics.
function_symbol_vector constructor_functions(const sort_expression &s) const
data_equation_vector comparison_equations() const
Returns the equations for the functions used to implement comparison operators on this sort....
data_equation_vector constructor_equations(const sort_expression &s) const
data_equation_vector recogniser_equations(const sort_expression &s) const
static bool has_recogniser(structured_sort_constructor const &s)
data_equation_vector projection_equations() const
Generate equations for the projection functions of this sort.
function_symbol equal_arguments_function(const sort_expression &s) const
structured_sort(const Container &constructors, typename atermpp::enable_if_container< Container, structured_sort_constructor >::type *=nullptr)
\brief Constructor Z2.
const structured_sort_constructor_list & constructors() const
function_symbol_vector constructor_functions() const
Returns the constructor functions of this sort, such that the result can be used by the rewriter.
function_symbol_vector projection_functions() const
Returns the projection functions of this sort, such that the result can be used by the rewriter.
function_symbol_vector comparison_functions(const sort_expression &s) const
function_symbol_vector comparison_functions() const
Returns the additional functions of this sort, used to implement its comparison operators.
data_equation_vector comparison_equations(const sort_expression &s) const
structured_sort(const structured_sort_constructor_list &constructors)
\brief Constructor Z14.
function_symbol_vector recogniser_functions() const
Returns the recogniser functions of this sort, such that the result can be used by the rewriter.
function_symbol_vector projection_functions(const sort_expression &s) const
structured_sort()
\brief Default constructor X3.
structured_sort(structured_sort &&) noexcept=default
data_equation_vector projection_equations(const sort_expression &s) const
structured_sort(const atermpp::aterm &term)
structured_sort & operator=(structured_sort &&) noexcept=default
data_equation_vector constructor_equations() const
Returns the equations for ==, < and <= for this sort, such that the result can be used by the rewrite...
function_symbol smaller_equal_arguments_function(const sort_expression &s) const
\brief An untyped parameter
untyped_data_parameter(const core::identifier_string &name, const data_expression_list &arguments)
\brief Constructor Z12.
const core::identifier_string & name() const
untyped_data_parameter(const std::string &name, const data_expression_list &arguments)
\brief Constructor Z1.
const data_expression_list & arguments() const
untyped_data_parameter(const untyped_data_parameter &) noexcept=default
Move semantics.
untyped_data_parameter & operator=(untyped_data_parameter &&) noexcept=default
untyped_data_parameter & operator=(const untyped_data_parameter &) noexcept=default
untyped_data_parameter(const atermpp::aterm &term)
untyped_data_parameter(untyped_data_parameter &&) noexcept=default
untyped_data_parameter()
\brief Default constructor X3.
\brief Assignment of a data expression to a string
const core::identifier_string & lhs() const
untyped_identifier_assignment(const atermpp::aterm &term)
untyped_identifier_assignment()
\brief Default constructor X3.
const data_expression & rhs() const
untyped_identifier_assignment & operator=(untyped_identifier_assignment &&) noexcept=default
untyped_identifier_assignment & operator=(const untyped_identifier_assignment &) noexcept=default
untyped_identifier_assignment(const core::identifier_string &lhs, const data_expression &rhs)
\brief Constructor Z14.
untyped_identifier_assignment(untyped_identifier_assignment &&) noexcept=default
untyped_identifier_assignment(const untyped_identifier_assignment &) noexcept=default
Move semantics.
data_expression operator()(const untyped_identifier &x) const
Applies the assignment to a variable.
\brief An untyped identifier
untyped_identifier(const atermpp::aterm &term)
untyped_identifier(const untyped_identifier &) noexcept=default
Move semantics.
untyped_identifier(const std::string &name)
\brief Constructor Z2.
untyped_identifier & operator=(untyped_identifier &&) noexcept=default
const core::identifier_string & name() const
untyped_identifier(untyped_identifier &&) noexcept=default
untyped_identifier & operator=(const untyped_identifier &) noexcept=default
untyped_identifier()
\brief Default constructor X3.
untyped_identifier(const core::identifier_string &name)
\brief Constructor Z14.
\brief Multiple possible sorts
untyped_possible_sorts(const Container &sorts, typename atermpp::enable_if_container< Container, sort_expression >::type *=nullptr)
\brief Constructor Z2.
untyped_possible_sorts & operator=(const untyped_possible_sorts &) noexcept=default
untyped_possible_sorts(const untyped_possible_sorts &) noexcept=default
Move semantics.
untyped_possible_sorts & operator=(untyped_possible_sorts &&) noexcept=default
untyped_possible_sorts(const sort_expression_list &sorts)
\brief Constructor Z14.
untyped_possible_sorts(const atermpp::aterm &term)
untyped_possible_sorts(untyped_possible_sorts &&) noexcept=default
untyped_possible_sorts()
\brief Default constructor X3.
const sort_expression_list & sorts() const
\brief Binder for untyped set or bag comprehension
untyped_set_or_bag_comprehension_binder(untyped_set_or_bag_comprehension_binder &&) noexcept=default
untyped_set_or_bag_comprehension_binder(const atermpp::aterm &term)
untyped_set_or_bag_comprehension_binder()
\brief Default constructor X3.
untyped_set_or_bag_comprehension_binder(const untyped_set_or_bag_comprehension_binder &) noexcept=default
Move semantics.
untyped_set_or_bag_comprehension_binder & operator=(const untyped_set_or_bag_comprehension_binder &) noexcept=default
untyped_set_or_bag_comprehension_binder & operator=(untyped_set_or_bag_comprehension_binder &&) noexcept=default
universal quantification.
untyped_set_or_bag_comprehension & operator=(untyped_set_or_bag_comprehension &&) noexcept=default
untyped_set_or_bag_comprehension(const Container &variables, const data_expression &body, typename atermpp::enable_if_container< Container, variable >::type *=nullptr)
untyped_set_or_bag_comprehension(const aterm &d)
untyped_set_or_bag_comprehension(const untyped_set_or_bag_comprehension &) noexcept=default
Move semantics.
untyped_set_or_bag_comprehension(untyped_set_or_bag_comprehension &&) noexcept=default
untyped_set_or_bag_comprehension & operator=(const untyped_set_or_bag_comprehension &) noexcept=default
\brief Untyped sort variable
untyped_sort_variable & operator=(const untyped_sort_variable &) noexcept=default
untyped_sort_variable(const untyped_sort_variable &) noexcept=default
Move semantics.
untyped_sort_variable(const atermpp::aterm &term)
untyped_sort_variable & operator=(untyped_sort_variable &&) noexcept=default
untyped_sort_variable(untyped_sort_variable &&) noexcept=default
untyped_sort_variable(std::size_t value)
Constructor.
untyped_sort_variable(const atermpp::aterm_int &value)
\brief Constructor Z14.
untyped_sort_variable()
\brief Default constructor X3.
const atermpp::aterm_int & value() const
\brief Unknown sort expression
untyped_sort & operator=(const untyped_sort &) noexcept=default
untyped_sort(const atermpp::aterm &term)
untyped_sort(const untyped_sort &) noexcept=default
Move semantics.
untyped_sort & operator=(untyped_sort &&) noexcept=default
untyped_sort(untyped_sort &&) noexcept=default
untyped_sort()
\brief Default constructor X3.
variable(const variable &) noexcept=default
Move semantics.
variable(const std::string &name, const sort_expression &sort)
Constructor.
variable(variable &&) noexcept=default
variable()
Default constructor.
const core::identifier_string & name() const
variable & operator=(variable &&) noexcept=default
const sort_expression & sort() const
variable & operator=(const variable &) noexcept=default
variable(const core::identifier_string &name, const sort_expression &sort)
Constructor.
variable(const atermpp::aterm &term)
Constructor.
\brief A where expression
where_clause & operator=(where_clause &&) noexcept=default
const assignment_list & assignments() const
where_clause(const where_clause &) noexcept=default
Move semantics.
where_clause(const atermpp::aterm &term)
const data_expression & body() const
const assignment_expression_list & declarations() const
where_clause & operator=(const where_clause &) noexcept=default
where_clause()
\brief Default constructor X3.
where_clause(const data_expression &body, const Container &declarations, typename atermpp::enable_if_container< Container, assignment_expression >::type *=nullptr)
\brief Constructor Z2.
where_clause(where_clause &&) noexcept=default
where_clause(const data_expression &body, const assignment_expression_list &declarations)
\brief Constructor Z14.
logger(const log_level_t l)
Default constructor.
Standard exception class for reporting runtime errors.
runtime_error(const std::string &message)
Constructor.
Identifier generator that generates names consisting of a prefix followed by a number....
number_postfix_generator(std::string hint="FRESH_VAR")
Constructor.
std::string operator()(std::string hint, bool add_to_context=true) const
Generates a fresh identifier that doesn't appear in the context.
void add_identifiers(Iter first, Iter last)
Adds the strings in the range [first, last) to the context.
number_postfix_generator(Iter first, Iter last, std::string hint="FRESH_VAR")
Constructor.
void clear()
Clear the context of the generator.
std::string m_hint
The default hint.
std::map< std::string, std::size_t > m_index
A map that maintains the highest index for each prefix.
void add_identifier(const std::string &id)
Adds the strings in the range [first, last) to the context.
const std::string & hint() const
Returns the default hint.
std::string & hint()
Returns the default hint.
std::string operator()() const
Generates a fresh identifier that doesn't appear in the context.
D_ParserTables parser_tables_fsm
D_ParserTables parser_tables_dot
D_ParserTables parser_tables_mcrl2
#define mCRL2log(LEVEL)
mCRL2log(LEVEL) provides the stream used to log.
The main namespace for the aterm++ library.
term_list< aterm > aterm_list
A term_list with elements of type aterm.
const aterm_string & empty_string()
Returns the empty aterm_string.
bool check_term_PREqnSpec(const Term &t)
bool check_term_MapSpec(const Term &t)
bool check_term_PBESTrue(const Term &t)
bool check_term_Seq(const Term &t)
bool check_term_DataVarIdInit(const Term &t)
bool check_rule_DataVarIdInit(const Term &t)
bool check_term_Action(const Term &t)
bool check_term_PRESOr(const Term &t)
bool check_term_SortId(const Term &t)
bool check_term_Sum(const Term &t)
bool check_term_Whr(const Term &t)
bool check_term_ActAt(const Term &t)
bool check_rule_WhrDecl(const Term &t)
bool check_term_StateInfimum(const Term &t)
bool check_term_CommExpr(const Term &t)
bool check_rule_ActSpec(const Term &t)
bool check_term_UntypedSortUnknown(const Term &t)
bool check_term_ActFalse(const Term &t)
bool check_term_ActId(const Term &t)
bool check_term_RegTrans(const Term &t)
bool check_rule_Distribution(const Term &t)
bool check_term_LinearProcessSummand(const Term &t)
bool check_rule_Number(const Term &t)
const atermpp::function_symbol & function_symbol_UntypedSortsPossible()
const atermpp::function_symbol & function_symbol_DataEqn()
const atermpp::function_symbol & function_symbol_DataVarId()
bool check_term_StateFalse(const Term &t)
bool check_term_argument(const Term &t, CheckFunction f)
const atermpp::function_symbol & function_symbol_StructCons()
bool check_term_UntypedSortVariable(const Term &t)
bool check_rule_ActFrm(const Term &t)
bool check_term_MultAct(const Term &t)
bool check_term_Tau(const Term &t)
bool check_rule_ActId(const Term &t)
bool check_term_UntypedProcessAssignment(const Term &t)
bool check_term_StateDelayTimed(const Term &t)
void syntax_error_fn(struct D_Parser *ap)
Custom syntax error function that prints both the line number and the column.
bool check_term_Delta(const Term &t)
bool check_rule_PBEqn(const Term &t)
bool check_rule_Action(const Term &t)
const atermpp::function_symbol & function_symbol_SortRef()
bool check_term_PRESTrue(const Term &t)
bool check_rule_ActionRenameSpec(const Term &t)
bool check_rule_FixPoint(const Term &t)
bool check_list_argument(const Term &t, CheckFunction f, unsigned int minimum_size)
bool check_rule_DataEqn(const Term &t)
bool check_rule_LinProcSpec(const Term &t)
bool check_term_PRES(const Term &t)
bool check_rule_SortDecl(const Term &t)
bool check_rule_RenameExpr(const Term &t)
bool check_term_ActImp(const Term &t)
bool check_term_Allow(const Term &t)
bool check_term_Choice(const Term &t)
bool check_term_LinProcSpec(const Term &t)
bool check_rule_SortId(const Term &t)
bool check_term_PBESNot(const Term &t)
bool check_term_Sync(const Term &t)
const atermpp::function_symbol & function_symbol_StructProj()
bool check_rule_String(const Term &t)
bool check_term_ActMultAct(const Term &t)
bool check_term_PRESCondEq(const Term &t)
bool check_term_RegTransOrNil(const Term &t)
bool check_term_GlobVarSpec(const Term &t)
bool check_term_StateSupremum(const Term &t)
bool check_term_Mu(const Term &t)
bool check_rule_BindingOperator(const Term &t)
bool check_rule_CommExpr(const Term &t)
bool check_term_UntypedIdentifierAssignment(const Term &t)
bool check_term_RegNil(const Term &t)
bool check_term_DataEqn(const Term &t)
bool check_term_UntypedIdentifier(const Term &t)
bool check_term_StateMust(const Term &t)
bool check_rule_StructProj(const Term &t)
bool check_rule_ConsSpec(const Term &t)
bool check_term_ProcEqnSpec(const Term &t)
bool check_term_LMerge(const Term &t)
bool check_term_ConsSpec(const Term &t)
bool check_rule_SortConsType(const Term &t)
bool check_term_SortSet(const Term &t)
bool check_rule_SortSpec(const Term &t)
const atermpp::function_symbol & function_symbol_UntypedIdentifierAssignment()
const atermpp::function_symbol & function_symbol_Binder()
bool check_rule_PRES(const Term &t)
bool check_term_Binder(const Term &t)
bool check_term_SortArrow(const Term &t)
bool check_rule_DataExpr(const Term &t)
bool check_term_StateSum(const Term &t)
bool check_term_DataVarId(const Term &t)
bool check_term_UntypedDataParameter(const Term &t)
bool check_term_PRESConstantMultiply(const Term &t)
bool check_term_PBESForall(const Term &t)
bool check_rule_DataEqnSpec(const Term &t)
bool check_term_ActTrue(const Term &t)
bool check_rule_MultActOrDelta(const Term &t)
bool check_rule_LinearProcess(const Term &t)
const atermpp::function_symbol & function_symbol_UntypedSortVariable()
D_ParseNode * ambiguity_fn(struct D_Parser *, int n, struct D_ParseNode **v)
Function for resolving parser ambiguities.
bool check_term_ProcessInit(const Term &t)
bool check_term_BagComp(const Term &t)
bool check_rule_ProcVarId(const Term &t)
bool check_term_SortFBag(const Term &t)
bool check_rule_PRExpr(const Term &t)
bool check_term_StateYaled(const Term &t)
const atermpp::function_symbol & function_symbol_SortArrow()
bool check_term_MultActName(const Term &t)
bool check_term_Nu(const Term &t)
bool check_term_PBESExists(const Term &t)
bool check_term_BInit(const Term &t)
bool check_term_ProcessAssignment(const Term &t)
bool check_term_Lambda(const Term &t)
bool check_term_StateMay(const Term &t)
bool check_term_PRESAnd(const Term &t)
bool check_term_StateVar(const Term &t)
bool check_term_SortRef(const Term &t)
bool check_term_PRESEqInf(const Term &t)
bool check_rule_StateFrm(const Term &t)
bool check_term_ProcSpec(const Term &t)
bool check_term_SortBag(const Term &t)
const atermpp::function_symbol & function_symbol_UntypedDataParameter()
bool check_term_ProcEqn(const Term &t)
bool check_rule_MultActName(const Term &t)
bool check_term_StatePlus(const Term &t)
bool check_term_TimedMultAct(const Term &t)
bool check_term_PRESInfimum(const Term &t)
bool check_term_Rename(const Term &t)
bool check_rule_MapSpec(const Term &t)
bool check_rule_ProcEqnSpec(const Term &t)
bool check_rule_ProcEqn(const Term &t)
bool check_rule_PREqn(const Term &t)
bool check_term_StateYaledTimed(const Term &t)
bool check_term_StateImp(const Term &t)
bool check_term_StateConstantMultiply(const Term &t)
bool check_rule_DataVarId(const Term &t)
bool check_rule_UntypedIdentifierAssignment(const Term &t)
bool check_term_SortCons(const Term &t)
bool check_term_PRESSupremum(const Term &t)
bool check_term_PropVarInst(const Term &t)
bool check_term_UntypedRegFrm(const Term &t)
bool check_rule_PBES(const Term &t)
bool check_term_IfThen(const Term &t)
bool check_term_ActForall(const Term &t)
bool check_term_StateTrue(const Term &t)
bool check_term_SortSpec(const Term &t)
bool check_term_StateOr(const Term &t)
bool check_term_Forall(const Term &t)
bool check_term_UntypedSetBagComp(const Term &t)
bool check_term_LinearProcess(const Term &t)
bool check_term_PBInit(const Term &t)
bool check_rule_ProcExpr(const Term &t)
bool check_term_Comm(const Term &t)
bool check_term_StateAnd(const Term &t)
bool check_term_PBESOr(const Term &t)
const atermpp::function_symbol & function_symbol_SortId()
bool check_term_StateMinus(const Term &t)
bool check_term_RenameExpr(const Term &t)
bool check_term_ActExists(const Term &t)
bool check_term_LinearProcessInit(const Term &t)
bool check_rule_SortExpr(const Term &t)
bool check_term_PREqn(const Term &t)
bool check_term_UntypedMultiAction(const Term &t)
bool check_term_PBES(const Term &t)
bool check_rule_GlobVarSpec(const Term &t)
bool check_rule_ActionRenameRuleRHS(const Term &t)
bool check_term_ActAnd(const Term &t)
bool check_rule_DataSpec(const Term &t)
bool check_term_AtTime(const Term &t)
bool check_term_ActSpec(const Term &t)
bool check_term_StateMu(const Term &t)
bool check_rule_LinearProcessSummand(const Term &t)
bool check_rule_StringOrEmpty(const Term &t)
bool check_term_StateNu(const Term &t)
bool check_term_PBEqn(const Term &t)
const atermpp::function_symbol & function_symbol_Whr()
bool check_term_PRESSum(const Term &t)
bool check_term_ActionRenameSpec(const Term &t)
bool check_term_StateDelay(const Term &t)
bool check_rule_PBEqnSpec(const Term &t)
bool check_term_SortStruct(const Term &t)
bool check_rule_RegFrm(const Term &t)
bool check_rule_ActionRenameRules(const Term &t)
bool check_term_StochasticOperator(const Term &t)
bool check_rule_ProcSpec(const Term &t)
bool check_term_PBESImp(const Term &t)
bool gsIsDataAppl(const atermpp::aterm &Term)
bool check_rule_PropVarDecl(const Term &t)
bool check_term_StateForall(const Term &t)
bool check_term_PRInit(const Term &t)
bool check_term_DataEqnSpec(const Term &t)
bool check_term_StructCons(const Term &t)
const atermpp::function_symbol & function_symbol_SortStruct()
bool check_rule_ParamIdOrAction(const Term &t)
bool check_term_ProcVarId(const Term &t)
bool check_term_PRESConstantMultiplyAlt(const Term &t)
bool check_term_DataSpec(const Term &t)
bool check_term_Process(const Term &t)
bool gsIsDataAppl_no_check(const atermpp::aterm &Term)
bool check_term_ActionRenameRule(const Term &t)
bool check_rule_ActionRenameRule(const Term &t)
bool check_rule_PBExpr(const Term &t)
bool check_term_StateNot(const Term &t)
bool check_term_PRESFalse(const Term &t)
bool check_rule_UntypedMultiAction(const Term &t)
bool check_term_OpId(const Term &t)
bool check_term_Distribution(const Term &t)
const atermpp::function_symbol & function_symbol_UntypedIdentifier()
bool check_term_ActNot(const Term &t)
bool check_term_PRESEqNInf(const Term &t)
bool check_term_UntypedSortsPossible(const Term &t)
bool check_rule_UntypedDataParameter(const Term &t)
bool check_term_Hide(const Term &t)
bool check_rule_PREqnSpec(const Term &t)
bool check_rule_TimedMultAct(const Term &t)
bool check_term_Merge(const Term &t)
bool check_rule_PropVarInst(const Term &t)
bool check_term_Exists(const Term &t)
void foreach_parse_node(const parse_node &x, Function f)
Calls the function f on each node in the parse tree with x as root.
bool check_term_SetComp(const Term &t)
bool check_term_ActOr(const Term &t)
bool check_term_StructProj(const Term &t)
bool check_term_PRESMinus(const Term &t)
bool check_rule_MultAct(const Term &t)
bool check_term_SortList(const Term &t)
bool check_term_PBEqnSpec(const Term &t)
bool check_rule_LinearProcessInit(const Term &t)
bool check_rule_PBInit(const Term &t)
bool check_term_IfThenElse(const Term &t)
bool check_term_PBESAnd(const Term &t)
bool check_rule_ProcInit(const Term &t)
bool check_term_PBESFalse(const Term &t)
bool check_rule_StructCons(const Term &t)
bool check_term_PRESPlus(const Term &t)
bool check_rule_OpId(const Term &t)
bool check_term_PropVarDecl(const Term &t)
bool check_term_SortFSet(const Term &t)
bool check_term_PRESCondSm(const Term &t)
bool check_term_Block(const Term &t)
const atermpp::function_symbol & function_symbol_SortCons()
const atermpp::function_symbol & function_symbol_OpId()
bool check_term_StateExists(const Term &t)
bool check_term_ActionRenameRules(const Term &t)
bool check_term_StateConstantMultiplyAlt(const Term &t)
bool check_term_DataAppl(const Term &t)
bool check_term_RegSeq(const Term &t)
bool check_term_PRESImp(const Term &t)
const atermpp::function_symbol & function_symbol_DataVarIdInit()
bool check_term_RegAlt(const Term &t)
bool check_rule_PRInit(const Term &t)
void warn_left_merge_merge(const parse_node &)
Prints a warning for each occurrence of 'x ||_ y || z' in the parse tree.
apply_builder< Builder > make_apply_builder()
update_apply_builder_arg1< Builder, Function, Arg1 > make_update_apply_builder_arg1(const Function &f)
void print_aterm(const T &)
void print_aterm(const atermpp::aterm &x)
atermpp::term_list< identifier_string > identifier_string_list
\brief list of identifier_strings
atermpp::aterm_string identifier_string
String type of the LPS library. Identifier strings are represented internally as ATerms.
void warn_and_or(const parse_node &)
Prints a warning for each occurrence of 'x && y || z' in the parse tree.
apply_builder_arg1< Builder, Arg1 > make_apply_builder_arg1(const Arg1 &arg1)
void msg(const std::string &)
identifier_string parse_identifier(const std::string &text)
Parse an identifier.
update_apply_builder< Builder, Function > make_update_apply_builder(const Function &f)
bool is_user_identifier(std::string const &s)
apply_builder_arg2< Builder, Arg1, Arg2 > make_apply_builder_arg2(const Arg1 &arg1, const Arg2 &arg2)
data_expression parse_data_expression(const std::string &text)
data_specification parse_data_specification_new(const std::string &text)
variable_list parse_variable_declaration_list(const std::string &text)
variable_list parse_variables(const std::string &text)
sort_of_expression< variable > sort_of_variable
Function object that returns the sort of a data variable.
sort_expression parse_sort_expression(const std::string &text)
A collection of utilities for lazy expression construction.
data_expression implies(data_expression const &p, data_expression const &q)
Returns an expression equivalent to p implies q.
data_expression join_and(ForwardTraversalIterator first, ForwardTraversalIterator last)
Returns and applied to the sequence of data expressions [first, last)
data_expression not_(data_expression const &p)
Returns an expression equivalent to not p.
data_expression equal_to(data_expression const &p, data_expression const &q)
Returns an expression equivalent to p == q.
data_expression not_equal_to(data_expression const &p, data_expression const &q)
Returns an expression equivalent to p == q.
data_expression and_(data_expression const &p, data_expression const &q)
Returns an expression equivalent to p or q.
data_expression or_(data_expression const &p, data_expression const &q)
Returns an expression equivalent to p and q.
data_expression join_or(ForwardTraversalIterator first, ForwardTraversalIterator last)
Returns or applied to the sequence of data expressions [first, last)
data_expression if_(const data_expression &cond, const data_expression &then, const data_expression &else_)
Returns an expression equivalent to if(cond,then,else_)
Namespace for system defined sort bag.
function_symbol fbag2fset(const sort_expression &s)
Constructor for function symbol @fbag2fset.
bool is_bag2set_application(const atermpp::aterm &e)
Recogniser for application of Bag2Set.
bool is_intersection_function_symbol(const atermpp::aterm &e)
Recogniser for function *.
void make_bool2nat_function(data_expression &result, const sort_expression &s, const data_expression &arg0)
Make an application of function symbol @Bool2Nat_.
application difference(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol -.
const core::identifier_string & fbag2fset_name()
Generate identifier @fbag2fset.
const data_expression & right(const data_expression &e)
Function for projecting out argument. right from an application.
bool is_min_function_function_symbol(const atermpp::aterm &e)
Recogniser for function @min_.
function_symbol bag_fbag(const sort_expression &s)
Constructor for function symbol @bagfbag.
bool is_min_function_application(const atermpp::aterm &e)
Recogniser for application of @min_.
function_symbol monus_function(const sort_expression &s)
Constructor for function symbol @monus_.
const core::identifier_string & fbag_intersect_name()
Generate identifier @fbag_inter.
void make_bag2set(data_expression &result, const sort_expression &s, const data_expression &arg0)
Make an application of function symbol Bag2Set.
bool is_fbag_difference_function_symbol(const atermpp::aterm &e)
Recogniser for function @fbag_diff.
bool is_fbag_join_function_symbol(const atermpp::aterm &e)
Recogniser for function @fbag_join.
void make_count(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol count.
function_symbol_vector bag_generate_functions_code(const sort_expression &s)
Give all system defined mappings for bag.
application zero_function(const sort_expression &s, const data_expression &arg0)
Application of function symbol @zero_.
const core::identifier_string & bool2nat_function_name()
Generate identifier @Bool2Nat_.
void make_one_function(data_expression &result, const sort_expression &s, const data_expression &arg0)
Make an application of function symbol @one_.
const data_expression & arg3(const data_expression &e)
Function for projecting out argument. arg3 from an application.
bool is_difference_application(const atermpp::aterm &e)
Recogniser for application of -.
function_symbol difference(const sort_expression &s, const sort_expression &s0, const sort_expression &s1)
const core::identifier_string & set2bag_name()
Generate identifier Set2Bag.
bool is_bag_fbag_application(const atermpp::aterm &e)
Recogniser for application of @bagfbag.
application fbag2fset(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol @fbag2fset.
function_symbol_vector bag_generate_constructors_and_functions_code(const sort_expression &s)
Give all system defined mappings and constructors for bag.
void make_add_function(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol @add_.
data_equation_vector bag_generate_equations_code(const sort_expression &s)
Give all system defined equations for bag.
bool is_fbag_difference_application(const atermpp::aterm &e)
Recogniser for application of @fbag_diff.
bool is_bag_fbag_function_symbol(const atermpp::aterm &e)
Recogniser for function @bagfbag.
const core::identifier_string & zero_function_name()
Generate identifier @zero_.
const core::identifier_string & add_function_name()
Generate identifier @add_.
application bag2set(const sort_expression &s, const data_expression &arg0)
Application of function symbol Bag2Set.
application in(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol in.
function_symbol_vector bag_mCRL2_usable_constructors(const sort_expression &s)
Give all defined constructors which can be used in mCRL2 specs for bag.
bool is_fbag2fset_function_symbol(const atermpp::aterm &e)
Recogniser for function @fbag2fset.
bool is_union_application(const atermpp::aterm &e)
Recogniser for application of +.
function_symbol bag2set(const sort_expression &s)
Constructor for function symbol Bag2Set.
bool is_monus_function_application(const atermpp::aterm &e)
Recogniser for application of @monus_.
const core::identifier_string & nat2bool_function_name()
Generate identifier @Nat2Bool_.
function_symbol intersection(const sort_expression &s, const sort_expression &s0, const sort_expression &s1)
bool is_zero_function_application(const atermpp::aterm &e)
Recogniser for application of @zero_.
const core::identifier_string & fbag_difference_name()
Generate identifier @fbag_diff.
void make_monus_function(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol @monus_.
implementation_map bag_cpp_implementable_mappings(const sort_expression &s)
Give all system defined mappings that are to be implemented in C++ code for bag.
bool is_count_function_symbol(const atermpp::aterm &e)
Recogniser for function count.
function_symbol count(const sort_expression &, const sort_expression &s0, const sort_expression &s1)
implementation_map bag_cpp_implementable_constructors(const sort_expression &s)
Give all system defined constructors which have an implementation in C++ and not in rewrite rules for...
function_symbol add_function(const sort_expression &s)
Constructor for function symbol @add_.
bool is_nat2bool_function_application(const atermpp::aterm &e)
Recogniser for application of @Nat2Bool_.
function_symbol fbag_intersect(const sort_expression &s)
Constructor for function symbol @fbag_inter.
void make_fbag_intersect(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2, const data_expression &arg3)
Make an application of function symbol @fbag_inter.
bool is_union_function_symbol(const atermpp::aterm &e)
Recogniser for function +.
void make_nat2bool_function(data_expression &result, const sort_expression &s, const data_expression &arg0)
Make an application of function symbol @Nat2Bool_.
application bag_fbag(const sort_expression &s, const data_expression &arg0)
Application of function symbol @bagfbag.
bool is_fbag_intersect_application(const atermpp::aterm &e)
Recogniser for application of @fbag_inter.
bool is_in_application(const atermpp::aterm &e)
Recogniser for application of in.
function_symbol fbag_difference(const sort_expression &s)
Constructor for function symbol @fbag_diff.
bool is_in_function_symbol(const atermpp::aterm &e)
Recogniser for function in.
application bool2nat_function(const sort_expression &s, const data_expression &arg0)
Application of function symbol @Bool2Nat_.
bool is_bag_comprehension_function_symbol(const atermpp::aterm &e)
Recogniser for function @bagcomp.
void make_min_function(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol @min_.
data_expression bag_enumeration(const sort_expression &s, data_expression_list const &range)
Application of function symbol bag_enumeration.
const core::identifier_string & min_function_name()
Generate identifier @min_.
bool is_set2bag_function_symbol(const atermpp::aterm &e)
Recogniser for function Set2Bag.
application union_(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol +.
const data_expression & left(const data_expression &e)
Function for projecting out argument. left from an application.
function_symbol_vector bag_mCRL2_usable_mappings(const sort_expression &s)
Give all system defined mappings that can be used in mCRL2 specs for bag.
bool is_nat2bool_function_function_symbol(const atermpp::aterm &e)
Recogniser for function @Nat2Bool_.
application one_function(const sort_expression &s, const data_expression &arg0)
Application of function symbol @one_.
const core::identifier_string & monus_function_name()
Generate identifier @monus_.
const data_expression & arg4(const data_expression &e)
Function for projecting out argument. arg4 from an application.
bool is_add_function_application(const atermpp::aterm &e)
Recogniser for application of @add_.
void make_fbag2fset(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol @fbag2fset.
void make_fbag_join(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2, const data_expression &arg3)
Make an application of function symbol @fbag_join.
function_symbol min_function(const sort_expression &s)
Constructor for function symbol @min_.
function_symbol set2bag(const sort_expression &s)
Constructor for function symbol Set2Bag.
const core::identifier_string & bag_fbag_name()
Generate identifier @bagfbag.
const core::identifier_string & bag2set_name()
Generate identifier Bag2Set.
const core::identifier_string & intersection_name()
Generate identifier *.
application nat2bool_function(const sort_expression &s, const data_expression &arg0)
Application of function symbol @Nat2Bool_.
void make_in(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol in.
application constructor(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol @bag.
application fbag_intersect(const sort_expression &s, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2, const data_expression &arg3)
Application of function symbol @fbag_inter.
function_symbol bag_comprehension(const sort_expression &s)
Constructor for function symbol @bagcomp.
bool is_bag2set_function_symbol(const atermpp::aterm &e)
Recogniser for function Bag2Set.
bool is_bool2nat_function_application(const atermpp::aterm &e)
Recogniser for application of @Bool2Nat_.
const core::identifier_string & fbag_join_name()
Generate identifier @fbag_join.
void make_intersection(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol *.
function_symbol fbag_join(const sort_expression &s)
Constructor for function symbol @fbag_join.
bool is_constructor_application(const atermpp::aterm &e)
Recogniser for application of @bag.
bool is_zero_function_function_symbol(const atermpp::aterm &e)
Recogniser for function @zero_.
function_symbol constructor(const sort_expression &s)
Constructor for function symbol @bag.
const data_expression & arg2(const data_expression &e)
Function for projecting out argument. arg2 from an application.
const core::identifier_string & constructor_name()
Generate identifier @bag.
bool is_bag_comprehension_application(const atermpp::aterm &e)
Recogniser for application of @bagcomp.
bool is_set2bag_application(const atermpp::aterm &e)
Recogniser for application of Set2Bag.
function_symbol in(const sort_expression &, const sort_expression &s0, const sort_expression &s1)
void make_zero_function(data_expression &result, const sort_expression &s, const data_expression &arg0)
Make an application of function symbol @zero_.
const data_expression & arg1(const data_expression &e)
Function for projecting out argument. arg1 from an application.
void make_bag_fbag(data_expression &result, const sort_expression &s, const data_expression &arg0)
Make an application of function symbol @bagfbag.
function_symbol bool2nat_function(const sort_expression &s)
Constructor for function symbol @Bool2Nat_.
void make_set2bag(data_expression &result, const sort_expression &s, const data_expression &arg0)
Make an application of function symbol Set2Bag.
const core::identifier_string & union_name()
Generate identifier +.
bool is_fbag_intersect_function_symbol(const atermpp::aterm &e)
Recogniser for function @fbag_inter.
function_symbol union_(const sort_expression &s, const sort_expression &s0, const sort_expression &s1)
bool is_intersection_application(const atermpp::aterm &e)
Recogniser for application of *.
void make_bag_comprehension(data_expression &result, const sort_expression &s, const data_expression &arg0)
Make an application of function symbol @bagcomp.
const data_expression & arg(const data_expression &e)
Function for projecting out argument. arg from an application.
void make_fbag_difference(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2, const data_expression &arg3)
Make an application of function symbol @fbag_diff.
const core::identifier_string & count_name()
Generate identifier count.
void make_union_(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol +.
function_symbol nat2bool_function(const sort_expression &s)
Constructor for function symbol @Nat2Bool_.
bool is_one_function_application(const atermpp::aterm &e)
Recogniser for application of @one_.
application fbag_difference(const sort_expression &s, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2, const data_expression &arg3)
Application of function symbol @fbag_diff.
application add_function(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol @add_.
const core::identifier_string & difference_name()
Generate identifier -.
application set2bag(const sort_expression &s, const data_expression &arg0)
Application of function symbol Set2Bag.
bool is_bool2nat_function_function_symbol(const atermpp::aterm &e)
Recogniser for function @Bool2Nat_.
bool is_bag(const sort_expression &e)
Recogniser for sort expression Bag(s)
application monus_function(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol @monus_.
container_sort bag(const sort_expression &s)
Constructor for sort expression Bag(S)
bool is_difference_function_symbol(const atermpp::aterm &e)
Recogniser for function -.
bool is_fbag2fset_application(const atermpp::aterm &e)
Recogniser for application of @fbag2fset.
std::map< function_symbol, std::pair< std::function< void(data_expression &, const data_expression &)>, std::string > > implementation_map
application intersection(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol *.
const core::identifier_string & in_name()
Generate identifier in.
bool is_constructor_function_symbol(const atermpp::aterm &e)
Recogniser for function @bag.
const core::identifier_string & bag_comprehension_name()
Generate identifier @bagcomp.
bool is_count_application(const atermpp::aterm &e)
Recogniser for application of count.
void make_difference(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol -.
application fbag_join(const sort_expression &s, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2, const data_expression &arg3)
Application of function symbol @fbag_join.
const core::identifier_string & one_function_name()
Generate identifier @one_.
bool is_add_function_function_symbol(const atermpp::aterm &e)
Recogniser for function @add_.
void make_constructor(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol @bag.
function_symbol zero_function(const sort_expression &s)
Constructor for function symbol @zero_.
bool is_one_function_function_symbol(const atermpp::aterm &e)
Recogniser for function @one_.
application bag_comprehension(const sort_expression &s, const data_expression &arg0)
Application of function symbol @bagcomp.
function_symbol one_function(const sort_expression &s)
Constructor for function symbol @one_.
application count(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol count.
application min_function(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol @min_.
function_symbol_vector bag_generate_constructors_code(const sort_expression &s)
Give all system defined constructors for bag.
bool is_fbag_join_application(const atermpp::aterm &e)
Recogniser for application of @fbag_join.
bool is_monus_function_function_symbol(const atermpp::aterm &e)
Recogniser for function @monus_.
Namespace for system defined sort bool_.
data_equation_vector bool_generate_equations_code()
Give all system defined equations for bool_.
bool is_false_function_symbol(const atermpp::aterm &e)
Recogniser for function false.
const data_expression & arg(const data_expression &e)
Function for projecting out argument. arg from an application.
function_symbol_vector bool_mCRL2_usable_mappings()
Give all system defined mappings that can be used in mCRL2 specs for bool_.
function_symbol_vector bool_mCRL2_usable_constructors()
Give all defined constructors which can be used in mCRL2 specs for bool_.
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 core::identifier_string & implies_name()
Generate identifier =>.
const basic_sort & bool_()
Constructor for sort expression Bool.
const core::identifier_string & or_name()
Generate identifier ||.
implementation_map bool_cpp_implementable_constructors()
Give all system defined constructors which have an implementation in C++ and not in rewrite rules for...
const function_symbol & implies()
Constructor for function symbol =>.
const data_expression & right(const data_expression &e)
Function for projecting out argument. right from an application.
bool is_not_function_symbol(const atermpp::aterm &e)
Recogniser for function !.
bool is_implies_application(const atermpp::aterm &e)
Recogniser for application of =>.
application not_(const data_expression &arg0)
Application of function symbol !.
bool is_boolean_constant(data_expression const &b)
Determines whether b is a Boolean constant.
const function_symbol & and_()
Constructor for function symbol &&.
application and_(const data_expression &arg0, const data_expression &arg1)
Application of function symbol &&.
std::map< function_symbol, std::pair< std::function< void(data_expression &, const data_expression &)>, std::string > > implementation_map
function_symbol_vector bool_generate_constructors_and_functions_code()
Give all system defined mappings and constructors for bool_.
const core::identifier_string & not_name()
Generate identifier !.
application implies(const data_expression &arg0, const data_expression &arg1)
Application of function symbol =>.
function_symbol_vector bool_generate_constructors_code()
Give all system defined constructors for bool_.
implementation_map bool_cpp_implementable_mappings()
Give all system defined mappings that are to be implemented in C++ code for bool_.
application or_(const data_expression &arg0, const data_expression &arg1)
Application of function symbol ||.
const function_symbol & false_()
Constructor for function symbol false.
const core::identifier_string & bool_name()
bool is_and_function_symbol(const atermpp::aterm &e)
Recogniser for function &&.
bool is_and_application(const atermpp::aterm &e)
Recogniser for application of &&.
data_expression bool_(bool b)
Constructs expression of type Bool from an integral type.
const function_symbol & or_()
Constructor for function symbol ||.
bool is_or_function_symbol(const atermpp::aterm &e)
Recogniser for function ||.
bool is_true_function_symbol(const atermpp::aterm &e)
Recogniser for function true.
const core::identifier_string & false_name()
Generate identifier false.
const core::identifier_string & true_name()
Generate identifier true.
bool is_not_application(const atermpp::aterm &e)
Recogniser for application of !.
function_symbol_vector bool_generate_functions_code()
Give all system defined mappings for bool_.
const function_symbol & not_()
Constructor for function symbol !.
void make_not_(data_expression &result, const data_expression &arg0)
Make an application of function symbol !.
void make_and_(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol &&.
const function_symbol & true_()
Constructor for function symbol true.
bool is_implies_function_symbol(const atermpp::aterm &e)
Recogniser for function =>.
void make_or_(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol ||.
void make_implies(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol =>.
const data_expression & left(const data_expression &e)
Function for projecting out argument. left from an application.
const core::identifier_string & and_name()
Generate identifier &&.
Namespace for system defined sort fbag.
bool is_empty_function_symbol(const atermpp::aterm &e)
Recogniser for function {:}.
void make_count(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol count.
const core::identifier_string & count_all_name()
Generate identifier #.
function_symbol_vector fbag_generate_constructors_and_functions_code(const sort_expression &s)
Give all system defined mappings and constructors for fbag.
const core::identifier_string & fset2fbag_name()
Generate identifier @fset2fbag.
application fset2fbag(const sort_expression &s, const data_expression &arg0)
Application of function symbol @fset2fbag.
container_sort fbag(const sort_expression &s)
Constructor for sort expression FBag(S)
application union_(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol +.
bool is_in_function_symbol(const atermpp::aterm &e)
Recogniser for function in.
bool is_difference_function_symbol(const atermpp::aterm &e)
Recogniser for function -.
application intersection(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol *.
const core::identifier_string & count_name()
Generate identifier count.
const core::identifier_string & cinsert_name()
Generate identifier @fbag_cinsert.
bool is_union_application(const atermpp::aterm &e)
Recogniser for application of +.
function_symbol intersection(const sort_expression &s)
Constructor for function symbol *.
const data_expression & arg3(const data_expression &e)
Function for projecting out argument. arg3 from an application.
function_symbol union_(const sort_expression &s)
Constructor for function symbol +.
const data_expression & arg(const data_expression &e)
Function for projecting out argument. arg from an application.
bool is_cinsert_function_symbol(const atermpp::aterm &e)
Recogniser for function @fbag_cinsert.
function_symbol cons_(const sort_expression &s)
Constructor for function symbol @fbag_cons.
bool is_insert_function_symbol(const atermpp::aterm &e)
Recogniser for function @fbag_insert.
bool is_intersection_application(const atermpp::aterm &e)
Recogniser for application of *.
function_symbol count_all(const sort_expression &s)
Constructor for function symbol #.
void make_intersection(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol *.
bool is_cons_function_symbol(const atermpp::aterm &e)
Recogniser for function @fbag_cons.
application in(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol in.
function_symbol insert(const sort_expression &s)
Constructor for function symbol @fbag_insert.
application insert(const sort_expression &s, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Application of function symbol @fbag_insert.
void make_fset2fbag(data_expression &result, const sort_expression &s, const data_expression &arg0)
Make an application of function symbol @fset2fbag.
void make_cons_(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Make an application of function symbol @fbag_cons.
const core::identifier_string & cons_name()
Generate identifier @fbag_cons.
application cinsert(const sort_expression &s, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Application of function symbol @fbag_cinsert.
bool is_fset2fbag_function_symbol(const atermpp::aterm &e)
Recogniser for function @fset2fbag.
bool is_in_application(const atermpp::aterm &e)
Recogniser for application of in.
const core::identifier_string & empty_name()
Generate identifier {:}.
const core::identifier_string & difference_name()
Generate identifier -.
bool is_difference_application(const atermpp::aterm &e)
Recogniser for application of -.
bool is_count_application(const atermpp::aterm &e)
Recogniser for application of count.
bool is_cons_application(const atermpp::aterm &e)
Recogniser for application of @fbag_cons.
void make_in(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol in.
const data_expression & left(const data_expression &e)
Function for projecting out argument. left from an application.
const data_expression & arg2(const data_expression &e)
Function for projecting out argument. arg2 from an application.
void make_count_all(data_expression &result, const sort_expression &s, const data_expression &arg0)
Make an application of function symbol #.
bool is_count_function_symbol(const atermpp::aterm &e)
Recogniser for function count.
application count_all(const sort_expression &s, const data_expression &arg0)
Application of function symbol #.
bool is_intersection_function_symbol(const atermpp::aterm &e)
Recogniser for function *.
application cons_(const sort_expression &s, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Application of function symbol @fbag_cons.
implementation_map fbag_cpp_implementable_constructors(const sort_expression &s)
Give all system defined constructors which have an implementation in C++ and not in rewrite rules for...
const core::identifier_string & intersection_name()
Generate identifier *.
const data_expression & right(const data_expression &e)
Function for projecting out argument. right from an application.
function_symbol in(const sort_expression &s)
Constructor for function symbol in.
function_symbol_vector fbag_generate_constructors_code(const sort_expression &s)
Give all system defined constructors for fbag.
bool is_count_all_application(const atermpp::aterm &e)
Recogniser for application of #.
function_symbol count(const sort_expression &s)
Constructor for function symbol count.
void make_union_(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol +.
implementation_map fbag_cpp_implementable_mappings(const sort_expression &s)
Give all system defined mappings that are to be implemented in C++ code for fbag.
bool is_fbag(const sort_expression &e)
Recogniser for sort expression FBag(s)
void make_cinsert(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Make an application of function symbol @fbag_cinsert.
application difference(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol -.
function_symbol empty(const sort_expression &s)
Constructor for function symbol {:}.
void make_difference(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol -.
function_symbol cinsert(const sort_expression &s)
Constructor for function symbol @fbag_cinsert.
bool is_cinsert_application(const atermpp::aterm &e)
Recogniser for application of @fbag_cinsert.
void make_insert(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Make an application of function symbol @fbag_insert.
bool is_fset2fbag_application(const atermpp::aterm &e)
Recogniser for application of @fset2fbag.
bool is_count_all_function_symbol(const atermpp::aterm &e)
Recogniser for function #.
function_symbol_vector fbag_mCRL2_usable_mappings(const sort_expression &s)
Give all system defined mappings that can be used in mCRL2 specs for fbag.
function_symbol fset2fbag(const sort_expression &s)
Constructor for function symbol @fset2fbag.
const core::identifier_string & union_name()
Generate identifier +.
application count(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol count.
function_symbol difference(const sort_expression &s)
Constructor for function symbol -.
function_symbol_vector fbag_generate_functions_code(const sort_expression &s)
Give all system defined mappings for fbag.
bool is_insert_application(const atermpp::aterm &e)
Recogniser for application of @fbag_insert.
const core::identifier_string & insert_name()
Generate identifier @fbag_insert.
std::map< function_symbol, std::pair< std::function< void(data_expression &, const data_expression &)>, std::string > > implementation_map
data_equation_vector fbag_generate_equations_code(const sort_expression &s)
Give all system defined equations for fbag.
bool is_union_function_symbol(const atermpp::aterm &e)
Recogniser for function +.
const data_expression & arg1(const data_expression &e)
Function for projecting out argument. arg1 from an application.
function_symbol_vector fbag_mCRL2_usable_constructors(const sort_expression &s)
Give all defined constructors which can be used in mCRL2 specs for fbag.
const core::identifier_string & in_name()
Generate identifier in.
Namespace for system defined sort fset.
function_symbol insert(const sort_expression &s)
Constructor for function symbol @fset_insert.
bool is_fset(const sort_expression &e)
Recogniser for sort expression FSet(s)
function_symbol_vector fset_mCRL2_usable_mappings(const sort_expression &s)
Give all system defined mappings that can be used in mCRL2 specs for fset.
void make_union_(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol +.
application count(const sort_expression &s, const data_expression &arg0)
Application of function symbol #.
bool is_empty_function_symbol(const atermpp::aterm &e)
Recogniser for function {}.
application insert(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol @fset_insert.
bool is_in_application(const atermpp::aterm &e)
Recogniser for application of in.
bool is_cinsert_function_symbol(const atermpp::aterm &e)
Recogniser for function @fset_cinsert.
bool is_count_function_symbol(const atermpp::aterm &e)
Recogniser for function #.
function_symbol_vector fset_generate_constructors_and_functions_code(const sort_expression &s)
Give all system defined mappings and constructors for fset.
function_symbol cinsert(const sort_expression &s)
Constructor for function symbol @fset_cinsert.
function_symbol_vector fset_mCRL2_usable_constructors(const sort_expression &s)
Give all defined constructors which can be used in mCRL2 specs for fset.
bool is_cons_function_symbol(const atermpp::aterm &e)
Recogniser for function @fset_cons.
function_symbol_vector fset_generate_constructors_code(const sort_expression &s)
Give all system defined constructors for fset.
const core::identifier_string & empty_name()
Generate identifier {}.
const core::identifier_string & intersection_name()
Generate identifier *.
application in(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol in.
implementation_map fset_cpp_implementable_constructors(const sort_expression &s)
Give all system defined constructors which have an implementation in C++ and not in rewrite rules for...
bool is_insert_function_symbol(const atermpp::aterm &e)
Recogniser for function @fset_insert.
function_symbol_vector fset_generate_functions_code(const sort_expression &s)
Give all system defined mappings for fset.
application cons_(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol @fset_cons.
bool is_difference_function_symbol(const atermpp::aterm &e)
Recogniser for function -.
function_symbol cons_(const sort_expression &s)
Constructor for function symbol @fset_cons.
void make_intersection(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol *.
implementation_map fset_cpp_implementable_mappings(const sort_expression &s)
Give all system defined mappings that are to be implemented in C++ code for fset.
function_symbol empty(const sort_expression &s)
Constructor for function symbol {}.
const core::identifier_string & difference_name()
Generate identifier -.
bool is_union_function_symbol(const atermpp::aterm &e)
Recogniser for function +.
void make_difference(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol -.
function_symbol intersection(const sort_expression &s)
Constructor for function symbol *.
void make_cinsert(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Make an application of function symbol @fset_cinsert.
const data_expression & right(const data_expression &e)
Function for projecting out argument. right from an application.
function_symbol difference(const sort_expression &s)
Constructor for function symbol -.
void make_insert(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol @fset_insert.
std::map< function_symbol, std::pair< std::function< void(data_expression &, const data_expression &)>, std::string > > implementation_map
bool is_intersection_function_symbol(const atermpp::aterm &e)
Recogniser for function *.
const core::identifier_string & cinsert_name()
Generate identifier @fset_cinsert.
bool is_in_function_symbol(const atermpp::aterm &e)
Recogniser for function in.
void make_count(data_expression &result, const sort_expression &s, const data_expression &arg0)
Make an application of function symbol #.
const data_expression & left(const data_expression &e)
Function for projecting out argument. left from an application.
function_symbol in(const sort_expression &s)
Constructor for function symbol in.
bool is_difference_application(const atermpp::aterm &e)
Recogniser for application of -.
const core::identifier_string & count_name()
Generate identifier #.
const data_expression & arg2(const data_expression &e)
Function for projecting out argument. arg2 from an application.
data_equation_vector fset_generate_equations_code(const sort_expression &s)
Give all system defined equations for fset.
const core::identifier_string & union_name()
Generate identifier +.
const data_expression & arg1(const data_expression &e)
Function for projecting out argument. arg1 from an application.
void make_in(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol in.
const data_expression & arg3(const data_expression &e)
Function for projecting out argument. arg3 from an application.
bool is_count_application(const atermpp::aterm &e)
Recogniser for application of #.
function_symbol count(const sort_expression &s)
Constructor for function symbol #.
bool is_cons_application(const atermpp::aterm &e)
Recogniser for application of @fset_cons.
application cinsert(const sort_expression &s, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Application of function symbol @fset_cinsert.
bool is_intersection_application(const atermpp::aterm &e)
Recogniser for application of *.
application difference(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol -.
const core::identifier_string & insert_name()
Generate identifier @fset_insert.
void make_cons_(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol @fset_cons.
container_sort fset(const sort_expression &s)
Constructor for sort expression FSet(S)
application union_(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol +.
const core::identifier_string & cons_name()
Generate identifier @fset_cons.
const data_expression & arg(const data_expression &e)
Function for projecting out argument. arg from an application.
application intersection(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol *.
function_symbol union_(const sort_expression &s)
Constructor for function symbol +.
const core::identifier_string & in_name()
Generate identifier in.
bool is_cinsert_application(const atermpp::aterm &e)
Recogniser for application of @fset_cinsert.
bool is_union_application(const atermpp::aterm &e)
Recogniser for application of +.
bool is_insert_application(const atermpp::aterm &e)
Recogniser for application of @fset_insert.
Namespace for system defined sort int_.
bool is_minimum_application(const atermpp::aterm &e)
Recogniser for application of min.
const data_expression & right(const data_expression &e)
Function for projecting out argument. right from an application.
void make_minimum(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol min.
const core::identifier_string & cint_name()
Generate identifier @cInt.
application cint(const data_expression &arg0)
Application of function symbol @cInt.
application abs(const data_expression &arg0)
Application of function symbol abs.
application nat2int(const data_expression &arg0)
Application of function symbol Nat2Int.
application succ(const data_expression &arg0)
Application of function symbol succ.
application cneg(const data_expression &arg0)
Application of function symbol @cNeg.
bool is_minus_function_symbol(const atermpp::aterm &e)
Recogniser for function -.
bool is_maximum_application(const atermpp::aterm &e)
Recogniser for application of max.
bool is_succ_function_symbol(const atermpp::aterm &e)
Recogniser for function succ.
const core::identifier_string & abs_name()
Generate identifier abs.
bool is_minimum_function_symbol(const atermpp::aterm &e)
Recogniser for function min.
bool is_int2pos_application(const atermpp::aterm &e)
Recogniser for application of Int2Pos.
const core::identifier_string & pred_name()
Generate identifier pred.
bool is_exp_function_symbol(const atermpp::aterm &e)
Recogniser for function exp.
bool is_int2pos_function_symbol(const atermpp::aterm &e)
Recogniser for function Int2Pos.
const function_symbol & pos2int()
Constructor for function symbol Pos2Int.
const core::identifier_string & nat2int_name()
Generate identifier Nat2Int.
const data_expression & arg(const data_expression &e)
Function for projecting out argument. arg from an application.
void make_minus(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol -.
application negate(const data_expression &arg0)
Application of function symbol -.
bool is_cneg_function_symbol(const atermpp::aterm &e)
Recogniser for function @cNeg.
std::enable_if< std::is_integral< T >::value &&std::is_unsigned< T >::value, data_expression >::type int_(T t)
Constructs expression of type pos from an integral type.
const core::identifier_string & int2pos_name()
Generate identifier Int2Pos.
function_symbol maximum(const sort_expression &s0, const sort_expression &s1)
void make_cneg(data_expression &result, const data_expression &arg0)
Make an application of function symbol @cNeg.
application int2nat(const data_expression &arg0)
Application of function symbol Int2Nat.
function_symbol pred(const sort_expression &s0)
application plus(const data_expression &arg0, const data_expression &arg1)
Application of function symbol +.
const core::identifier_string & cneg_name()
Generate identifier @cNeg.
const core::identifier_string & exp_name()
Generate identifier exp.
void make_exp(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol exp.
const core::identifier_string & minimum_name()
Generate identifier min.
bool is_mod_application(const atermpp::aterm &e)
Recogniser for application of mod.
const core::identifier_string & int_name()
bool is_mod_function_symbol(const atermpp::aterm &e)
Recogniser for function mod.
application maximum(const data_expression &arg0, const data_expression &arg1)
Application of function symbol max.
application times(const data_expression &arg0, const data_expression &arg1)
Application of function symbol *.
function_symbol_vector int_mCRL2_usable_mappings()
Give all system defined mappings that can be used in mCRL2 specs for int_.
const core::identifier_string & pos2int_name()
Generate identifier Pos2Int.
const function_symbol & int2nat()
Constructor for function symbol Int2Nat.
bool is_int(const sort_expression &e)
Recogniser for sort expression Int.
function_symbol minus(const sort_expression &s0, const sort_expression &s1)
bool is_pred_application(const atermpp::aterm &e)
Recogniser for application of pred.
const function_symbol & nat2int()
Constructor for function symbol Nat2Int.
application div(const data_expression &arg0, const data_expression &arg1)
Application of function symbol div.
bool is_times_application(const atermpp::aterm &e)
Recogniser for application of *.
const core::identifier_string & maximum_name()
Generate identifier max.
bool is_int2nat_function_symbol(const atermpp::aterm &e)
Recogniser for function Int2Nat.
bool is_cneg_application(const atermpp::aterm &e)
Recogniser for application of @cNeg.
const core::identifier_string & succ_name()
Generate identifier succ.
const function_symbol & cneg()
Constructor for function symbol @cNeg.
void make_pos2int(data_expression &result, const data_expression &arg0)
Make an application of function symbol Pos2Int.
const function_symbol & abs()
Constructor for function symbol abs.
function_symbol exp(const sort_expression &s0, const sort_expression &s1)
bool is_cint_application(const atermpp::aterm &e)
Recogniser for application of @cInt.
bool is_times_function_symbol(const atermpp::aterm &e)
Recogniser for function *.
bool is_plus_application(const atermpp::aterm &e)
Recogniser for application of +.
const core::identifier_string & mod_name()
Generate identifier mod.
void make_plus(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol +.
data_equation_vector int_generate_equations_code()
Give all system defined equations for int_.
application minus(const data_expression &arg0, const data_expression &arg1)
Application of function symbol -.
function_symbol plus(const sort_expression &s0, const sort_expression &s1)
application minimum(const data_expression &arg0, const data_expression &arg1)
Application of function symbol min.
const function_symbol & int2pos()
Constructor for function symbol Int2Pos.
bool is_integer_constant(const data_expression &n)
Determines whether n is an integer constant.
const core::identifier_string & plus_name()
Generate identifier +.
function_symbol_vector int_generate_constructors_and_functions_code()
Give all system defined mappings and constructors for int_.
void make_div(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol div.
bool is_negate_application(const atermpp::aterm &e)
Recogniser for application of -.
function_symbol negate(const sort_expression &s0)
bool is_div_application(const atermpp::aterm &e)
Recogniser for application of div.
void make_mod(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol mod.
bool is_pos2int_function_symbol(const atermpp::aterm &e)
Recogniser for function Pos2Int.
function_symbol_vector int_generate_constructors_code()
Give all system defined constructors for int_.
bool is_abs_application(const atermpp::aterm &e)
Recogniser for application of abs.
void make_maximum(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol max.
function_symbol_vector int_mCRL2_usable_constructors()
Give all defined constructors which can be used in mCRL2 specs for int_.
application int2pos(const data_expression &arg0)
Application of function symbol Int2Pos.
function_symbol succ(const sort_expression &s0)
void make_negate(data_expression &result, const data_expression &arg0)
Make an application of function symbol -.
const core::identifier_string & negate_name()
Generate identifier -.
bool is_cint_function_symbol(const atermpp::aterm &e)
Recogniser for function @cInt.
std::string integer_constant_as_string(const data_expression &n)
Return the string representation of an integer number.
void make_abs(data_expression &result, const data_expression &arg0)
Make an application of function symbol abs.
std::enable_if< std::is_integral< T >::value &&std::is_signed< T >::value, data_expression >::type int_(T t)
Constructs expression of type pos from an integral type.
function_symbol_vector int_generate_functions_code()
Give all system defined mappings for int_.
implementation_map int_cpp_implementable_constructors()
Give all system defined constructors which have an implementation in C++ and not in rewrite rules for...
bool is_exp_application(const atermpp::aterm &e)
Recogniser for application of exp.
application mod(const data_expression &arg0, const data_expression &arg1)
Application of function symbol mod.
void make_nat2int(data_expression &result, const data_expression &arg0)
Make an application of function symbol Nat2Int.
const function_symbol & cint()
Constructor for function symbol @cInt.
implementation_map int_cpp_implementable_mappings()
Give all system defined mappings that are to be implemented in C++ code for int_.
application pos2int(const data_expression &arg0)
Application of function symbol Pos2Int.
bool is_nat2int_function_symbol(const atermpp::aterm &e)
Recogniser for function Nat2Int.
bool is_int2nat_application(const atermpp::aterm &e)
Recogniser for application of Int2Nat.
const core::identifier_string & minus_name()
Generate identifier -.
function_symbol mod(const sort_expression &s0, const sort_expression &s1)
const core::identifier_string & int2nat_name()
Generate identifier Int2Nat.
const core::identifier_string & div_name()
Generate identifier div.
bool is_maximum_function_symbol(const atermpp::aterm &e)
Recogniser for function max.
application exp(const data_expression &arg0, const data_expression &arg1)
Application of function symbol exp.
bool is_div_function_symbol(const atermpp::aterm &e)
Recogniser for function div.
application pred(const data_expression &arg0)
Application of function symbol pred.
bool is_negate_function_symbol(const atermpp::aterm &e)
Recogniser for function -.
void make_int2pos(data_expression &result, const data_expression &arg0)
Make an application of function symbol Int2Pos.
function_symbol times(const sort_expression &s0, const sort_expression &s1)
bool is_plus_function_symbol(const atermpp::aterm &e)
Recogniser for function +.
bool is_nat2int_application(const atermpp::aterm &e)
Recogniser for application of Nat2Int.
bool is_minus_application(const atermpp::aterm &e)
Recogniser for application of -.
void make_times(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol *.
function_symbol minimum(const sort_expression &s0, const sort_expression &s1)
bool is_pred_function_symbol(const atermpp::aterm &e)
Recogniser for function pred.
function_symbol div(const sort_expression &s0, const sort_expression &s1)
void make_succ(data_expression &result, const data_expression &arg0)
Make an application of function symbol succ.
bool is_pos2int_application(const atermpp::aterm &e)
Recogniser for application of Pos2Int.
void make_pred(data_expression &result, const data_expression &arg0)
Make an application of function symbol pred.
std::map< function_symbol, std::pair< std::function< void(data_expression &, const data_expression &)>, std::string > > implementation_map
void make_cint(data_expression &result, const data_expression &arg0)
Make an application of function symbol @cInt.
void make_int2nat(data_expression &result, const data_expression &arg0)
Make an application of function symbol Int2Nat.
bool is_abs_function_symbol(const atermpp::aterm &e)
Recogniser for function abs.
const core::identifier_string & times_name()
Generate identifier *.
const data_expression & left(const data_expression &e)
Function for projecting out argument. left from an application.
NUMERIC_VALUE integer_constant_to_value(const data_expression &n)
Return the NUMERIC_VALUE representation of an integer number.
bool is_succ_application(const atermpp::aterm &e)
Recogniser for application of succ.
const basic_sort & int_()
Constructor for sort expression Int.
Namespace for system defined sort list.
container_sort list(const sort_expression &s)
Constructor for sort expression List(S)
data_expression list_enumeration(const sort_expression &s, data_expression_list const &range)
Application of function symbol list_enumeration.
Namespace for system defined sort nat.
const core::identifier_string & succ_name()
Generate identifier succ.
const data_expression & right(const data_expression &e)
Function for projecting out argument. right from an application.
application cpair(const data_expression &arg0, const data_expression &arg1)
Application of function symbol @cPair.
bool is_cpair_application(const atermpp::aterm &e)
Recogniser for application of @cPair.
void make_plus(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol +.
const function_symbol & generalised_divmod()
Constructor for function symbol @gdivmod.
function_symbol maximum(const sort_expression &s0, const sort_expression &s1)
const core::identifier_string & sqrt_nat_aux_func_name()
Generate identifier @sqrt_nat.
bool is_pos2nat_function_symbol(const atermpp::aterm &e)
Recogniser for function Pos2Nat.
function_symbol succ(const sort_expression &s0)
const function_symbol & monus()
Constructor for function symbol @monus.
void make_sqrt(data_expression &result, const data_expression &arg0)
Make an application of function symbol sqrt.
void make_generalised_divmod(data_expression &result, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Make an application of function symbol @gdivmod.
bool is_gte_subtract_with_borrow_function_symbol(const atermpp::aterm &e)
Recogniser for function @gtesubtb.
const function_symbol & c0()
Constructor for function symbol @c0.
bool is_swap_zero_add_application(const atermpp::aterm &e)
Recogniser for application of @swap_zero_add.
void make_dub(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol @dub.
void make_div(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol div.
application sqrt_nat_aux_func(const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Application of function symbol @sqrt_nat.
const core::identifier_string & maximum_name()
Generate identifier max.
void make_mod(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol mod.
application generalised_divmod(const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Application of function symbol @gdivmod.
bool is_swap_zero_function_symbol(const atermpp::aterm &e)
Recogniser for function @swap_zero.
bool is_cnat_application(const atermpp::aterm &e)
Recogniser for application of @cNat.
const core::identifier_string & mod_name()
Generate identifier mod.
const function_symbol & gte_subtract_with_borrow()
Constructor for function symbol @gtesubtb.
std::enable_if< std::is_integral< T >::value, data_expression >::type nat(T t)
Constructs expression of type pos from an integral type.
bool is_generalised_divmod_application(const atermpp::aterm &e)
Recogniser for application of @gdivmod.
bool is_div_application(const atermpp::aterm &e)
Recogniser for application of div.
void make_doubly_generalised_divmod(data_expression &result, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Make an application of function symbol @ggdivmod.
const core::identifier_string & swap_zero_min_name()
Generate identifier @swap_zero_min.
const function_symbol & divmod()
Constructor for function symbol @divmod.
bool is_pos2nat_application(const atermpp::aterm &e)
Recogniser for application of Pos2Nat.
const function_symbol & cnat()
Constructor for function symbol @cNat.
application dubsucc(const data_expression &arg0)
Application of function symbol @dubsucc.
void make_pred(data_expression &result, const data_expression &arg0)
Make an application of function symbol pred.
bool is_nat2pos_application(const atermpp::aterm &e)
Recogniser for application of Nat2Pos.
bool is_mod_function_symbol(const atermpp::aterm &e)
Recogniser for function mod.
function_symbol exp(const sort_expression &s0, const sort_expression &s1)
application minimum(const data_expression &arg0, const data_expression &arg1)
Application of function symbol min.
const core::identifier_string & times_name()
Generate identifier *.
const function_symbol & dubsucc()
Constructor for function symbol @dubsucc.
const function_symbol & swap_zero_add()
Constructor for function symbol @swap_zero_add.
function_symbol_vector nat_mCRL2_usable_mappings()
Give all system defined mappings that can be used in mCRL2 specs for nat.
data_equation_vector nat_generate_equations_code()
Give all system defined equations for nat.
const function_symbol & cpair()
Constructor for function symbol @cPair.
const basic_sort & nat()
Constructor for sort expression Nat.
const core::identifier_string & nat_name()
application exp(const data_expression &arg0, const data_expression &arg1)
Application of function symbol exp.
const core::identifier_string & exp_name()
Generate identifier exp.
const function_symbol & swap_zero()
Constructor for function symbol @swap_zero.
application swap_zero(const data_expression &arg0, const data_expression &arg1)
Application of function symbol @swap_zero.
bool is_first_function_symbol(const atermpp::aterm &e)
Recogniser for function @first.
bool is_maximum_application(const atermpp::aterm &e)
Recogniser for application of max.
void make_cpair(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol @cPair.
implementation_map nat_cpp_implementable_constructors()
Give all system defined constructors which have an implementation in C++ and not in rewrite rules for...
bool is_nat(const sort_expression &e)
Recogniser for sort expression Nat.
bool is_doubly_generalised_divmod_function_symbol(const atermpp::aterm &e)
Recogniser for function @ggdivmod.
bool is_plus_function_symbol(const atermpp::aterm &e)
Recogniser for function +.
function_symbol_vector nat_generate_constructors_and_functions_code()
Give all system defined mappings and constructors for nat.
std::string natural_constant_as_string(const data_expression &n_in)
Return the string representation of a natural number.
application sqrt(const data_expression &arg0)
Application of function symbol sqrt.
application pos2nat(const data_expression &arg0)
Application of function symbol Pos2Nat.
void make_nat2pos(data_expression &result, const data_expression &arg0)
Make an application of function symbol Nat2Pos.
application first(const data_expression &arg0)
Application of function symbol @first.
const core::identifier_string & plus_name()
Generate identifier +.
const core::identifier_string & natpair_name()
const data_expression & left(const data_expression &e)
Function for projecting out argument. left from an application.
bool is_succ_function_symbol(const atermpp::aterm &e)
Recogniser for function succ.
void make_maximum(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol max.
const core::identifier_string & div_name()
Generate identifier div.
const function_symbol & mod()
Constructor for function symbol mod.
void make_monus(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol @monus.
const function_symbol & sqrt()
Constructor for function symbol sqrt.
void make_dubsucc(data_expression &result, const data_expression &arg0)
Make an application of function symbol @dubsucc.
application even(const data_expression &arg0)
Application of function symbol @even.
const function_symbol & doubly_generalised_divmod()
Constructor for function symbol @ggdivmod.
const function_symbol & pred()
Constructor for function symbol pred.
void make_even(data_expression &result, const data_expression &arg0)
Make an application of function symbol @even.
void make_gte_subtract_with_borrow(data_expression &result, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Make an application of function symbol @gtesubtb.
bool is_sqrt_nat_aux_func_function_symbol(const atermpp::aterm &e)
Recogniser for function @sqrt_nat.
const function_symbol & even()
Constructor for function symbol @even.
const core::identifier_string & first_name()
Generate identifier @first.
void make_swap_zero_monus(data_expression &result, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2, const data_expression &arg3)
Make an application of function symbol @swap_zero_monus.
bool is_succ_application(const atermpp::aterm &e)
Recogniser for application of succ.
bool is_dub_function_symbol(const atermpp::aterm &e)
Recogniser for function @dub.
application cnat(const data_expression &arg0)
Application of function symbol @cNat.
bool is_swap_zero_application(const atermpp::aterm &e)
Recogniser for application of @swap_zero.
const core::identifier_string & even_name()
Generate identifier @even.
const core::identifier_string & swap_zero_name()
Generate identifier @swap_zero.
void make_pos2nat(data_expression &result, const data_expression &arg0)
Make an application of function symbol Pos2Nat.
bool is_minimum_application(const atermpp::aterm &e)
Recogniser for application of min.
bool is_exp_function_symbol(const atermpp::aterm &e)
Recogniser for function exp.
bool is_monus_function_symbol(const atermpp::aterm &e)
Recogniser for function @monus.
bool is_mod_application(const atermpp::aterm &e)
Recogniser for application of mod.
bool is_even_function_symbol(const atermpp::aterm &e)
Recogniser for function @even.
const core::identifier_string & pred_name()
Generate identifier pred.
bool is_exp_application(const atermpp::aterm &e)
Recogniser for application of exp.
const function_symbol & swap_zero_min()
Constructor for function symbol @swap_zero_min.
function_symbol minimum(const sort_expression &s0, const sort_expression &s1)
const function_symbol & sqrt_nat_aux_func()
Constructor for function symbol @sqrt_nat.
bool is_last_application(const atermpp::aterm &e)
Recogniser for application of @last.
void make_exp(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol exp.
const function_symbol & div()
Constructor for function symbol div.
application last(const data_expression &arg0)
Application of function symbol @last.
const core::identifier_string & doubly_generalised_divmod_name()
Generate identifier @ggdivmod.
void make_succ(data_expression &result, const data_expression &arg0)
Make an application of function symbol succ.
bool is_maximum_function_symbol(const atermpp::aterm &e)
Recogniser for function max.
bool is_gte_subtract_with_borrow_application(const atermpp::aterm &e)
Recogniser for application of @gtesubtb.
bool is_swap_zero_min_application(const atermpp::aterm &e)
Recogniser for application of @swap_zero_min.
function_symbol plus(const sort_expression &s0, const sort_expression &s1)
const core::identifier_string & dubsucc_name()
Generate identifier @dubsucc.
bool is_first_application(const atermpp::aterm &e)
Recogniser for application of @first.
std::map< function_symbol, std::pair< std::function< void(data_expression &, const data_expression &)>, std::string > > implementation_map
bool is_sqrt_application(const atermpp::aterm &e)
Recogniser for application of sqrt.
const function_symbol & first()
Constructor for function symbol @first.
void make_first(data_expression &result, const data_expression &arg0)
Make an application of function symbol @first.
bool is_pred_function_symbol(const atermpp::aterm &e)
Recogniser for function pred.
bool is_generalised_divmod_function_symbol(const atermpp::aterm &e)
Recogniser for function @gdivmod.
application swap_zero_add(const data_expression &arg0, const data_expression &arg1, const data_expression &arg2, const data_expression &arg3)
Application of function symbol @swap_zero_add.
void make_swap_zero_add(data_expression &result, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2, const data_expression &arg3)
Make an application of function symbol @swap_zero_add.
const core::identifier_string & swap_zero_monus_name()
Generate identifier @swap_zero_monus.
application gte_subtract_with_borrow(const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Application of function symbol @gtesubtb.
function_symbol_vector nat_generate_functions_code()
Give all system defined mappings for nat.
bool is_cpair_function_symbol(const atermpp::aterm &e)
Recogniser for function @cPair.
application div(const data_expression &arg0, const data_expression &arg1)
Application of function symbol div.
bool is_divmod_function_symbol(const atermpp::aterm &e)
Recogniser for function @divmod.
const function_symbol & swap_zero_monus()
Constructor for function symbol @swap_zero_monus.
void make_times(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol *.
application swap_zero_min(const data_expression &arg0, const data_expression &arg1, const data_expression &arg2, const data_expression &arg3)
Application of function symbol @swap_zero_min.
bool is_c0_function_symbol(const atermpp::aterm &e)
Recogniser for function @c0.
const core::identifier_string & generalised_divmod_name()
Generate identifier @gdivmod.
application doubly_generalised_divmod(const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Application of function symbol @ggdivmod.
const function_symbol & nat2pos()
Constructor for function symbol Nat2Pos.
const core::identifier_string & monus_name()
Generate identifier @monus.
application monus(const data_expression &arg0, const data_expression &arg1)
Application of function symbol @monus.
const core::identifier_string & cpair_name()
Generate identifier @cPair.
const core::identifier_string & nat2pos_name()
Generate identifier Nat2Pos.
const data_expression & arg3(const data_expression &e)
Function for projecting out argument. arg3 from an application.
void make_divmod(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol @divmod.
application dub(const data_expression &arg0, const data_expression &arg1)
Application of function symbol @dub.
implementation_map nat_cpp_implementable_mappings()
Give all system defined mappings that are to be implemented in C++ code for nat.
const data_expression & arg2(const data_expression &e)
Function for projecting out argument. arg2 from an application.
const core::identifier_string & gte_subtract_with_borrow_name()
Generate identifier @gtesubtb.
const basic_sort & natpair()
Constructor for sort expression @NatPair.
application pred(const data_expression &arg0)
Application of function symbol pred.
application succ(const data_expression &arg0)
Application of function symbol succ.
const data_expression & arg1(const data_expression &e)
Function for projecting out argument. arg1 from an application.
bool is_swap_zero_monus_application(const atermpp::aterm &e)
Recogniser for application of @swap_zero_monus.
void make_swap_zero_min(data_expression &result, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2, const data_expression &arg3)
Make an application of function symbol @swap_zero_min.
const core::identifier_string & dub_name()
Generate identifier @dub.
const core::identifier_string & cnat_name()
Generate identifier @cNat.
const core::identifier_string & c0_name()
Generate identifier @c0.
application divmod(const data_expression &arg0, const data_expression &arg1)
Application of function symbol @divmod.
bool is_swap_zero_add_function_symbol(const atermpp::aterm &e)
Recogniser for function @swap_zero_add.
bool is_natpair(const sort_expression &e)
Recogniser for sort expression @NatPair.
bool is_swap_zero_monus_function_symbol(const atermpp::aterm &e)
Recogniser for function @swap_zero_monus.
const core::identifier_string & pos2nat_name()
Generate identifier Pos2Nat.
const core::identifier_string & last_name()
Generate identifier @last.
const core::identifier_string & minimum_name()
Generate identifier min.
void make_sqrt_nat_aux_func(data_expression &result, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Make an application of function symbol @sqrt_nat.
bool is_sqrt_nat_aux_func_application(const atermpp::aterm &e)
Recogniser for application of @sqrt_nat.
const data_expression & arg(const data_expression &e)
Function for projecting out argument. arg from an application.
bool is_sqrt_function_symbol(const atermpp::aterm &e)
Recogniser for function sqrt.
application mod(const data_expression &arg0, const data_expression &arg1)
Application of function symbol mod.
bool is_cnat_function_symbol(const atermpp::aterm &e)
Recogniser for function @cNat.
NUMERIC_TYPE natural_constant_to_value(const data_expression &n)
Return the NUMERIC_VALUE representation of a natural number.
function_symbol_vector nat_mCRL2_usable_constructors()
Give all defined constructors which can be used in mCRL2 specs for nat.
const function_symbol & last()
Constructor for function symbol @last.
bool is_pred_application(const atermpp::aterm &e)
Recogniser for application of pred.
bool is_plus_application(const atermpp::aterm &e)
Recogniser for application of +.
application maximum(const data_expression &arg0, const data_expression &arg1)
Application of function symbol max.
void make_swap_zero(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol @swap_zero.
void make_minimum(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol min.
const core::identifier_string & swap_zero_add_name()
Generate identifier @swap_zero_add.
bool is_dubsucc_function_symbol(const atermpp::aterm &e)
Recogniser for function @dubsucc.
application plus(const data_expression &arg0, const data_expression &arg1)
Application of function symbol +.
bool is_dubsucc_application(const atermpp::aterm &e)
Recogniser for application of @dubsucc.
bool is_swap_zero_min_function_symbol(const atermpp::aterm &e)
Recogniser for function @swap_zero_min.
function_symbol_vector nat_generate_constructors_code()
Give all system defined constructors for nat.
const core::identifier_string & sqrt_name()
Generate identifier sqrt.
bool is_doubly_generalised_divmod_application(const atermpp::aterm &e)
Recogniser for application of @ggdivmod.
bool is_last_function_symbol(const atermpp::aterm &e)
Recogniser for function @last.
application times(const data_expression &arg0, const data_expression &arg1)
Application of function symbol *.
bool is_times_application(const atermpp::aterm &e)
Recogniser for application of *.
bool is_div_function_symbol(const atermpp::aterm &e)
Recogniser for function div.
const core::identifier_string & divmod_name()
Generate identifier @divmod.
bool is_minimum_function_symbol(const atermpp::aterm &e)
Recogniser for function min.
function_symbol times(const sort_expression &s0, const sort_expression &s1)
bool is_times_function_symbol(const atermpp::aterm &e)
Recogniser for function *.
bool is_dub_application(const atermpp::aterm &e)
Recogniser for application of @dub.
bool is_nat2pos_function_symbol(const atermpp::aterm &e)
Recogniser for function Nat2Pos.
const function_symbol & dub()
Constructor for function symbol @dub.
void make_cnat(data_expression &result, const data_expression &arg0)
Make an application of function symbol @cNat.
application swap_zero_monus(const data_expression &arg0, const data_expression &arg1, const data_expression &arg2, const data_expression &arg3)
Application of function symbol @swap_zero_monus.
const function_symbol & pos2nat()
Constructor for function symbol Pos2Nat.
void make_last(data_expression &result, const data_expression &arg0)
Make an application of function symbol @last.
application nat2pos(const data_expression &arg0)
Application of function symbol Nat2Pos.
bool is_natural_constant(const data_expression &n)
Determines whether n is a natural constant.
bool is_monus_application(const atermpp::aterm &e)
Recogniser for application of @monus.
bool is_divmod_application(const atermpp::aterm &e)
Recogniser for application of @divmod.
const data_expression & arg4(const data_expression &e)
Function for projecting out argument. arg4 from an application.
bool is_even_application(const atermpp::aterm &e)
Recogniser for application of @even.
Namespace for system defined sort pos.
void make_powerlog2_pos(data_expression &result, const data_expression &arg0)
Make an application of function symbol @powerlog2.
bool is_pos_predecessor_function_symbol(const atermpp::aterm &e)
Recogniser for function @pospred.
bool is_add_with_carry_function_symbol(const atermpp::aterm &e)
Recogniser for function @addc.
std::string positive_constant_as_string(const data_expression &n_in)
Return the string representation of a positive number.
application minimum(const data_expression &arg0, const data_expression &arg1)
Application of function symbol min.
const data_expression & arg(const data_expression &e)
Function for projecting out argument. arg from an application.
void make_add_with_carry(data_expression &result, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Make an application of function symbol @addc.
void make_times(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol *.
bool is_cdub_function_symbol(const atermpp::aterm &e)
Recogniser for function @cDub.
bool is_maximum_function_symbol(const atermpp::aterm &e)
Recogniser for function max.
implementation_map pos_cpp_implementable_mappings()
Give all system defined mappings that are to be implemented in C++ code for pos.
application succ(const data_expression &arg0)
Application of function symbol succ.
void make_maximum(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol max.
const function_symbol & powerlog2_pos()
Constructor for function symbol @powerlog2.
bool is_positive_constant(const data_expression &n)
Determines whether n is a positive constant.
bool is_pos(const sort_expression &e)
Recogniser for sort expression Pos.
const data_expression & arg3(const data_expression &e)
Function for projecting out argument. arg3 from an application.
const function_symbol & c1()
Constructor for function symbol @c1.
void make_succ(data_expression &result, const data_expression &arg0)
Make an application of function symbol succ.
const function_symbol & add_with_carry()
Constructor for function symbol @addc.
const data_expression & arg1(const data_expression &e)
Function for projecting out argument. arg1 from an application.
application times(const data_expression &arg0, const data_expression &arg1)
Application of function symbol *.
bool is_cdub_application(const atermpp::aterm &e)
Recogniser for application of @cDub.
void make_minimum(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol min.
function_symbol_vector pos_generate_functions_code()
Give all system defined mappings for pos.
const function_symbol & pos_predecessor()
Constructor for function symbol @pospred.
const core::identifier_string & cdub_name()
Generate identifier @cDub.
std::enable_if< std::is_integral< T >::value, data_expression >::type pos(const T t)
Constructs expression of type Bool from an integral type Type T is an unsigned integral type.
const core::identifier_string & c1_name()
Generate identifier @c1.
const function_symbol & plus()
Constructor for function symbol +.
bool is_add_with_carry_application(const atermpp::aterm &e)
Recogniser for application of @addc.
const function_symbol & maximum()
Constructor for function symbol max.
const core::identifier_string & powerlog2_pos_name()
Generate identifier @powerlog2.
bool is_powerlog2_pos_application(const atermpp::aterm &e)
Recogniser for application of @powerlog2.
const core::identifier_string & times_name()
Generate identifier *.
function_symbol_vector pos_mCRL2_usable_constructors()
Give all defined constructors which can be used in mCRL2 specs for pos.
bool is_c1_function_symbol(const atermpp::aterm &e)
Recogniser for function @c1.
const data_expression & arg2(const data_expression &e)
Function for projecting out argument. arg2 from an application.
const core::identifier_string & plus_name()
Generate identifier +.
bool is_minimum_function_symbol(const atermpp::aterm &e)
Recogniser for function min.
const function_symbol & cdub()
Constructor for function symbol @cDub.
const data_expression & right(const data_expression &e)
Function for projecting out argument. right from an application.
application add_with_carry(const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Application of function symbol @addc.
implementation_map pos_cpp_implementable_constructors()
Give all system defined constructors which have an implementation in C++ and not in rewrite rules for...
application powerlog2_pos(const data_expression &arg0)
Application of function symbol @powerlog2.
application plus(const data_expression &arg0, const data_expression &arg1)
Application of function symbol +.
bool is_times_application(const atermpp::aterm &e)
Recogniser for application of *.
bool is_times_function_symbol(const atermpp::aterm &e)
Recogniser for function *.
void make_plus(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol +.
const core::identifier_string & add_with_carry_name()
Generate identifier @addc.
const function_symbol & times()
Constructor for function symbol *.
bool is_succ_function_symbol(const atermpp::aterm &e)
Recogniser for function succ.
bool is_plus_function_symbol(const atermpp::aterm &e)
Recogniser for function +.
const core::identifier_string & minimum_name()
Generate identifier min.
bool is_minimum_application(const atermpp::aterm &e)
Recogniser for application of min.
data_equation_vector pos_generate_equations_code()
Give all system defined equations for pos.
application pos_predecessor(const data_expression &arg0)
Application of function symbol @pospred.
bool is_powerlog2_pos_function_symbol(const atermpp::aterm &e)
Recogniser for function @powerlog2.
application cdub(const data_expression &arg0, const data_expression &arg1)
Application of function symbol @cDub.
bool is_succ_application(const atermpp::aterm &e)
Recogniser for application of succ.
application maximum(const data_expression &arg0, const data_expression &arg1)
Application of function symbol max.
const basic_sort & pos()
Constructor for sort expression Pos.
const core::identifier_string & maximum_name()
Generate identifier max.
const core::identifier_string & pos_name()
const function_symbol & minimum()
Constructor for function symbol min.
NUMERIC_TYPE positive_constant_to_value(const data_expression &n)
Returns the NUMERIC_TYPE representation of a positive number.
const data_expression & left(const data_expression &e)
Function for projecting out argument. left from an application.
function_symbol_vector pos_generate_constructors_and_functions_code()
Give all system defined mappings and constructors for pos.
function_symbol_vector pos_generate_constructors_code()
Give all system defined constructors for pos.
bool is_maximum_application(const atermpp::aterm &e)
Recogniser for application of max.
bool is_pos_predecessor_application(const atermpp::aterm &e)
Recogniser for application of @pospred.
std::map< function_symbol, std::pair< std::function< void(data_expression &, const data_expression &)>, std::string > > implementation_map
bool is_plus_application(const atermpp::aterm &e)
Recogniser for application of +.
const function_symbol & succ()
Constructor for function symbol succ.
void make_cdub(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol @cDub.
const core::identifier_string & pos_predecessor_name()
Generate identifier @pospred.
function_symbol_vector pos_mCRL2_usable_mappings()
Give all system defined mappings that can be used in mCRL2 specs for pos.
const core::identifier_string & succ_name()
Generate identifier succ.
void make_pos_predecessor(data_expression &result, const data_expression &arg0)
Make an application of function symbol @pospred.
Namespace for system defined sort real_.
function_symbol minimum(const sort_expression &s0, const sort_expression &s1)
void make_abs(data_expression &result, const data_expression &arg0)
Make an application of function symbol abs.
function_symbol plus(const sort_expression &s0, const sort_expression &s1)
bool is_real2int_function_symbol(const atermpp::aterm &e)
Recogniser for function Real2Int.
application exp(const data_expression &arg0, const data_expression &arg1)
Application of function symbol exp.
void make_minus(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol -.
const function_symbol & creal()
Constructor for function symbol @cReal.
void make_reduce_fraction(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol @redfrac.
const core::identifier_string & maximum_name()
Generate identifier max.
void make_negate(data_expression &result, const data_expression &arg0)
Make an application of function symbol -.
const core::identifier_string & minus_name()
Generate identifier -.
bool is_succ_function_symbol(const atermpp::aterm &e)
Recogniser for function succ.
application reduce_fraction_helper(const data_expression &arg0, const data_expression &arg1)
Application of function symbol @redfrachlp.
const core::identifier_string & real_name()
const function_symbol & pos2real()
Constructor for function symbol Pos2Real.
const core::identifier_string & reduce_fraction_where_name()
Generate identifier @redfracwhr.
const function_symbol & round()
Constructor for function symbol round.
bool is_plus_function_symbol(const atermpp::aterm &e)
Recogniser for function +.
std::enable_if< std::is_integral< T >::value, data_expression >::type real_(T t)
Constructs expression of type Real from an integral type.
function_symbol times(const sort_expression &s0, const sort_expression &s1)
application divides(const data_expression &arg0, const data_expression &arg1)
Application of function symbol /.
bool is_abs_application(const atermpp::aterm &e)
Recogniser for application of abs.
function_symbol divides(const sort_expression &s0, const sort_expression &s1)
const core::identifier_string & int2real_name()
Generate identifier Int2Real.
const function_symbol & real2nat()
Constructor for function symbol Real2Nat.
bool is_divides_function_symbol(const atermpp::aterm &e)
Recogniser for function /.
const core::identifier_string & creal_name()
Generate identifier @cReal.
void make_succ(data_expression &result, const data_expression &arg0)
Make an application of function symbol succ.
bool is_exp_application(const atermpp::aterm &e)
Recogniser for application of exp.
application real2nat(const data_expression &arg0)
Application of function symbol Real2Nat.
const data_expression & arg(const data_expression &e)
Function for projecting out argument. arg from an application.
bool is_int2real_application(const atermpp::aterm &e)
Recogniser for application of Int2Real.
const function_symbol & ceil()
Constructor for function symbol ceil.
const data_expression & arg2(const data_expression &e)
Function for projecting out argument. arg2 from an application.
bool is_plus_application(const atermpp::aterm &e)
Recogniser for application of +.
bool is_divides_application(const atermpp::aterm &e)
Recogniser for application of /.
bool is_reduce_fraction_function_symbol(const atermpp::aterm &e)
Recogniser for function @redfrac.
bool is_maximum_function_symbol(const atermpp::aterm &e)
Recogniser for function max.
void make_exp(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol exp.
const core::identifier_string & divides_name()
Generate identifier /.
bool is_real2int_application(const atermpp::aterm &e)
Recogniser for application of Real2Int.
const core::identifier_string & ceil_name()
Generate identifier ceil.
bool is_creal_function_symbol(const atermpp::aterm &e)
Recogniser for function @cReal.
void make_real2nat(data_expression &result, const data_expression &arg0)
Make an application of function symbol Real2Nat.
bool is_minus_function_symbol(const atermpp::aterm &e)
Recogniser for function -.
application creal(const data_expression &arg0, const data_expression &arg1)
Application of function symbol @cReal.
bool is_reduce_fraction_where_application(const atermpp::aterm &e)
Recogniser for application of @redfracwhr.
function_symbol succ(const sort_expression &s0)
application negate(const data_expression &arg0)
Application of function symbol -.
bool is_floor_function_symbol(const atermpp::aterm &e)
Recogniser for function floor.
void make_int2real(data_expression &result, const data_expression &arg0)
Make an application of function symbol Int2Real.
void make_divides(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol /.
const core::identifier_string & floor_name()
Generate identifier floor.
const core::identifier_string & times_name()
Generate identifier *.
bool is_abs_function_symbol(const atermpp::aterm &e)
Recogniser for function abs.
bool is_ceil_application(const atermpp::aterm &e)
Recogniser for application of ceil.
application succ(const data_expression &arg0)
Application of function symbol succ.
const function_symbol & real2int()
Constructor for function symbol Real2Int.
bool is_maximum_application(const atermpp::aterm &e)
Recogniser for application of max.
application nat2real(const data_expression &arg0)
Application of function symbol Nat2Real.
const function_symbol & reduce_fraction()
Constructor for function symbol @redfrac.
bool is_creal_application(const atermpp::aterm &e)
Recogniser for application of @cReal.
bool is_pred_application(const atermpp::aterm &e)
Recogniser for application of pred.
const core::identifier_string & negate_name()
Generate identifier -.
void make_reduce_fraction_helper(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol @redfrachlp.
NUMERIC_TYPE value(const data_expression &r, typename std::enable_if< std::is_floating_point< NUMERIC_TYPE >::value >::type *=nullptr)
Yields the real value of a data expression.
void make_pos2real(data_expression &result, const data_expression &arg0)
Make an application of function symbol Pos2Real.
function_symbol pred(const sort_expression &s0)
bool is_round_function_symbol(const atermpp::aterm &e)
Recogniser for function round.
const core::identifier_string & succ_name()
Generate identifier succ.
const function_symbol & reduce_fraction_helper()
Constructor for function symbol @redfrachlp.
const core::identifier_string & abs_name()
Generate identifier abs.
data_equation_vector real_generate_equations_code()
Give all system defined equations for real_.
bool is_times_function_symbol(const atermpp::aterm &e)
Recogniser for function *.
const core::identifier_string & round_name()
Generate identifier round.
bool is_negate_function_symbol(const atermpp::aterm &e)
Recogniser for function -.
application int2real(const data_expression &arg0)
Application of function symbol Int2Real.
function_symbol minus(const sort_expression &s0, const sort_expression &s1)
const basic_sort & real_()
Constructor for sort expression Real.
bool is_minimum_function_symbol(const atermpp::aterm &e)
Recogniser for function min.
const function_symbol & floor()
Constructor for function symbol floor.
void make_minimum(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol min.
void make_times(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol *.
const core::identifier_string & reduce_fraction_helper_name()
Generate identifier @redfrachlp.
function_symbol_vector real_mCRL2_usable_constructors()
Give all defined constructors which can be used in mCRL2 specs for real_.
std::enable_if< std::is_integral< T >::value, data_expression >::type real_(T numerator, T denominator)
Constructs expression of type Real from an integral type.
bool is_real2pos_function_symbol(const atermpp::aterm &e)
Recogniser for function Real2Pos.
void make_real2int(data_expression &result, const data_expression &arg0)
Make an application of function symbol Real2Int.
function_symbol_vector real_generate_constructors_code()
Give all system defined constructors for real_.
void make_nat2real(data_expression &result, const data_expression &arg0)
Make an application of function symbol Nat2Real.
void make_maximum(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol max.
bool is_floor_application(const atermpp::aterm &e)
Recogniser for application of floor.
application reduce_fraction_where(const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Application of function symbol @redfracwhr.
bool is_real(const sort_expression &e)
Recogniser for sort expression Real.
const function_symbol & reduce_fraction_where()
Constructor for function symbol @redfracwhr.
application plus(const data_expression &arg0, const data_expression &arg1)
Application of function symbol +.
implementation_map real_cpp_implementable_mappings()
Give all system defined mappings that are to be implemented in C++ code for real_.
application times(const data_expression &arg0, const data_expression &arg1)
Application of function symbol *.
bool is_ceil_function_symbol(const atermpp::aterm &e)
Recogniser for function ceil.
application real2int(const data_expression &arg0)
Application of function symbol Real2Int.
const core::identifier_string & pred_name()
Generate identifier pred.
const function_symbol & nat2real()
Constructor for function symbol Nat2Real.
const core::identifier_string & minimum_name()
Generate identifier min.
const data_expression & right(const data_expression &e)
Function for projecting out argument. right from an application.
bool is_succ_application(const atermpp::aterm &e)
Recogniser for application of succ.
application pos2real(const data_expression &arg0)
Application of function symbol Pos2Real.
void make_round(data_expression &result, const data_expression &arg0)
Make an application of function symbol round.
bool is_pos2real_function_symbol(const atermpp::aterm &e)
Recogniser for function Pos2Real.
function_symbol_vector real_mCRL2_usable_mappings()
Give all system defined mappings that can be used in mCRL2 specs for real_.
const data_expression & arg1(const data_expression &e)
Function for projecting out argument. arg1 from an application.
const core::identifier_string & plus_name()
Generate identifier +.
function_symbol abs(const sort_expression &s0)
const data_expression & left(const data_expression &e)
Function for projecting out argument. left from an application.
bool is_times_application(const atermpp::aterm &e)
Recogniser for application of *.
void make_ceil(data_expression &result, const data_expression &arg0)
Make an application of function symbol ceil.
const core::identifier_string & reduce_fraction_name()
Generate identifier @redfrac.
function_symbol negate(const sort_expression &s0)
application minus(const data_expression &arg0, const data_expression &arg1)
Application of function symbol -.
application abs(const data_expression &arg0)
Application of function symbol abs.
bool is_real2pos_application(const atermpp::aterm &e)
Recogniser for application of Real2Pos.
bool is_reduce_fraction_application(const atermpp::aterm &e)
Recogniser for application of @redfrac.
bool is_int2real_function_symbol(const atermpp::aterm &e)
Recogniser for function Int2Real.
bool is_negate_application(const atermpp::aterm &e)
Recogniser for application of -.
std::map< function_symbol, std::pair< std::function< void(data_expression &, const data_expression &)>, std::string > > implementation_map
bool is_reduce_fraction_helper_function_symbol(const atermpp::aterm &e)
Recogniser for function @redfrachlp.
bool is_minimum_application(const atermpp::aterm &e)
Recogniser for application of min.
bool is_minus_application(const atermpp::aterm &e)
Recogniser for application of -.
const core::identifier_string & pos2real_name()
Generate identifier Pos2Real.
bool is_round_application(const atermpp::aterm &e)
Recogniser for application of round.
application reduce_fraction(const data_expression &arg0, const data_expression &arg1)
Application of function symbol @redfrac.
const data_expression & arg3(const data_expression &e)
Function for projecting out argument. arg3 from an application.
const core::identifier_string & exp_name()
Generate identifier exp.
application maximum(const data_expression &arg0, const data_expression &arg1)
Application of function symbol max.
bool is_real2nat_function_symbol(const atermpp::aterm &e)
Recogniser for function Real2Nat.
const core::identifier_string & real2nat_name()
Generate identifier Real2Nat.
const core::identifier_string & real2int_name()
Generate identifier Real2Int.
const function_symbol & int2real()
Constructor for function symbol Int2Real.
bool is_pred_function_symbol(const atermpp::aterm &e)
Recogniser for function pred.
const core::identifier_string & nat2real_name()
Generate identifier Nat2Real.
function_symbol exp(const sort_expression &s0, const sort_expression &s1)
application real2pos(const data_expression &arg0)
Application of function symbol Real2Pos.
void make_pred(data_expression &result, const data_expression &arg0)
Make an application of function symbol pred.
bool is_real2nat_application(const atermpp::aterm &e)
Recogniser for application of Real2Nat.
bool is_pos2real_application(const atermpp::aterm &e)
Recogniser for application of Pos2Real.
application floor(const data_expression &arg0)
Application of function symbol floor.
application minimum(const data_expression &arg0, const data_expression &arg1)
Application of function symbol min.
void make_plus(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol +.
bool is_reduce_fraction_helper_application(const atermpp::aterm &e)
Recogniser for application of @redfrachlp.
void make_floor(data_expression &result, const data_expression &arg0)
Make an application of function symbol floor.
const function_symbol & real2pos()
Constructor for function symbol Real2Pos.
implementation_map real_cpp_implementable_constructors()
Give all system defined constructors which have an implementation in C++ and not in rewrite rules for...
function_symbol maximum(const sort_expression &s0, const sort_expression &s1)
function_symbol_vector real_generate_functions_code()
Give all system defined mappings for real_.
void make_reduce_fraction_where(data_expression &result, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Make an application of function symbol @redfracwhr.
function_symbol_vector real_generate_constructors_and_functions_code()
Give all system defined mappings and constructors for real_.
const core::identifier_string & real2pos_name()
Generate identifier Real2Pos.
void make_real2pos(data_expression &result, const data_expression &arg0)
Make an application of function symbol Real2Pos.
application round(const data_expression &arg0)
Application of function symbol round.
bool is_exp_function_symbol(const atermpp::aterm &e)
Recogniser for function exp.
application pred(const data_expression &arg0)
Application of function symbol pred.
void make_creal(data_expression &result, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol @cReal.
application ceil(const data_expression &arg0)
Application of function symbol ceil.
bool is_reduce_fraction_where_function_symbol(const atermpp::aterm &e)
Recogniser for function @redfracwhr.
bool is_nat2real_function_symbol(const atermpp::aterm &e)
Recogniser for function Nat2Real.
bool is_nat2real_application(const atermpp::aterm &e)
Recogniser for application of Nat2Real.
Namespace for system defined sort set_.
const core::identifier_string & fset_intersection_name()
Generate identifier @fset_inter.
void make_in(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol in.
function_symbol true_function(const sort_expression &s)
Constructor for function symbol @true_.
const core::identifier_string & or_function_name()
Generate identifier @or_.
bool is_set_comprehension_application(const atermpp::aterm &e)
Recogniser for application of @setcomp.
const core::identifier_string & constructor_name()
Generate identifier @set.
application fset_intersection(const sort_expression &s, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2, const data_expression &arg3)
Application of function symbol @fset_inter.
bool is_false_function_function_symbol(const atermpp::aterm &e)
Recogniser for function @false_.
bool is_difference_function_symbol(const atermpp::aterm &e)
Recogniser for function -.
bool is_not_function_application(const atermpp::aterm &e)
Recogniser for application of @not_.
bool is_and_function_application(const atermpp::aterm &e)
Recogniser for application of @and_.
void make_or_function(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol @or_.
function_symbol_vector set_generate_constructors_and_functions_code(const sort_expression &s)
Give all system defined mappings and constructors for set_.
application or_function(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol @or_.
bool is_fset_intersection_function_symbol(const atermpp::aterm &e)
Recogniser for function @fset_inter.
bool is_set(const sort_expression &e)
Recogniser for sort expression Set(s)
function_symbol or_function(const sort_expression &s)
Constructor for function symbol @or_.
void make_complement(data_expression &result, const sort_expression &s, const data_expression &arg0)
Make an application of function symbol !.
bool is_union_application(const atermpp::aterm &e)
Recogniser for application of +.
const core::identifier_string & false_function_name()
Generate identifier @false_.
bool is_in_function_symbol(const atermpp::aterm &e)
Recogniser for function in.
const data_expression & arg4(const data_expression &e)
Function for projecting out argument. arg4 from an application.
bool is_true_function_function_symbol(const atermpp::aterm &e)
Recogniser for function @true_.
bool is_complement_application(const atermpp::aterm &e)
Recogniser for application of !.
bool is_or_function_function_symbol(const atermpp::aterm &e)
Recogniser for function @or_.
function_symbol fset_intersection(const sort_expression &s)
Constructor for function symbol @fset_inter.
std::map< function_symbol, std::pair< std::function< void(data_expression &, const data_expression &)>, std::string > > implementation_map
const core::identifier_string & set_comprehension_name()
Generate identifier @setcomp.
void make_fset_union(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2, const data_expression &arg3)
Make an application of function symbol @fset_union.
bool is_fset_union_application(const atermpp::aterm &e)
Recogniser for application of @fset_union.
bool is_false_function_application(const atermpp::aterm &e)
Recogniser for application of @false_.
const data_expression & left(const data_expression &e)
Function for projecting out argument. left from an application.
bool is_not_function_function_symbol(const atermpp::aterm &e)
Recogniser for function @not_.
function_symbol and_function(const sort_expression &s)
Constructor for function symbol @and_.
bool is_set_comprehension_function_symbol(const atermpp::aterm &e)
Recogniser for function @setcomp.
bool is_in_application(const atermpp::aterm &e)
Recogniser for application of in.
const core::identifier_string & not_function_name()
Generate identifier @not_.
application not_function(const sort_expression &s, const data_expression &arg0)
Application of function symbol @not_.
const core::identifier_string & in_name()
Generate identifier in.
function_symbol_vector set_generate_constructors_code(const sort_expression &s)
Give all system defined constructors for set_.
implementation_map set_cpp_implementable_mappings(const sort_expression &s)
Give all system defined mappings that are to be implemented in C++ code for set_.
bool is_fset_intersection_application(const atermpp::aterm &e)
Recogniser for application of @fset_inter.
data_expression set_enumeration(const sort_expression &s, data_expression_list const &range)
Application of function symbol set_enumeration.
bool is_difference_application(const atermpp::aterm &e)
Recogniser for application of -.
function_symbol not_function(const sort_expression &s)
Constructor for function symbol @not_.
const data_expression & arg(const data_expression &e)
Function for projecting out argument. arg from an application.
application union_(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol +.
bool is_constructor_application(const atermpp::aterm &e)
Recogniser for application of @set.
const core::identifier_string & fset_union_name()
Generate identifier @fset_union.
bool is_set_fset_application(const atermpp::aterm &e)
Recogniser for application of @setfset.
implementation_map set_cpp_implementable_constructors(const sort_expression &s)
Give all system defined constructors which have an implementation in C++ and not in rewrite rules for...
void make_intersection(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol *.
application difference(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol -.
application complement(const sort_expression &s, const data_expression &arg0)
Application of function symbol !.
const core::identifier_string & complement_name()
Generate identifier !.
function_symbol intersection(const sort_expression &s, const sort_expression &s0, const sort_expression &s1)
application set_fset(const sort_expression &s, const data_expression &arg0)
Application of function symbol @setfset.
const core::identifier_string & and_function_name()
Generate identifier @and_.
application intersection(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol *.
bool is_fset_union_function_symbol(const atermpp::aterm &e)
Recogniser for function @fset_union.
const data_expression & arg2(const data_expression &e)
Function for projecting out argument. arg2 from an application.
function_symbol fset_union(const sort_expression &s)
Constructor for function symbol @fset_union.
void make_and_function(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol @and_.
container_sort set_(const sort_expression &s)
Constructor for sort expression Set(S)
bool is_set_fset_function_symbol(const atermpp::aterm &e)
Recogniser for function @setfset.
application set_comprehension(const sort_expression &s, const data_expression &arg0)
Application of function symbol @setcomp.
const core::identifier_string & intersection_name()
Generate identifier *.
void make_fset_intersection(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2, const data_expression &arg3)
Make an application of function symbol @fset_inter.
function_symbol constructor(const sort_expression &s)
Constructor for function symbol @set.
const data_expression & arg3(const data_expression &e)
Function for projecting out argument. arg3 from an application.
const data_expression & right(const data_expression &e)
Function for projecting out argument. right from an application.
function_symbol false_function(const sort_expression &s)
Constructor for function symbol @false_.
void make_constructor(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol @set.
const core::identifier_string & set_fset_name()
Generate identifier @setfset.
const core::identifier_string & union_name()
Generate identifier +.
bool is_complement_function_symbol(const atermpp::aterm &e)
Recogniser for function !.
function_symbol in(const sort_expression &, const sort_expression &s0, const sort_expression &s1)
function_symbol union_(const sort_expression &s, const sort_expression &s0, const sort_expression &s1)
bool is_constructor_function_symbol(const atermpp::aterm &e)
Recogniser for function @set.
function_symbol_vector set_generate_functions_code(const sort_expression &s)
Give all system defined mappings for set_.
application fset_union(const sort_expression &s, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2, const data_expression &arg3)
Application of function symbol @fset_union.
function_symbol_vector set_mCRL2_usable_constructors(const sort_expression &s)
Give all defined constructors which can be used in mCRL2 specs for set_.
const core::identifier_string & difference_name()
Generate identifier -.
void make_set_comprehension(data_expression &result, const sort_expression &s, const data_expression &arg0)
Make an application of function symbol @setcomp.
application true_function(const sort_expression &s, const data_expression &arg0)
Application of function symbol @true_.
void make_not_function(data_expression &result, const sort_expression &s, const data_expression &arg0)
Make an application of function symbol @not_.
bool is_or_function_application(const atermpp::aterm &e)
Recogniser for application of @or_.
const core::identifier_string & true_function_name()
Generate identifier @true_.
void make_false_function(data_expression &result, const sort_expression &s, const data_expression &arg0)
Make an application of function symbol @false_.
void make_true_function(data_expression &result, const sort_expression &s, const data_expression &arg0)
Make an application of function symbol @true_.
application false_function(const sort_expression &s, const data_expression &arg0)
Application of function symbol @false_.
function_symbol difference(const sort_expression &s, const sort_expression &s0, const sort_expression &s1)
bool is_union_function_symbol(const atermpp::aterm &e)
Recogniser for function +.
function_symbol complement(const sort_expression &s)
Constructor for function symbol !.
bool is_true_function_application(const atermpp::aterm &e)
Recogniser for application of @true_.
function_symbol set_fset(const sort_expression &s)
Constructor for function symbol @setfset.
void make_difference(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol -.
void make_union_(data_expression &result, const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Make an application of function symbol +.
function_symbol set_comprehension(const sort_expression &s)
Constructor for function symbol @setcomp.
application in(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol in.
bool is_intersection_application(const atermpp::aterm &e)
Recogniser for application of *.
data_equation_vector set_generate_equations_code(const sort_expression &s)
Give all system defined equations for set_.
application and_function(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol @and_.
function_symbol_vector set_mCRL2_usable_mappings(const sort_expression &s)
Give all system defined mappings that can be used in mCRL2 specs for set_.
bool is_and_function_function_symbol(const atermpp::aterm &e)
Recogniser for function @and_.
void make_set_fset(data_expression &result, const sort_expression &s, const data_expression &arg0)
Make an application of function symbol @setfset.
bool is_intersection_function_symbol(const atermpp::aterm &e)
Recogniser for function *.
application constructor(const sort_expression &s, const data_expression &arg0, const data_expression &arg1)
Application of function symbol @set.
const data_expression & arg1(const data_expression &e)
Function for projecting out argument. arg1 from an application.
Namespace for all data library functionality.
void make_set_comprehension(atermpp::aterm &result, ARGUMENTS... arguments)
std::set< data::variable > find_free_variables(const T &x)
void swap(exists_binder &t1, exists_binder &t2)
\brief swap overload
std::vector< machine_number > machine_number_vector
\brief vector of machine_numbers
void make_data_expression(data_expression &result)
atermpp::term_list< assignment_expression > assignment_expression_list
\brief list of assignment_expressions
std::vector< assignment > assignment_vector
\brief vector of assignments
bool is_convertible(const sort_expression &s1, const sort_expression &s2)
Returns true if and only if s1 == s2, or if s1 is a less specific numeric type than s2.
void make_function_symbol(atermpp::aterm &t, const ARGUMENTS &... args)
data::data_equation normalize_sorts(const data::data_equation &x, const data::sort_specification &sortspec)
constexpr std::size_t undefined_index()
Returns an index that corresponds to 'undefined'.
std::string pp(const data::untyped_set_or_bag_comprehension_binder &x)
bool is_greater_application(const DataExpression &e)
Recogniser for application of >
std::string pp(const data::set_comprehension_binder &x)
void normalize_sorts(data::data_equation_vector &x, const data::sort_specification &sortspec)
std::string pp(const data::exists &x)
bool is_greater_function_symbol(const DataExpression &e)
Recogniser for function >
std::string pp(const data::untyped_sort_variable &x)
void if_always_else_manual_implementation(data_expression &result, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
The data expression of an application of the function symbol @if_always_else.
atermpp::term_list< function_sort > function_sort_list
list of function sorts
std::string pp(const data::untyped_set_or_bag_comprehension &x)
const data::data_expression & undefined_real()
Returns a data expression of type Real that corresponds to 'undefined'.
std::string pp(const data::assignment_expression &x)
bool is_if_always_else_function_symbol(const atermpp::aterm &e)
Recogniser for function @if_always_else.
bool is_structured_sort(const atermpp::aterm &x)
Returns true if the term t is a structured sort.
data::data_equation_list normalize_sorts(const data::data_equation_list &x, const data::sort_specification &sortspec)
std::string pp(const data::function_symbol_list &x)
void normalize_sorts(T &x, const data::sort_specification &sort_spec, typename std::enable_if< !std::is_base_of< atermpp::aterm, T >::value >::type *=nullptr)
bool is_data_equation(const atermpp::aterm &t)
Recognizer function.
std::set< data::data_expression > find_data_expressions(const T &x)
Returns all data expressions that occur in an object.
application function_update(const sort_expression &s, const sort_expression &t, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Application of function symbol @func_update.
void find_identifiers(const T &x, OutputIterator o)
std::set< data::function_symbol > find_function_symbols(const T &x)
function_symbol_vector function_update_mCRL2_usable_mappings(const sort_expression &s, const sort_expression &t)
Give all system defined mappings that can be used in mCRL2 specs for function_update.
variable_list free_variables(const data_expression &x)
bool is_is_not_a_function_update_application(const atermpp::aterm &e)
Recogniser for application of @is_not_an_update.
function_symbol less_equal(const sort_expression &s)
Constructor for function symbol <=.
std::set< data::sort_expression > find_sort_expressions(const T &x)
void make_bag_comprehension(atermpp::aterm &result, ARGUMENTS... arguments)
void swap(container_sort &t1, container_sort &t2)
\brief swap overload
std::string pp(const data::set_container &x)
void swap(machine_number &t1, machine_number &t2)
\brief swap overload
bool is_set_container(const atermpp::aterm &x)
std::string pp(const data::abstraction &x)
void swap(structured_sort &t1, structured_sort &t2)
\brief swap overload
void swap(lambda_binder &t1, lambda_binder &t2)
\brief swap overload
std::string pp(const data::application &x)
std::string pp(const data::bag_comprehension_binder &x)
function_symbol_vector standard_generate_functions_code(const sort_expression &s)
Give all standard system defined functions for sort s.
void find_free_variables_with_bound(const T &x, OutputIterator o, const VariableContainer &bound)
void make_machine_number(atermpp::aterm &t, size_t n)
std::set< data::variable > find_all_variables(const data::data_expression_list &x)
bool is_data_expression(const atermpp::aterm &x)
Test for a data_expression expression.
void swap(abstraction &t1, abstraction &t2)
\brief swap overload
std::string pp(const data::fbag_container &x)
void swap(untyped_sort_variable &t1, untyped_sort_variable &t2)
\brief swap overload
bool is_application_no_check(const atermpp::aterm &x)
Returns true if the term t is an application, but it does not check whether an application symbol of ...
function_symbol not_equal_to(const sort_expression &s)
Constructor for function symbol !=.
std::vector< sort_expression > sort_expression_vector
\brief vector of sort_expressions
const data_expression & arg1(const data_expression &e)
Function for projecting out argument. arg1 from an application.
void make_where_clause(atermpp::aterm &t, const ARGUMENTS &... args)
void make_untyped_data_parameter(atermpp::aterm &t, const ARGUMENTS &... args)
bool is_equal_to_function_symbol(const DataExpression &e)
Recogniser for function ==.
function_symbol_vector function_update_mCRL2_usable_constructors()
Give all defined constructors which can be used in mCRL2 specs for function_update.
data_expression_list make_data_expression_list(Container const &r, typename atermpp::enable_if_container< Container, data_expression >::type *=nullptr)
Converts an container with data expressions to data_expression_list.
std::set< data::sort_expression > find_sort_expressions(const data::data_expression &x)
void swap(list_container &t1, list_container &t2)
\brief swap overload
const data::variable & undefined_variable()
Returns a data variable that corresponds to 'undefined'.
data::data_equation translate_user_notation(const data::data_equation &x)
std::string pp(const data::untyped_data_parameter &x)
std::string pp(const data::fset_container &x)
bool is_application(const data_expression &t)
Returns true if the term t is an application.
bool is_list_container(const atermpp::aterm &x)
std::vector< alias > alias_vector
\brief vector of aliass
bool is_if_application(const DataExpression &e)
Recogniser for application of if.
void make_basic_sort(atermpp::aterm &t, const ARGUMENTS &... args)
void make_function_update_stable(data_expression &result, const sort_expression &s, const sort_expression &t, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Make an application of function symbol @func_update_stable.
void swap(set_comprehension &t1, set_comprehension &t2)
\brief swap overload
bool search_data_expression(Container const &container, const data_expression &s)
Returns true if the term has a given data expression as subterm.
std::set< data::variable > find_all_variables(const T &x)
function_sort make_function_sort_(const sort_expression &dom1, const sort_expression &dom2, const sort_expression &dom3, const sort_expression &dom4, const sort_expression &codomain)
Convenience constructor for function sort with domain size 4.
implementation_map function_update_cpp_implementable_mappings(const sort_expression &s, const sort_expression &t)
Give all system defined mappings that are to be implemented in C++ code for function_update.
atermpp::term_list< function_symbol > function_symbol_list
\brief list of function_symbols
bool is_not_equal_to_application(const DataExpression &e)
Recogniser for application of !=.
std::set< data::variable > find_all_variables(const data::data_expression &x)
void find_all_variables(const T &x, OutputIterator o)
function_symbol if_always_else(const sort_expression &s, const sort_expression &t)
Constructor for function symbol @if_always_else.
atermpp::term_list< untyped_data_parameter > untyped_data_parameter_list
\brief list of untyped_data_parameters
void swap(untyped_identifier_assignment &t1, untyped_identifier_assignment &t2)
\brief swap overload
std::string pp(const data::untyped_identifier_assignment &x)
std::string pp(const data::lambda &x)
function_symbol less(const sort_expression &s)
Constructor for function symbol <.
void make_function_update(data_expression &result, const sort_expression &s, const sort_expression &t, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Make an application of function symbol @func_update.
std::string pp(const data::container_sort &x)
void make_untyped_set_or_bag_comprehension(atermpp::aterm &result, ARGUMENTS... arguments)
bool is_where_clause(const atermpp::aterm &x)
Returns true if the term t is a where clause.
const core::identifier_string & function_update_name()
Generate identifier @func_update.
bool is_untyped_possible_sorts(const atermpp::aterm &x)
Returns true if the term t is an expression for multiple possible sorts.
void swap(assignment &t1, assignment &t2)
\brief swap overload
bool is_untyped_sort(const atermpp::aterm &x)
Returns true if the term t is the unknown sort.
application less_equal(const data_expression &arg0, const data_expression &arg1)
Application of function symbol <=.
std::vector< container_sort > container_sort_vector
list of function sorts
void swap(structured_sort_constructor &t1, structured_sort_constructor &t2)
\brief swap overload
std::string pp(const data::variable &x)
std::string pp(const data::untyped_sort &x)
void swap(fset_container &t1, fset_container &t2)
\brief swap overload
void if_always_else_application(data_expression &result, const data_expression &a1)
Application of a function that is user defined instead of by rewrite rules. It does not have sort par...
void swap(untyped_possible_sorts &t1, untyped_possible_sorts &t2)
\brief swap overload
void swap(alias &t1, alias &t2)
\brief swap overload
std::string pp(const data::machine_number &x)
bool search_free_variable(const T &x, const variable &v)
Returns true if the term has a given free variable as subterm.
atermpp::term_list< alias > alias_list
\brief list of aliass
bool is_greater_equal_application(const DataExpression &e)
Recogniser for application of >=.
application less(const data_expression &arg0, const data_expression &arg1)
Application of function symbol <.
void swap(lambda &t1, lambda &t2)
\brief swap overload
std::string pp(const data::lambda_binder &x)
atermpp::term_list< binder_type > binder_type_list
\brief list of binder_types
data::data_expression translate_user_notation(const data::data_expression &x)
function_symbol_vector function_update_generate_constructors_and_functions_code(const sort_expression &s, const sort_expression &t)
Give all system defined mappings and constructors for function_update.
bool is_if_always_else_application(const atermpp::aterm &e)
Recogniser for application of @if_always_else.
std::vector< untyped_identifier_assignment > untyped_identifier_assignment_vector
\brief vector of untyped_identifier_assignments
void swap(fbag_container &t1, fbag_container &t2)
\brief swap overload
bool is_abstraction(const atermpp::aterm &x)
Returns true if the term t is an abstraction.
void make_variable(atermpp::aterm &t, const ARGUMENTS &... args)
application not_equal_to(const data_expression &arg0, const data_expression &arg1)
Application of function symbol !=.
std::vector< data_equation > data_equation_vector
\brief vector of data_equations
std::vector< structured_sort > structured_sort_vector
\brief vector of structured_sorts
std::vector< binder_type > binder_type_vector
\brief vector of binder_types
std::vector< variable > variable_vector
\brief vector of variables
function_symbol_vector function_update_generate_constructors_code()
Give all system defined constructors for function_update.
atermpp::term_list< machine_number > machine_number_list
\brief list of machine_numbers
function_sort make_function_sort_(const sort_expression &dom1, const sort_expression &codomain)
Convenience constructor for function sort with domain size 1.
void swap(bag_comprehension_binder &t1, bag_comprehension_binder &t2)
\brief swap overload
application if_(const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Application of function symbol if.
atermpp::term_list< structured_sort_constructor_argument > structured_sort_constructor_argument_list
\brief list of structured_sort_constructor_arguments
bool is_untyped_identifier(const atermpp::aterm &x)
Returns true if the term t is an identifier.
data_equation_vector standard_generate_equations_code(const sort_expression &s)
Give all standard system defined equations for sort s.
std::string pp(const data::data_equation_list &x)
void make_untyped_identifier(atermpp::aterm &t, const ARGUMENTS &... args)
void find_function_symbols(const T &x, OutputIterator o)
void make_assignment(atermpp::aterm &t, const ARGUMENTS &... args)
std::string pp(const data::data_equation &x)
const core::identifier_string & if_always_else_name()
Generate identifier @if_always_else.
std::string pp(const data::function_sort &x)
void make_untyped_identifier_assignment(atermpp::aterm &t, const ARGUMENTS &... args)
bool is_set_comprehension_binder(const atermpp::aterm &x)
void swap(sort_expression &t1, sort_expression &t2)
\brief swap overload
atermpp::term_list< sort_expression > sort_expression_list
\brief list of sort_expressions
void swap(set_container &t1, set_container &t2)
\brief swap overload
void find_free_variables(const T &x, OutputIterator o)
bool is_exists_binder(const atermpp::aterm &x)
std::vector< data_expression > data_expression_vector
\brief vector of data_expressions
void swap(structured_sort_constructor_argument &t1, structured_sort_constructor_argument &t2)
\brief swap overload
std::set< data::variable > find_all_variables(const data::function_symbol &x)
void swap(data_expression &t1, data_expression &t2)
\brief swap overload
std::string pp(const data::bag_comprehension &x)
bool is_not_equal_to_function_symbol(const DataExpression &e)
Recogniser for function !=.
void make_structured_sort_constructor_argument(atermpp::aterm &t, const ARGUMENTS &... args)
void make_alias(atermpp::aterm &t, const ARGUMENTS &... args)
void swap(untyped_set_or_bag_comprehension_binder &t1, untyped_set_or_bag_comprehension_binder &t2)
\brief swap overload
void swap(untyped_sort &t1, untyped_sort &t2)
\brief swap overload
atermpp::term_list< basic_sort > basic_sort_list
list of basic sorts
const core::identifier_string & is_not_a_function_update_name()
Generate identifier @is_not_an_update.
void make_lambda(atermpp::aterm &result, ARGUMENTS... arguments)
application function_update_stable(const sort_expression &s, const sort_expression &t, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Application of function symbol @func_update_stable.
std::string pp(const data::exists_binder &x)
function_symbol greater_equal(const sort_expression &s)
Constructor for function symbol >=.
void swap(bag_comprehension &t1, bag_comprehension &t2)
\brief swap overload
bool is_assignment_expression(const atermpp::aterm &x)
void swap(function_symbol &t1, function_symbol &t2)
\brief swap overload
bool search_sort_expression(Container const &container, const sort_expression &s)
Returns true if the term has a given sort expression as subterm.
std::string pp(const data::forall_binder &x)
bool is_structured_sort_constructor_argument(const atermpp::aterm &x)
std::string pp(const data::structured_sort_constructor_list &x)
bool is_function_update_function_symbol(const atermpp::aterm &e)
Recogniser for function @func_update.
atermpp::term_list< structured_sort > structured_sort_list
\brief list of structured_sorts
void is_not_a_function_update_application(data_expression &result, const data_expression &a1)
Application of a function that is user defined instead of by rewrite rules. It does not have sort par...
application is_not_a_function_update(const sort_expression &s, const sort_expression &t, const data_expression &arg0)
Application of function symbol @is_not_an_update.
atermpp::term_list< container_type > container_type_list
\brief list of container_types
void make_if_always_else(data_expression &result, const sort_expression &s, const sort_expression &t, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Make an application of function symbol @if_always_else.
bool is_system_defined(const sort_expression &s)
Returns true iff the expression represents a standard sort.
bool is_function_update_stable_function_symbol(const atermpp::aterm &e)
Recogniser for function @func_update_stable.
std::string pp(const data::untyped_possible_sorts &x)
void swap(where_clause &t1, where_clause &t2)
\brief swap overload
std::vector< container_type > container_type_vector
\brief vector of container_types
std::string pp(const data::data_expression_list &x)
std::vector< structured_sort_constructor > structured_sort_constructor_vector
\brief vector of structured_sort_constructors
void make_forall(atermpp::aterm &result, ARGUMENTS... arguments)
bool is_structured_sort_constructor(const atermpp::aterm &x)
bool is_container_sort(const atermpp::aterm &x)
Returns true if the term t is a container sort.
variable_list left_hand_sides(const assignment_list &x)
Returns the left hand sides of an assignment list.
void swap(function_sort &t1, function_sort &t2)
\brief swap overload
bool is_lambda_binder(const atermpp::aterm &x)
std::string pp(const data::assignment_list &x)
bool is_forall(const atermpp::aterm &x)
Returns true if the term t is a universal quantification.
bool is_function_symbol(const atermpp::aterm &x)
Returns true if the term t is a function symbol.
atermpp::term_list< data_equation > data_equation_list
\brief list of data_equations
void swap(untyped_data_parameter &t1, untyped_data_parameter &t2)
\brief swap overload
atermpp::term_list< data_expression > data_expression_list
\brief list of data_expressions
std::set< data::variable > find_all_variables(const data::machine_number &x)
bool is_fset_container(const atermpp::aterm &x)
bool is_less_function_symbol(const DataExpression &e)
Recogniser for function <.
std::string pp(const data::structured_sort_constructor &x)
void swap(untyped_identifier &t1, untyped_identifier &t2)
\brief swap overload
std::set< core::identifier_string > find_identifiers(const T &x)
void swap(container_type &t1, container_type &t2)
\brief swap overload
std::string pp(const data::assignment &x)
bool is_basic_sort(const atermpp::aterm &x)
Returns true if the term t is a basic sort.
bool is_untyped_sort_variable(const atermpp::aterm &x)
void swap(untyped_set_or_bag_comprehension &t1, untyped_set_or_bag_comprehension &t2)
\brief swap overload
function_sort make_function_sort_(const sort_expression &dom1, const sort_expression &dom2, const sort_expression &dom3, const sort_expression &dom4, const sort_expression &dom5, const sort_expression &dom6, const sort_expression &codomain)
Convenience constructor for function sort with domain size 6.
data_equation_vector function_update_generate_equations_code(const sort_expression &s, const sort_expression &t)
Give all system defined equations for function_update.
std::list< data_expression > split_disjunction(const data_expression &condition)
Split a disjunctive expression into a set of clauses.
bool is_untyped_set_or_bag_comprehension_binder(const atermpp::aterm &x)
std::set< data::sort_expression > find_sort_expressions(const data::data_equation &x)
void swap(data_equation &t1, data_equation &t2)
\brief swap overload
bool is_function_update_stable_application(const atermpp::aterm &e)
Recogniser for application of @func_update_stable.
std::set< data::function_symbol > find_function_symbols(const data::data_equation &x)
application if_always_else(const sort_expression &s, const sort_expression &t, const data_expression &arg0, const data_expression &arg1, const data_expression &arg2)
Application of function symbol @if_always_else.
void swap(assignment_expression &t1, assignment_expression &t2)
\brief swap overload
bool is_if_function_symbol(const DataExpression &e)
Recogniser for function if.
std::set< data::variable > find_free_variables(const data::data_expression &x)
application greater(const data_expression &arg0, const data_expression &arg1)
Application of function symbol >
std::string pp(const data::bag_container &x)
void make_abstraction(atermpp::aterm &result, ARGUMENTS... arguments)
std::vector< assignment_expression > assignment_expression_vector
\brief vector of assignment_expressions
std::set< data::variable > find_all_variables(const data::variable_list &x)
bool is_untyped_set_or_bag_comprehension(const atermpp::aterm &x)
Returns true if the term t is a set/bag comprehension.
std::pair< core::identifier_string, sort_expression > function_symbol_key_type
T normalize_sorts(const T &x, const data::sort_specification &sort_spec, typename std::enable_if< std::is_base_of< atermpp::aterm, T >::value >::type *=nullptr)
bool is_untyped_data_parameter(const atermpp::aterm &x)
bool is_assignment(const atermpp::aterm &x)
std::string pp(const data::structured_sort &x)
std::list< data_expression > split_conjunction(const data_expression &condition)
Split a disjunctive expression into a set of clauses.
std::set< data::sort_expression > find_sort_expressions(const data::sort_expression &x)
atermpp::term_list< variable > variable_list
\brief list of variables
void find_data_expressions(const T &x, OutputIterator o)
Returns all data expressions that occur in an object.
function_sort make_function_sort_(const sort_expression &dom1, const sort_expression &dom2, const sort_expression &dom3, const sort_expression &codomain)
Convenience constructor for function sort with domain size 3.
void is_not_a_function_update_manual_implementation(data_expression &result, const data_expression &arg0)
The data expression of an application of the function symbol @is_not_an_update.
std::pair< basic_sort_vector, alias_vector > parse_sort_specification(const std::string &text)
std::string pp(const data::data_specification &x)
data::sort_expression normalize_sorts(const data::sort_expression &x, const data::sort_specification &sortspec)
bool is_exists(const atermpp::aterm &x)
Returns true if the term t is an existential quantification.
std::vector< function_sort > function_sort_vector
vector of function sorts
std::string pp(const data::container_type &x)
application greater_equal(const data_expression &arg0, const data_expression &arg1)
Application of function symbol >=.
void find_sort_expressions(const T &x, OutputIterator o)
std::string pp(const data::function_symbol &x)
bool is_less_equal_function_symbol(const DataExpression &e)
Recogniser for function <=.
void make_data_equation(atermpp::aterm &t, const ARGUMENTS &... args)
bool is_function_sort(const atermpp::aterm &x)
Returns true if the term t is a function sort.
bool is_greater_equal_function_symbol(const DataExpression &e)
Recogniser for function >=.
assignment_vector make_assignment_vector(VariableSequence const &variables, ExpressionSequence const &expressions)
Constructs an assignment_list by pairwise combining a variable and expression.
std::set< data::variable > find_free_variables(const data::data_expression_list &x)
void swap(set_comprehension_binder &t1, set_comprehension_binder &t2)
\brief swap overload
std::string pp(const data::basic_sort &x)
implementation_map function_update_cpp_implementable_constructors()
Give all system defined constructors which have an implementation in C++ and not in rewrite rules for...
std::string pp(const data::alias &x)
std::string pp(const data::list_container &x)
std::string pp(const data::forall &x)
void swap(bag_container &t1, bag_container &t2)
\brief swap overload
atermpp::term_list< assignment > assignment_list
\brief list of assignments
bool is_bag_comprehension(const atermpp::aterm &x)
Returns true if the term t is a bag comprehension.
std::string pp(const data::sort_expression &x)
bool is_set_comprehension(const atermpp::aterm &x)
Returns true if the term t is a set comprehension.
std::string max_machine_number_string()
A string representation indicating the maximal machine number + 1.
bool is_bag_container(const atermpp::aterm &x)
void swap(variable &t1, variable &t2)
\brief swap overload
bool is_machine_number(const atermpp::aterm &x)
Returns true if the term t is a machine_number.
function_symbol equal_to(const sort_expression &s)
Constructor for function symbol ==.
data::variable_list normalize_sorts(const data::variable_list &x, const data::sort_specification &sortspec)
const data_expression_list & variable_list_to_data_expression_list(const variable_list &l)
Transform a variable_list into a data_expression_list.
function_symbol function_update_stable(const sort_expression &s, const sort_expression &t)
Constructor for function symbol @func_update_stable.
bool is_function_update_application(const atermpp::aterm &e)
Recogniser for application of @func_update.
data::data_expression normalize_sorts(const data::data_expression &x, const data::sort_specification &sortspec)
data_expression_list right_hand_sides(const assignment_list &x)
Returns the right hand sides of an assignment list.
void make_is_not_a_function_update(data_expression &result, const sort_expression &s, const sort_expression &t, const data_expression &arg0)
Make an application of function symbol @is_not_an_update.
function_sort make_function_sort_(const sort_expression &dom1, const sort_expression &dom2, const sort_expression &codomain)
Convenience constructor for function sort with domain size 2.
std::map< function_symbol, std::pair< std::function< void(data_expression &, const data_expression &)>, std::string > > implementation_map
application equal_to(const data_expression &arg0, const data_expression &arg1)
Application of function symbol ==.
bool is_fbag_container(const atermpp::aterm &x)
atermpp::term_list< container_sort > container_sort_list
list of function sorts
std::string pp(const data::structured_sort_constructor_argument &x)
bool is_lambda(const atermpp::aterm &x)
Returns true if the term t is a lambda abstraction.
const data::variable & undefined_real_variable()
Returns a data variable that corresponds to 'undefined'.
void swap(exists &t1, exists &t2)
\brief swap overload
bool is_untyped_identifier_assignment(const atermpp::aterm &x)
function_symbol_vector function_update_generate_functions_code(const sort_expression &s, const sort_expression &t)
Give all system defined mappings for function_update.
bool is_alias(const atermpp::aterm &x)
bool is_is_not_a_function_update_function_symbol(const atermpp::aterm &e)
Recogniser for function @is_not_an_update.
void swap(forall &t1, forall &t2)
\brief swap overload
std::set< data::variable > find_all_variables(const data::variable &x)
void make_exists(atermpp::aterm &result, ARGUMENTS... arguments)
function_symbol function_update(const sort_expression &s, const sort_expression &t)
Constructor for function symbol @func_update.
bool is_constant(const data_expression &x)
bool is_forall_binder(const atermpp::aterm &x)
const core::identifier_string & function_update_stable_name()
Generate identifier @func_update_stable.
void swap(forall_binder &t1, forall_binder &t2)
\brief swap overload
bool search_variable(const T &x, const variable &v)
Returns true if the term has a given variable as subterm.
assignment_list make_assignment_list(const VariableSequence &variables, const ExpressionSequence &expressions)
Converts an iterator range to data_expression_list.
bool is_less_application(const DataExpression &e)
Recogniser for application of <.
void make_structured_sort(atermpp::aterm &t, const ARGUMENTS &... args)
std::set< core::identifier_string > find_identifiers(const data::variable_list &x)
std::vector< basic_sort > basic_sort_vector
vector of basic sorts
bool search_variable(const data::data_expression &x, const data::variable &v)
const data::data_expression & undefined_data_expression()
Returns a data expression that corresponds to 'undefined'.
const data::sort_expression & undefined_sort_expression()
Returns a sort expression that corresponds to 'undefined'.
void make_container_sort(atermpp::aterm &t, const ARGUMENTS &... args)
void make_function_sort(atermpp::aterm &t, const ARGUMENTS &... args)
function_sort make_function_sort_(const sort_expression &dom1, const sort_expression &dom2, const sort_expression &dom3, const sort_expression &dom4, const sort_expression &dom5, const sort_expression &codomain)
Convenience constructor for function sort with domain size 5.
void make_structured_sort_constructor(atermpp::aterm &t, const ARGUMENTS &... args)
std::string pp(const data::set_comprehension &x)
const data_expression & arg3(const data_expression &e)
Function for projecting out argument. arg3 from an application.
void make_untyped_possible_sorts(atermpp::aterm &t, const ARGUMENTS &... args)
std::vector< untyped_data_parameter > untyped_data_parameter_vector
\brief vector of untyped_data_parameters
bool is_application(const atermpp::aterm &x)
Returns true if the term t is an application.
void swap(basic_sort &t1, basic_sort &t2)
\brief swap overload
std::vector< function_symbol > function_symbol_vector
\brief vector of function_symbols
atermpp::term_list< untyped_identifier_assignment > untyped_identifier_assignment_list
\brief list of untyped_identifier_assignments
std::string pp(const data::variable_list &x)
std::set< data::variable > substitution_variables(const mutable_map_substitution<> &sigma)
std::string pp(const data::where_clause &x)
bool is_less_equal_application(const DataExpression &e)
Recogniser for application of <=.
std::vector< structured_sort_constructor_argument > structured_sort_constructor_argument_vector
\brief vector of structured_sort_constructor_arguments
const data_expression & arg2(const data_expression &e)
Function for projecting out argument. arg2 from an application.
std::string pp(const machine_number_list &x)
bool is_bag_comprehension_binder(const atermpp::aterm &x)
std::set< data::variable > find_free_variables_with_bound(const T &x, VariableContainer const &bound)
function_symbol if_(const sort_expression &s)
Constructor for function symbol if.
function_symbol is_not_a_function_update(const sort_expression &s, const sort_expression &t)
Constructor for function symbol @is_not_an_update.
bool is_equal_to_application(const DataExpression &e)
Recogniser for application of ==.
std::string pp(const data::data_expression &x)
void swap(binder_type &t1, binder_type &t2)
\brief swap overload
std::string pp(const data::untyped_identifier &x)
bool is_variable(const atermpp::aterm &x)
Returns true if the term t is a variable.
std::string pp(const data::sort_expression_vector &x)
std::string pp(const data::binder_type &x)
bool is_sort_expression(const atermpp::aterm &x)
Test for a sort_expression expression.
atermpp::term_list< structured_sort_constructor > structured_sort_constructor_list
\brief list of structured_sort_constructors
std::string pp(const data::sort_expression_list &x)
void make_untyped_sort_variable(atermpp::aterm &t, const ARGUMENTS &... args)
std::pair< atermpp::aterm, atermpp::aterm > machine_number_key_type
function_symbol greater(const sort_expression &s)
Constructor for function symbol >
T join(FwdIt first, FwdIt last, BinaryOperation op, T empty_sequence_result)
Given a sequence [t1, t2, ..., tn] of elements of type T, returns op(t1, op(t2, .....
T join_balanced(RndIt first, RndIt last, BinaryOperation op)
Given a non-empty sequence [t1, t2, ..., tn] of elements of type T, returns op(op(t1,...
void split(const T &t, OutputIterator i, MatchFunction match, AccessorFunction1 lhs, AccessorFunction2 rhs)
Splits a binary tree T into a sequence, and writes the result to the output range given by an output ...
A class that takes a linear process specification and checks all tau-summands of that LPS for conflue...
expression builder that visits all sub expressions
void update(T &x, typename atermpp::disable_if_container< T >::type *=nullptr)
void apply(atermpp::term_list< T > &result, const atermpp::term_list< U > &x)
void update(std::set< T > &x)
core::identifier_string parse_Id(const parse_node &node) const
atermpp::term_list< T > parse_list(const parse_node &node, const std::string &type, const Function &f) const
default_parser_actions(const parser &parser_)
std::vector< T > parse_vector(const parse_node &node, const std::string &type, const Function &f) const
core::identifier_string_list parse_IdList(const parse_node &node) const
core::identifier_string parse_Number(const parse_node &node) const
static const atermpp::aterm DataVarIdInit
static const atermpp::aterm SortFSet
static const atermpp::aterm DataVarId
static const atermpp::aterm BindingOperator
static const atermpp::aterm SortArrow
static const atermpp::aterm UntypedSetBagComp
static const atermpp::aterm Lambda
static const atermpp::aterm SortExpr
static const atermpp::aterm SortConsType
static const atermpp::aterm SortId
static const atermpp::aterm UntypedSortsPossible
static const atermpp::aterm Binder
static const atermpp::aterm UntypedSortVariable
static const atermpp::aterm DataEqn
static const atermpp::aterm SortRef
static const atermpp::aterm DataExpr
static const atermpp::aterm UntypedSortUnknown
static const atermpp::aterm SortSet
static const atermpp::aterm Exists
static const atermpp::aterm SortCons
static const atermpp::aterm SortBag
static const atermpp::aterm OpId
static const atermpp::aterm StructProj
static const atermpp::aterm Whr
static const atermpp::aterm UntypedIdentifierAssignment
static const atermpp::aterm SortStruct
static const atermpp::aterm SetComp
static const atermpp::aterm StructCons
static const atermpp::aterm BagComp
static const atermpp::aterm UntypedIdentifier
static const atermpp::aterm SortFBag
static const atermpp::aterm SortList
static const atermpp::aterm WhrDecl
static const atermpp::aterm Forall
static const atermpp::aterm UntypedDataParameter
void operator()(const parse_node &x)
const parser_table & table
find_and_or(const parser_table &table_)
void operator()(const parse_node &x)
const parser_table & table
find_left_merge_merge(const parser_table &table_)
static const atermpp::function_symbol ProcEqnSpec
static const atermpp::function_symbol Lambda
static const atermpp::function_symbol PRInit
static const atermpp::function_symbol PBESTrue
static const atermpp::function_symbol UntypedRegFrm
static const atermpp::function_symbol ProcessInit
static const atermpp::function_symbol PRESTrue
static const atermpp::function_symbol StateMu
static const atermpp::function_symbol PREqnSpec
static const atermpp::function_symbol ActMultAct
static const atermpp::function_symbol RegSeq
static const atermpp::function_symbol Rename
static const atermpp::function_symbol BagComp
static const atermpp::function_symbol StateConstantMultiply
static const atermpp::function_symbol ActNot
static const atermpp::function_symbol Allow
static const atermpp::function_symbol StateSum
static const atermpp::function_symbol ActionRenameRules
static const atermpp::function_symbol ProcEqn
static const atermpp::function_symbol ActAnd
static const atermpp::function_symbol PRESCondEq
static const atermpp::function_symbol Forall
static const atermpp::function_symbol Delta
static const atermpp::function_symbol PropVarDecl
static const atermpp::function_symbol DataEqn
static const atermpp::function_symbol UntypedDataParameter
static const atermpp::function_symbol StructProj
static const atermpp::function_symbol ProcessAssignment
static const atermpp::function_symbol ActSpec
static const atermpp::function_symbol PRESImp
static const atermpp::function_symbol StateConstantMultiplyAlt
static const atermpp::function_symbol MultAct
static const atermpp::function_symbol Whr
static const atermpp::function_symbol SortFSet
static const atermpp::function_symbol IfThenElse
static const atermpp::function_symbol StateForall
static const atermpp::function_symbol PBESForall
static const atermpp::function_symbol StateOr
static const atermpp::function_symbol PRES
static const atermpp::function_symbol ActFalse
static const atermpp::function_symbol PBESFalse
static const atermpp::function_symbol RegTransOrNil
static const atermpp::function_symbol Hide
static const atermpp::function_symbol PRESEqInf
static const atermpp::function_symbol UntypedProcessAssignment
static const atermpp::function_symbol StateYaledTimed
static const atermpp::function_symbol SortList
static const atermpp::function_symbol Exists
static const atermpp::function_symbol ActId
static const atermpp::function_symbol TimedMultAct
static const atermpp::function_symbol StateExists
static const atermpp::function_symbol ActExists
static const atermpp::function_symbol ProcVarId
static const atermpp::function_symbol ConsSpec
static const atermpp::function_symbol BInit
static const atermpp::function_symbol RenameExpr
static const atermpp::function_symbol UntypedMultiAction
static const atermpp::function_symbol PRESMinus
static const atermpp::function_symbol PBES
static const atermpp::function_symbol StructCons
static const atermpp::function_symbol StochasticOperator
static const atermpp::function_symbol StateVar
static const atermpp::function_symbol StateTrue
static const atermpp::function_symbol LinProcSpec
static const atermpp::function_symbol SortRef
static const atermpp::function_symbol StateFalse
static const atermpp::function_symbol Choice
static const atermpp::function_symbol SortArrow
static const atermpp::function_symbol OpId
static const atermpp::function_symbol SortFBag
static const atermpp::function_symbol StateImp
static const atermpp::function_symbol Sync
static const atermpp::function_symbol Sum
static const atermpp::function_symbol PRESEqNInf
static const atermpp::function_symbol PBESNot
static const atermpp::function_symbol ProcSpec
static const atermpp::function_symbol MapSpec
static const atermpp::function_symbol PRESCondSm
static const atermpp::function_symbol RegAlt
static const atermpp::function_symbol RegTrans
static const atermpp::function_symbol Action
static const atermpp::function_symbol StateMinus
static const atermpp::function_symbol SetComp
static const atermpp::function_symbol PBESImp
static const atermpp::function_symbol StateNot
static const atermpp::function_symbol CommExpr
static const atermpp::function_symbol Comm
static const atermpp::function_symbol SortCons
static const atermpp::function_symbol SortSet
static const atermpp::function_symbol PBESAnd
static const atermpp::function_symbol AtTime
static const atermpp::function_symbol Nu
static const atermpp::function_symbol Binder
static const atermpp::function_symbol StateInfimum
static const atermpp::function_symbol SortSpec
static const atermpp::function_symbol StateDelay
static const atermpp::function_symbol PRESOr
static const atermpp::function_symbol StateYaled
static const atermpp::function_symbol MultActName
static const atermpp::function_symbol ActAt
static const atermpp::function_symbol PropVarInst
static const atermpp::function_symbol PBInit
static const atermpp::function_symbol StateMay
static const atermpp::function_symbol LinearProcess
static const atermpp::function_symbol Process
static const atermpp::function_symbol SortStruct
static const atermpp::function_symbol StateDelayTimed
static const atermpp::function_symbol ActImp
static const atermpp::function_symbol ActTrue
static const atermpp::function_symbol Merge
static const atermpp::function_symbol ActForall
static const atermpp::function_symbol LinearProcessInit
static const atermpp::function_symbol Block
static const atermpp::function_symbol Seq
static const atermpp::function_symbol ActionRenameRule
static const atermpp::function_symbol Mu
static const atermpp::function_symbol PRESSupremum
static const atermpp::function_symbol StatePlus
static const atermpp::function_symbol UntypedSortsPossible
static const atermpp::function_symbol IfThen
static const atermpp::function_symbol LinearProcessSummand
static const atermpp::function_symbol StateMust
static const atermpp::function_symbol PBESExists
static const atermpp::function_symbol DataVarId
static const atermpp::function_symbol ActionRenameSpec
static const atermpp::function_symbol DataSpec
static const atermpp::function_symbol SortId
static const atermpp::function_symbol GlobVarSpec
static const atermpp::function_symbol UntypedIdentifier
static const atermpp::function_symbol StateNu
static const atermpp::function_symbol PBESOr
static const atermpp::function_symbol Distribution
static const atermpp::function_symbol UntypedSortVariable
static const atermpp::function_symbol DataVarIdInit
static const atermpp::function_symbol PREqn
static const atermpp::function_symbol StateAnd
static const atermpp::function_symbol PRESPlus
static const atermpp::function_symbol SortBag
static const atermpp::function_symbol PRESInfimum
static const atermpp::function_symbol PBEqnSpec
static const atermpp::function_symbol PRESFalse
static const atermpp::function_symbol ActOr
static const atermpp::function_symbol DataEqnSpec
static const atermpp::function_symbol PRESConstantMultiply
static const atermpp::function_symbol UntypedIdentifierAssignment
static const atermpp::function_symbol PRESConstantMultiplyAlt
static const atermpp::function_symbol UntypedSetBagComp
static const atermpp::function_symbol StateSupremum
static const atermpp::function_symbol PBEqn
static const atermpp::function_symbol UntypedSortUnknown
static const atermpp::function_symbol PRESSum
static const atermpp::function_symbol PRESAnd
static const atermpp::function_symbol RegNil
static const atermpp::function_symbol LMerge
static const atermpp::function_symbol Tau
Checks if a node is the binary operation '&&'.
is_and_node(const parser_table &table_)
Checks if a node is of type 'x && (y || z)'.
const parser_table & table
is_and_or_node(const parser_table &table_)
bool operator()(const parse_node &x)
Checks if a node is the binary operation op.
bool operator()(const parse_node &x)
const parser_table & table
is_binary_operator_node(const parser_table &table_, const std::string &op_)
Checks if a node is of type 'x ||_ (y || z)'.
const parser_table & table
is_left_merge_merge(const parser_table &table_)
bool operator()(const parse_node &x)
Checks if a node is the left merge operation '||_'.
is_left_merge_node(const parser_table &table_)
Checks if a node is the merge operation '||'.
is_merge_node(const parser_table &table_)
Checks if a node is the binary operation '||'.
is_or_node(const parser_table &table_)
parse_node child(int i) const
std::string add_context(const std::string &message) const
bool operator()(const parse_node &node) const
collector(const parser_table &table_, const std::string &type_, Container &container_, const Function &f_)
const parser_table & table
set_collector(const parser_table &table_, const std::string &type_, SetContainer &container_, const Function &f_)
bool operator()(const parse_node &node) const
const parser_table & table
visitor(const parser_table &table_, const std::string &type_, const Function &f_)
const parser_table & table
bool operator()(const parse_node &node) const
std::string symbol_name(const parse_node &node) const
parser_actions(const parser &parser_)
void traverse(const parse_node &node, const Function &f) const
set_collector< SetContainer, Function > make_set_collector(const parser_table &table, const std::string &type, SetContainer &container, const Function &f) const
visitor< Function > make_visitor(const parser_table &table, const std::string &type, const Function &f) const
collector< Container, Function > make_collector(const parser_table &table, const std::string &type, Container &container, const Function &f) const
Wrapper for D_ParserTables.
std::string symbol_name(const parse_node &node) const
std::string symbol_name(unsigned int i) const
Wrapper for D_Parser and its corresponding D_ParserTables.
void print_node(std::ostream &out, const parse_node &node) const
parse_node parse(const std::string &text, unsigned int start_symbol_index=0, bool partial_parses=false)
Parses a string. N.B. The user is responsible for destruction of the returned value by calling destro...
const parser_table & symbol_table() const
parser(D_ParserTables &tables, D_AmbiguityFn ambiguity_fn=nullptr, D_SyntaxErrorFn syntax_error_fn=nullptr, std::size_t max_error_message_count=1)
unsigned int start_symbol_index(const std::string &name) const
void apply(T &result, const argument_type &x)
Builder< update_apply_builder< Builder, Function > > super
update_apply_builder(const Function &f)
void apply(T &result, const data::bag_comprehension &x)
void apply(T &result, const data::machine_number &x)
void apply(T &result, const data::untyped_identifier_assignment &x)
void apply(T &result, const data::assignment_expression &x)
void apply(T &result, const data::untyped_set_or_bag_comprehension &x)
void apply(T &result, const data::untyped_identifier &x)
void apply(T &result, const data::data_equation &x)
void apply(T &result, const data::function_symbol &x)
void apply(T &result, const data::assignment &x)
void apply(T &result, const data::abstraction &x)
void apply(T &result, const data::forall &x)
void apply(T &result, const data::untyped_data_parameter &x)
void apply(T &result, const data::exists &x)
void apply(T &result, const data::where_clause &x)
void apply(T &result, const data::application &x)
void apply(T &result, const data::variable &x)
void apply(T &result, const data::data_expression &x)
void apply(T &result, const data::set_comprehension &x)
void apply(T &result, const data::lambda &x)
Maintains a multiset of bound data variables during traversal.
void decrease_bind_count(const assignment_list &assignments)
void leave(const data::exists &x)
void enter(const data::forall &x)
void leave(const data::forall &x)
void leave(const data::data_equation &x)
void enter(const data::set_comprehension &x)
core::add_binding< Builder, Derived, variable > super
void enter(const data::data_equation &x)
void leave(const data::set_comprehension &x)
void enter(const data::exists &x)
void leave(const data::bag_comprehension &x)
void enter(const data::lambda &x)
void leave(const data::untyped_set_or_bag_comprehension &x)
void increase_bind_count(const assignment_list &assignments)
void enter(const data::bag_comprehension &x)
void leave(const data::lambda &x)
void enter(const data::untyped_set_or_bag_comprehension &x)
void enter(const data::where_clause &x)
void leave(const data::where_clause &x)
add_data_variable_binding< Builder, Derived > super
void apply(T &result, const data::where_clause &x)
add_data_variable_binding< Builder, Derived > super
void apply(const data::where_clause &x)
void apply(T &result, const data::assignment &x)
void apply(T &result, const data::set_comprehension &x)
void apply(T &result, const data::structured_sort_constructor_argument &x)
void apply(T &result, const data::container_sort &x)
void apply(T &result, const data::alias &x)
void apply(T &result, const data::exists &x)
void apply(T &result, const data::machine_number &x)
void apply(T &result, const data::function_symbol &x)
void apply(T &result, const data::untyped_possible_sorts &x)
void apply(T &result, const data::forall &x)
void apply(T &result, const data::basic_sort &x)
void apply(T &result, const data::data_equation &x)
void apply(T &result, const data::untyped_sort &x)
void apply(T &result, const data::abstraction &x)
void apply(T &result, const data::application &x)
void apply(T &result, const data::variable &x)
void apply(T &result, const data::structured_sort &x)
void apply(T &result, const data::untyped_identifier_assignment &x)
void apply(T &result, const data::untyped_data_parameter &x)
void apply(T &result, const data::function_sort &x)
void apply(T &result, const data::untyped_identifier &x)
void apply(T &result, const data::structured_sort_constructor &x)
void apply(T &result, const data::lambda &x)
void apply(T &result, const data::untyped_set_or_bag_comprehension &x)
void apply(T &result, const data::where_clause &x)
void apply(T &result, const data::assignment_expression &x)
void apply(T &result, const data::data_expression &x)
void apply(T &result, const data::sort_expression &x)
void apply(T &result, const data::untyped_sort_variable &x)
void apply(T &result, const data::bag_comprehension &x)
void apply(T &result, const data::abstraction &x)
void apply(T &result, const data::application &x)
void apply(T &result, const data::untyped_data_parameter &x)
void apply(T &result, const data::untyped_identifier &x)
void apply(T &result, const data::data_expression &x)
void apply(T &result, const data::assignment_expression &x)
void apply(T &result, const data::where_clause &x)
void apply(T &result, const data::forall &x)
void apply(T &result, const data::function_symbol &x)
void apply(T &result, const data::exists &x)
void apply(T &result, const data::lambda &x)
void apply(T &result, const data::variable &x)
void apply(T &result, const data::assignment &x)
void apply(T &result, const data::untyped_identifier_assignment &x)
void apply(T &result, const data::untyped_set_or_bag_comprehension &x)
void apply(T &result, const data::set_comprehension &x)
void apply(T &result, const data::bag_comprehension &x)
void apply(T &result, const data::machine_number &x)
void apply(T &result, const data::data_equation &x)
Tests if a term is a sort, and if it is equal to s.
bool operator()(const atermpp::aterm &t) const
compare_sort(sort_expression s_)
bool operator()(Term2 t) const
Function call operator.
compare_term(const Term &t)
Function object that determines if a term is equal to a given data variable.
compare_variable(const variable &v)
data_expression make_untyped_set_or_bag_comprehension(const variable &v, const data_expression &x) const
data::variable_list parse_VarsDeclList(const core::parse_node &node) const
data::data_expression_list parse_DataExprList(const core::parse_node &node) const
data_expression make_list_enumeration(const data_expression_list &x) const
data_expression make_function_update(const data_expression &x, const data_expression &y, const data_expression &z) const
data_expression make_set_enumeration(const data_expression_list &x) const
data::sort_expression_list get_sorts(const ExpressionContainer &x) const
data_expression_actions(const core::parser &parser_)
bool callback_VarsDecl(const core::parse_node &node, variable_vector &result) const
data::variable parse_VarDecl(const core::parse_node &node) const
data::untyped_identifier_assignment parse_Assignment(const core::parse_node &node) const
data::data_expression parse_DataValExpr(const core::parse_node &node) const
data::data_expression_list parse_BagEnumEltList(const core::parse_node &node) const
data::untyped_identifier_assignment_list parse_AssignmentList(const core::parse_node &node) const
data_expression make_bag_enumeration(const data_expression_list &x) const
data::data_expression parse_DataExprUnit(const core::parse_node &node) const
data::data_expression parse_DataExpr(const core::parse_node &node) const
bool callback_IdsDecl(const core::parse_node &node, function_symbol_vector &result) const
data::variable_list parse_GlobVarSpec(const core::parse_node &node) const
data_specification_actions(const core::parser &parser_)
data::function_symbol_vector parse_MapSpec(const core::parse_node &node) const
data::data_equation_vector parse_EqnDeclList(const core::parse_node &node, const variable_list &variables) const
data::variable_list parse_VarSpec(const core::parse_node &node) const
std::vector< atermpp::aterm > parse_SortDeclList(const core::parse_node &node) const
untyped_data_specification parse_DataSpec(const core::parse_node &node) const
bool callback_SortDecl(const core::parse_node &node, std::vector< atermpp::aterm > &result) const
data::data_equation_vector parse_EqnSpec(const core::parse_node &node) const
data::function_symbol_vector parse_IdsDeclList(const core::parse_node &node) const
bool callback_DataSpecElement(const core::parse_node &node, untyped_data_specification &result) const
bool callback_EqnDecl(const core::parse_node &node, const variable_list &variables, data_equation_vector &result) const
std::vector< atermpp::aterm > parse_SortSpec(const core::parse_node &node) const
data::function_symbol_vector parse_ConsSpec(const core::parse_node &node) const
bool operator()(const function_symbol &c) const
Function call operator.
function_symbol_has_name(std::string const &name)
normalize_sorts_function(const sort_specification &sort_spec)
sort_expression operator()(const sort_expression &e) const
Normalise sorts.
const std::map< sort_expression, sort_expression > & m_normalised_aliases
data::structured_sort_constructor parse_ConstrDecl(const core::parse_node &node) const
data::sort_expression parse_SortExpr(const core::parse_node &node, data::sort_expression_list *product=nullptr) const
data::structured_sort_constructor_list parse_ConstrDeclList(const core::parse_node &node) const
data::sort_expression_list parse_SortProduct(const core::parse_node &node) const
data::sort_expression_list parse_SortExpr_as_SortProduct(const core::parse_node &node) const
data::structured_sort_constructor_argument_list parse_ProjDeclList(const core::parse_node &node) const
sort_expression_actions(const core::parser &parser_)
data::structured_sort_constructor_argument parse_ProjDecl(const core::parse_node &node) const
bool operator()(const sort_expression &s) const
Function call operator.
sort_has_name(std::string const &name)
Function object that returns the sort of a data expression.
sort_expression operator()(const Expression &e) const
Function call operator.
Function object that returns the name of a data variable.
core::identifier_string operator()(const variable &v) const
Function call operator.
sort_expression operator()(structured_sort_constructor_argument const &s) const
data_specification construct_data_specification() const
std::size_t operator()(const atermpp::aterm &t) const
std::size_t operator()(const atermpp::detail::reference_aterm< T > &t) const
std::size_t operator()(const mcrl2::data::container_type &v) const
std::size_t operator()(const mcrl2::data::data_expression &v) const
std::size_t operator()(const mcrl2::data::function_sort &v) const
std::size_t operator()(const mcrl2::data::sort_expression &x) const
std::size_t operator()(const mcrl2::data::variable &v) const