39 ms·
Most computers follows the Von Neumann architecture. Any imperative languages with no GC would do great because of the small number of abstractions needed to ma
by skydhash 4y ago
Most computers follows the Von Neumann architecture. Any imperative languages with no GC would do great because of the small number of abstractions needed to make a program run. AFAIK, C only requires to set up a stack with the registers.
When we build something with lambda calculus as its core, you might want to revise that opinion.
- docandrew 4y agoThere’s some truth to this - imperative languages with state make sense because the underlying hardware is a series of imperative instructions and a large amount of state. What does lambda calculus hardware look like?
- AndrewKemendo 4y agoApparently it's called the "reduceron" https://www.cs.york.ac.uk/fp/reduceron/ https://www.cs.york.ac.uk/fp/reduceron/ https://www.cs.york.ac.uk/fp/reduceron/jfp-reduceron.pdf https://www.cs.york.ac.uk/fp/reduceron/jfp-reduceron.pdf