pi-forall alternatives and similar packages
Based on the "Compiler" category.
Alternatively, view pi-forall alternatives based on common mentions on social networks and blogs.
-
accelerate
Embedded language for high-performance array computations -
husk-scheme
A full implementation of the Scheme programming language for the Haskell Platform. -
hyper-haskell-server
The strongly hyped Haskell interpreter. -
bound
Combinators for manipulating locally-nameless generalized de Bruijn terms -
lambdacube-compiler
LambdaCube 3D is a Haskell-like purely functional language for GPU. Try it out: -
elm-street
:deciduous_tree: Crossing the road between Haskell and Elm -
haskell-to-elm
Generate Elm types, encoders, and decoders from Haskell types -
unbound
Replib: generic programming & Unbound: generic treatment of binders -
accelerate-io
Read and write Accelerate arrays in various formats -
haskelm
Haskell to Elm translation using Template Haskell. Contains both a library and executable. -
accelerate-fft
FFT library for Haskell based on the embedded array language Accelerate -
feldspar-compiler
This is the compiler for the Feldspar Language. -
lazyboy
An EDSL implemented in Haskell for programming the Nintendo Game Boy. -
elm-syntax
Library for generating Elm syntax from Haskell in a scope-safe way
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 pi-forall or a related project?
README
Pi-Forall language
This language implementation is designed to accompany four lectures at OPLSS during Summer 2014. Notes for these lectures are included in the distribution:
- [notes.md](notes.md): Basic language with Type:Type
- [notes2.md](notes2.md): Implementation of basic languages
- [notes3.md](notes3.md): Definitional and propositional equality
- [notes4.md](notes4.md): Datatypes, with parameters and indices, erased arguments
Videos for these lectures are also available from the OPLSS website.
An abridged version of these lectures was given at the Compose Conference, January 2015.
- [compose.md](compose.md): Overview of pi-forall implementation
These lecture notes corresponds to an increasingly expressive demo implementation of dependently-typed lambda calculus.
- [version1/](version1/): Basic language implementation,
- [version2/](version2/): Basic language extended with nontrivial definitional equality
- [full/](full/): Full language with datatypes and erased arguments
See also the implementation [README.md](master/README.md) for more details.
All of these versions are excerpted from the marked up files in the directory:
- [master/](master/)
All edits should be to the code in the master
directory. The above versions
are included in the repo just for convenience.
-- Stephanie Weirich