S.Y. Lee

> It suffices now to choose numeric values of a0, a1 and a2 to make each irreducible factor have a given sign and then count the roots numerically in each...

I think that it may be significantly difficult problem for the cases where there are multiple parameters involved, such as finding sample points for $a_0, a_1, a_2$ as described above....

> I don't know how important that really is but it prevents representing the transfer function in the natural standard form for rational functions in symbolic computing which is a...

`topological_sort` has limitation that it doesn't work for cyclic problems. `strongly_connected_components` may take in place of `topological_sort` such that we can topologically sort for blocks of cyclic substitutions. However, I...

I think that there are problems seen in the tests ``` f(x) / / | | | b(y) | c(x) | ---- d(_y) = C1 + | ---- dx |...

Unfortunately, I still see some problems for types if one operand is signed and the other operand is unsigned I found this from specification: > One operand can be signed...

I expect something like ``` defn("float", [arg('float'), inarg('float'), outarg('float')], (x, y, z) => [...]) ```

And also, simple type like `export type Arg = { type: A, id?: string, tag: 'arg' };` could be better if we just expect users to use factories like above...

> I often come to the conclusion that my time is better spent on more useful things... at least until there's a more obvious way forward. Unfortunately, I'm unclear about...

> I was (still am) genuinely interested in learning more abour your use case(s), since it would help me to better understand how you're intending to use this package (and...