bound
Combinators for manipulating locally-nameless generalized de Bruijn terms (by ekmett)
lambdacube-compiler
LambdaCube 3D is a Haskell-like purely functional language for GPU. Try it out: (by lambdacube3d)
Our great sponsors
| bound | lambdacube-compiler | |
|---|---|---|
| 2 | 2 | |
| 121 | 84 | |
| - | - | |
| 4.2 | 0.0 | |
| about 1 month ago | 7 months ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | BSD 3-clause "New" or "Revised" License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
bound
Posts with mentions or reviews of bound.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-03-05.
-
What's the state of the art wrt representing bound variables in syntax trees with binding?
First off, I am using Rust. I've begun by implementing an idea that is close in essence to bound, available in this playground. I believe that this is a good first step, but I am concerned with all the recursion leading to stack overflows and that analysing a term under a scope requires eliminating it, which in turn requires full tree traversals. There are ways to optimize the approach (such as caching variable occurrences in each scope node and skipping subtress when a variable I am looking for is not in it) but I wonder how far I can go with this approach and if there’s alternatives.
-
Monthly Hask Anything (March 2023)
Has anyone applied this bound Imperative example to a larger language?
lambdacube-compiler
Posts with mentions or reviews of lambdacube-compiler.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-11-25.
-
A functional shading langauge
http://lambdacube3d.com/ is a Haskell-like GPU programming language that compiles to WebGL1.0/GLES2.0/GL3.3. IIRC it also has partially dependent types.
-
Is Haskell capable of this?
However, it's certainly possible to build purely functional abstractions on the top of existing imperative solutions, and you already found one example, GPipe. Another one is lambdacube 3d
What are some alternatives?
When comparing bound and lambdacube-compiler you can also consider the following projects:
hyper-haskell-server - The strongly hyped Haskell interpreter.
uu-cco - Tools for the CCO (Compiler Construction) course at the UU (Utrecht University)
bound-gen - Making bound play nice with monad-gen.
dhall - Maintainable configuration files
binaryen - DEPRECATED in favor of ghc wasm backend, see https://www.tweag.io/blog/2022-11-22-wasm-backend-merged-in-ghc
sjsp
llvm-hs-pretty - Pretty printer for LLVM AST to Textual IR
unbound - Replib: generic programming & Unbound: generic treatment of binders
egison - The Egison Programming Language
bound vs hyper-haskell-server
lambdacube-compiler vs uu-cco
bound vs bound-gen
lambdacube-compiler vs hyper-haskell-server
bound vs dhall
lambdacube-compiler vs dhall
bound vs uu-cco
lambdacube-compiler vs binaryen
bound vs sjsp
lambdacube-compiler vs llvm-hs-pretty
bound vs unbound
lambdacube-compiler vs egison