2011/02/15 by Kristoffer H. Rose
Computer Science · Mathematics · #Bootstrapping (finance) #Compiler #Compiler construction #Compiler correctness #Computer science #Executable #Formal Methods in Verification #Logic, programming, and type systems #Mathematics #Operating system #Parallel Computing and Optimization Techniques #Parsing #Programming language #Rewriting #XML #XML database #XQuery #cs.LO #cs.PL
paper · pdf · doi:10.4204/eptcs.49.3
published in Electronic Proceedings in Theoretical Computer Science 49, 31-45 (Open Publishing Association) · In Proceedings HOR 2010, arXiv:1102.3465
openalex publication_date 2011/02/15 · arxiv created 2011/02/18 · arxiv updated 2011/02/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06
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).