manual-stg-experiment VS Schemer

Compare manual-stg-experiment vs Schemer and see what are their differences.


Manually constructed STG programs compiled with the standard GHC codegen backend. (by csabahruska)
InfluxDB - Power Real-Time Data Analytics at Scale
Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
manual-stg-experiment Schemer
1 2
22 0
- -
1.8 2.9
over 3 years ago 6 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.


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
    4 projects | /r/haskell | 10 Jan 2021
    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:


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
    2 projects | /r/haskell | 14 Apr 2021
    Though I can't seem to really figure it out. For people interested my current code is here:
  • Question about Unbound's FreshM/LFreshM (Compiler)
    2 projects | /r/haskell | 26 Mar 2021
    I'm currently writing a simple Scheme compiler ( 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:


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.

eclair-lang - A minimal, fast Datalog implementation in Haskell that compiles to LLVM IR

ghc-whole-program-compiler-project - GHC Whole Program Compiler and External STG IR tooling