We present a type system for strategy languages that express programtransformations as compositions of rewrite rules . Our row-polymorphic typesystem assists compiler engineers to write correct strategies by . statically rejecting compositions of rewrites that otherwise would . otherwise would failduring rewriting at runtime . Furthermore, our type system enables reasoning about how rewriting transforms the shape of the computational program . Wepresent a formalization of our language at its type system and demonstrate its use for expressing . optimization strategies .

Author(s) : Rongxiao Fu, Xueying Qin, Ornela Dardha, Michel Steuwer

Links : PDF - Abstract

Code :
Coursera

Keywords : type - system - rewriting - row - strategies -

Leave a Reply

Your email address will not be published. Required fields are marked *