To what extent does the existence of a grouplaw for adding points depend on the binary operations in the polynomial? For example what if the addition in the polynomial y^2 = ax^3+bx+c is a semigroup/monoid/quasigroup/loop and the multiplication isn't necessarily associative. Will you instead end up with a monoidlaw or looplaw ?

The short answer is that the group law on the set of rational points of an elliptic curve defined by a Weierstrass equation uses all of the structure and properties of a field in an essential way. To even get a welldefined operation, you really need the fact that if a line intersects the curve in two rational points, then it intersects the curve in exactly one more rational point (counting multiplicity). If you are not working over a field, you may have more or fewer than three intersections. It is not hard to write down counterexamples for any particular weakening of the field axioms, but I do not know of a general counterexample schema that works for every nonfield algebraic structure with two binary operations (nor is it clear that such a thing should exist). For the sake of exercise, let us suppose you were working in some bizarre nonfield situation that for miraculous reasons admitted a welldefined operation. You would find that the condition that all three intersection points sum to zero automatically makes the operation commutative, with all elements invertible, so a commutative loop with identity is unavoidable. Associativity is somewhat more complicated to verify in the classical sense, and it is conceivable that in the absence of geometric input of some form (e.g., from theorems like Bezout or RiemannRoch) it can be violated in your context. 

