absal-ex
Absal ex
Browse cluster: Functional Programming & Type Theory →Tech stack & purpose
Absal is an implementation of Lamping's Abstract Algorithm, which evaluates lambda calculus terms optimally by encoding them as interaction combinators, normalizing the resulting graph, and decoding the result back. The project addresses the problem domain of functional program evaluation and can serve as a runtime for programming languages, with the goal of asymptotically outperforming standard evaluators like GHC and V8 while automatically exploiting inherent parallelizability through interaction nets. The core is written in Rust, with a parallel implementation using OpenCL for GPU computation, and the material references an `absal-rs` repository on the `parallel-test-3` branch as the main codebase. The README includes extensive technical documentation of the graph-rewriting algorithm, test cases using lambda-term syntax, and optimization ideas for leveraging local GPU caching.
Contributors
- MaiaVictor42 commits
- Victor Maia12 commits
- Leonardo Souza3 commits
- Victor Taelin1 commits · 6,113 followers
