Agda 2.9.0 is a major release of the dependently typed programming language and proof assistant, combining performance work, new language features, and fixes. Batch type-checking can now run imported modules in parallel with the experimental `-j` option, offering roughly three times the speed on large libraries while potentially doubling peak memory. Other additions include Agda’s availability on WebAssembly, qualified `do` notation, experimental local rewrite rules and unused-import warnings, improved termination checking for copatterns, and advances to automatic term synthesis (“Mimer”). A new Forester backend broadens output options, and the release reports about 60 fixes for inconsistencies, internal errors, and regressions, plus around 130 other issue fixes.
The release also changes configuration and compatibility expectations. Support for GHC 8.8, 8.10, and 9.0 has ended; supported versions now range from 9.2.8 to 9.14.1. New command-line controls cover parallelism, listing options, Markdown and Typst code-block parsing, occurrence analysis, and quotation of terms containing unsolved metavariables. Termination-depth checking now uses iterative deepening, with a higher default limit. Several changes may affect existing projects: the old `ETA` pragma is replaced by `ETA_EQUALITY`, eta-equality is no longer inferred for records, and `erased-matches` now accepts explicit modes that alter defaults and can require code updates. Cubical Agda variants can also be selected more explicitly, and new irrelevance controls are available.
Summary generated by AI from the linked article. hn.today is not affiliated with Hacker News or Y Combinator.