#programing languages

Yes I finished the type checker. But the language don’t have all the feature I want to Sooooo for now it’s good enough.

main = add 5 .$ + 1 2 add: a, b = + a b $: function, right function, right argument one, right argument two = right function right argument one right argument two .function

//main :: Int //add :: Int -> Int -> Int //$ :: (b -> a) -> (c -> d -> b) -> c -> b -> a

Since last time ai realised that my previous implementation of the type checker wouldn’t work for generics. So I re-wrote the entire thing. I am not handling infix type checking yet. But I did managed to do the following

Hey it‘s been a while o/.

Since the last time I have been working on type inference. I finished basic inference today.

add one: n = + 1 n add two: n = 2 .+ n -> (Int -> Int -> Int)

In last update I talked about how you could only call one function per function body. Now it’s no longer the case with the introduction of the “.” oporator you can turn ANY function into an infix function with left priority. the result of the expretion to the left will be passed as the first argument of the function

An other important milestone is here you can now define your own function. It is still somewhat limited since  it will only do one function call per line (by design, but I have something coming for that later) and we don’t have conditional branching yet.

my add: a, b = add a b main = my add 5 5 -> 10

This morning I was able to implement function calling for built in functions for al of those cases:

main = add 1 2 -> 3

main = add one 2 one = 1 -> 3

main = add one one two one = 1 one two = 12 -> 13