3 ms·

Thanks for replying! (a) and (b) make sense. (b) will depend on adoption as well, so your answer is fully understandable. Just a follow-up question on (c) - if

Thanks for replying! (a) and (b) make sense. (b) will depend on adoption as well, so your answer is fully understandable. Just a follow-up question on (c) - if you will allow me please. Are the data structures immutable like Clojure and Erlang, so that they could be distributed eventually, once the optimizations are done (and you are able to package the non-functional code like C into their own partitions for the distribution)? Reason I ask is that the page mentions Category Oriented Programming - which I am not at all familiar with. Regards

wdanilo 11y ago
I would really love to answer any questions regarding Luna, so feel free to ask them as many as you need! c) Yes, Luna supports immutable data structures in the form of composable algebraic data types. Composability means in this context that you can compose the sum and product types directly using Luna's built-in combinators, so you can for example build data types that share some constructor definitions (this is just a generalization of algebraic data types in general. As a side note, the first Luna release lacks some mechanisms to fully handle this abstraction, but this is understandable as this is an alpha release). Luna data types allow for efficient binary serialization, if you mean it by asking about "own partitions for the distribution". The Category Oriented Programming paradigm, on the other hand, is developed by us. It is widely described in the Luna user manual, that for now will be available for alpha testers only, but we will work towards releasing it to the public as fast as possible. Did I answer your questions?
- gsanghera 11y ago
  Thanks a lot, yes. All the best and look forward to this!