Higher-order Rewriting for Executable Compiler Specifications
Kristoffer H. Rose (IBM T.J. Watson Research Center)
TL;DR
This paper demonstrates how a simple compiler for a language inspired by XQuery can be fully specified using higher-order rewriting across all stages, leveraging the crsx system for a declarative approach.
Contribution
It introduces a comprehensive method for specifying compilers entirely through higher-order rewriting, applied to a small language called 'X' using the crsx system.
Findings
Complete compiler specification using higher-order rewriting
Application to a language inspired by XQuery
Implementation with the crsx system
Abstract
In this paper we outline how a simple compiler can be completely specified using higher order rewriting in all stages: parsing, analysis/optimization, and code emission, specifically using the crsx.sf.net system for a small declarative language called "X" inspired by XQuery (for which we are building a production quality compiler in the same way).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParallel Computing and Optimization Techniques · Logic, programming, and type systems · Formal Methods in Verification