-- Inv

s = \ f -> \ g -> \ x -> f x (g x);


Inv: inv toc < ( < #1 , #7 > : ( < #2 , #7 > : ( < #3 , #7 > : [] ) ) ), ( #1: ( #2: ( #3 : [] ) ) ) >

Inv: inv myddId ( []+> "hallo")



-- Thesis  change focusCol and chess colors to grey, change '\' to 'l' withFont "Symbol"

list = [ 1+2, 27, 3*5 ];

large = \x -> \y -> \z -> x+y+z+1;

s = \f -> \g -> \x -> f x (g x);

f = \x -> x^2+2*x+(3+x)*(2+x)*1%(x+1)^2;

c = f 3;




increase = \ x -> x+1;

Slides: pres


-- Japan monday

simple = \x -> 1+2*3+x;

frac = 1*2*3 % 4*5*6;

nestedFrac = 1*2^2*3 % 4*5*6;

-- ToPS Japan demo


inc = \x -> x+1;

h = [(1,False),(2,True),(3,False)];

s = \f -> \g -> \x -> f x (g x);

x = let local = 1+2+3+4; h = 1; in if True then local + h else 0;

g = case 5*7 of aaa -> 2+4; b -> 10;;

test = f 3;














f = \x -> x^2+2*x+(3+x)*(2+x)*1%(x+1)^2;




-- Content design demo:

Slides: pres
inc = \x -> x+1;

h = [(1,False),(2,True),(3,False)];

x = let local = 1+2+3+4; h = 1; in if True then local + h else 0;

g = case 5*7 of aaa -> 2+4; b -> 10;;

test = f 3;

f = \x -> x^2+2*x+(3+x)*(2+x)*1%(x+1)^2;


-- some lambda terms for trying the reducer.


testY = y f;

inc = \x -> x+1;

val = \num -> (num inc) 0; 

test = val ((add one) one);

zero = \s -> \z -> z;

one =  \s -> \z -> s z;

two =  \s -> \z -> s (s z);

three =  \s -> \z -> s ((two s) z);

add = \n -> \m -> \s -> \z -> (n s) ((m s) z);

mult = \n -> \m -> \s -> \z -> (n (m s)) z;

y = \h -> (\x -> h (x x)) (\x -> h (x x));

-- 
PPT: pres

inc = \x -> x+1;

h = [(1,False),(2,True),(3,False)];

x = let local = 1+2+3+4; h = 1; in if True then inc 18 else 0;

g = case 5*7 of aaa -> 2+4; b -> 10;;

test = f 3;

f = \x -> x^2+2*x+(3+x)*(2+x)*1%(x+1)^2;

-- MS demo:

x = let local = 1+2+3+4; h = 1; in if True then f 18 else 0;

g = case 5* 7 of aaa -> 2+4; b -> 10;;

h = [1,2,3];

f = \x -> x+1;

y = 1;

--

g = case 5* 7 of
      a -> 2 + 4;
      b -> 10;;

h = [1,2,3];

f = \x -> x+1;

j = let a = 10;
        b = 20;
        c = True;
    in  if c then let a = 1;
                      d = 4;
                  in  a+d
             else 10;

s = \f -> \g -> \x -> f x (g x);
k = \a -> \b -> a;
t = ( 1+2
    , 3+5
    , 81);
    

Chess: board


lst = [1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0];
lst = [1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0];
lst = [1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0];
lst = [1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0];
lst = [1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0];
lst = [1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0];
lst = [1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0];
lst = [1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0];
lst = [1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0];
lst = [1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0];
lst = [1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0];
lst = [1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0];
lst = [1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0];
lst = [1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0];
lst = [1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0];
lst = [1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0];
lst = [1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0];
lst = [1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0];