alms
The Alms Programming Language (by tov)
unbound
Replib: generic programming & Unbound: generic treatment of binders (by sweirich)
alms | unbound | |
---|---|---|
- | 1 | |
43 | 44 | |
- | - | |
0.0 | 0.0 | |
over 5 years ago | over 1 year ago | |
Haskell | Coq | |
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.
alms
Posts with mentions or reviews of alms.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning alms yet.
Tracking mentions began in Dec 2020.
unbound
Posts with mentions or reviews of unbound.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-03-26.
-
Question about Unbound's FreshM/LFreshM (Compiler)
Here's an example of using LFresh for the simply-typed lambda calculus. https://github.com/sweirich/replib/blob/master/Unbound/Examples/STLC.hs Note that LFresh and FreshM are monads, so they will only guarantee fresh name generation while in the monad. contFreshM lets you "run" the monadic computation, so you'll only want to call it at the "top level" of your program.
What are some alternatives?
When comparing alms and unbound you can also consider the following projects:
hyper-haskell-server - The strongly hyped Haskell interpreter.
dhall - Maintainable configuration files
kaleidoscope - Haskell LLVM JIT Compiler Tutorial
uu-cco - Tools for the CCO (Compiler Construction) course at the UU (Utrecht University)
haste-compiler - A GHC-based Haskell to JavaScript compiler
mappy - A functional programming language. Like LISP but focused around maps rather than lists.
CompCert - The CompCert formally-verified C compiler
flp - Spatial layout specifications for memory management systems.
bound - Combinators for manipulating locally-nameless generalized de Bruijn terms