added TASTY reference, better generation of first sequence

Author: rssh

notes/techreport.bib

@@ -13,6 +13,12 @@ @ONLINE{SIP22
     year = {2013}
 }
 
+@ONLINE{TASTY,
+    author = {Martin Odersky, Dmitry Petrashko, Eugene Burmako},
+    title = {TASTY Reference Manual},
+    url = {https://docs.google.com/document/d/1h3KUMxsSSjyze05VecJGQ5H2yh7fNADtIf3chD3_wr0/},
+    year = {2016}
+}
 
 @ONLINE{scala-gopher,
     author = {Ruslan Shevchenko},

notes/techreport.pdf

@@ -41,7 +41,7 @@ \section{Introduction}
     val in = makeChannel[Int]()
     val out = makeChannel[Int]()
     go {
-      for(i <- 1 to n*n) out.write(i)
+      for(i <- 1 to Int.MaxValue) out.write(i)
     }
     go {
       select.fold(in){ (ch,s) =>
@@ -106,7 +106,7 @@ \subsection{Go: Translations of hight-order functions to asynchronous form.}
    (1 to n).mapAsync(i => out.aread)
 \end{Verbatim}
 
- Using this approach allows overcoming the inconvenience of async/await by allowing programmers use hight-order functions API inside asynchronous expression. Also, it is theoretically possible to generate asynchronous variants of API methods by transforming TASTY representation of AST of synchronous versions. Thr similar technique is implemented in Nim \cite{Nim} programming language, where we can to generate both synchronious and asynchronious variants of a function from one definition.
+ Using this approach allows overcoming the inconvenience of async/await by allowing programmers use hight-order functions API inside asynchronous expression. Also, it is theoretically possible to generate asynchronous variants of API methods by transforming TASTY\cite{TASTY} representation of AST of synchronous versions. Thr similar technique is implemented in Nim \cite{Nim} programming language, where we can to generate both synchronious and asynchronious variants of a function from one definition.
 
  \item do transformation of defer statement. This is just an implementation of error handling mechanism.