piforall alternatives and similar packages
Based on the "Compiler" category.
Alternatively, view piforall alternatives based on common mentions on social networks and blogs.

binaryen
DEPRECATED in favor of ghc wasm backend, see https://www.tweag.io/blog/20221122wasmbackendmergedinghc 
accelerate
Embedded language for highperformance array computations 
hyperhaskellserver
The strongly hyped Haskell interpreter. 
huskscheme
A full implementation of the Scheme programming language for the Haskell Platform. 
hint
Runtime Haskell interpreter [Moved to: https://github.com/haskellhint/hint] 
bound
Combinators for manipulating locallynameless generalized de Bruijn terms 
lambdacubecompiler
LambdaCube 3D is a Haskelllike purely functional language for GPU. Try it out: 
elmstreet
:deciduous_tree: Crossing the road between Haskell and Elm 
haskelltoelm
Generate Elm types, encoders, and decoders from Haskell types 
unbound
Replib: generic programming & Unbound: generic treatment of binders 
accelerateio
Read and write Accelerate arrays in various formats 
haskelm
Haskell to Elm translation using Template Haskell. Contains both a library and executable. 
acceleratefft
FFT library for Haskell based on the embedded array language Accelerate 
lazyboy
An EDSL implemented in Haskell for programming the Nintendo Game Boy. 
elmsyntax
Library for generating Elm syntax from Haskell in a scopesafe way 
feldsparcompiler
This is the compiler for the Feldspar Language.
Static code analysis for 29 languages.
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.
Do you think we are missing an alternative of piforall or a related project?
README
piforall language
This language implementation is designed to accompany four lectures at OPLSS during Summer 2022. Notes for these lectures are included in the distribution:
 [oplss.pdf](doc/oplss.pdf)
(The documentation [README.md](doc/README.md) includes details about how the notes are typeset.)
These lecture notes correspond to an increasingly expressive demo implementation of dependentlytyped lambda calculus. Each of the following subdirectories is selfcontained (and all are generated from the same source, located in the [main/](main/) directory).
 [version1/](version1/): Basic language implementation
 [version2/](version2/): Basic language extended with nontrivial definitional equality
 [version3/](version3/): Above, extended with irrelevant arguments
 [full/](full/): Full language with datatypes
The implementation [README.md](main/README.md) includes instructions about how to compile and work with these implementations.
History
This is a revised version of lecture notes originally presented at OPLSS during 2014 and 2013.
Videos from the 2014 lectures are also available from the OPLSS website. If you want to watch these videos, you should look at the 2014 branch of this repository.
An abridged version of these lectures was also given at the Compose Conference, January 2015. Notes from this version are also available.
 [compose.md](old/compose.md): Overview of piforall implementation
 Stephanie Weirich