AccelerateHS / AccelerateHS/accelerate-backend-kit

Expand SizeAnalysis into a full simplifier pass

オープン
#12 コメント 0 件 リアクション 0 件 担当者 0 名 GitHub で見る
主要言語
Haskell
スター
16
フォーク
2
PR マージ指標
30日以内にマージされた PR はありません

説明

I can't think of a good way to separate these two. This pass should do standard partial evaluation / delta-reduction, and should also label the known sizes that result.

Right now it only gets the easy stuff. It should be hooked up to the interpreter so that it can go further.

In fact, we should find that the combinator-based representation of arrays should be better for static evaluation. For example, lookups into arrays created by `generate` should often be statically computable if that is needed to compute the shape of something else. [Still, we have to avoid executing the whole Accelerate program, because it actually is a complete, ready-to-run program.]

The other thing to be careful of is that we need to preclude having an effective caching system to avoid recompilation.

コントリビューションガイド

このリポジトリのコントリビューションガイドは索引されていません

評価

この issue はまだ評価されていません。

新しい issue をメールで受け取る

初心者向けの GitHub issue を短くまとめたダイジェスト。