aboutsummaryrefslogtreecommitdiffhomepage
path: root/samples/fun
AgeCommit message (Collapse)Author
2025-03-06Add state demoHEADmainMarvin Borner
2025-01-23Experiment of golfing Wilson's theoremMarvin Borner
2024-11-27Fix rng stateMarvin Borner
2024-11-27Monad improvementsMarvin Borner
2024-10-28Improved minibruijn and parserMarvin Borner
2024-10-27Improvements in maps, sets, and parsingMarvin Borner
2024-10-26Initial minibruijnMarvin Borner
2024-09-08Fun new tupling techniqueMarvin Borner
2024-09-06Sample/std fixesMarvin Borner
2024-06-09Fixed IO function namesMarvin Borner
2024-06-07Some more work on monadsMarvin Borner
2024-05-17Fixed testsMarvin Borner
2024-05-17Minor additions :)Marvin Borner
2024-05-02More mathMarvin Borner
MAATHTHAHHAHA
2024-03-03Even more samplesMarvin Borner
wtf
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-05More samplesMarvin Borner