From fc517356a78a24b5371a73eca1738ed37bfecde8 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Marko=20Dimja=C5=A1evi=C4=87?= Date: Tue, 12 Mar 2019 21:45:14 +0100 Subject: [PATCH] Lists: updates the definition of a higher-order function --- src/plfa/Lists.lagda | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/plfa/Lists.lagda b/src/plfa/Lists.lagda index 68f0b6c8..b7295a16 100644 --- a/src/plfa/Lists.lagda +++ b/src/plfa/Lists.lagda @@ -468,7 +468,7 @@ Now the time to reverse a list is linear in the length of the list. Map applies a function to every element of a list to generate a corresponding list. Map is an example of a _higher-order function_, one which takes a function as an -argument and returns a function as a result: +argument or returns a function as a result: \begin{code} map : ∀ {A B : Set} → (A → B) → List A → List B map f [] = []