Changeset 86bd8538 for doc/theses/andrew_beach_MMath

Timestamp:

Sep 27, 2021, 9:37:18 AM (3 years ago)

Author:

Andrew Beach <ajbeach@…>

Branches:

ADT, ast-experimental, enum, forall-pointer-decay, master, pthread-emulation, qualifiedEnum

Children:

056cbdb

Parents:

166b384

Message:

Andrew MMath: Hopefully the last updates from the readers.

Location:

doc/theses/andrew_beach_MMath

Files:

• intro.tex (modified) (2 diffs)
• performance.tex (modified) (2 diffs)

doc/theses/andrew_beach_MMath/intro.tex

@@ -280 +280 @@
 standard library function that reports errors this way.
 \begin{lstlisting}[language=C]
-// Make sure to clear the store.
-errno = 0;
 // Now a library function can set the error.
 int handle = open(path_name, flags);
@@ -338 +336 @@
 use the same error type, then it can be implemented with a \code{haskell}{do}
 block.
-\begin{lstlisting}[language=haskell]
+\begin{lstlisting}[language=haskell,literate={}]
 failingFunction x y = do
         z <- helperOne x

doc/theses/andrew_beach_MMath/performance.tex

@@ -39 +39 @@
 On the other hand, the functional equivalents to resumption are too new.
 There does not seem to be any standard implementations in well-known
-languages, so far they seem confined to extensions and research languages.
+languages; so far, they seem confined to extensions and research languages.
 % There was some maybe interesting comparison to an OCaml extension
 % but I'm not sure how to get that working if it is interesting.
@@ -317 +317 @@
 \CFA, \Cpp and Java.
 % To be exact, the Match All and Match None cases.
-The most likely explination is that,
+The most likely explanation is that
 the generally faster languages have made ``common cases fast" at the expense
 of the rarer cases. Since exceptions are considered rare, they are made
 expensive to help speed up common actions, such as entering and leaving try
 statements.
-Python on the other hand, while generally slower than the other languages,
-uses exceptions more and has not scarified their performance.
+Python, on the other hand, while generally slower than the other languages,
+uses exceptions more and has not sacrificed their performance.
 In addition, languages with high-level representations have a much
 easier time scanning the stack as there is less to decode.