m-schm's starred repositories

chumsky

Write expressive, high-performance parsers with ease.

Language:RustLicense:MITStargazers:3550Issues:24Issues:274

koka

Koka language compiler and interpreter

Language:HaskellLicense:NOASSERTIONStargazers:3250Issues:60Issues:316

agda

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

Language:HaskellLicense:NOASSERTIONStargazers:2476Issues:64Issues:5486

plfa.github.io

An introduction to programming language theory in Agda

Language:AgdaLicense:CC-BY-4.0Stargazers:1356Issues:23Issues:256

sixten

Functional programming with fewer indirections

Language:HaskellLicense:BSD-3-ClauseStargazers:758Issues:49Issues:85

elaboration-zoo

Minimal implementations for dependent type checking and elaboration

Language:HaskellLicense:BSD-3-ClauseStargazers:601Issues:40Issues:32

optics

Optics as an abstract interface

recursion-schemes

Generalized bananas, lenses and barbed wire

Language:HaskellLicense:NOASSERTIONStargazers:336Issues:19Issues:70

singletons

Fake dependent types in Haskell using singletons

datatt

A dependent type theory with user defined data types

nanohs

a self-hosting lambda calculus compiler

Language:HaskellLicense:BSD-3-ClauseStargazers:34Issues:3Issues:0