hasufell/haskell-lectures
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Move call-by-need question zo laziness

Browse Source
This commit is contained in:
Julian Ospald 2015-04-29 22:11:00 +02:00
parent 4f138f5995
commit 7ea86009d9
No known key found for this signature in database
GPG Key ID: 220CD1C5BDEED020
2 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
VL1/content/VL1_what_does_lazy_mean.tex
View File

@ -4,4 +4,7 @@
\item \ifger{unendliche Datenstrukturen sind möglich, sowohl rekursive als auch nicht-rekursive}{infinite data structures are now possible (recursive and non-recursive)}
\item \ifger{neue Kontrollstrukturen können sehr leicht durch Definieren von Funktionen erzeugt werden, wir benötigen nicht unbedingt if-then-else}{defining new control structures by just defining a function (since not everything is evaluated... who needs if-then-else anyway?)}
\item \ifger{sehr wichtig für die Programmierung mit Komposition (z.b. Funktionskomposition) und Effizienz}{important for compositional programming and efficiency}
\end{itemizep}
\end{itemizep}
\slidep
\vspace{\baselineskip}
\ifger{Frage:}{Question:} call-by-value? call-by-reference? call-by-need?

5
VL1/content/VL1_what_does_pure_mean.tex
View File

@ -13,7 +13,4 @@
\item \ifger{Parallelisierung}{parallelism}
\item \ifger{Denken in Gleichungen und hohes Refactoring-Potenzial}{equational reasoning and refactoring}
\item \ifger{weniger Bugs!}{less bugs!}
\end{itemizep}
\slidep
\vspace{\baselineskip}
\ifger{Frage:}{Question:} call-by-value? call-by-reference? call-by-need?
\end{itemizep}