aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorAnton Trunov <trunov@math.tsu.ru>2015-02-28 13:55:55 +0300
committerAnton Trunov <trunov@math.tsu.ru>2015-02-28 13:55:55 +0300
commitc10dcb94671ac3c29e503896396d4a413898f415 (patch)
tree47dac8d0eb4dbd34e4abf2dd7fb8b80de5e480d3
parent1218ce98a40ef243824fed0efce7160a10fe5f36 (diff)
downloadmal-c10dcb94671ac3c29e503896396d4a413898f415.tar.gz
mal-c10dcb94671ac3c29e503896396d4a413898f415.zip
guide: insert missing word
-rw-r--r--process/guide.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/process/guide.md b/process/guide.md
index 734dc32..d8d6db4 100644
--- a/process/guide.md
+++ b/process/guide.md
@@ -15,7 +15,7 @@ So jump right in (er ... start the climb)!
You might already have a language in mind that you want to use.
Technically speaking, mal can be implemented in any sufficiently
-complete programming (i.e. Turing complete), however, there are a few
+complete programming language (i.e. Turing complete), however, there are a few
language features that can make the task MUCH easier. Here are some of
them in rough order of importance: