Savelenko

module Zipper

type Person = { Name : string; Children : List<Person> }

type Parent = Parent of {| Name : string;  OtherChildren : List<Person> |} // Note *other* children

/// The "family tree" zipper
type FamilyTree = FamilyTree of Person * List<Parent> // A person and his/her ancestors

/// Person -> FamilyTree

Savelenko

(* Library portion *)

/// Just like Async but supports early return with skipping the rest of computations.
type ContAsync<'r,'a> = ('a -> Async<'r>) -> Async<'r>

/// Early return.
let early (a : 'a) : ContAsync<'a,_> = fun _ -> async { return a }

/// Computation expression builder.

Savelenko

(* An experiment with implementing early return in F#. Initial examples work, but I do not know whether it is really correct! *)

/// A computation which runs to completion and produces 'r or returns an 'a early, short-circuiting some steps.
type R<'a,'r> =
    private
    | Done of 'r
    | EarlyReturn of 'a
    | Zero
    | Effect of (unit -> R<'a,'r>)

Savelenko

// A polymorphic function which works for values of *any* type.
let hello (a : 't) : string =
    // Just ignore the argument
    "Hello"

// We can use it any context, on any input: it is polymorphic after all.
let result =
    let a = hello 1
    let b = hello "string"

Savelenko

type Factory<'T> = unit -> Option<'T>
type NoOptionFactory<'T> = unit -> 'T

type FactoryTests () =

    member _.CanFactory () =
        // Use the Option-returning factory
        let factory : Factory<'T> = FactoryTests.FactoryFunction
        let testString : Option<string> = factory ()
        let testInt : Option<int> = factory ()

Savelenko

private static void Main(string[] args)
{
    /* LINQ-to-nothing-special */

    Just<int> five = 5;
    Just<int> six = 6;

    var eleven = from a in five
                 from b in six
                 select a + b;

Savelenko

/// Non-empty trees.
type Tree<'a> = TreeNode of 'a * List<Tree<'a>>

/// Syntactic simulation of the `Tree` base functor.
let (|TreeNode_|) (a, ys) = (a, ys)

/// Regular catamorphism for `Tree`.
let rec cata f (TreeNode (a, ts)) = f a (ts |> List.map (cata f))

/// Compute a result from a single `Tree` node while having access to a function which computes a result from a single

Savelenko

module EmployeeLocation

open TypeEquality

type Name = string

/// Some employees are engineers.
type Engineer = Engineer of Name

/// Some employees are factory workers.

Savelenko

module Bounded =

    type IBound =
        static abstract Bound : int

    type Bounded = private Bounded of int // Abstract data type

    let bounded<'bound when 'bound :> IBound> (value : int) : Option<Bounded> =
        if value <= 'bound.Bound then Some (Bounded value) else None

Savelenko

module Handler

open System.Threading.Tasks
open Giraffe
open Giraffe.FormatExpressions
open Microsoft.AspNetCore.Http
open Microsoft.Extensions.Logging

(* Core definitions *)