aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMarvin Borner2023-02-26 12:13:51 +0100
committerMarvin Borner2023-02-26 12:14:25 +0100
commitfa9e1764a6b10bd5d8f794d8e99e7dc56d089695 (patch)
tree0d19e65cddedde09efd5cdeec455af3efcccb518
parenta867155a5b8a0e8d1a8bb43dc5bffc3e5269e889 (diff)
Note on garbage collection
-rw-r--r--readme.md9
1 files changed, 9 insertions, 0 deletions
diff --git a/readme.md b/readme.md
index fc22750..ded84c9 100644
--- a/readme.md
+++ b/readme.md
@@ -12,6 +12,15 @@
- Based on bleeding-edge research results
- Mostly linear time/memory complexity\[0\]
+## Garbage collection
+
+In theory the RKNL abstract machine should be able to be implementented
+without a periodic/incremental garbage collector.
+
+I tried implementing it using reference counting but eventually gave up.
+You can find my attempts at
+[a0b4299cbd](https://github.com/marvinborner/calm/tree/a0b4299cbda261684ad464b22c07a07bcf3acbed).
+
## Libraries
- [CHAMP](https://github.com/ammut/immutable-c-ollections) \[MIT\]: