# canonicalization Published articles for canonicalization. This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles. ## MLIR -- Canonicalizers and Declarative Rewrite Patterns DevFeed: [MLIR -- Canonicalizers and Declarative Rewrite Patterns]() Original publisher: [Read original article]() Published: 2023-09-20T08:00:00Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [Code](), [C++](), [Development]() Tags: [c-plus-plus](), [canonicalization](), [compilers](), [complex-numbers](), [declarative](), [deprecated](), [maintenance](), [mathematics](), [mlir](), [polynomials](), [primer](), [programming](), [rewrite](), [tablegen](), [test]() ### AI overview This tutorial explains how to implement general canonicalization patterns in MLIR. It covers both C++ canonicalizers and declarative rewrite rules in TableGen, including an identity-based polynomial rewrite and its testing considerations. ### Source excerpt Table of Contents In a previous article we defined folding functions, and used them to enable some canonicalization and the sccp constant propagation pass for the poly dialect. This time we'll see how to add more general canonicalization patterns. The code for this article is in this pull request, and as usual the commits are organized to be read in order. Why is Canonicalization Needed? MLIR provides folding as a mechanism to simplify an IR, which can result in simpler, more efficient ops (e. ## MLIR -- Verifiers DevFeed: [MLIR -- Verifiers]() Original publisher: [Read original article]() Published: 2023-09-13T09:00:00Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [mlir](), [Code](), [Pull Request]() Tags: [article](), [c-plus-plus](), [canonicalization](), [code](), [compilers](), [mathematics](), [mlir](), [operations](), [pass](), [primer](), [programming](), [pull-request](), [safety](), [types]() ### AI overview This tutorial explains how to add verifiers to an MLIR dialect. Verifiers check that types and operations are well-formed before and after passes, enforcing operation invariants and allowing passes to avoid repeated edge-case checks. It also describes trait-based verification, generated type-checking and inference support, assembly-format simplification, builders, and related test updates. ### Source excerpt Table of Contents Last time we defined folders and used them to enable some canonicalization and the sccp constant propagation pass for the poly dialect. This time we'll add some additional safety checks to the dialect in the form of verifiers. The code for this article is in this pull request, and as usual the commits are organized to be read in order. Purpose of a verifier Verifiers ensure the types and operations in a concrete MLIR program are well-formed. ## MLIR -- Folders and Constant Propagation DevFeed: [MLIR -- Folders and Constant Propagation]() Original publisher: [Read original article]() Published: 2023-09-11T08:00:00Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [Code](), [Computing](), [Pull Request]() Tags: [article](), [c-plus-plus](), [canonicalization](), [code](), [compilers](), [folding](), [heir](), [invariant](), [mathematics](), [mlir](), [process](), [programming]() ### AI overview This tutorial explains how MLIR folding supports sparse conditional constant propagation and canonicalization. It describes adding a constant operation, a materialization hook, and folders for each operation, while distinguishing local canonicalization from propagation through control flow. ### Source excerpt Table of Contents Last time we saw how to use pre-defined MLIR traits to enable upstream MLIR passes like loop-invariant-code-motion to apply to poly programs. We left out -sccp (sparse conditional constant propagation), and so this time we'll add what is needed to make that pass work. It requires the concept of folding. The code for this article is in this pull request, and as usual the commits are organized to be read in order. ## MLIR -- Writing Our First Pass DevFeed: [MLIR -- Writing Our First Pass]() Original publisher: [Read original article]() Published: 2023-08-10T14:39:42Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [mlir](), [Tutorial](), [API](), [Compiler]() Tags: [api](), [canonicalization](), [code](), [compiler](), [compilers](), [implementation](), [llvm](), [mathematics](), [mlir](), [optimize](), [programming](), [tutorial]() ### AI overview This tutorial introduces MLIR pass development through the HEIR project. It explains how to create a custom tool for an out-of-tree MLIR project and implement simple passes, including loop unrolling and instruction replacement, using the MLIR API and pass infrastructure. ### Source excerpt Table of Contents This series is an introduction to MLIR and an onboarding tutorial for the HEIR project. Last time we saw how to run and test a basic lowering. This time we will write some simple passes to illustrate the various parts of the MLIR API and the pass infrastructure. As mentioned previously, the main work in MLIR is defining passes that either optimize part of a program, lower from parts of one dialect to others, or perform various normalization and canonicalization operations.