<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Luke Burgess-Yeo on Medium]]></title>
        <description><![CDATA[Stories by Luke Burgess-Yeo on Medium]]></description>
        <link>https://medium.com/@lukeburgessyeo?source=rss-f1c9b4cd56ae------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/1*99J2rChpn_KwP31wqZAOKg.jpeg</url>
            <title>Stories by Luke Burgess-Yeo on Medium</title>
            <link>https://medium.com/@lukeburgessyeo?source=rss-f1c9b4cd56ae------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Thu, 19 Nov 2026 09:53:37 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@lukeburgessyeo/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[F# Tree Diff Algorithm]]></title>
            <link>https://medium.com/f-ing-about/f-tree-diff-algorithm-5b7f9c85beac?source=rss-f1c9b4cd56ae------2</link>
            <guid isPermaLink="false">https://medium.com/p/5b7f9c85beac</guid>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[data]]></category>
            <category><![CDATA[data-structures]]></category>
            <category><![CDATA[fsharp]]></category>
            <category><![CDATA[trees]]></category>
            <dc:creator><![CDATA[Luke Burgess-Yeo]]></dc:creator>
            <pubDate>Wed, 01 Jan 2020 16:01:01 GMT</pubDate>
            <atom:updated>2020-01-01T16:01:01.255Z</atom:updated>
            <content:encoded><![CDATA[<h4>Implementing an algorithm to find the difference between two trees</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*yNeGaUP37PXRlYsphtCxjg.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/@niko_photos?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">niko photos</a> on <a href="https://unsplash.com/s/photos/tree?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Unsplash</a></figcaption></figure><p>Suppose you have two tree data structures and you want to find the difference between them. What follows is a description and implementation of a simple algorithm with takes two trees — one original, one modified — as inputs and outputs a single tree with nodes labelled to indicate whether they have been inserted, deleted or had their values updated when compared with the original tree.</p><p>This algorithm is inspired by the diff algorithms behind Virtual DOMs in JavaScript frameworks like React. This implementation in particular is based on a post by <a href="https://medium.com/@deathmood/how-to-write-your-own-virtual-dom-ee74acc13060">deathmood</a>.</p><p>An F# script file with the full implementation code and simple test case can be found here: <a href="https://github.com/LukeBurgessYeo/tree-diff">https://github.com/LukeBurgessYeo/tree-diff</a>.</p><h3>Introduction To Trees</h3><p>Let’s begin with a quick introduction to tree data structures. The idea is to define a hierarchical structure containing nodes where each node has a value and a (potentially empty) collection of child nodes. We will be concerning ourselves with labeled, unordered trees.</p><h4>Defining a tree</h4><p>For the purposes of our algorithm we will give each node an Id — so we can match nodes between different trees — as well as a label specifying whether the node has been changed (modeled here as a discriminated union):</p><pre>type Change =<br>    | Unchanged<br>    | Inserted<br>    | Deleted    <br>    | Updated of string</pre><pre>type Node = {    <br>    Id : int    <br>    Value : string  <br>    Modified : Change   <br>    Children : Node list<br>}</pre><p>(For simplicity I am setting the type of Value to string, but there is no reason why it could not be any other type, or in fact a generic type — as in the repo linked above.)</p><p>Instances of trees can then be constructed easily. For example, this tree with a “Root” node that has two children — “A” and “B”:</p><pre>let tree0 = {    <br>  Id = 0    <br>  Value = &quot;Root&quot;    <br>  Modified = Unchanged    <br>  Children = [        <br>    { Id = 1; Value = &quot;A&quot;; Modified = Unchanged; Children = [] }<br>    { Id = 2; Value = &quot;B&quot;; Modified = Unchanged; Children = [] }<br>  ] <br>}</pre><h4>Working with trees</h4><p>Using this data structure is slightly more difficult than built in types such as Lists. In order to read data from our tree we will have to traverse the nodes using a tree traversal algorithm. The simplest to demonstrate is <a href="https://www.geeksforgeeks.org/depth-first-search-or-dfs-for-a-graph/">Depth First Search</a>.</p><p>Depth First Search attempts to traverse the tree by visit leaf nodes (nodes with no children) first — i.e. going as deep into the tree as possible first — before going back up the tree and down the next branch. Here is an implementation in F# which we can use to print out our trees in a more human readable form:</p><pre>let printTree tree =<br>  let rec traverse node level =<br>    let spacing = <br>      List.init (level * 4) (fun _ -&gt; &quot; &quot;) <br>      |&gt; String.concat &quot;&quot;        <br>    let nodeString = <br>      sprintf &quot;(%i) %s - %A&quot; node.Id node.Value node.Modified<br>    printfn &quot;%s%s&quot; spacing nodeString<br>    node.Children<br>    |&gt; List.iter (fun child -&gt; traverse child (level + 1))<br>  traverse tree 0</pre><p>The above function uses a recursive inner function to traverse each node of the tree — printing out the node in a readable format — before visiting the children of that node. The traverse function also takes a state parameter “level” which keeps track of the depth of the tree so the appropriate indentation can be added to each line, making the output easier to read.</p><p>Here as the output from fsi when printTree is called on tree0:</p><pre>&gt; printTree tree0;;<br>(0) Root - Unchanged<br>    (1) A - Unchanged<br>    (2) B - Unchanged<br>val it : unit = ()</pre><h3>The Tree Diff Algorithm</h3><h4>Overview of the algorithm</h4><p>The algorithm itself will have to deal with a number of different cases when comparing nodes in two trees:</p><ol><li>A new node has been inserted.</li><li>An old node has been deleted.</li><li>The node exists in both trees.</li></ol><p>If the node exists in both trees then we need to check to see if the value of the node needs to be modified. We also need to compare the children of the old node and the new node.</p><h4>Implementation — Part 1: Helper functions</h4><p>Firstly, let’s define some helper functions to mark a node as inserted, deleted, or updated. For inserted and deleted nodes, we also need to mark the rest of the sub-tree based at these nodes as inserted or deleted. Hence it is useful to define the Depth First Search implementation:</p><pre>let rec markNode change node =<br>    { node with<br>        Modified = change<br>        Children = <br>            node.Children <br>            |&gt; List.map (markNode change) }</pre><p>This allows us to define the insert and delete function succinctly:</p><pre>let insert node = markNode Inserted node</pre><pre>let delete node = markNode Deleted node</pre><p>(The use of the explicit “node” parameter is required if using this code with fsi and a generic type tree.)</p><p>As the value of child nodes are not necessarily updated when a node has changed value, the update function can be written simply as a record update:</p><pre>let update node value =<br>    { node with<br>        Modified = Updated value }</pre><p>Where “value” indicates the new value, while the node itself will retain it’s original “Value”, so we can track the exact change.</p><h4>Implementation — Part 2: Main diff function</h4><p>Now we are ready to compare two nodes. As neither node is guaranteed to exist, we shall use the Option type to write a function which takes two nodes which may, or may not, exist. The type of this function will therefore be:</p><pre>Node option * Node option -&gt; Node</pre><p>Using a tuple rather than currying will turn out to be useful later, but also this is not a function where partial application makes sense. Note that the function will also need to be recursive so we can call it on the children of the input nodes.</p><p>We will match on the cases of our two option inputs. The first three cases are straightforward:</p><ol><li>Delete the old node if there is no new node.</li><li>Insert the new node if there is no old node.</li><li>Do nothing if the two nodes are identical.</li></ol><pre>let rec diff (oldNodeOpt, newNodeOpt) =<br>  match oldNodeOpt, newNodeOpt with<br>    | Some oldNode, None -&gt; delete oldNode<br>    | None, Some newNode -&gt; insert newNode<br>    | Some oldNode, Some newNode when oldNode = newNode -&gt; oldNode</pre><p>Next we should do a simple update the value of a node has changed, but everything else is identical. To do this we can define an infix operator to do this comparison:</p><pre>let (==) node1 node2 =<br>  node1.Id = node2.Id<br>  &amp;&amp; node1.Children = node2.Children<br>  &amp;&amp; node1.Value &lt;&gt; node2.Value</pre><p>and add the following line to our diff function: (note the use of “==”)</p><pre>| Some oldNode, Some newNode when oldNode == newNode -&gt; <br>  update oldNode newNode.Value</pre><p>The final (non-degenerative) case is when we have two nodes with different children. To handle this case, we need to pass the children of the two nodes into our diff function to be compared. This means we have to construct a list of Node option tuples and iterate over the list, passing each pair back into our diff function.</p><p>The first item in each pair will contain the child of the old node (if it exists), and the second item will contain the child of the new node (if it exists). The determine whether a given node should exist, we must iterate first over the children of the old node, checking to see if that node exists in the list of children of the new node. Then do similarly for the new node, checking the list of children of the old node. The following function does exactly that:</p><pre>let combine node1 node2 =<br>  let first = <br>    node1.Children <br>    |&gt; List.map (fun x -&gt;<br>      let maybeNode =<br>        node2.Children <br>        |&gt; List.tryFind (fun y -&gt; y.Id = x.Id)<br>      (Some x, maybeNode))</pre><pre>  let second = <br>    let maybeNode =<br>      node2.Children <br>      |&gt; List.map (fun x -&gt; <br>        (node1.Children <br>        |&gt; List.tryFind (fun y -&gt; y.Id = x.Id)<br>    (maybeNode, Some x))</pre><pre>  first @ second |&gt; List.distinct</pre><p>Note the use of List.distinct at the end to remove any double counted nodes.</p><p>We are now in a position to complete our diff function by using List.map to pass each child node combination back into our diff function to get the list of compared child nodes. This is the reason why we chose to pass a tuple to diff. Here is the completed function, with the newly added case in <strong>bold</strong>:</p><pre>let rec diff (oldNodeOpt, newNodeOpt) =<br>  match oldNodeOpt, newNodeOpt with<br>  | Some oldNode, None -&gt; delete oldNode<br>  | None, Some newNode -&gt; insert newNode<br>  | Some oldNode, Some newNode when oldNode = newNode -&gt; oldNode<br>  | Some oldNode, Some newNode when oldNode == newNode -&gt; <br>    update oldNode newNode.Value<br>  <strong>| Some oldNode, Some newNode -&gt;<br>    { oldNode with<br>        Modified = <br>          if oldNode.Value = newNode.Value then <br>            Unchanged <br>          else Updated newNode.Value<br>        Children = <br>          combine oldNode newNode<br>          |&gt; List.map diff }</strong><br>  | None, None -&gt; <br>    failwith &quot;Must have at least one node to compare.&quot;</pre><p>The final match case is “None, None” which does not make sense as an input to the function and so we raise an exception. This function should never receive two None’s as inputs. Even if it did, we would not have a node to return and creating an empty node to continue the execution of the program could cause problems later on.</p><p>Finally we can wrap our diff function in a more intuitive API for external use:</p><pre>let compare oldTree newTree = diff (Some oldTree, Some newTree)</pre><h3>Final Comments</h3><p>This algorithm can likely be further optimized and improved upon — for example respecting the order of nodes as well as their Id’s.</p><p>The careful reader may have noticed that the match case which deals with children of the given nodes also deals with the previous two cases (when the nodes are equal, and when they are equal in all but value). The inclusion of these two cases improves the performance of the algorithm for large trees, and trees with very few changes. We can quickly eliminate identical sub-trees by comparing nodes by value (as F# does by default), and the case where only the value has changed gives a practical example of defining a custom infix operator.</p><p>Of course, if the user is comparing extremely large trees then other optimizations may be necessary, and F# may not even be the most suitable tool for the task. Other algorithms exist which try to find the “minimum update script” — a list of edits to transform one tree into another as efficiently as possible (where you can decide how to measure efficiency).</p><p>Finally, please feel free to contribute any bug fixes or improvements to the code at <a href="https://github.com/LukeBurgessYeo/tree-diff">https://github.com/LukeBurgessYeo/tree-diff</a>.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=5b7f9c85beac" width="1" height="1" alt=""><hr><p><a href="https://medium.com/f-ing-about/f-tree-diff-algorithm-5b7f9c85beac">F# Tree Diff Algorithm</a> was originally published in <a href="https://medium.com/f-ing-about">F#ing About</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Functional Reactive Programming]]></title>
            <link>https://medium.com/f-ing-about/functional-reactive-programming-bac706d922e2?source=rss-f1c9b4cd56ae------2</link>
            <guid isPermaLink="false">https://medium.com/p/bac706d922e2</guid>
            <category><![CDATA[technology]]></category>
            <category><![CDATA[programming-languages]]></category>
            <category><![CDATA[development]]></category>
            <category><![CDATA[fsharp]]></category>
            <category><![CDATA[programming]]></category>
            <dc:creator><![CDATA[Luke Burgess-Yeo]]></dc:creator>
            <pubDate>Tue, 24 Dec 2019 12:10:30 GMT</pubDate>
            <atom:updated>2019-12-24T12:10:30.259Z</atom:updated>
            <content:encoded><![CDATA[<h4>Using Observable’s and Events</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*Dj_PV5H9kDimPbtIpyQmfQ.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/@oskaryil?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Oskar Yildiz</a> on <a href="https://unsplash.com/s/photos/programming?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Unsplash</a></figcaption></figure><p>Functional Reactive Programming is a powerful technique which allows for easy handling of events and complex control-flow situations. However, this style of programming can be initially confusing without a solid understanding of the different types and functions which are involved.</p><p>The basic idea is to raise events in one part of the system, and write listeners in another part of the system to handle the events. This decoupling of producers and consumers allows for a cleaner — more modular — architecture, as well as making applications which rely on network communication or parallel execution much easier to build.</p><p>For more examples and explanation of this topic. See Scott Wlaschin’s blog: <a href="https://fsharpforfunandprofit.com/posts/concurrency-reactive/">https://fsharpforfunandprofit.com/posts/concurrency-reactive/</a>.</p><h3>What Are Events?</h3><p>Events are instances of the <a href="https://msdn.microsoft.com/visualfsharpdocs/conceptual/control.event%5b%27t%5d-class-%5bfsharp%5d">built in F# Event type</a>. Events are raised automatically by certain user inputs (in WinForms apps for example) or custom events can be created, published and triggered. Below is an example of creating, publishing and triggering a custom event:</p><pre>// create the event<br>let customEvent = Event&lt;string&gt;()</pre><pre>// publish the event so it can be listened to<br>let eventStream = customEvent.Publish</pre><pre>// trigger the event<br>customEvent.Trigger(&quot;Hello world!&quot;)</pre><p>Events can take any type you wish. Events containing record types representing the state, or union types representing one of several options a user may have chosen are particularly useful.</p><h3>Listening To Events</h3><p>Now that we have a published event, we need to listen out for the event being triggered. There are several ways to do this, however the below method (using the <a href="https://msdn.microsoft.com/visualfsharpdocs/conceptual/control.observable-module-%5bfsharp%5d">Observable module</a> methods) is preferred:</p><pre>// string -&gt; unit<br>let handler message = printfn &quot;%s&quot; message</pre><pre>eventStream<br>|&gt; Observable.subscribe handler</pre><p>Observable.subscribe takes a handler function (which in this case must be have type “string -&gt; unit” because our eventStream was created from a Event&lt;string&gt; event) and an IEvent (which we can by publishing our custom event) and calls the handler function every time the corresponding event is triggered.</p><p>Now every time we trigger our customEvent, the message which is passed as a parameter to Trigger will be logged to the console. Here it is in fsi:</p><pre>&gt; customEvent.Trigger(&quot;Hello world!&quot;);;<br>Hello world!</pre><h3>Other Functions In The Observable Module</h3><p>With the basics covered, what else can we do with events? Well much like the List module (and others), the Observable module comes with several built in functions which allow us to manipulate events in order to make complex control flow tasks with events easy. For example, we might want to alter the data in our events when we receive them. This can be done using the <a href="https://msdn.microsoft.com/visualfsharpdocs/conceptual/observable.map%5b%27t%2c%27u%5d-function-%5bfsharp%5d">map function</a>:</p><pre>eventStream<br>|&gt; Observable.map (fun x -&gt; sprintf &quot;Message: %s&quot; x)<br>|&gt; Observable.subscribe(fun x -&gt; printfn &quot;%s&quot; x)</pre><p>Or we might want to <a href="https://msdn.microsoft.com/visualfsharpdocs/conceptual/observable.filter%5b%27t%5d-function-%5bfsharp%5d">filter</a> out messages over a certain length:</p><pre>eventStream<br>|&gt; Observable.filter (fun x -&gt; x.Length &lt; 10)<br>|&gt; Observable.subscribe(fun x -&gt; printfn &quot;%s&quot; x)</pre><p>Or we might want to accumulate some state for each event. This can be done using the <a href="https://msdn.microsoft.com/visualfsharpdocs/conceptual/observable.scan%5b%27u%2c%27t%5d-function-%5bfsharp%5d">scan function</a>:</p><pre>eventStream<br>|&gt; Observable.scan (fun acc cur -&gt; sprintf &quot;%s %s&quot; acc cur) &quot;&quot;<br>|&gt; Observable.subscribe(fun x -&gt; printfn &quot;%s&quot; x)</pre><p>This will add each new message to the state for every event that is triggered. Here is the output from fsi (with the printed messages in <strong>bold</strong>):</p><pre>&gt; customEvent.Trigger(&quot;hello&quot;);;<br> <strong>hello</strong><br>val it : unit = ()</pre><pre>&gt; customEvent.Trigger(&quot;world&quot;);;<br> <strong>hello world</strong><br>val it : unit = ()</pre><pre>&gt; customEvent.Trigger(&quot;this&quot;);;<br> <strong>hello world this</strong><br>val it : unit = ()</pre><pre>&gt; customEvent.Trigger(&quot;is&quot;);;<br> <strong>hello world this is</strong><br>val it : unit = ()</pre><pre>&gt; customEvent.Trigger(&quot;F#&quot;);;<br> <strong>hello world this is F#</strong><br>val it : unit = ()</pre><p>This can be incredibly useful for keeping track of your applications state whilst listening to events.</p><p>There are several other functions in the Observable module, as well as others in the <a href="https://docs.microsoft.com/en-us/previous-versions/dotnet/reactive-extensions/hh242985(v=vs.103)">Reactive Extensions</a> module to give you complete control over your event handling.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=bac706d922e2" width="1" height="1" alt=""><hr><p><a href="https://medium.com/f-ing-about/functional-reactive-programming-bac706d922e2">Functional Reactive Programming</a> was originally published in <a href="https://medium.com/f-ing-about">F#ing About</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Using F# Scripts To Explore Your .NET Codebase]]></title>
            <link>https://medium.com/f-ing-about/using-f-scripts-to-explore-your-net-codebase-9f8cd982727c?source=rss-f1c9b4cd56ae------2</link>
            <guid isPermaLink="false">https://medium.com/p/9f8cd982727c</guid>
            <category><![CDATA[dotnet]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[software-development]]></category>
            <category><![CDATA[functional-programming]]></category>
            <category><![CDATA[fsharp]]></category>
            <dc:creator><![CDATA[Luke Burgess-Yeo]]></dc:creator>
            <pubDate>Sat, 15 Jun 2019 16:10:03 GMT</pubDate>
            <atom:updated>2019-06-15T16:10:03.507Z</atom:updated>
            <content:encoded><![CDATA[<h3>Using F# Scripts To Explore Your .NET Codebase</h3><h4>Some powerful techniques to quickly prototype new features</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*xAFAiAxqZVrOVLBTo9tf6w.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/@emilep?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Émile Perron</a> on <a href="https://unsplash.com/search/photos/programming?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Unsplash</a></figcaption></figure><p>Having to make a change inside a large codebase which you are unfamilar with can be a daunting task. How do you know that you aren’t breaking consciously designed logic? How do you know that the changes you are making won’t have any side effects or break something somewhere else in the code? Hopefully the codebase is well designed and well structured with high unit test coverage and documentation to mitigate against these issues, but that just isn’t how things usually are in the real world. So what can we do to make our lives easier in these situations? Specifically, how can F# help us explore and get a better understanding of our .NET codebase?</p><h3>F# Scripts and F# Interactive</h3><p>Firstly, a brief introduction to F# scripts and F# interactive (fsi). FSI is a super powerful tool which can (and should) be used to interactively test code as it’s being written. But it can do a lot more than simply verify that the chain of list module functions that you’ve just put together actual does what you want it to do — as useful as that is.</p><p>Writing code inside a .fsx file and sending it to fsi is just the first step on a journey to more productive programming experience. For more on this see Mathias Brandewinder’s (slightly dated but still extremely useful) blog post on <a href="https://brandewinder.com/2016/02/06/10-fsharp-scripting-tips/">10 Tips for Productive F# Scripting</a>. I will be expanding on some of the points in this post…</p><h3>Importing The Things You Need</h3><p>The first step to leveling up your scripting experience is learning how to get the various libraries and other binaries you need into your script. You can also load other scripts, or other F# files, into your script, allowing you to abstract away the common elements of your scripts — so you can follow all the best software development principles (single responsibility, don’t repeat yourself, etc.) with your scripts too!</p><p>Loading in F# files or scripts is done via the <a href="https://docs.microsoft.com/en-us/dotnet/fsharp/tutorials/fsharp-interactive/"><em>#load</em> directive</a>, followed by the relative path to your script:</p><pre>#load &quot;MyScript.fsx&quot;</pre><pre>open MyScript</pre><p>Loading external libraries or built code can be done using <em>#r</em> (and here is a more explicit use of relative paths, using @ to avoid needing to escape characters in the path). Then you can open any modules inside the built dll:</p><pre>#r @&quot;../src/myproject/bin/debug/myproject.dll&quot;</pre><pre>open MyModule</pre><p>However, you may well want to load several dll’s from the same location. In this case, it may be better to make the entire directory available to be loaded from using <em>#I</em>:</p><pre>#I @&quot;../src/myproject/bin/debug&quot;<br>#r &quot;myproject.dll&quot;<br>#r &quot;somelibrary.dll&quot;</pre><pre>open MyModule<br>open LibraryModule</pre><p>An even faster way of doing this (if your scripts are in the same location as your built dll’s) is to use the <a href="https://docs.microsoft.com/en-us/dotnet/fsharp/language-reference/source-line-file-path-identifiers">__SOURCE_DIRECTORY__</a> built-in value:</p><pre>#I __SOURCE_DIRECTORY__<br>#r &quot;myproject.dll&quot;<br>#r &quot;somelibrary.dll&quot;</pre><pre>open MyModule<br>open LibraryModule</pre><p>This allows you to access any code from your codebase directly in your scripts, ready to be sent to fsi. It is worth remembering, however, that after loading these dll’s into fsi, fsi will “lock” the files themselves. This means that any attempt to rebuild them (i.e. copy or overwrite them) will fail. So make sure you’ve quit your fsi session before trying to rebuild the projects you’ve referenced.</p><h3>Exploring Your Codebase</h3><p>Now that you can load in literally any code you need from your codebase, you can use F# scripts to interatively explore the code. Here are some possible use cases for these kinds of scripts.</p><h4>Exploring Data</h4><p>Let’s suppose you are working on an application which loads a large amount of data into memory before the application, or at least part of it, becomes usable.</p><p>Restarting the application and waiting for the data to load every time you make a code change could become tedious. However, with fsi, this may not be necessary. Simply import the code which does the data loading into a script and and run it once to load the data into the memory of the fsi process. Now we can interactively run any code we like against this data without having to reload it.</p><p>This could be extremely useful for developing a new feature which requires an intamte knowledge of that data — or at least how it’s structured — or just to save time while you use trial-and-error to figure out the details of the logic you are implementing.</p><h4>Targetted Debugging</h4><p>It is possible to attach the Visual Studio (or Visual Studio Code with some extra work) debugger to the fsi.exe process, and then set breakpoints and debug your code as you would if you were running the application.</p><p>There are situations where this is much more effecient or desirable than traditional debugging methods. For example, if you wanted to test what happens when a function recives an input that is unusual or difficult to replicate through the UI (to test that a new feature where that situation may occur won’t break the code). Or if you needed to answer a question like “what happens when…”, simply write a script that creates that situation and attach the debugger to see what happens.</p><h4>Sanity Checks and Ad-Hoc Integration Testing</h4><p>Suppose your application has a long list of items which the user can click on to perform some task or calculation. How do you know that a data change won’t break that task for every possible item that the user might click?</p><p>Write a script which calls the code that would run if the user did click every item and find out for yourself! This trick could be extended to run ad-hoc integration tests before the code gets to an integration testing environment.</p><p>In general F# scripts are extremely powerful and a practicle way to increase your productivity, even if your main codebase is written in another .NET language.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=9f8cd982727c" width="1" height="1" alt=""><hr><p><a href="https://medium.com/f-ing-about/using-f-scripts-to-explore-your-net-codebase-9f8cd982727c">Using F# Scripts To Explore Your .NET Codebase</a> was originally published in <a href="https://medium.com/f-ing-about">F#ing About</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Learning F#]]></title>
            <link>https://medium.com/f-ing-about/learning-f-3135d495d883?source=rss-f1c9b4cd56ae------2</link>
            <guid isPermaLink="false">https://medium.com/p/3135d495d883</guid>
            <category><![CDATA[software-development]]></category>
            <category><![CDATA[dotnet]]></category>
            <category><![CDATA[fsharp]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[functional-programming]]></category>
            <dc:creator><![CDATA[Luke Burgess-Yeo]]></dc:creator>
            <pubDate>Mon, 10 Jun 2019 21:20:54 GMT</pubDate>
            <atom:updated>2019-06-15T16:13:08.779Z</atom:updated>
            <content:encoded><![CDATA[<h4>Changing the way you think about code</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*4hMD3YXsF8jGgxnhsn28Tg.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/Agx5_TLsIf4?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Fatos Bytyqi</a> on <a href="https://unsplash.com/search/photos/programming?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Unsplash</a></figcaption></figure><p>So you’ve decided you want to learn F#, what are the next steps to become proficient? This post will hopefully point you in the right direction for the sorts of things that you should — and more importantly <em>should not — </em>be doing whilst learning F#.</p><h3>First Steps</h3><p>Forget about imperative programming. By that I mean forget about variables, loops, if-else statements, and pretty much all of the little things that you might rely on when writing imperative code.</p><p>Embrace immutability. Embrace pattern matching. Embrance partial application and currying, and embrace the F# type system.</p><p>Write lots of small functions and glue them together, making use of composition and partial application.</p><p>Speaking of the type system. This is probably the most important aspect of F# to spend your time learning properly. Forget about classes, interfaces and other object oriented notions and instead use native F# types.</p><h3>The Type System</h3><p>F# allows you to consisely define your domain model in such a way that invalid application state is impossible. Doing this in traditional imperative code is extremely difficult and requires many lines of error handling code.</p><p>F# gives us discriminated unions, records and tuples which can be used to define state which cannot be invalid, much more consisely and acurately than in imperative code.</p><p>Pattern matching then allows you to confidently implement the logic that works with this state with the compiler automatically checking that you’ve covered every possible branch.</p><h3>Enumeral Types and Modules</h3><p>It is also well worth spending some time understanding the differences between lists (singlely linked and immutable), arrays (the traditional mutable array we all know and love) and seqs (lazily loaded lists) and the various core module functions for working with those data types.</p><p>As I said above, you should forget about loops and embrace the enumerable module functions. Get used to map, filter, reduce/fold and all the other functions in these modules. These functions allow you to abstract away the looping itself and focus purely on the logic that matters in manipulating these data structures.</p><h3>Conclusion</h3><p>Try and avoid using mutable variables, loops, if-else statements and any object oriented features (classes, etc.). Instead use the native F# types, use the list module functions, use pattern matching. Write lots of little functions and compose them together to build larger modules.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=3135d495d883" width="1" height="1" alt=""><hr><p><a href="https://medium.com/f-ing-about/learning-f-3135d495d883">Learning F#</a> was originally published in <a href="https://medium.com/f-ing-about">F#ing About</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[First Look At F#]]></title>
            <link>https://medium.com/f-ing-about/first-look-at-f-542c6d500217?source=rss-f1c9b4cd56ae------2</link>
            <guid isPermaLink="false">https://medium.com/p/542c6d500217</guid>
            <category><![CDATA[software-development]]></category>
            <category><![CDATA[functional-programming]]></category>
            <category><![CDATA[fsharp]]></category>
            <category><![CDATA[dotnet]]></category>
            <category><![CDATA[programming]]></category>
            <dc:creator><![CDATA[Luke Burgess-Yeo]]></dc:creator>
            <pubDate>Thu, 04 Apr 2019 17:20:28 GMT</pubDate>
            <atom:updated>2019-06-15T16:13:54.547Z</atom:updated>
            <content:encoded><![CDATA[<h4>What makes F# unique and worth using?</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*d0I7athFoo0jgOpGMLPCKg.jpeg" /><figcaption>Photo by <a href="https://unsplash.com/photos/Hl1stIQkVRw?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">John Salzarulo</a> on <a href="https://unsplash.com/search/photos/coding?utm_source=unsplash&amp;utm_medium=referral&amp;utm_content=creditCopyText">Unsplash</a></figcaption></figure><p>I recently started a new job in which I had to learn F#. I’ve been a fan of the language for a long time but this was the first time I had the chance to learn the language properly and in detail. In this post I will list a number of features that make F# unique — compared to C# at least —and worth learning. F# is not just lightweight syntax for things you can already do, and here’s why…</p><h3>The Five C’s of F#</h3><p>Taken from Scott Wlaschin’s <a href="https://fsharpforfunandprofit.com/why-use-fsharp/">excellent blog</a>, F# is good for its Conciseness, Convenience, Correctness, Concurrency and Completeness. Read the blog post for more details but these are the headline ideas.</p><p>In practice these things make F# a joy to write. The syntax is clean, F# interactive allows you to rapidly test your code as you’re writing it, and the type system ensures that you write far fewer bugs than in conventional imperative languages.</p><p>That being said, the minimalist syntax and strict type system do take some getting used to — however the payoff is worth it. F# is not a language that has been designed for ease of use in the first few hours of programming, but rather for the seasoned enterprise developer to work with over many years.</p><h3>A Shift In Mindset</h3><p>As well as getting used to the syntax and type system, programming in F# requires a shift in mindset from the imperative programming approach. F# encourages you to think “functionally” rather than in terms of classes and Object Oriented principles. Again, this may seem daunting when we are so used to OOP, but I would argue that thinking in terms of functions rather than classes is more natural. Classes, objects, interfaces, inheritance, polymorphism, etc. are all concepts which we have to learn — and eventually become natural — but once upon a time they were strange ideas. Functions on the other hand are taught to primary school children.</p><h3>Yet More Blog Posts</h3><p>A common criticism of F# is that C# is good enough for basically everything the enterprise programmer could ever want to do. This is true, but that doesn’t mean that C# is the best tool for the job. For some more reasons as to why, read <a href="https://fsharpforfunandprofit.com/posts/is-your-language-unreasonable/">this post</a> on how reasoning about F# code is far easier than OO code. Furthermore, <a href="https://fsharpforfunandprofit.com/posts/fsharp-is-the-best-enterprise-language/">here is a detailed argument</a> for why F# is the best enterprise programming language on the market right now.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=542c6d500217" width="1" height="1" alt=""><hr><p><a href="https://medium.com/f-ing-about/first-look-at-f-542c6d500217">First Look At F#</a> was originally published in <a href="https://medium.com/f-ing-about">F#ing About</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Live European Ultimate]]></title>
            <link>https://medium.com/this-ultimate-life/live-european-ultimate-7a96fd38f58d?source=rss-f1c9b4cd56ae------2</link>
            <guid isPermaLink="false">https://medium.com/p/7a96fd38f58d</guid>
            <category><![CDATA[ultimate-frisbee]]></category>
            <category><![CDATA[medium]]></category>
            <category><![CDATA[sports]]></category>
            <category><![CDATA[europe]]></category>
            <category><![CDATA[live-streaming]]></category>
            <dc:creator><![CDATA[Luke Burgess-Yeo]]></dc:creator>
            <pubDate>Wed, 18 Apr 2018 16:56:43 GMT</pubDate>
            <atom:updated>2018-04-18T16:56:43.270Z</atom:updated>
            <content:encoded><![CDATA[<h4>A lot of ultimate is going to be filmed this season.</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*JdDJv-B8HQNUDN-erBnOIA.jpeg" /><figcaption>Fanseat’s promotional poster. I’m not being paid to put this here or to write this article, all opinions are my own.</figcaption></figure><p>I’ve been somewhat uninspired to write about ultimate recently, but it’s probably about time I publish something, given that the mixed season is well and truly underway and the university season is coming to an end this weekend!</p><p>A lot has happened elsewhere in the world since my last post; the UUL didn’t meet it’s <a href="https://ultiworld.com/livewire/uul-misses-kickstarter-funding-target-wont-continue/">crowd funding target</a>, a <a href="https://www.ioultimate.com/blog/professional-mixed-ultimate-league-announced-in-australia">semi-pro mixed league</a> was announced in Australia and Beau Kittredge randomly decided to <a href="http://skydmagazine.com/2018/03/building-an-empire/">move to New York</a>... to try and further the gender equity movement, I think? But I really don’t want to write about any of that. So in short: I’m glad the UUL wasn’t funded, I’m excited to see what happens in Australia, I’m beginning to think that Beau’s column is just click-bait.</p><h4><strong>Fanseat Coverage</strong></h4><p>Moving on to more pressing matters: today, Fanseat and the European Ultimate Federation formally announced their partnership to bring live coverage of nine featured tournaments, and many more ‘sideline’ events, over the remainder of the season. The nine featured tournaments are:</p><ul><li>Tom’s Tourney (Belgium, 4th-6th May)</li><li>Talampaya (Switzerland, 19th-21st May)</li><li>UKU Open/Women’s Tour 1 (UK, 2nd-3rd June)</li><li>UKU Open/Women’s Tour 2 (UK, 16th-17th June)</li><li>EUCR-N (Estonia, 18th-19th August)</li><li>UKU Nationals (UK, 25th-27th August)</li><li>EUCR-S (Italy, 1st-2nd September)</li><li>EUCF (Poland, 5th-7th October)</li><li>European Beach Ultimate Club Championships (Spain, 26th-28th October)</li></ul><p>Here in the UK the planned sideline events are Mixed Tours 2 and 3, University Nationals (this weekend!) and Open/Women’s Tour 3 (which is during WUCC). Other sideline streams are planned throughout Europe but the schedule is quite fluid. A full list of planned streams will, eventually, be posted <a href="https://www.ultimatefederation.eu/watch-ultimate-live.php">here</a>.</p><p>The nine featured tournaments will be covered with the same production quality that we saw at the UK Tour events and Nationals last year. The sideline events will be covered with a single camera and no replays, but it’s a lot better than no coverage at all!</p><p>In terms of the tournaments themselves, everything before WUCC (Tom’s, Talampaya and Tours 1 and 2), will be very interesting given that they are the tournaments that the WUCC teams will be using to warm up. The remainder of the grass season — the euro’s events — will be a good opportunity for teams who didn’t go to WUCC to have a go at taking EUCF spots away from the top teams and we could well see some big upsets.</p><p>At the end of the season we will also get to see the first ever <a href="http://ebucc2018.org/">EBUCC</a>. Top level beach ultimate is always exciting to watch so I am very much looking forward to seeing how that event turns out. Overall, it looks to be a great season of coverage.</p><h4><strong>Implications For European Ultimate</strong></h4><p>There is very little money in ultimate, so having a media company that is willing to put up the money to produce live streams of tournaments is a big deal. It isn’t cheap to produce a live stream of even just a single field, and given that there is no sponsorship money floating around, the money has to either come from viewers or players. It’s unlikely that players would agree to increased player fees to support a live stream that they will most likely not play on (unless they are playing for a top team). So, that means the cost of production has to go on to the viewer — this is Fanseat’s model.</p><p>Fortunately for us Fanseat have shown that they are committed to the ultimate community, not only by partnering with EUF but also by taking feedback that was given last season and acting upon it to improve their service (for example, the on-demand experience is now much better). Their service is far from perfect but hopefully we can encourage them to improve it further.</p><p>Supporting Fanseat is directly helping to promote and grow the sport. A large amount of free content can be generated from the live streams — mostly in the form of highlights videos shared to Facebook and Twitter — which can be used to market the sport to new players and generate interest in a similar way to how the AUDL’s content has generated interest in the US.</p><p>On top of all that, the increased exposure of European ultimate will help create a more cohesive ultimate community in Europe. For years, it’s been very hard to stay up to date on who the top and upcoming teams are. Streaming of EUCF (as well as Tom’s and Windmill to a some extent) helped to illuminate the very top of the scene. The Eurozone podcast has done a great job of trying to stay on top of all the storylines around Europe but they themselves proved how difficult it was to even get in touch with certain parts of the community. The additional coverage that Fanseat are providing this year goes a long way to making it possible to follow European ultimate without having to physically travel to each of the major tournaments.</p><p>It’s important that we all get behind the Fanseat project to help promote and grow the sport… and to get some sweet highlight reels!</p><p>For those of you that are going to Uni Nationals this weekend, I will be doing commentary for the live stream so come and say hi. If you aren’t there, tune in to the coverage! It should be a good tournament.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=7a96fd38f58d" width="1" height="1" alt=""><hr><p><a href="https://medium.com/this-ultimate-life/live-european-ultimate-7a96fd38f58d">Live European Ultimate</a> was originally published in <a href="https://medium.com/this-ultimate-life">This Ultimate Life</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Thoughts On The UUL]]></title>
            <link>https://medium.com/this-ultimate-life/thoughts-on-the-uul-6a5cabf03fae?source=rss-f1c9b4cd56ae------2</link>
            <guid isPermaLink="false">https://medium.com/p/6a5cabf03fae</guid>
            <category><![CDATA[opinion]]></category>
            <category><![CDATA[gender-equality]]></category>
            <category><![CDATA[sports]]></category>
            <category><![CDATA[ultimate-frisbee]]></category>
            <category><![CDATA[usa]]></category>
            <dc:creator><![CDATA[Luke Burgess-Yeo]]></dc:creator>
            <pubDate>Sat, 03 Feb 2018 16:43:09 GMT</pubDate>
            <atom:updated>2018-02-03T16:43:09.102Z</atom:updated>
            <content:encoded><![CDATA[<h4>And the ongoing AUDL gender equity debate.</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*LcLqgystY-LmJ467OiuToA.png" /><figcaption>United Ultimate League logo.</figcaption></figure><p>I try and avoid writing about the AUDL. I’ve discussed why I’m disapproving of the league in the past and, generally, I think that’s all that I need to say on the matter. I didn’t write about the AUDL boycott when it was announced because I had already been somewhat ‘boycotting’ the league from the start. Also, As much as I don’t support the AUDL, I’m not entirely sure if I support the boycott or not — as I feel that there are many more issues with the AUDL than just gender equity. I also share many of the concerns that were raised in <a href="https://ultiworld.com/2017/12/15/deep-look-audl-boycott-hannah-leathers-nicky-spiva-wucc-ringers/">this edition of the Ultiworld podcast</a> (although I do not share the view that the AUDL is beneficial for ultimate in general).</p><p>So what of the <a href="https://uulultimate.com/">United Ultimate League</a>? In case you aren’t aware, the UUL is a proposed semi-pro mixed ultimate league. It’s the creation of Todd Curran — founder of <a href="https://savageultimate.com/">Savage Ultimate</a> — and will be launching in 2019 assuming that it’s crowdfunding efforts are successful. Other notable points include the fact that it will be played 6v6 on smaller fields and with Aria discs. The UUL is also in partnership with USAU and as such will use self-officiation with observers. For more details: here is an <a href="https://ultiworld.com/2018/01/15/new-mixed-gender-professional-league-eying-2019-start/">Ultiworld article</a>, a <a href="http://skydmagazine.com/2018/01/qa-united-ultimate-leagues-todd-curran/">Skyd Magazine article</a> and an <a href="https://ultiworld.com/2018/01/17/deep-look-united-ultimate-league-u24-worlds/">Ultiworld podcast</a> discussing the league (including an interview with Todd Curran himself).</p><p>The UUL is certainly much more appealing than the AUDL. The issues of self-officiation and gender equity are being addressed, however, I still cannot say that I am in favour of the league.</p><p>The reason is simple: it is yet another offshoot of an already far too broken up community. As I have said in the past, it is ridiculous that WFDF and USAU use too differing rule sets, let alone having the AUDL playing an entirely different version of the game. Adding the UUL into the mix, with another rule set, is further exacerbating the problem. Admittedly, the UUL will be using the USAU rules for the most part, however they are changing the format to 6v6 and games will be played to a time limit rather than points which dramatically changes how the game is played (and maybe I’ll write something one day about why ultimate shouldn’t be played to time).</p><p>In my mind (and seemingly in the mind of WFDF) the number one, most beneficial thing for ultimate in the near future would be making it into the Olympics. Given how young our sport is, it is hardly surprising that we have yet to decide on the optimal rule set and officiating system, but it would be an extremely positive step if we could decide on a single way of doing things and work towards developing the community to a point where the Olympics doesn’t sound like a pipe dream anymore.</p><p>At this stage, I would much rather see the efforts of the US community go towards making the top level of USAU play as good as it can be (both from a player and spectator point of view). If semi-pro ultimate is the aim then why not try and turn the very top USAU club teams into semi-pro franchises — through sponsorship from USAU and its partners for example — rather than inventing a brand new league which pulls from the same player base anyway? Or better yet, put more resources into growing ultimate at the youth level?</p><p>I can foresee the UUL being reasonably successful. I am fairly confident that it will hit at least it’s initial crowdfunding target, if not a stretch goal or two, which will support the league for a year. There are many questions still to be answered around the years after that and the feasibility of the league long term. I would much rather see the UUL succeed than the AUDL but I do wonder if another revolution, similar to the gender equity movement, would surface after a few successful years of the UUL but this time with race or class being the central issue? It is well known that the vast majority of ultimate players are white and middle class and this is the demographic that any high level ultimate league will favour. I think that it is hard to properly tackle race and class issues if we can’t even get basic gender equality right but we must not forget that there are still many problems our community has inherited from society that we have so far failed to deal with. Setting up a successful and sustainable semi-pro mixed league is not the end game, and I really hope that everyone campaigning so vocally for gender equity will also turn their attention to other marginalised groups once the major gender equity issues have been addressed to a satisfactory level (which will happen eventually. Of course gender equity in ultimate will still be an issue for as long as it’s an issue in society in general).</p><p>I am mildly interested in how well the UUL does, but I will not be supporting the league.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=6a5cabf03fae" width="1" height="1" alt=""><hr><p><a href="https://medium.com/this-ultimate-life/thoughts-on-the-uul-6a5cabf03fae">Thoughts On The UUL</a> was originally published in <a href="https://medium.com/this-ultimate-life">This Ultimate Life</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[U24 World’s Review]]></title>
            <link>https://medium.com/this-ultimate-life/u24-worlds-review-663d193dc48e?source=rss-f1c9b4cd56ae------2</link>
            <guid isPermaLink="false">https://medium.com/p/663d193dc48e</guid>
            <category><![CDATA[australia]]></category>
            <category><![CDATA[review]]></category>
            <category><![CDATA[ultimate-frisbee]]></category>
            <category><![CDATA[sports]]></category>
            <category><![CDATA[opinion]]></category>
            <dc:creator><![CDATA[Luke Burgess-Yeo]]></dc:creator>
            <pubDate>Wed, 17 Jan 2018 17:31:01 GMT</pubDate>
            <atom:updated>2018-01-17T21:18:15.385Z</atom:updated>
            <content:encoded><![CDATA[<h4>Another Sweep For The USA</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/500/1*IAblejltFtvwy_R8QdQkBA.png" /><figcaption>Official WU24UC2018 Logo.</figcaption></figure><p>It was an exciting week, with a slightly disappointing outcome but congratulations to all three US teams for taking gold. Let’s look back at the tournament and see how wrong my predictions were. (Full results can be found <a href="https://ultiarchive.com/">here</a>, my predictions can be found <a href="https://medium.com/this-ultimate-life/u24-worlds-predictions-7c5da2b65b0d">here</a>.)</p><h3>Men’s Division</h3><p>As predicted, USA won. I also predicted that Australia would came third. I don’t think anyone predicted that Italy would take second. Hence, I was very wrong about the second and fourth place teams. I had picked Canada and Japan to take those spots but both teams were knocked out in quarters. Canada fell to the USA while Japan fell to Italy themselves.</p><p>GB fell to Australia in quarters in a painful throwback to the quarter finals of WUGC 2016. I didn’t think the team was top four quality and their final position of seventh is probably very fair given how competitive the top eight of the tournament was.</p><h3>Women’s Division</h3><p>I came a little closer in this division. However, Japan narrowly missed out on the top four after losing to Australia on double game point in the pool play. Colombia joined Australia, Canada and the USA to make up the top four. The USA beat Canada in the most one sided of all the finals and Australia took Bronze over Colombia. Despite not making the top four, the Japan women’s team put on some of the most entertaining games of the tournament during the group stage.</p><p>The GB women’s team only won two games in the group stage (against Singapore and the Philippines) finishing the tournament in tenth. Another disappointing, but not unpredictable, performance from the GB women’s program and yet more evidence that more needs to be done for the development of women’s ultimate in the UK (especially at the junior level).</p><h3>Mixed Division</h3><p>I had high hopes for the GB mixed team, but another crushing quarter finals loss to Australia saw them tumble into the lower bracket and finish the tournament in seventh. The quarter final in question was live streamed on YouTube so we could all see the mistakes that lead to GB’s undoing. GB failed to catch their attempted blocks on several occasions and, with the Perth wind, this lead to Australia maintaining position when they really shouldn’t have, and these are mistakes that just can’t be made in the quarter finals of a world championship. In that game GB showed that they were not a top four calibre team.</p><p>Japan, Australia, Canada and the USA on the other hand were all very much top four calibre teams and Japan put up a valiant fight in the final before ultimately losing to the USA. Canada beat Australia to take third. Also, shout out to Singapore for not only making it into the top eight — but taking fifth after losing to the USA in quarters, a huge result for them.</p><h3>Media Coverage</h3><p>The media coverage of the tournament was very good. There were at least three games a day being live streamed, a crazy amount of social media content, plenty of articles written by The Show Game, Ultiworld, etc. so following the tournament was actually quite easy — or at least once the guys at Ultiarchive got their site up. The official website was absolute garbage, it was pretty much impossible to find any useful information. The full list of final standings isn’t even up there. I was a big fan of the changes to the original broadcast schedule, which was pretty lacklustre, but I think the final set of games that were filmed really showcased international ultimate in a great way.</p><p>The production quality of the live broadcast was excellent. I really enjoyed the different camera angles, and especially the smaller roaming camera that was filming the players up close just after a score towards the end of the week. Having mic’s on the game advisors was also great. It was really interesting to hear the conversations and for the commentators to be able to ask questions and get clarification on what had happened or various aspects of the rules. Rueben Berg<strong> </strong>was particularly impressive as a mic’d up GA and gave us some great insights, as well as doing really well at facilitating communication between players during calls.</p><p>There were some very mixed opinions regarding the commentators, a lot of people really enjoyed the energy and enthusiasm which was kept at a high level all week. On the other hand, some people were complaining about the reduced level of professionalism when compared to the very top ultimate commentators. I agree that the commentators were not world class, but in my opinion — by the end of the week at least — they were still very good. All of them had different verbal ticks and mannerisms that were a little annoying but given that they were frequently talking over each other and not working with specific roles at the start of the week, the improvement was significant. Also, the gender ratio was spot on, which was great to see.</p><p>Overall, I really enjoyed U24 World’s and I can’t wait for WUCC later this year for some more top level international ultimate.</p><p>As I have not been living under a rock, I realise that between World’s finishing and me writing this post there has been some very big news emerging from the whole AUDL boycott movement, with the announcement of plans for a semi-pro mixed league starting in 2019. I will be writing up my thoughts regarding that at some point soon but until then feel free to go back and read my posts regarding <a href="https://medium.com/this-ultimate-life/should-mixed-ultimate-be-6v6-d97385ea6ccd">6v6 mixed</a> and <a href="https://medium.com/this-ultimate-life/what-do-you-think-of-the-pro-leagues-263a1e6f9cd0">the pro leagues</a>.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=663d193dc48e" width="1" height="1" alt=""><hr><p><a href="https://medium.com/this-ultimate-life/u24-worlds-review-663d193dc48e">U24 World’s Review</a> was originally published in <a href="https://medium.com/this-ultimate-life">This Ultimate Life</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[U24 World’s Predictions]]></title>
            <link>https://medium.com/this-ultimate-life/u24-worlds-predictions-7c5da2b65b0d?source=rss-f1c9b4cd56ae------2</link>
            <guid isPermaLink="false">https://medium.com/p/7c5da2b65b0d</guid>
            <category><![CDATA[united-kingdom]]></category>
            <category><![CDATA[competition]]></category>
            <category><![CDATA[sports]]></category>
            <category><![CDATA[australia]]></category>
            <category><![CDATA[ultimate-frisbee]]></category>
            <dc:creator><![CDATA[Luke Burgess-Yeo]]></dc:creator>
            <pubDate>Sun, 17 Dec 2017 12:16:28 GMT</pubDate>
            <atom:updated>2017-12-17T12:17:11.976Z</atom:updated>
            <content:encoded><![CDATA[<h4>How will GB do over in Perth?</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/680/1*hMV3xhdAEhwsC18Vr0u3zA.jpeg" /><figcaption>Official WU24UC2018 Logo.</figcaption></figure><p>It’s less than a month before the <a href="http://wu24perth.com/en_au">World Under 24 Ultimate Championships</a>, so it is about time to throw down some predictions. Unfortunately, a schedule does not seem to have been publicly released, making things a little harder to predict but we will see how it goes.</p><p>In basically every division the main contenders are: USA, Canada, Japan, Australia and Great Britain. Of course, keep an eye out for Colombia and some of the other European teams such as France and Germany. These are the countries that put a lot of emphasis on their youth and U24 programs and I expect to see the top 8 of each division made up predominantly of these teams. So let’s get into each division more specifically (spoiler alert: USA are the favourites).</p><h3>Men’s</h3><p>My top 4 in this division is:</p><ol><li>USA</li><li>Canada</li><li>Australia</li><li>Japan</li></ol><p>I expect to see GB in the quarter finals here but they are not the same calibre of team that we saw take the USA to double-game-point in the semi-finals in London two years ago. That being said, the top seven players on GB are good enough to take on the best any country has to offer but it’s GB’s depth that worries me. Therefore, I don’t expect them to make it into the top four without an especially favourable schedule or freak upsets.</p><p>USA should win fairly comfortably and Canada tend to have very strong men’s teams, so I am picking them for the silver medal.</p><h3>Women’s</h3><p>For the women’s division:</p><ol><li>USA</li><li>Australia</li><li>Japan</li><li>Canada</li></ol><p>GB Women have been struggling in all age groups recently (with the exception of a bronze medal at <a href="http://live.wcbu2017.org/standings/wmn/30">beach world’s</a>), and I wouldn’t be surprised to see GB not make it through the group stage in Perth unless they get a particularly favourable group.</p><p>Australia’s women’s teams have also been struggling recently, although this time round they do have the legendary Mish Phillips as a coach which could make the difference for them.</p><p>Japan famously took down the USA in the final two years ago in London. I expect to see another strong team coming out of Japan and a semi-final between Australia and Japan could be one of the best games of the tournament.</p><p>The only other team that I can see making it into the top 4 is Colombia. Colombia has potential to send a truly formidable team but that all depends on whether Marucio Moore will be coaching them and whether the Cardenas sisters will be playing. They may well be skipping this tournament to focus on WUCC with Revolution later in the year. A strong Colombian team could well make the final.</p><h3>Mixed</h3><p>And finally, the mixed division:</p><ol><li>USA</li><li>Australia</li><li>Canada</li><li>Great Britain</li></ol><p>GB finally make their way into my top 4. This is because, having spoken to some of the GBX players, they are rumoured to be in a group which makes it fairly easy for them to get to the quarter finals with a favourable matchup. Unfortunately I don’t see them beating any of the other top 4 teams, but a 4th place finish would be huge for them.</p><p>Australia have historically had good mixed teams and I can see them taking down Canada if that game get’s played.</p><p>I am personally very excited to see what WU24UC2018 has to offer. Hopefully the weather will be good, the live streams will be hold up and the games will be exciting. I also hope that I am proved wrong and that GB make deep runs into every division.</p><p>Until then, have a good Christmas and spare a thought for the U24 athletes and coaching staff that won’t be able to relax quite as much as the rest of us.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=7c5da2b65b0d" width="1" height="1" alt=""><hr><p><a href="https://medium.com/this-ultimate-life/u24-worlds-predictions-7c5da2b65b0d">U24 World’s Predictions</a> was originally published in <a href="https://medium.com/this-ultimate-life">This Ultimate Life</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[WUCC2018 Bids]]></title>
            <link>https://medium.com/this-ultimate-life/wucc2018-bids-eaf919ceaaa9?source=rss-f1c9b4cd56ae------2</link>
            <guid isPermaLink="false">https://medium.com/p/eaf919ceaaa9</guid>
            <category><![CDATA[gender-equality]]></category>
            <category><![CDATA[ultimate-frisbee]]></category>
            <category><![CDATA[sports]]></category>
            <category><![CDATA[south-africa]]></category>
            <category><![CDATA[2018]]></category>
            <dc:creator><![CDATA[Luke Burgess-Yeo]]></dc:creator>
            <pubDate>Tue, 21 Nov 2017 22:37:35 GMT</pubDate>
            <atom:updated>2017-11-21T22:37:35.812Z</atom:updated>
            <content:encoded><![CDATA[<h4>WFDF Finally told us how many teams each country gets to send to Worlds!</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/488/1*eqXBSwUo4bqwvPS6ci7LhQ.png" /><figcaption>WUCC2018 logo</figcaption></figure><p>After many months of waiting, WFDF have finally told us how many teams each country will get to send to World’s next year. The list of bids each country has received can be <a href="https://ultiworld.com/2017/09/22/wucc-2018-initial-bid-allocation-released/">found here</a>. The teams that have currently qualified can be <a href="http://wfdf.org/images/wucc-list-sheet1.pdf">found here</a>. Incase you didn’t already know, Great Britain has three bids in each division, so the teams we will be sending are Clapham, Chevron, Devon, Iceni, SYC, Nice Bristols, Black Eagles, SMOG and Reading.</p><p>There are, however, some notable exclusions. The most high profile has to be the lack of a bid for <a href="http://skydmagazine.com/2017/11/how-did-we-end-up-here/">South Africa in the Mixed division</a>. The linked Skyd magazine article goes deep into the historical context leading up to this decision by WFDF and although the author claims that the bid allocation rules are opaque, WFDF have released a <a href="http://www.wfdf.org/files/WFDF_Rules_of_Ultimate_2017_-_Appendix_FINAL.pdf">public document containing the bid allocation rules</a> (see section E5, or the Ultiworld article linked above for a summary).</p><p>The very first rule in the E5 section states:</p><blockquote>E5.1. WFDF Member Federations receive one (1) bid in each playing division in which the Member Federation participated in the previous WUGC event.</blockquote><p>As South Africa did not enter a mixed team into WUGC2016, it comes as no surprise that they did not recieve a big to WUCC in the Mixed division, as tragic as that is for the players on Flying Tigers who worked so hard to win the National and Continental titles.</p><p>Having said this, rules E5.4. and E5.5. arguably award South Africa a bid in the Mixed division, but WFDF ultimately decide which bids go where and there’s not a lot we can do about it without major international outcry which (at least at this point) seems unlikely.</p><p>The only other country in a similar situation is India, receiving only one bid (in the Mixed division) despite sending multiple teams to WUGC last year.</p><p>The bids for all other countries look reasonable, although it is always worth reminding ourselves that Ireland only got one bid in the Men’s division — and it did not go to Pelt. Ranelagh beat Pelt in an extremely windy final of Irish nationals earlier this year securing their spot at World’s despite generally finishing behind Pelt all season long (at UK Tour and Nationals for example).</p><p>Finally, I sincerely hope that Atletico (the top women’s team from Finland and reigning European champions) do send a competitive team to World’s. There was <a href="https://ultiworld.com/2017/10/09/eurozone-eucf-recap-jaimie-cross-jeroen-oort-essi-inkinen/">rumour from the Atletico captain</a> that they may not send a team, which would be a great shame. Reigning continental champions should really be trying to prove themselves on the largest of international stages, but ultimate is an amateur sport and Cincinnati is a long way from Helsinki.</p><p>Whilst we continue to get excited about WUCC2018, the next major international tournament is less than two months away. U24 World’s takes place in Perth in January and, although it doesn’t look like I will be there in person, I cannot wait to follow the action.</p><p>The GB teams have been working hard whilst the rest of us enjoy our off season and soon we will get to see just how much that work will pay off.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=eaf919ceaaa9" width="1" height="1" alt=""><hr><p><a href="https://medium.com/this-ultimate-life/wucc2018-bids-eaf919ceaaa9">WUCC2018 Bids</a> was originally published in <a href="https://medium.com/this-ultimate-life">This Ultimate Life</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
    </channel>
</rss>