unbound
Replib: generic programming & Unbound: generic treatment of binders (by sweirich)
Schemer
A simple Scheme compiler for my thesis (by teichholz)
| unbound | Schemer | |
|---|---|---|
| 1 | 2 | |
| 44 | 0 | |
| - | - | |
| 0.0 | 2.9 | |
| over 1 year ago | 5 months ago | |
| Coq | 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.
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.
Schemer
Posts with mentions or reviews of Schemer.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-04-14.
-
Need some help with monad transformers
Though I can't seem to really figure it out. For people interested my current code is here: https://github.com/teichholz/Schemer/blob/main/src/Phases/Codegen.hs
-
Question about Unbound's FreshM/LFreshM (Compiler)
I'm currently writing a simple Scheme compiler (https://github.com/teichholz/Schemer) as my first big Haskell project and I can't seem to figure out Unbound / Unbound Generics. I have read the paper and get the internals, though I guess I'm missing Haskell experience. Consider:
What are some alternatives?
When comparing unbound and Schemer you can also consider the following projects:
dhall - Maintainable configuration files
kaleidoscope - Haskell LLVM JIT Compiler Tutorial
hyper-haskell-server - The strongly hyped Haskell interpreter.
uu-cco - Tools for the CCO (Compiler Construction) course at the UU (Utrecht University)
CompCert - The CompCert formally-verified C compiler
bound - Combinators for manipulating locally-nameless generalized de Bruijn terms
haste-compiler - A GHC-based Haskell to JavaScript compiler
ghc-proofs - Let GHC prove program equations for you
hoe - Haskell One-liner Evaluator
sjsp
ajhc - A fork of jhc. And also a Haskell compiler.