On 12 Feb 2015 15:11, "Jonathan S. Shapiro" <[email protected]> wrote: > > On Thu, Feb 12, 2015 at 12:33 AM, Keean Schupke <[email protected]> wrote: >> >> To me, (f x y) and ((f x) y) are the same thing, in both cases f :: a -> b -> c where the types of a, b, and c are inferred. > > Sure. But the difference between theory and practice is that in theory there is no difference between theory and practice, while in practice there is. > > Mathematically, those two are the same. But from the practical standpoint of deciding how to pass arguments in a non-whole-program compiler, they are most definitely different. >
But you can assume whole program if you have types at the module boundary, and the main program is a module. Keean. _______________________________________________ > bitc-dev mailing list > [email protected] > http://www.coyotos.org/mailman/listinfo/bitc-dev >
_______________________________________________ bitc-dev mailing list [email protected] http://www.coyotos.org/mailman/listinfo/bitc-dev
