AngouriMath.Core.Compilation
Classes within the AngouriMath.Core.Compilation namespace
Binders
Summary
The calculus nodes and the binders -- a derivative, an integral, a limit, a sum, a product, an extremum over a
set, a lambda and its application -- have no compiled form, and both compilers refuse them alike. Each is
computed by evaluation, which compiling them would have to repeat at every call, as slowly as evaluating; so the
caller evaluates once and compiles what comes back. The LINQ compiler reached the bound variable first and said
it was not among the arguments, which named the symptom rather than the node.
https://github.com/asc-community/AngouriMath/issues/2195
CompiledMembership
Summary
A membership written, for the compilers, as the statement it makes about its element; the set is fixed
when the expression is compiled, so only the element is computed. In a union, an intersection or a
difference, Kleene's connectives of the memberships in its sides, as evaluation decides them; in an
interval, the element real and between the ends; in a finite set, equal to one of its members; and in a
conditional set, the set's predicate of it. A membership in a set of numbers is left, for each compiler to
compile itself, and one in any other set, or with any other set inside, is left as written, which neither
compiles.
https://github.com/asc-community/AngouriMath/issues/2195
ComplexBranches
Summary
The branches the compilers take where Complex takes a
different one from the rest of the library. Everything here is answering the same
question: what does Evaled give?
RealOnly
Summary
The operations that are defined on the reals and not on the complex numbers, for the
compiler that carries every value as a Complex whether it
is real or not.
RealProducts
Summary
The product, the quotient and the power of two numbers carried as Complex, real where both
are real. Complex forms the product's imaginary part asa.Re b.Im + a.Im b.Re ,
which is∞ · 0 ,NaN , where a real factor is infinite, so a compiled-x at+oo was
(-∞, NaN) , a value with no imaginary part at all, where evaluation gives-oo .
https://github.com/asc-community/AngouriMath/issues/2222
StatementPositions
Summary
Where a statement may stand in an expression that is compiled: at the root, as an operand of a connective, on
both sides of an equality of statements, in an Iverson bracket, as a provided's or a piecewise's value or
predicate, and in a set or a quantifier. Anywhere a number is expected a statement has no value, as evaluation
leavessin(True) as written; FastExpression, which carries a statement as its truth value, answered
sin(1) . Its truth value as a number isiverson 's, and a statement anywhere else is refused, by
both compilers alike.
https://github.com/asc-community/AngouriMath/issues/2227
Angouri © 2019-2026 · Project's repo · Site's repo · Octicons · Transparency · 6018 pages online