| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2023-10-15 | Universal machine interpreter | Marvin Borner | |
| This is a fun lambda calculus interpreter, written in bruijn itself. The code is based on @Tromp submission to IOCCC 2012. Performance-wise the unary (fac 9) takes 11.4s simulated vs 1.2s native. -> main problem is memory, simulated (fac 10) causes memory overflow on 32GB. | |||
| 2023-10-06 | Fun with monads | Marvin Borner | |
| 2023-06-03 | Added collatz conjecture | Marvin Borner | |
| 2023-04-08 | Added huge sequence generator | Marvin Borner | |
| 2023-03-12 | Fun | Marvin Borner | |
| 2023-03-05 | More samples | Marvin Borner | |