Fix typos; MasterDuke++

Author: zoffixznet

doc/Language/glossary.pod6

@@ -758,7 +758,7 @@ In English language, L<reify means|http://www.dictionary.com/browse/reify> to
 similar, in that conceptual things, like "elements of an infinite list" get
 I<reified> when you try to operate on some of them:
 
-    # A list containing innfinite number of unreified Fibonacci numbers:
+    # A list containing infinite number of unreified Fibonacci numbers:
     my @fibonacci = 1, 1, * + * … ∞;
 
     # We reify 10 of them, looking up the first 10 of them with array index:
@@ -812,12 +812,12 @@ already-reified elements from the L<Seq>'s cache.
 
 Note that above we assigned the C<gather> to a L<Scalar> container (the C<$>
 sigil), not the L<Positional> one (the C<@> sigil). The reason is that the
-C<@>-sigiled variables are I<mostly lazy>. What this means is their
+C<@>-sigiled variables are I<mostly lazy>. What this means is they
 I<reify the stuff assigned to them> right away I<most of the time>. The only
 time they don't do it is when the items are known to be
 L«C<is-lazy>|/routine/is-lazy», like our sequence generated with infinity as the
-end point. We we to assign the C<gather> to a C<@>-variable, the C<say> statements
-inside of it would've been printed right away.
+end point. Were we to assign the C<gather> to a C<@>-variable, the C<say>
+statements inside of it would've been printed right away.
 
 Another way to fully-riefy a list, is by calling L«C<.elems>|/routine/elems» on
 it. This is the reason why checking whether a list contains any items is best

doc/Language/traps.pod6

@@ -22,7 +22,7 @@ language.
 
 =head2 Constants are Compile Time
 
-Constants are computed at compile time, so if use them in modules keep in mind
+Constants are computed at compile time, so if you use them in modules keep in mind
 their values will be frozen due to pre-compilation:
 
     # WRONG (most likely):