dcpu16 VS bound

Compare dcpu16 vs bound and see what are their differences.

dcpu16

DCPU-16 processor emulator (by anatolat)

bound

Combinators for manipulating locally-nameless generalized de Bruijn terms (by ekmett)
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
dcpu16 bound
- 2
3 121
- -
0.0 4.2
over 7 years ago about 2 months ago
Haskell Haskell
BSD 3-clause "New" or "Revised" License 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.

dcpu16

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

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

sunroof-compiler - Monadic Javascript Compiler

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

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

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

haste-compiler - A GHC-based Haskell to JavaScript compiler

dhall - Maintainable configuration files

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

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

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

sjsp

idris - A Dependently Typed Functional Programming Language

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