Name
Abstract | ||
|---|---|---|
The Normalization transformation plays a key role in the compilation of Diderot programs. The transformations are complicated and it would be easy for a bug to go undetected. To increase our confidence in normalization part of the compiler we provide a formal analysis on the rewriting system. We proof that the rewrite system is type preserving, value preserving (for tensor-valued expressions), and terminating. |
Year | Venue | Field |
|---|---|---|
2017 | arXiv: Programming Languages | Programming language,Normalization (statistics),Expression (mathematics),Computer science,Theoretical computer science,Compiler,Normalization property,Rewriting,Intermediate language |
DocType | Volume | Citations |
Journal | abs/1705.08801 | 0 |
PageRank | References | Authors |
0.34 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Charisee Chiw | 1 | 27 | 3.29 |
| John H. Reppy | 2 | 899 | 84.36 |