depsterr
/
hm
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
A hindley-milner typechecker with inductive types.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
23 Commits
1 Branch
0 Tags
574 KiB
 
Tag: Branch: Tree: master
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'master'
${ noResults }
Rachel Samuelsson bc7565a1f7
Merge branch 'master' of githug.xyz:depsterr/hm 		4 months ago
app able to typecheck files ! 1 year ago
src fixed loop in anti loop detection 1 year ago
.gitignore added some build stuff 1 year ago
LICENSE added some build stuff 1 year ago
Setup.hs only rebuild grammar when source has been modified 1 year ago
TODO it can now infer the type of some expressions 1 year ago
bad.hm added positivity check 1 year ago
hm.cabal able to typecheck files ! 1 year ago
hm.cf hm.cf: remove redundant comment 1 year ago
readme.md update readme a bit 1 year ago
test.hm precedence levels 4 months ago

readme.md

HM

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

For an example of the syntax see test.hm

Building

Depends: * BNFC * GHC * Cabal

Instructions: * Run cabal build

TODO

Currently there is no kind system and as such there are no indexed datatypes. Considering my interest currenlty lies in dependently typed systems this is not likely to change any time soon.