This document contains definitions and proofs about natural numbers, functions, and theorems in Coq. It defines natural numbers as inductive types, defines addition as a recursive function, and proves theorems like 1+1=2. It also contains definitions for monads and proofs about monad bind being associative in Coq.Read less
![型理論 なんて自分には関係ないと思っているあなたへ](https://cdn-ak-scissors.b.st-hatena.com/image/square/d86a1cec9b9fc0f8c3140ad18df4da2fc0b0b9f6/height=288;version=1;width=512/https%3A%2F%2Fcdn.slidesharecdn.com%2Fss_thumbnails%2Ftypetheoryforyou-130607022508-phpapp01-thumbnail.jpg%3Fwidth%3D640%26height%3D640%26fit%3Dbounds)