bound
Combinators for manipulating locally-nameless generalized de Bruijn terms (by ekmett)
idris
A Dependently Typed Functional Programming Language (by idris-lang)
Our great sponsors
bound | idris | |
---|---|---|
2 | 5 | |
121 | 3,410 | |
- | 0.4% | |
4.2 | 6.2 | |
about 1 month ago | 4 months ago | |
Haskell | Haskell | |
GNU General Public License v3.0 or later | 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.
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?
idris
Posts with mentions or reviews of idris.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-03-31.
-
(strongly typed) functional language compilers running in browser
there're a lot of languages that can target js/wasm these days, some of which are even self-hosting (ghc) and can target browser (ghcjs), a lot are written in haskell which again can target browser but the closest to my request i've found is an old thread of idris supposedely compilable by ghcjs and while there are plenty "run your code in browser (via server compilation)" services i've yet to see a working "running compiler in browser in browser example"
-
What's the current status with packages/libraries on Idris?
So apparently there's a package manager called Inigo, but there are only a few packages in it. There's an idris-hackers group on github, that's linked from the idris-lang.org page. None of those libraries appear in Inigo though. So seems that Inigo isn't really a thing people are using.
-
Optimizing Unary Arithmetic in my language
Here's Idris' Nat optimisations
- How does Idris optimize representation and operations for Nat-like types.
-
Record dot syntax has been merged
As of 2013, Idris does not want to even support user defined Unicode operators, for the usual reasons.
What are some alternatives?
When comparing bound and idris you can also consider the following projects:
hyper-haskell-server - The strongly hyped Haskell interpreter.
Elm - Compiler for Elm, a functional language for reliable webapps.
bound-gen - Making bound play nice with monad-gen.
egison - The Egison Programming Language
dhall - Maintainable configuration files
pi-forall - A demo implementation of a simple dependently-typed language
uu-cco - Tools for the CCO (Compiler Construction) course at the UU (Utrecht University)
const-math-ghc-plugin - GHC plugin for constant math elimination
sjsp
ghc-proofs - Let GHC prove program equations for you
unbound - Replib: generic programming & Unbound: generic treatment of binders
hackager - Tool to test GHC against all of Hackage