Tom01098

Main<>
	count = Read<>
	n = 1

	loop n <= count
		FizzBuzzNumber<n>
		n => n + 1
	end
end

Tom01098

// Get the factorial of an integer.
let factorial n =
    // Actual recursive factorial implementation.
    let rec f n =
        match n with
        | 0 -> 1
        | _ -> n * f (n - 1)

    // Validate that n isn't negative
    match n with

Tom01098

module BinarySearchTree

// Recursive tree type.
// Generic constraint to prevent creation of
// a tree where it doesn't make sense.
type Tree<'a when 'a : comparison> =
    | Node of 'a * Tree<'a> * Tree<'a>
    | Empty

/// Create an empty tree.

Tom01098

private static T ID<T>(T x) => x;