calm

calm abstract lambda machine

• aggressive reduction of lambda calculus expressions
• small memory footprint without leaks
• uses hash-based shared λ-graphs
• reducer of larsux

Note

The used reduction strategy works best if the reducer and scheduler support parallel execution using multi-threading. While planned for the future, this is currently not implemented due to quite a lot additional complexity.

This repository also contains an implementation of the RKNL abstract machine. You can find it in the rknl branch.

Libraries

• hashmap.c [MIT]: Simple but efficient hashmap
• pqueue [BSD 2-Clause]: Simple priority queue implementation
• xxHash [BSD 2-Clause]: Extremely fast hash algorithm