bound
lambda2js
bound | lambda2js | |
---|---|---|
2 | - | |
121 | 5 | |
- | - | |
4.2 | 0.0 | |
about 2 months ago | over 8 years ago | |
Haskell | Haskell | |
GNU General Public License v3.0 or later | GNU General Public License v3.0 only |
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
-
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?
lambda2js
We haven't tracked posts mentioning lambda2js yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
hyper-haskell-server - The strongly hyped Haskell interpreter.
glambda - The home of the Glamorous Glambda interpreter
bound-gen - Making bound play nice with monad-gen.
morte - A bare-bones calculus-of-constructions
dhall - Maintainable configuration files
elm-syntax - Library for generating Elm syntax from Haskell in a scope-safe way
uu-cco - Tools for the CCO (Compiler Construction) course at the UU (Utrecht University)
haste-compiler - A GHC-based Haskell to JavaScript compiler
sjsp
lazyboy - An EDSL implemented in Haskell for programming the Nintendo Game Boy.
unbound - Replib: generic programming & Unbound: generic treatment of binders
hint - Runtime Haskell interpreter [Moved to: https://github.com/haskell-hint/hint]