aboutsummaryrefslogtreecommitdiffhomepage
path: root/samples/fun/interpreter.bruijn
AgeCommit message (Collapse)Author
2024-01-18More efficient str→blcMarvin Borner
2023-11-06Minor general additionsMarvin 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.