bruno-cadorette

using System;

namespace MaybeCSharp
{
    interface IMaybe<T>
    {
        IMaybe<U> Bind<U>(Func<T, IMaybe<U>> f);
        IMaybe<U> Map<U>(Func<T, U> f);
        IMaybe<U> Ap<U>(IMaybe<Func<T, U>> f);
    }

bruno-cadorette

/*
                    GNU GENERAL PUBLIC LICENSE
                       Version 3, 29 June 2007

 Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
 Everyone is permitted to copy and distribute verbatim copies
 of this license document, but changing it is not allowed.

                            Preamble

bruno-cadorette

### Keybase proof

I hereby claim:

  * I am bruno-cadorette on github.
  * I am brunocadorette (https://keybase.io/brunocadorette) on keybase.
  * I have a public key ASDpLETUCCZ5yGWHBeGCTPt9d-RKxIOW9NeZIYe1nvICNgo

To claim this, I am signing this object:

bruno-cadorette

{-#LANGUAGE TypeFamilies, DeriveFunctor #-}

import Data.Functor.Foldable

data Tree a = Leaf | Node a (Tree a) (Tree a) deriving (Show)
data TreeF a b = LeafF | NodeF a b b deriving (Functor, Show)

type instance Base (Tree a) = TreeF a
instance Recursive (Tree a) where
    project Leaf = LeafF

bruno-cadorette

Require Import Coq.Lists.List.
Import Coq.Lists.List.ListNotations


Fixpoint my_remove_last {A : Type} (l : list A) : list A:= 
  match l with
    | [] => []
    | x :: [] => []
    | x :: xs => x :: (my_remove_last xs)
  end.

bruno-cadorette

import Control.Applicative
import qualified Data.Map as Map
import Debug.Trace
import Data.Foldable
import Data.Maybe
import Data.Ord
import Data.List
import Data.List.NonEmpty (nonEmpty)

minTransitions ::