On Saturday, 23 August 2014 04:26:10 UTC+2, jason wrote: > > On 8/21/14, 18:08, Bill Hart wrote: > > In theory, I can do generic programming in Julia that is faster (at > > runtime) than you can do in *any* C compiler. And I don't just mean a > > little bit. I mean a lot. I don't even think the Julia people fully > > realise this yet (I might be wrong about that, I don't know). And it's > > not been realised in practice for many cases. But it is true. > > Are you talking about the sort of things illustrated in this julia issue > with the various macros they talk about? > > https://github.com/JuliaLang/julia/issues/7033 >
That's not an example of what I have in mind, but it is an example of the sort of thing that is possible with type inference and macros. Very nice example. Thanks for pointing it out. (So the Julia developers really do know what they are onto. :-)) > > Thanks, > > Jason > > P.S. I've been following Julia for a while and I'm very intrigued by it. > I've also started keeping an eye on Nemo recently---very interesting! > Cool. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
