aboutsummaryrefslogtreecommitdiffhomepage
path: root/samples
AgeCommit message (Collapse)Author
2024-02-23More RosettaMarvin Borner
2024-02-21Additions for Rosetta CodeMarvin Borner
2024-02-16Added strong Rosenberg encoding for meta encodingMarvin Borner
Originally got the idea from @sgoguen (YC) and was further inspired by @hbr from one of their blog posts[1]. The current encoding has some holes and bad performance, so I might switch to a different one in the future. The wiki and metaprogramming blog post have been updated accordingly. [1] https://hbr.github.io/Lambda-Calculus/computability/text.html
2024-01-18More efficient str→blcMarvin Borner
2023-11-06Minor general additionsMarvin Borner
2023-10-19Added example mutual recurrence relations for y*Marvin Borner
2023-10-15Universal machine interpreterMarvin 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-06Fun with monadsMarvin Borner
2023-06-03Added collatz conjectureMarvin Borner
2023-04-08Added huge sequence generatorMarvin Borner
2023-03-12FunMarvin Borner
2023-03-07Fixed unsafe randomness and optimizationMarvin Borner
Enabling optimization greatly improved reduction times (obviously). Will investigate further optimizations in the future.
2023-03-07Added a few advent of code solutionsMarvin Borner
2023-03-05More samplesMarvin Borner
2023-03-05Way faster recursive showMarvin Borner
2023-03-05Made stdin and argument conversion lazyMarvin Borner
2023-03-05Monadic list/io interfaceMarvin Borner
2023-03-03Added second part of aoc and needed functionsMarvin Borner
Also, I don't know how I got 30s for the first part previously. Cannot reproduce and probably was a mistake. idk
2023-03-03Faster string breakingMarvin Borner
2023-02-26Added IO samplesMarvin Borner
2023-02-24Added code samplesMarvin Borner