Slides for my Craft-Conf meetup talk on DSLs and F#
Learn you to tame complex APIs with F#-powered DSLs from Yan Cui
F#
Slides from LambdaCon
Phew, finally back in familiar surroundings of London after back-to-back conferences in Italy where I spoke about Elm and F# at CodeMotion Rome and LambdaCon. It was a great couple of days, saw some interesting talks (I’ll write up some summaries later), met some old friends and made new ones. Here are the slides for …
Seven ineffective coding habits many F# programmers don’t have
This post is part of the F# Advent Calendar in English 2014 project. Check out all the other great posts there! Special thanks to Sergey Tihon for organizing this. A good coding habit is an incredibly powerful tool, it allows us to make good decisions with minimal cognitive effort and can be the difference between …
Seven ineffective coding habits many F# programmers don’t have Read More »
Being visually honest with F#
It’s been a busy month, some top quality conferences – Code Mesh, Build Stuff, FuncBy and NDC London – all cramped into the space of 4 weeks. It has been a blast, lots of talks and valuable takeaways, and it was great to hang out with old friends and meet new ones. As soon as …
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 …
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 …