MIT researchers built a tool that proves a compiler correct without ever seeing the language before
Automatic Checking of Compiler Correctness with E-Graphs

A POPL 2027 paper from Adam Chlipala's MIT CSAIL group uses e-graphs to automate formal verification of compilers. Given a definition of a new language's compiler, with no annotations written to guide theorem proving, the tool proves it correct on its own — apparently the first general proof-automation system to do so. It builds on Pyrosome, a framework for defining languages and verified compilers modularly, where each feature module is verified in isolation and linked together for free.
It seems to be the first example of a general proof-automation tool that can take in a compiler definition for a new programming language the tool has never seen before, with no extra annotations meant just to guide theorem proving, and prove it correct automatically.