![]() ![]() Polyhedral optimization in particular goes quite far, since it tackles nested loops too, and restructures nested loops not only to achieve vectorization and parallelization, but also to improve cache locality. There is great compiler research on vectorization and parallelization in the imperative world, and they're not "boring" nor "dead". ![]() Haskell is not the only place where people are doing this kind of research. Optimizations in C are considered well-known, well-researched territory (read: "boring").Īs a counter-example, I provided polyhedral optimization. Ask a question on Haskell Stack Overflow.The Haskell programming language community.ĭaily news and info about all things Haskell related: practical stuff, theory, types, libraries, jobs, patches, releases, events and conferences and more. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |