From 8aff938f7143ddff7c367ab12dc18b1777a5ff57 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Marko=20Dimja=C5=A1evi=C4=87?= Date: Mon, 27 Jan 2020 21:42:17 +0100 Subject: [PATCH] Denotational: remove a double 'to' --- src/plfa/part3/Denotational.lagda.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/plfa/part3/Denotational.lagda.md b/src/plfa/part3/Denotational.lagda.md index a215c2d7..146a23be 100644 --- a/src/plfa/part3/Denotational.lagda.md +++ b/src/plfa/part3/Denotational.lagda.md @@ -27,7 +27,7 @@ would seem that we would need infinitely long tables to represent functions. Second, in the lambda calculus, functions can be applied to functions. They can even be applied to themselves! So it would seem that the tables would contain cycles. One might start to worry that -advanced techniques are necessary to to address these issues, but +advanced techniques are necessary to address these issues, but fortunately this is not the case! The first problem, of functions with infinite domains, is solved by