Originally posted on The Cockney Coder:This post is the first part of a brief overview of Service Fabric and how we can model Service Fabric Actors in F#. Part 1 will cover the details of how to get up and running in SF, whilst Part 2 will look at the cha[...]

In version 3.4, WebSharper UI.Next's markup has been overhauled in order to prepare for the upcoming merger into WebSharper in version 4.0.

Tweet The other day I had a small task to inspect return values of methods and if the following property exists then set it to empty array.         public long[] Achievements { get; set; } This needed to happen once on every web request, and I decided to [...]

WebSharper 3.4 is out with a slew of features: new F# 4.0 collection functions, revamped sitelets API, anti-CSRF protection for RPC functions, and a reworked HTML language in UI.Next with server-side capability.

Welcome to F# Weekly, A roundup of F# content from this past week: News RyuJIT Bug Advisory in the .NET Framework 4.6 Released Visual F# PowerTools v2.0.0 with full support for F# 4.0 and a number of improvements from F# community. New “Getting started” t[...]

When I started learning F# I had a hard time grokking how and when to use a Discriminated Union (Sum type). I had experience in several paradigms and languages, but had never seen or used this data construct. In this article we'll start with an Enum and [...]

Tweet I recently gave a talk on the various use cases we have for F# at Gamesys Social at the Tokyo F# User Group during my trip there. The slides are available on Slideshare and I’ll share links to recording once they become available. F# at GameSys from[...]

First note: this blog post is very much tongue in cheek. I’m not actually planning on using the idea. But it was too fun not to share. As anyone following my activity on GitHub may be aware, I’ve been quite a lot of work on Protocol Buffers recently – in [...]

If trials of three or four simple cases have been made, and are found to agree with the results given by the engine, it is scarcely possible that there can be any error (...). Charles Babbage, On the mathematical powers of the calculating engine (1837) [...]

If trials of three or four simple cases have been made, and are found to agree with the results given by the engine, it is scarcely possible that there can be any error (...). Charles Babbage, On the mathematical powers of the calculating engine (1837)[...]