| Age | Commit message (Collapse) | Author |
|---|
|
+ 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
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
+ Enough that examples still compile, but missing references etc.
|
|
+ Missing implementations for most things, but it already highlights
an oversight in my initial plan, namely that currently, a function
might call multiple of its closures, meaning that a closure wouldn't
be allowed to move a value. I'm debating whether to check that only
one closure from a parameter list is called at a time or if I should
do what Hylo does and add in some kind of 'subscript' that's like a
function but has slightly different rules?
|
|
|
|
|
|
+ No actual type checking is implemented as of yet, but with references
and pointers I should be able to start playing around with checking
move semantics and so on
+ Might at some point also look into type propagation for let,
annoying to have to specify the same thing twice.
|
|
+ Add some notes about returning functions that I started thinking about
as a result of the fib example
|
|
+ Lots of code copied from ek, so didn't have to start from scratch, but
might mean there are some quirks here and there that made sense in ek
but not necessarily here.
|
