Pinned Loading

1. type inference for simply-typed comb... type inference for simply-typed combinaotry logic with S, K and I

   1

   -- only combinators are considered

   2

   data C = S | K | I | A C C

   3

     deriving Show

   4

   5

   data T = V Int | To T T

2. Ordinal.hs Ordinal.hs

   1

   import Data.List

   2

   3

   type Natural = Integer -- the natural numbers

   4

   5

   -- must be manipulated via the smart constructor `ordinal`

3. Automaton2RegExp.hs Automaton2RegExp.hs

   1

   import Data.List

   2

   3

   data RegExp =

   4

     EmptySet |

   5

     Var Int | -- for simplicity