Changeset a00bc5b for doc

Timestamp:

Jan 13, 2021, 3:43:14 PM (5 years ago)

Author:

Thierry Delisle <tdelisle@…>

Branches:

ADT, arm-eh, ast-experimental, enum, forall-pointer-decay, jacob/cs343-translation, master, new-ast-unique-expr, pthread-emulation, qualifiedEnum

Children:

270bdc8, 402658b1, bb58825

Parents:

97748ee (diff), 101cc3a (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.

Message:

Merge branch 'master' of plg.uwaterloo.ca:software/cfa/cfa-cc

Location:

doc

Files:

• bibliography/pl.bib (modified) (5 diffs)
• theses/andrew_beach_MMath/existing.tex (modified) (3 diffs)
• theses/andrew_beach_MMath/implement.tex (added)
• theses/fangren_yu_COOP_F20/Makefile (added)
• theses/fangren_yu_COOP_F20/Report.tex (added)
• theses/fangren_yu_COOP_S20/Report.tex (modified) (2 diffs)
• theses/fangren_yu_COOP_S20/cfa_developer_reference.pdf (deleted)
• theses/fangren_yu_COOP_S20/figures/DeepNodeSharing.fig.bak (deleted)

doc/bibliography/pl.bib

@@ -990 +990 @@
 }
 
+@techreport{cfa-cc,
+    keywords    = {Cforall, cfa-cc, transpiler},
+    contributer = {pabuhr@plg},
+    title       = {{\textsf{cfa-cc}} Developer's Reference Manual},
+    author      = {Fangren Yu},
+    institution = {School of Computer Science},
+    address     = {University of Waterloo, Waterloo, Ontario, Canada},
+    month       = aug,
+    year        = {2020},
+    note        = {\href{https://cforall.uwaterloo.ca/doc/Fangren_Yu_Report_S20.pdf}{https://\-cforall.uwaterloo.ca/\-doc/\-Fangren\_Yu\_Report\_S20.pdf}},
+}
+
 @article{Moss18,
     keywords    = {type systems, polymorphism, tuples, Cforall},
@@ -1040 +1052 @@
     keywords    = {type system, generic type, resolution algorithm, type environment, Cforall},
     author      = {Aaron Moss},
-    title       = {\textsf{C}$\mathbf{\forall}$ Type System Implementation},
+    title       = {\textsf{C}\,$\mathbf{\forall}$ Type System Implementation},
     school      = {School of Computer Science, University of Waterloo},
     year        = 2019,
@@ -1161 +1173 @@
     keywords    = {ctrie, concurrent map},
     contributer = {a3moss@uwaterloo.ca}, 
-    title       ={Cache-aware lock-free concurrent hash tries},
-    author      ={Prokopec, Aleksandar and Bagwell, Phil and Odersky, Martin},
-    institution ={EPFL},
-    year        ={2011}
+    title       = {Cache-aware lock-free concurrent hash tries},
+    author      = {Prokopec, Aleksandar and Bagwell, Phil and Odersky, Martin},
+    institution = {EPFL},
+    year        = {2011}
 }
 
@@ -3928 +3940 @@
     school      = {School of Computer Science, University of Waterloo},
     year        = 2003,
-    address     = {Waterloo, Ontario, Canada, N2L 3G1},
+    optaddress  = {Waterloo, Ontario, Canada, N2L 3G1},
     note        = {\href{http://plg.uwaterloo.ca/theses/BilsonThesis.pdf}{http://\-plg.uwaterloo.ca/\-theses/\-BilsonThesis.pdf}},
 }
@@ -5210 +5222 @@
 }
 
+@manual{gcc-nested-func,
+    keywords    = {gcc nested functions},
+    contributer = {pabuhr@plg},
+    key         = {gcc nested functions},
+    title       = {Nested Functions},
+    organization= {{gcc} 9.3 Manual},
+    year        = 2019,
+    note        = {\href{https://gcc.gnu.org/onlinedocs/gcc-9.3.0/gcc/Nested-Functions.html}{https://\-gcc.gnu.org/\-onlinedocs/\-gcc-9.3.0/\-gcc/\-Nested-Functions.html}},
+}
+
 @article{Haddon77,
     keywords    = {monitors, nested monitor calls},

doc/theses/andrew_beach_MMath/existing.tex

@@ -83 +83 @@
 the the call site.
 
-As an example, even if no function named \codeCFA{do\_once} is not defined
-near the definition of \codeCFA{do\_twice} the following code will work.
+As an example, even if no function named \codeCFA{do_once} is not defined
+near the definition of \codeCFA{do_twice} the following code will work.
 \begin{lstlisting}
 int quadruple(int x) {
@@ -95 +95 @@
 \end{lstlisting}
 This is not the recommended way to implement a quadruple function but it
-does work. The complier will deduce that \codeCFA{do\_twice}'s T is an
+does work. The complier will deduce that \codeCFA{do_twice}'s T is an
 integer from the argument. It will then look for a definition matching the
-assertion which is the \codeCFA{do\_once} defined within the function. That
-function will be passed in as a function pointer to \codeCFA{do\_twice} and
+assertion which is the \codeCFA{do_once} defined within the function. That
+function will be passed in as a function pointer to \codeCFA{do_twice} and
 called within it.
 
@@ -156 +156 @@
 In \CFA coroutines are created using the \codeCFA{coroutine} keyword which
 works just like \codeCFA{struct} except that the created structure will be
-modified by the compiler to satify the \codeCFA{is\_coroutine} trait.
+modified by the compiler to satify the \codeCFA{is_coroutine} trait.
 
 These structures act as the interface between callers and the coroutine,

doc/theses/fangren_yu_COOP_S20/Report.tex

@@ -56 +56 @@
 
 \title{\Huge
-cfa-cc Developer's Reference
+\lstinline|cfa-cc| Developer's Reference
 }% title
 
@@ -728 +728 @@
 The \CFA compiler sets a limit on assertion depth and reports an error if assertion resolution does not terminate within the limit (as for \lstinline[language=C++]@templates@ in \CC).
 
+\addcontentsline{toc}{section}{\refname}
 \bibliographystyle{plain}
 \bibliography{pl}