hyper-haskell-server VS bound

Compare hyper-haskell-server vs bound and see what are their differences.

bound

Combinators for manipulating locally-nameless generalized de Bruijn terms (by ekmett)
Our great sponsors
  • SurveyJS - Open-Source JSON Form Builder to Create Dynamic Forms Right in Your App
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
hyper-haskell-server bound
- 2
359 121
- -
4.1 4.2
3 months ago about 1 month ago
JavaScript 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.

hyper-haskell-server

Posts with mentions or reviews of hyper-haskell-server. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning hyper-haskell-server yet.
Tracking mentions began in Dec 2020.

bound

Posts with mentions or reviews of bound. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2023-03-05.
  • What's the state of the art wrt representing bound variables in syntax trees with binding?
    1 project | /r/ProgrammingLanguages | 27 Oct 2023
    First off, I am using Rust. I've begun by implementing an idea that is close in essence to bound, available in this playground. I believe that this is a good first step, but I am concerned with all the recursion leading to stack overflows and that analysing a term under a scope requires eliminating it, which in turn requires full tree traversals. There are ways to optimize the approach (such as caching variable occurrences in each scope node and skipping subtress when a variable I am looking for is not in it) but I wonder how far I can go with this approach and if there’s alternatives.
  • Monthly Hask Anything (March 2023)
    5 projects | /r/haskell | 5 Mar 2023
    Has anyone applied this bound Imperative example to a larger language?

What are some alternatives?

When comparing hyper-haskell-server and bound you can also consider the following projects:

husk-scheme - A full implementation of the Scheme programming language for the Haskell Platform.

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

sunroof-compiler - Monadic Javascript Compiler

dhall - Maintainable configuration files

Elm - Compiler for Elm, a functional language for reliable webapps.

uu-cco - Tools for the CCO (Compiler Construction) course at the UU (Utrecht University)

alms - The Alms Programming Language

sjsp

pi-forall - A demo implementation of a simple dependently-typed language

unbound - Replib: generic programming & Unbound: generic treatment of binders

core-compiler - compile your own functional language

hLLVM