Nathan Braswell
|
fb179cfcf7
|
Added primitive math ops, and realized when chaining them that overload resolution had to happen for different functions at different times (esp now that we don't just go outside in). Added a iterative resolver to solve the overloads, which iterates over each one and binds the one that only has one option and unifing types based on that, then running through them all again. If progress is not made for a whole iteration, it errors out and shows the first ambigious call. It could show all ambigious calls...
|
2018-10-01 01:19:51 -04:00 |
|
Nathan Braswell
|
4dcf102cb0
|
Also regular overloading works now, by counting remaining unknowns as equal during overload filtering time (so that function calls as statements, which get an inferenced return type of _unknown can match a function with any return type
|
2018-09-24 00:21:39 -04:00 |
|
Nathan Braswell
|
2148577523
|
HM-style return type overloaded function infrencing works!
|
2018-09-24 00:09:30 -04:00 |
|
Nathan Braswell
|
0505a0e7d6
|
Move types into binding also
|
2018-09-22 14:54:52 -04:00 |
|
Nathan Braswell
|
1cae1b1504
|
parse types into initial ast
|
2018-06-22 23:13:08 -04:00 |
|
Nathan Braswell
|
e851d0eac5
|
Add basis for types in k, and move to new poset setup (depend on individual imports, functions, types, and global variables)
|
2018-06-22 20:58:47 -04:00 |
|