dedekind::sets::Total< X > Struct Template Reference

The totality algebra at the points X: a node is total when its legs are, and an operator when it is admitted on its carrier (admits, the gate the value algebra enforces: total there, or dividing by a nonzero constant), an applied arrow when the arrow is total and its argument already has the arrow's domain (a conversion may fail). A predicate the grammar does not know is not certified. More...

Public Member Functions
template<typename Leaf>
constexpr std::bool_constant< IsTerm< Leaf > >	operator() (const Leaf &) const
template<typename Op, typename A, typename B, typename RA, typename RB>
constexpr auto	operator() (const BinOp< Op, A, B > &, RA, RB) const
template<typename F, typename A, typename R>
constexpr auto	operator() (const Ap< F, A > &, R) const
template<typename Node, typename... R>
constexpr std::bool_constant<(R::value &&...)>	operator() (const Node &, R...) const

Detailed Description

template<typename X>
struct dedekind::sets::Total< X >

The totality algebra at the points X: a node is total when its legs are, and an operator when it is admitted on its carrier (admits, the gate the value algebra enforces: total there, or dividing by a nonzero constant), an applied arrow when the arrow is total and its argument already has the arrow's domain (a conversion may fail). A predicate the grammar does not know is not certified.

terms__Formal_Verification

Template Parameters

X	the point type.

---

The documentation for this struct was generated from the following file:

• src/main/modules/dedekind/sets/terms.cppm