Compilers by Higher Order Rewriting of Terms - Workshop: COBRA 2011


First Workshop on Compilers by Rewriting, Automated

COBRA is a new workshop intended to promote research in and collaboration on in the application of rewriting to compilers across academia and industry. We hope to provide a forum for presentation, exchange, and discussion, of directions, developments, and results, as well as surveys, tutorials, experience reports, and proposals, for what is possible in this area!

The basic idea is that rewriting can be used to transform programs, and indeed is used in that many compilers include some kind of rewrite engine to realize optimizations such as algebraic rewrites, SSA tree rewrites, type inference, static reduction, etc. In this workshop it is our hope that focusing on the rewrite transformations as proper rewrite systems with formal rewrite rules can help us understand how we can give access to generic formal rewriting techniques in a way that can be directly exploited by the compiler writer without sacrificing performance and expressiveness of the analyses and transformations.

The first instance of the workshop will take place on Sunday, May 29, 2011, in Novi Sad, Serbia, colocated with the 22nd International Conference on Rewriting Techniques and Applications (RTA 2011) as a satellite event of the Federated Conference on Rewriting, Deduction, and Programming (RDP 2011).