AI Chat AI Image Generator AI Video Text to Speech

Properties of Normalization for a math based intermediate representation

05/24/2017

∙

by Charisee Chiw, et al.

∙

∙

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.

Charisee Chiw
3 publications
John Reppy
5 publications

page 1

page 2

page 3

page 4

research

∙ 02/21/2023

A Deforestation of Reducts: Refocusing

In a small-step semantics with a deterministic reduction strategy, refoc...

0 Olivier Danvy, et al. ∙

research

∙ 11/19/2019

Failure of Normalization in Impredicative Type Theory with Proof-Irrelevant Propositional Equality

In type theory with an impredicative universe of propositions and a proo...

0 Andreas Abel, et al. ∙

research

∙ 10/19/1998

General Theory of Image Normalization

We give a systematic, abstract formulation of the image normalization me...

0 Stephen L. Adler, et al. ∙

research

∙ 07/18/2022

Easy Batch Normalization

It was shown that adversarial examples improve object recognition. But w...

0 Arip Asadulaev, et al. ∙

research

∙ 05/10/2017

TSFC: a structure-preserving form compiler

A form compiler takes a high-level description of the weak form of parti...

0 Miklós Homolya, et al. ∙

research

∙ 04/26/2016

Scale Normalization

One of the difficulties of training deep neural networks is caused by im...

0 Henry Z. Lo, et al. ∙

research

∙ 09/08/2020

On Architecture to Architecture Mapping for Concurrency

Mapping programs from one architecture to another plays a key role in te...

0 Soham Chakraborty, et al. ∙