Back to Browse

Partial Maps | Software Foundations in Coq | LF | Lists

1.1K views
Oct 29, 2022
6:13

A partial (or finite) map is defined very much like a list in Coq. The [find] and [update] operations are easy to code with the help of the [option] type. A theorem is proved; it shows that the two operations work together. Textbook: https://clarksmr.github.io/sf-lectures/textbook/lf/toc.html Supporting materials: https://github.com/clarksmr/sf-lectures/tree/main/notes/lf

Download

0 formats

No download links available.

Partial Maps | Software Foundations in Coq | LF | Lists | NatokHD