~ chicken-core (chicken-5) 3018776b6ca20ef7185a344b217c288b6d6e0974

commit 3018776b6ca20ef7185a344b217c288b6d6e0974
Author:     Evan Hanson <evhan@foldling.org>
AuthorDate: Wed May 21 09:09:15 2014 +1200
Commit:     Evan Hanson <evhan@foldling.org>
CommitDate: Wed May 21 09:09:15 2014 +1200

    Sync manual/Types with wiki, and some nitpicky faq grammar tweaks

diff --git a/manual/Types b/manual/Types
index 8d6bc07e..b2861f6c 100644
--- a/manual/Types
+++ b/manual/Types
@@ -24,6 +24,9 @@ efficient code by omitting unnecessary type-checks.
 CHICKEN provides an intra-procedural flow-analysis pass and two
 compiler options for using type-information in this manner:
 
+{{-scrutinize}} will look for possibly incorrectly typed arguments to
+library procedure calls and generate warnings in such cases.
+
 {{-specialize}} will replace certain generic library procedure calls
 with faster type-specific operations.
 
@@ -101,7 +104,7 @@ or {{:}} should follow the syntax given below:
 <tr><td>{{(struct STRUCTURENAME)}}</td><td>record structure of given kind</td></tr>
 <tr><td>{{(procedure [NAME] (VALUETYPE ... [#!optional VALUETYPE ...] [#!rest [VALUETYPE]]) . RESULTS)}}</td><td>procedure type, optionally with name</td></tr>
 <tr><td>{{(VALUETYPE ... [#!optional VALUETYPE ...] [#!rest [VALUETYPE]] -> . RESULTS)}}</td><td>alternative procedure type syntax</td></tr>
-<tr><td>{{(VALUETYPE ... [#!optional VALUETYPE ...] [#!rest [VALUETYPE]] --> . RESULTS)}}</td><td>procedure type that is declared to modify locally held state</td></tr>
+<tr><td>{{(VALUETYPE ... [#!optional VALUETYPE ...] [#!rest [VALUETYPE]] --> . RESULTS)}}</td><td>procedure type that is declared not to modify locally held state</td></tr>
 <tr><td>{{(VALUETYPE -> VALUETYPE : VALUETYPE)}}</td><td>predicate procedure type</td></tr>
 <tr><td>{{(forall (TYPEVAR ...) VALUETYPE)}}</td><td>polymorphic type</td></tr>
 <tr><td>COMPLEXTYPE</td><td></td></tr>
@@ -310,7 +313,7 @@ compilation.
 
 ===== compiler-typecase
 
-<syntax>(compiler-typecase EXP (TYPE BODY ... [(else BODY ...)]) ...)</syntax>
+<syntax>(compiler-typecase EXP (TYPE BODY ...) ... [(else BODY ...)])</syntax>
 
 Evaluates {{EXP}} and executes the first clause which names a type that
 matches the type inferred during flow analysis as the result of {{EXP}}.
diff --git a/manual/faq b/manual/faq
index e53fdf37..08946274 100644
--- a/manual/faq
+++ b/manual/faq
@@ -18,7 +18,7 @@ for the existence of CHICKEN are:
 
 * CHICKEN is portable because it generates C code that runs on a large number of platforms.
 
-* CHICKEN is extendable, since its code generation scheme and runtime system/garbage collector fits neatly into a C environment.
+* CHICKEN is extensible, since its code generation scheme and runtime system/garbage collector fits neatly into a C environment.
 
 * CHICKEN is free and can be freely distributed, including its source code.
 
@@ -720,9 +720,9 @@ Compile the program that uses the module:
 
 ==== Why is my program which uses regular expressions so slow?
 
-The regular expression engine has recently be replaced by [[http://wiki.call-cc.org/users/alex shinn|alex shinn]]'s excellent
+The regular expression engine has recently been replaced by [[http://wiki.call-cc.org/users/alex shinn|alex shinn]]'s excellent
 {{irregex}} library, which is fully implemented in Scheme. Precompiling regular
-expressions to internal form is somewhat slower than with the old PCRE-based
+expressions to internal forms is somewhat slower than with the old PCRE-based
 regex engine. It is advisable to use {{irregex}} to precompile regular expressions
 outside of time-critical loops and use them where performance matters.
 
@@ -731,8 +731,8 @@ outside of time-critical loops and use them where performance matters.
 
 ==== Why does a loop that doesn't {{cons}} still trigger garbage collections?
 
-Under CHICKENs implementation policy, tail recursion is achieved simply by avoiding
-to return from a function call. Since the programs are CPS converted, a continuous 
+Under CHICKEN's implementation policy, tail recursion is achieved simply by avoiding
+returns from function calls. Since the programs are CPS converted, a continuous
 sequence of nested procedure calls is performed. At some stage the stack-space has
 to run out and the current procedure and its parameters (including the current
 continuation) are stored somewhere in the runtime system. Now a minor garbage collection