From 32fbd0340fc947fbf989eb972a7ff283bb776dd4 Mon Sep 17 00:00:00 2001 From: Ian Voysey Date: Mon, 10 Oct 2016 12:36:57 -0400 Subject: [PATCH] words --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index c2685dd..a87b091 100644 --- a/README.md +++ b/README.md @@ -263,7 +263,7 @@ Assumptions and Representation Decisions into a lemma; the rest are just repeated in place. - The paper text does not specify exactly what the base type `num` is. In - the mechanization we unary natural numbers, specifically the type + the mechanization we use unary natural numbers, specifically the type `Nat`. The only property that we require of `num` is that equality be decidable, so another choice would have been to abstract the rules over anything that happens to have decidable equality--and maybe anything that