Section: New Software and Platforms
CoLoR
CoLoR is Coq library on rewriting theory and termination. It provides many definitions and theorems on various mathematical structures (quasiordered sets, relations, ordered semirings, etc.), data structures (lists, vectors, matrices, polynomials, finite graphs), term structures (strings, firstorder terms, lambdaterms, etc.), transformation techniques (dependency pairs, semantic labeling, etc.) and (non)termination criteria (polynomial and matrix interpretations, recursive path ordering, computability closure, etc.).
In 2015, CoLoR has been enriched and improved in various ways:

The results on computability have been extended to $\eta $reduction.

It has been enriched by a library on finite and infinite sets, and a proof of the infinite Ramsey's theorem [54] .