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.

Elm

10.0 0.0 pi-forall VS Elm

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

10.0 3.4 pi-forall VS binaryen

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

ONLYOFFICE Docs — document collaboration in your environment

Powerful document editing and collaboration in your app or environment. Ultimate security, API and 30+ ready connectors, SaaS or on-premises

Promo www.onlyoffice.com

idris

10.0 5.4 pi-forall VS idris

A Dependently Typed Functional Programming Language
accelerate

9.9 9.1 pi-forall VS accelerate

Embedded language for high-performance array computations
egison

9.9 1.2 pi-forall VS egison

The Egison Programming Language
dhall

9.9 5.3 pi-forall VS dhall

Maintainable configuration files
haste-compiler

9.9 0.0 pi-forall VS haste-compiler

A GHC-based Haskell to JavaScript compiler
kaleidoscope

9.9 0.0 pi-forall VS kaleidoscope

Haskell LLVM JIT Compiler Tutorial
morte

9.7 0.0 pi-forall VS morte

A bare-bones calculus-of-constructions
hyper-haskell-server

9.7 0.0 L5 pi-forall VS hyper-haskell-server

The strongly hyped Haskell interpreter.
husk-scheme

9.7 0.0 pi-forall VS husk-scheme

A full implementation of the Scheme programming language for the Haskell Platform.
hint

9.6 7.0 pi-forall VS hint

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

9.6 1.2 pi-forall VS sjsp

Simple JavaScript Profiler
inspection-testing

9.5 3.9 pi-forall VS inspection-testing

Inspection Testing for Haskell
ajhc

9.5 0.0 pi-forall VS ajhc

A fork of jhc. And also a Haskell compiler.
accelerate-llvm

9.5 0.0 pi-forall VS accelerate-llvm

LLVM backend for Accelerate
glambda

9.5 0.0 pi-forall VS glambda

The home of the Glamorous Glambda interpreter
bound

9.4 0.0 pi-forall VS bound

Combinators for manipulating locally-nameless generalized de Bruijn terms
wasm

9.4 0.0 pi-forall VS wasm

Haskell WebAssembly Toolkit
ghc-proofs

9.3 0.0 pi-forall VS ghc-proofs

Let GHC prove program equations for you
sunroof-compiler

9.2 0.0 pi-forall VS sunroof-compiler

Monadic Javascript Compiler
accelerate-cuda

9.2 0.0 pi-forall VS accelerate-cuda

DEPRECATED: Accelerate backend for NVIDIA GPUs
accelerate-examples

9.2 0.0 pi-forall VS accelerate-examples

Examples for the Accelerate language
llvm-hs-pretty

9.1 0.0 pi-forall VS llvm-hs-pretty

Pretty printer for LLVM AST to Textual IR
pcf

9.1 0.0 pi-forall VS pcf

A small compiler for PCF
lambdacube-compiler

9.1 0.0 pi-forall VS lambdacube-compiler

LambdaCube 3D is a Haskell-like purely functional language for GPU. Try it out:
annah

9.1 0.0 pi-forall VS annah

Distributed programming language that desugars to Morte
CPL

9.1 0.0 pi-forall VS CPL

An interpreter of Hagino's Categorical Programming Language (CPL).
dhall-nix

9.0 0.0 pi-forall VS dhall-nix

Dhall to Nix compiler
elm-street

9.0 0.0 pi-forall VS elm-street

:deciduous_tree: Crossing the road between Haskell and Elm
ntha

8.8 0.0 pi-forall VS ntha

The Ntha Programming Language
dhall-json

8.8 0.0 pi-forall VS dhall-json

Compile Dhall to JSON or YAML
haskell-to-elm

8.7 0.0 pi-forall VS haskell-to-elm

Generate Elm types, encoders, and decoders from Haskell types
epic

8.6 0.0 pi-forall VS epic

Epic - a Supercombinator Compiler
hLLVM

8.5 0.0 pi-forall VS hLLVM

A library for analyzing and transforming LLVM (3.5) assembly codes
unbound

8.4 0.0 pi-forall VS unbound

Replib: generic programming & Unbound: generic treatment of binders
sunroof-examples

8.2 0.0 pi-forall VS sunroof-examples

Tests for Sunroof
peg

8.2 0.0 pi-forall VS peg

A lazy non-deterministic concatenative programming language
accelerate-io

8.2 0.0 pi-forall VS accelerate-io

Read and write Accelerate arrays in various formats
kempe

8.1 1.2 pi-forall VS kempe

Kempe is a compiled stack-based language
haskelm

8.1 0.0 pi-forall VS haskelm

Haskell to Elm translation using Template Haskell. Contains both a library and executable.
nom

8.1 0.0 pi-forall VS nom

Haskell implementation of nominal datatypes and functions
lazyboy

7.9 0.0 pi-forall VS lazyboy

An EDSL implemented in Haskell for programming the Nintendo Game Boy.
accelerate-fft

7.9 0.0 pi-forall VS accelerate-fft

FFT library for Haskell based on the embedded array language Accelerate
elm-syntax

7.8 0.0 pi-forall VS elm-syntax

Library for generating Elm syntax from Haskell in a scope-safe way
alms

7.7 0.0 pi-forall VS alms

The Alms Programming Language
strict-ghc-plugin

7.7 0.0 pi-forall VS strict-ghc-plugin

Compiler plugin for making Haskell strict
feldspar-compiler

7.6 0.0 pi-forall VS feldspar-compiler

This is the compiler for the Feldspar Language.
hoe

7.5 0.0 pi-forall VS hoe

Haskell One-liner Evaluator
dhall-text

7.4 0.0 pi-forall VS dhall-text

Template text using Dhall

* 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?

Add another 'Compiler' Package

Popular Comparisons

README

pi-forall 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 dependently-typed lambda calculus. Each of the following subdirectories is self-contained (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.