rachel/hm
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
A hindley-milner typechecker with inductive types.
11 Commits 1 Branch 0 Tags 574 KiB
Haskell 100%
413f7d3a21
Go to file
depsterr 413f7d3a21 handle application as list
2022-01-26 19:05:15 +01:00
app it can now infer the type of some expressions 2022-01-25 21:00:12 +01:00
src handle application as list 2022-01-26 19:05:15 +01:00
.gitignore added some build stuff 2022-01-23 12:52:33 +01:00
hm.cabal it can now infer the type of some expressions 2022-01-25 21:00:12 +01:00
hm.cf it can now infer the type of some expressions 2022-01-25 21:00:12 +01:00
LICENSE added some build stuff 2022-01-23 12:52:33 +01:00
readme.md readme.md: added some info on current state of the project 2022-01-25 21:01:52 +01:00
Setup.hs only rebuild grammar when source has been modified 2022-01-23 13:58:15 +01:00
test added a TODO with some resources 2022-01-23 12:00:17 +01:00
TODO it can now infer the type of some expressions 2022-01-25 21:00:12 +01:00
tst handle application as list 2022-01-26 19:05:15 +01:00

readme.md

HM

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

Very much a work in progress

The code is very messy and needs to be cleaned up..

Building

Depends: * BNFC * GHC * Cabal

Instructions: * Run cabal build