Commit Graph

25 Commits

Author SHA1 Message Date
Nathan Braswell
ae2f40bcc7 Treat assignment like other operators 2018-10-01 23:32:46 -04:00
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
dea34f0821 Add in all primitive comparators. Gonna add other primitive ops next - pointers are gonna be interesting and will probs have to wait till generic functions (to make them generic operators) 2018-09-30 16:21:24 -04:00
Nathan Braswell
4d5e65e962 Groundwork for primitive operations, including > for ints 2018-09-30 16:06:07 -04:00
Nathan Braswell
9f26472b97 Clean up error messages 2018-09-24 00:26:06 -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
9178c2a29d More unification for typechecking: 2018-09-22 20:10:56 -04:00
Nathan Braswell
6c7f313075 Very limited HM-style type inference works! (Just var v = value, but still. The machinery is mostly in place) 2018-09-22 16:41:36 -04:00
Nathan Braswell
0505a0e7d6 Move types into binding also 2018-09-22 14:54:52 -04:00
Nathan Braswell
38133b8bc3 Pull binding out into it's own templated object so we can use it for types for unification 2018-09-22 10:44:02 -04:00
Nathan Braswell
08b5e29b70 Fix poset to handle circular closed dependencies (they're propegated recursively to open dependencies) and some indentation fixes 2018-09-19 00:43:49 -04:00
Nathan Braswell
3e3564ea54 Add basic if statement 2018-09-18 09:04:05 -04:00
Nathan Braswell
2d9f5dc6fe Add in support for top-level-declarations in k and erroring out if no progress is made in poset. A bug I encountered during devleopment of this reminds me of the need to deal with cycles in the poset in the future - probabally by not adding a close dependency if doing so would make a close dependency cycle? This might not actually be fully legitimate 2018-09-18 00:37:16 -04:00
Nathan Braswell
cf4a006958 Fix bug in func calling, pass in argc and argv. Next up will be to get rid of the f of fmain by adding name mangling 2018-09-17 23:52:23 -04:00
Nathan Braswell
0e0ca8d7b4 Big changes to k - now all passes are top-level-item focused, does dead simple scope lookup. Added an error message when trying to match on not an ADT 2018-09-17 23:36:26 -04:00
Nathan Braswell
0cad409b07 Some small cleanup 2018-08-26 22:59:39 -04:00
Nathan Braswell
235fb3c141 Can just barely compile a return int 2018-08-26 22:46:38 -04:00
Nathan Braswell
87bc88cde4 Transition to new pass/poset setup 2018-08-26 21:45:38 -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
Nathan Braswell
6ffe7aee46 Basic support for templates in ast, rest will come with types 2018-06-22 09:02:30 -04:00
Nathan Braswell
a8d4b4eb7f Parses everything but templates into new AST, including imports adding to dependency poset 2018-06-20 00:49:49 -04:00
Nathan Braswell
b5ce776726 Basic AST 2018-06-18 19:04:24 -04:00
Nathan Braswell
e898e7b285 Pass system works 2018-06-14 00:08:55 -04:00