feldspar-compiler
This is the compiler for the Feldspar Language. (by Feldspar)
bound
Combinators for manipulating locally-nameless generalized de Bruijn terms (by ekmett)
Our great sponsors
| feldspar-compiler | bound | |
|---|---|---|
| - | 2 | |
| 22 | 121 | |
| - | - | |
| 0.0 | 4.2 | |
| almost 4 years ago | about 1 month ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | GNU General Public License v3.0 or later |
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.
feldspar-compiler
Posts with mentions or reviews of feldspar-compiler.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning feldspar-compiler yet.
Tracking mentions began in Dec 2020.
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?
What are some alternatives?
When comparing feldspar-compiler and bound you can also consider the following projects:
CPL - An interpreter of Hagino's Categorical Programming Language (CPL).
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.
haste-compiler - A GHC-based Haskell to JavaScript compiler
accelerate - Embedded language for high-performance array computations
dhall - Maintainable configuration files
sjsp
epic - Epic - a Supercombinator Compiler
unbound - Replib: generic programming & Unbound: generic treatment of binders