Some links

Parallel data structures
https://www.addthis.com/blog/2013/04/25/the-secret-life-of-concurrent-data-structures

Algorithm Design: Parallel and Sequential
http://www.parallel-algorithms-book.com/

Types, Semantics and Verification (replace 13 with 05~15)
https://www.cs.uoregon.edu/research/summerschool/summer13/curriculum.html

ScalaSTM
http://nbronson.github.io/scala-stm/

Operational semantics of Scala
http://infoscience.epfl.ch/record/85784/files/EPFL_TH3556.pdf

Denotational design and FRP
http://programmers.stackexchange.com/questions/183867/applying-denotational-semantics-to-design-of-programs

Tricks in solving common programming problems

O(1)-space collision detection

At times, you need to detect for once whether a collision occurs. For example, you may need to enumerate a sequence$$ x_0,\ x_1=f(x_0),\ x_2=f(x_1),\ \dots,\ x_i=f(x_{i-1}),\ \dots $$until either a desired element is found or a cycle is detected. A naive method to detect a cycle requires storing all elements ever enumerated in a hash table. This method however would need to store the entire sequence in the worst case. Instead, you can utilize one of the cycle detection techniques to reduce the space to O(1) at the cost of possibly longer search time.

(more to come...)

Smoothsort Demystified

A very nice article explaining smoothsort!

http://www.keithschwarz.com/smoothsort/