Manual slightly improved

docs/src/markdown_syntax.txt

@@ -165,7 +165,7 @@ The indentation is removed in the output:
     f x y = let z = (x,y)
              in (z,z)
 
-The visually structure a document, one can also put a line
+To visualize the structure of a document, one can also put a line
 containing only blanks and at least three dashes (stars would also work)
 in the source text:
 

docs/src/overview.tex

@@ -20,10 +20,10 @@ The source code of the Curry program
 must be stored in a file with the suffix \ccode{.curry},
 e.g., \code{prog.curry}. 
 Literate programs must be stored in files with the extension \ccode{.lcurry}.
-They are automatically converted into corresponding
-\ccode{.curry} files by deleting all lines not starting 
-with \ccode{>} and removing the prefix \ccode{> } of the
-remaining lines.
+%They are automatically converted into corresponding
+%\ccode{.curry} files by deleting all lines not starting 
+%with \ccode{>} and removing the prefix \ccode{> } of the
+%remaining lines.
 
 Since the translation of Curry programs with \CYS creates
 some auxiliary files (see Section~\ref{sec-auxfiles} for details),
@@ -60,7 +60,7 @@ typical source of programming errors.
 \CYS translates all \emph{local declarations} into global functions with
 additional arguments (``lambda lifting'', see Appendix~D of the
 Curry language report).
-Thus, in the various run-time systems, the definition of
+Thus, in the compiled target code, the definition of
 functions with local declarations look different from
 their original definition (in order to see the result
 of this transformation, you can use the \cb, see
@@ -69,7 +69,14 @@ Section~\ref{sec-currybrowser}).
 Tabulator stops instead of blank spaces in source files are
 interpreted as stops at columns 9, 17, 25, 33, and so on.
 In general, tabulator stops should be avoided in source programs.
-\item Threads created by a concurrent conjunction are not executed
+\item
+Since PAKCS compiles Curry programs into Prolog programs,
+non-deterministic computations are treated as in Prolog
+by a backtracking strategy, which is known to be incomplete.
+Thus, the order of rules could influence the ability
+to find solutions for a given goal.
+\item
+Threads created by a concurrent conjunction are not executed
 in a fair manner (usually, threads corresponding to leftmost constraints
 are executed with higher priority).
 \item

docs/src/preface.tex

@@ -14,9 +14,13 @@ logic programming (logical variables, partial data structures,
 built-in search), and concurrent programming (concurrent evaluation
 of constraints with synchronization on logical variables).
 Moreover, the \CYS implementation of Curry also supports
+constraint programming over various constraint domains,
 the high-level implementation of distributed applications,
 graphical user interfaces, and web services
 (as described in more detail in \cite{Hanus99PPDP,Hanus00PADL,Hanus01PADL}).
+Since \CYS compiles Curry programs into Prolog programs,
+the availability of some of these features might depend on
+the underlying Prolog system.
 
 We assume familiarity with the ideas and features
 of Curry as described in the Curry language definition \cite{Hanus12Curry}.