md` To facilitate parsing of our language we have decided to give it the following lisp-like syntax: **Integers** ${html`1 is represented as (TMint 1), 2 as (TMint 2) ...etc.`} **Bool** ${html`True is (TMint 1) and False is (TMint 0)`} **String** ${html`"hello, world!" is defined as (TMstr hello, world!)`} **Variable** ${html`a variable x is declared as (TMvar x)`} **Tuples** ${html`a tuple (t0, t1, t2) for example is defined as (TMtup t0 t1 t2)`} **Operations** 2 + 3 + 4 is defined as ${html`(TMopr + (TMint 2) (TMint 3) (TMint 4))`} **Lambda Function** ${tex` \lambda x.x + x`} can be defined as ${html`(TMlam x (TMopr + (TMvar x) (TMvar x))) `} **Function application** Applying the above lambda function to 1 can be done as such: ${html`(TMapp (TMlam x (TMopr + (TMvar x) (TMvar x))) (TMint 1))`} **Fixed Point** the fibonacci function can be written as ${html` (TMfix f x (TMifnz (TMvar x) (TMifnz (TMopr - (TMvar x) (TMint 1)) (TMopr + (TMapp (TMvar f) (TMopr - (TMvar x) (TMint 1))) (TMapp (TMvar f) (TMopr - (TMvar x) (TMint 2))) ) (TMint 1)) (TMint 0)) ) `} **Sequential operations** let val () = println!("hello, world!") in add(2, 3) end can be encoded as ${html` (TMseq (TMopr println (TMstr hello, world!)) (TMapp (TMapp (TMlam y (TMlam x (TMopr + (TMvar x) (TMvar y)) ) ) (TMint 2)) (TMint 3)) ) `} `