unbound-generics VS helium

Compare unbound-generics vs helium and see what are their differences.

unbound-generics

Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound) (by lambdageek)
Data Language ghc-generics variable-binding Substitution Bound Unbound haskell-library
Source Code
hackage.haskell.org
Suggest alternative
Edit details

helium

The Helium compiler, Helium-as-a-library, and the texthint interpreter (by Helium4Haskell)
Suggest topics
Source Code
Suggest alternative
Edit details
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.
www.influxdata.com
featured
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com
featured
unbound-generics helium
1 2
55 89
- -
6.3 0.0
about 1 month ago 3 months ago
Haskell Haskell
BSD 3-clause "New" or "Revised" License GNU General Public License v3.0 only
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.

unbound-generics

Posts with mentions or reviews of unbound-generics. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2021-02-25.

helium

Posts with mentions or reviews of helium. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2021-02-25.
  • Good resources for writing compiler in Haskell
    2 projects | /r/haskell | 25 Feb 2021
    I think attribute grammars are underrated. Helium and the abandoned UHC use the attribute grammar system developed at Utrecht University. Here is the manual. It is implemented as a preprocessor like Alex and Happy, so it can be a bit hard to setup. I have made two small example repositories here and here.
  • GHC 2021!
    3 projects | /r/haskell | 18 Jan 2021
    Helium is still actively developed and almost Haskell2010 compatible.

What are some alternatives?

When comparing unbound-generics and helium you can also consider the following projects:

prolog - A prolog interpreter written in Haskell.

hermit-syb

imperative-edsl - Deep embedding of imperative programs with code generation

netlist-to-vhdl - Netlist and Verilog Haskell Package

WebBits - An updated webbits is available at https://github.com/jswebtools/language-ecmascript

lambda-placeholders - A Haskell library to emulate Scala's placeholder syntax feature.

conffmt - language-conf - .conf (e.g. nginx configuration) parsers and pretty-printers for the Haskell programming language.

caledon - higher order dependently typed logic programing

windns - Domain Name Service (DNS) lookup via the Windows dnsapi standard library

bound-gen - Making bound play nice with monad-gen.

unbound-generics vs prolog unbound-generics vs hermit-syb unbound-generics vs imperative-edsl unbound-generics vs netlist-to-vhdl unbound-generics vs WebBits unbound-generics vs lambda-placeholders unbound-generics vs conffmt unbound-generics vs caledon unbound-generics vs windns unbound-generics vs bound-gen