Slides for my Elm talk at NDC London
My adventure with Elm from Yan Cui Update 24/12/2014: Recording of the session is now available at NDC videos : http://www.ndcvideos.com/#/app/video/3041
Programming
Slides for CodeMesh, BuildStuff and FBy
Here are the slides for my talks at CodeMesh, BuildStuff and Fby this year, enjoy! Modelling game economy with Neo4j from Yan Cui Learn you to tame complex APIs with F#-powered DSLs from Yan Cui
It’s Conference Time!
Winter is upon us, but so is an exciting part of the year when lots of good tech conferences are happening all over the place! CodeMesh was awesome We had a great time at CodeMesh again this year, and enjoyed some amazing sessions from some of the best people in the industry. Don’t worry …
Elm and Myo playing together
I haven’t been able to stop playing around with my Myo armband since I got my hands on it this week. In truth it’s ruined a few of my plans for the weekend, but boy it’s been fun trying to get the Myo working with various apps and games. Elm has also piqued my interest …
Myo – First day of happy hacking!
It’s been a long wait but I have finally got my hands on a Myo armband this week! To start, you need to download and install Myo Connect from here. You need to go through the set up guide, which includes teaching the Myo armband how to classify the EMG readings from your arm …
Project Euler – Problem 68 Solution
Problem Consider the following “magic” 3-gon ring, filled with the numbers 1 to 6, and each line adding to nine. Working clockwise, and starting from the group of three with the numerically lowest external node (4,3,2 in this example), each solution can be described uniquely. For example, the above solution can be described by the …
Project Euler – Problem 64 Solution
Problem All square roots are periodic when written as continued fractions and can be written in the form: For example, let us consider ?23: If we continue we would get the following expansion: The process can be summarised as follows: It can be seen that the sequence is repeating. For conciseness, we use the notation …
Project Euler – Problem 80 Solution
Problem It is well known that if the square root of a natural number is not an integer, then it is irrational. The decimal expansion of such square roots is infinite without any repeating pattern at all. The square root of two is 1.41421356237309504880…, and the digital sum of the first one hundred decimal digits …
Project Euler – Problem 61 Solution
Problem Triangle, square, pentagonal, hexagonal, heptagonal, and octagonal numbers are all figurate (polygonal) numbers and are generated by the following formulae: The ordered set of three 4-digit numbers: 8128, 2882, 8281, has three interesting properties. The set is cyclic, in that the last two digits of each number is the first two digits of the …
F# – Imitating Erlang’s bit syntax for easier binary protocol implementation
Bit Syntax in Erlang One of the often under-appreciated features of Erlang is its Bit Syntax for parsing and pattern matching binary data at a bit level. For instance, to pare TCP segments you can write something along the line of: The same capability can be applied to anything binary protocols, such as video encoding, …
F# – Imitating Erlang’s bit syntax for easier binary protocol implementation Read More »