-
# Snapshot
The Graph Systems needs to record the changes during each Propagation recomputation procedure.
This is mainly for the following purpose:
1. user wants to roll-back to a certain stage
…
-
I'm starting to research and attempt to implement incremental backup. I plan to achieve this feature through three PRs:
1. Find a way to send the manifest files to the extension.
2. Compare the fi…
-
Lisps are a very unique language. It is one of the only languages that is homoiconic, and this feature, combined with its S-Expressions and macro abilities let you do some pretty neat things with it.
…
-
# More than Persistent Collections ❤️
Contain **_`persistent(immutable) collections/Functional Data Structures`_** 📌
- **`vavr`** ❤️ ![](https://img.shields.io/github/stars/vavr-io/vavr.svg?styl…
-
I'm John A. De Goes, an advanced functional programmer who currently works with Scala and PureScript, with an occasional bit of Haskell. I love clean solutions, static types, and composing large progr…
-
I am interested in the implementation plan for thread model, async runtime and some data containers (like map).
Is the plan is to implement one in the backend and then port the interfaces to the la…
-
As suggested by @BobHanson, there should be standard means to distinguish between experimental and theoretical structures. This could be a property with boolean/enum values. I would suggest "MUST" lev…
-
@Moredread @coldfix @DanielSank
Pinging everybody who might be still interested in this.
By now, I feel like using the raw observer pattern like this is actually a bad idea and one should go for som…
-
`Data.Sequence` is only strict in its length and not its values - analogous to how `Data.Map.Lazy` is strict in its keys but not its values.
This is causing a space leak in my program, and ghc-heap…
-
For now this is a stub for an RFC.
The DDlog 2.0 compiler has to be modular, to enable incremental compiler evolution and experimentation (e.g., adding syntax desugaring passes, extending the langu…