FBMachine

3 ms·

1. 1.▲
   by FBMachine 8y ago

   For those who had questions about how memory is to be managed, the documentation for that work is being tracked here: https://github.com/FBMachine/bon/blob/auto_mem/docs/ch02-01-... Thanks for all o
2. 2.▲
   by FBMachine 8y ago

   Yeah, 'class' in Bon defines a typeclass. While I plan on adding x.norm() as syntactic sugar for norm(x), typeclasses in general are a bit more flexible. For example, while you can use it for polymorphic operator overloading [0],
3. 3.▲
   by FBMachine 8y ago

   Thanks for checking it out. They are currently implemented similarly to OCaml, so yes they are linked lists. This was purely for simplicity (they can be implemented in a couple of lines of code with algebraic data types). Simplicity of impl
4. 4.▲
   by FBMachine 8y ago

   Hi Charles, That's a fair comment. I will say however that the references to performance are more an attempt to keep it in mind from the beginning, rather than being an assertion at this point. I only began working on it shortly after
5. 5.▲
   by FBMachine 8y ago

   Thanks, I really appreciate it!
6. 6.▲
   by FBMachine 8y ago

   I wouldn't call it an extension, but I did use the tutorial to quickly prototype from. There are still some remnants left in the code, but I don't expect much if any to be left in the near future.
7. 7.▲
   by FBMachine 8y ago

   Hi Chris, thanks for checking it out. The first code push for Bon was today, so many things are of course rough around the edges. Memory will be garbage collected, though I am aiming for zero-cost as much as possible. At the moment it just
8. 8.▲
   Show HN: Bon – programming language designed for simplicity, performance, safety(github.com)

   99 points by FBMachine 8y ago|35 comments