m-schm's Stars
zesterer/chumsky
Write expressive, high-performance parsers with ease.
mmcqd/datatt
A dependent type theory with user defined data types
koka-lang/koka
Koka language compiler and interpreter
bkomuves/nanohs
a self-hosting lambda calculus compiler
well-typed/optics
Optics as an abstract interface
plfa/plfa.github.io
An introduction to programming language theory in Agda
goldfirere/singletons
Fake dependent types in Haskell using singletons
recursion-schemes/recursion-schemes
Generalized bananas, lenses and barbed wire
AndrasKovacs/elaboration-zoo
Minimal implementations for dependent type checking and elaboration
agda/agda
Agda is a dependently typed programming language / interactive theorem prover.
ollef/sixten
Functional programming with fewer indirections