compilation VS bound

Compare compilation vs bound and see what are their differences.

compilation

Haskell functionality for quickly assembling compilers. (by lapets)
Compiler
Source Code
hackage.haskell.org
Suggest alternative
Edit details

bound

Combinators for manipulating locally-nameless generalized de Bruijn terms (by ekmett)
Compiler Bound
Source Code
schoolofhaskell.com
Suggest alternative
Edit details
InfluxDB
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
Our great sponsors
compilation bound
- 2
0 121
- -
0.0 4.2
over 8 years ago about 1 month ago
Haskell Haskell
GNU General Public License v3.0 only GNU General Public License v3.0 or later
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.

compilation

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

We haven't tracked posts mentioning compilation 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 compilation and bound you can also consider the following projects:

hint - Runtime Haskell interpreter [Moved to: https://github.com/haskell-hint/hint]

hyper-haskell-server - The strongly hyped Haskell interpreter.

accelerate - Embedded language for high-performance array computations

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

kaleidoscope - Haskell LLVM JIT Compiler Tutorial

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

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

dhall - Maintainable configuration files

binaryen - DEPRECATED in favor of ghc wasm backend, see https://www.tweag.io/blog/2022-11-22-wasm-backend-merged-in-ghc

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

morte - A bare-bones calculus-of-constructions

sjsp

compilation vs hint bound vs hyper-haskell-server compilation vs accelerate bound vs bound-gen compilation vs kaleidoscope bound vs uu-cco compilation vs Elm bound vs dhall compilation vs binaryen bound vs unbound compilation vs morte bound vs sjsp