A hindley-milner typechecker with inductive types.

Go to file

Rachel Lambda Samuelsson e7160485b6 only rebuild grammar when source has been modified		2022-01-23 13:58:15 +01:00
app	added some build stuff	2022-01-23 12:52:33 +01:00
src	setup build system properly	2022-01-23 13:43:50 +01:00
.gitignore	added some build stuff	2022-01-23 12:52:33 +01:00
LICENSE	added some build stuff	2022-01-23 12:52:33 +01:00
Setup.hs	only rebuild grammar when source has been modified	2022-01-23 13:58:15 +01:00
TODO	added a TODO with some resources	2022-01-23 12:00:17 +01:00
hm.cabal	only rebuild grammar when source has been modified	2022-01-23 13:58:15 +01:00
hm.cf	added some build stuff	2022-01-23 12:52:33 +01:00
readme.md	setup build system properly	2022-01-23 13:43:50 +01:00
test	added a TODO with some resources	2022-01-23 12:00:17 +01:00

readme.md

HM

A simple, terminating, pure, hindley milner lambda calculus with inductively defined types.

Building

Depends: * BNFC * GHC * Cabal

Instructions: * Run cabal build