A friendly programming language from the future

A modern proof language

Agda is a dependently typed programming language / interactive theorem prover.

Minimal implementations for dependent type checking and elaboration

A demo implementation of a simple dependently-typed language

Haskell bindings for MLIR

An arbitrary-precision differentiable programming language.

Prototype of the system described in "Trace Types and Denotational Semantics for Sound Programmable Inference in Probabilistic Languages"

A probabilistic programming language for streaming inference