fwd/include, branch masterA programming language that cannot returnhttps://metanimi.dy.fi/cgit/fwd/atom?h=master2026-05-01T19:16:26Zadd support for coverage2026-05-01T19:16:26ZKimplulkimi.h.kuparinen@gmail.com2026-05-01T17:35:00Zurn:sha1:8946c27306abed7065afad3f015df5ee81e72ad2run formatter2026-05-01T11:40:06ZKimplulkimi.h.kuparinen@gmail.com2026-05-01T11:40:06Zurn:sha1:7a68d1106b37e16c24e58bc77ce49fc6beadce9c
+ Should really get this done automatically somehow
add initial reference invalidation2026-03-13T12:09:53ZKimplulkimi.h.kuparinen@gmail.com2026-03-13T12:07:29Zurn:sha1:ed7da0d9e31e8dd6847e2e603f0d1943330cf4d0
+ Makes vec example actually memory safe, which is cool
+ Specify owner > sub relationships with ">" in closure parameter
lists, uses the same group idea as closure calls
+ Relies on users implementing functions in a consistent manner,
since you can kind of do whatever with pointers. Presumably
there would be a stdlib of vec/map/set etc. which applications
could then use and by proxy be memory safe. Although some more
checks wouldn't hurt, I suppose?
+ Not sure I like having reference invalidation be 'just a move',
seems to work alright but the semantics of it are a bit muddy.
example/vec fixes2026-02-25T23:19:56ZKimplulkimi.h.kuparinen@gmail.com2026-02-25T23:19:56Zurn:sha1:e36f35d0ee1132a8aa998891ca333ff0c4ed64c2
+ Doesn't quite work yet, but compiles fine. Some issues were in the
example itself, heh
filter out empty nodes from statement list2026-02-25T20:55:35ZKimplulkimi.h.kuparinen@gmail.com2026-02-25T20:54:10Zurn:sha1:0dd32cca3b8ad7e2a34ec815996e68e2f81c1da1
+ Fixes tail call analysis that was accidentally broken by
64146b46da45ce69ab380add00459f7b60fe9196
+ Kind of wasteful to first allocate empty node and then just throw it
away, but I don't have any better ideas at the moment
vec example produces C, but broken C2026-02-25T20:42:22ZKimplulkimi.h.kuparinen@gmail.com2026-02-25T20:42:22Zurn:sha1:ee50ee4ef760521c0764177b3bb8fed25beb2092improve move checker to detect pointer leaks2026-01-06T15:19:52ZKimplulkimi.h.kuparinen@gmail.com2026-01-06T15:17:27Zurn:sha1:99601456e6ad4c86287ba786923c99c5499037e0
+ Currently requires a lot of unnecessary `forget` statements,
but at least some can likely be eliminated by doing some
basic origin analysis, kind of like with groups
work towards a simple integer vector implementation2026-01-06T15:19:52ZKimplulkimi.h.kuparinen@gmail.com2025-12-28T22:07:16Zurn:sha1:c7b41b47d038fd4973da05224b7aa29efaae1784
+ Hopefully shows that useful programs can be implemented with
the rules present
+ Still missing at least external functions with non-void returns
implement enough type analysis for vector example2026-01-06T15:19:52ZKimplulkimi.h.kuparinen@gmail.com2025-05-07T18:22:38Zurn:sha1:d501b2c9ebab6f5b90c808ea0e5fde912818707d
+ Big commit, scary
+ Some details still a bit up in the air, mainly about move checking
structure member access ('register' types are freely copied I guess,
same as in rust? How about user types?)
WIP: rewrite C++ backend to be C2025-03-30T19:41:21ZKimplulkimi.h.kuparinen@gmail.com2025-03-30T19:36:53Zurn:sha1:957da9056c36a5eea15c6058701f7465b31f64a8
+ C allows for a bit more control, and we can manually handle closure
contexts. For example `examples/fib.fwd` now works for effectively any
`n`, pretty cool.
+ Fairly slow Fibonacci, I must admit. Initial profiling indicates it's
mainly due to branch mispredictions, but I'll have to look into this a
bit deeper.
+ The code is a bit hacked together, for now I'm more interested in
getting things working, I'll worry about making things pretty later.
+ For testing, there's also initial support for modules, just so I can
print stuff to the terminal
+ This commit is way too big, lol