The goal is to provide a concrete library focused on verification examples, as opposed to mathematics. The library has a good number of theorems for booleans, natural numbers, and lists. It also has trees, tries, vectors, and rudimentary IO. A number of good ideas come from Agda's standard library.

","plain":"The goal is to provide a concrete library focused on verification\nexamples, as opposed to mathematics. The library has a good number of\ntheorems for booleans, natural numbers, and lists. It also has trees,\ntries, vectors, and rudimentary IO. A number of good ideas come from\nAgda's standard library.\n\n","locale":"en_US.UTF-8"},"home-page":"https://github.com/cedille/ial","derivations":[{"system":"x86_64-linux","target":"","derivation":"/gnu/store/ilrhxrkjc1wx52sp8m6bc5ggq3wgv71y-agda-ial-1.5.0.drv"},{"system":"i686-linux","target":"","derivation":"/gnu/store/02iqcqyvg289h93wpk3scalsa4q2m5ix-agda-ial-1.5.0.drv"}]}