Rakarake/churf
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Inference on most expressions. HM based.

Browse source 
Still have to figure out how to infer type of lambda variables, as well
as how function application on polymorphic should work
This commit is contained in:
sebastianselander 2023-02-13 12:17:49 +01:00
parent a1e9624d5e
commit 73dc2e4b6a
12 changed files with 347 additions and 310 deletions
Download patch file Download diff file Expand all files Collapse all files

28
Grammar.cf
View file

@ -1,20 +1,28 @@
Program. Program ::= [Bind];
EId. Exp3 ::= Ident;
EInt. Exp3 ::= Integer;
ELet. Exp3 ::= "let" [Bind] "in" Exp;
EApp. Exp2 ::= Exp2 Exp3;
EAdd. Exp1 ::= Exp1 "+" Exp2;
EAbs. Exp ::= "\\" Ident "." Exp;
Bind. Bind ::= Ident [Ident] "=" Exp;
EAnn. Exp5 ::= Exp5 ":" Type ;
EId. Exp4 ::= Ident;
EConst. Exp4 ::= Const;
EApp. Exp3 ::= Exp3 Exp4;
ELet. Exp2 ::= "let" Bind "in" Exp;
EAdd. Exp1 ::= Exp1 "+" Exp2;
EAbs. Exp ::= "\\" Ident "." Exp;
CInt. Const ::= Integer ;
CStr. Const ::= String ;
TMono. Type1 ::= Ident ;
TPoly. Type1 ::= Ident ;
TFun. Type ::= Type1 "->" Type ;
separator Bind ";";
separator Ident " ";
coercions Exp 3;
coercions Type 1 ;
coercions Exp 5;
comment "--";
comment "{-" "-}";