manual-stg-experiment
Manually constructed STG programs compiled with the standard GHC codegen backend. (by csabahruska)
Schemer
A simple Scheme compiler for my thesis (by teichholz)
| manual-stg-experiment | Schemer | |
|---|---|---|
| 1 | 2 | |
| 22 | 0 | |
| - | - | |
| 1.8 | 2.9 | |
| over 3 years ago | 5 months ago | |
| Haskell | Haskell | |
| - | 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.
manual-stg-experiment
Posts with mentions or reviews of manual-stg-experiment.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-01-10.
-
Next-gen Haskell Compilation Techniques
Yes, unlifted boxed STG values does not have thunk checks. The STG to Cmm codegen generates only a single ADT tag lookup code. You can check the generated ASM code: https://github.com/csabahruska/manual-stg-experiment https://github.com/csabahruska/manual-stg-experiment/blob/master/StgSample.hs#L390-L391
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 manual-stg-experiment and Schemer you can also consider the following projects:
IdrisExtSTGCodegen
unbound - Replib: generic programming & Unbound: generic treatment of binders
grin - GRIN is a compiler back-end for lazy and strict functional languages with whole program optimization support.
kaleidoscope - Haskell LLVM JIT Compiler Tutorial
sense-lang - Sense is a very high level, functional programming language for creating software by writing only the absolute necessary information and not a single line above that.
ghc-whole-program-compiler-project - GHC Whole Program Compiler and External STG IR tooling