Properties of Normalization for a math based intermediate representation
Programming Languages
2017-05-25 v1
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.
Cite
@article{arxiv.1705.08801,
title = {Properties of Normalization for a math based intermediate representation},
author = {Charisee Chiw and John Reppy},
journal= {arXiv preprint arXiv:1705.08801},
year = {2017}
}