-
-
When I first started rtype, I was tempted to just steal Haskell's Hindley-Milner type annotations and just start using them, but I saw several problems with that:
1. Haskell types are all curry all…
-
Thanks for your project! I hope you're aware of https://github.com/sdiehl/numpile which is purposely minimalist example of (simple) type inferencing of Python code. It uses simple equality constraint …
-
#615 describes the need for having a type system for Bend as well as the design discussion of how this system should be.
This issue tracks the implementation of the bend type system.
- [x] Compile b…
-
Needs to be restricted to Hindley-Milner power or less.
Full H-M is probably the way to go.
Will always need type annotations on record projections and sum constructors, as they're naturally amb…
-
Surfing the web I stumbled upon this [Hindley-Milner parser](https://github.com/xodio/hm-parser) written in JS. I immediately saw the possibility of to generate the TS definitions -and possibly Flow- …
-
It looks like hask always trusts type signatures and doesn't check them.
E.g.
``` python
from hask import *
@sig(H/ "a" >> "b" >> "c")
def const1(x, y):
return x+1
print(const1(1,2))
```
runs …
-
Hi!
In the Ramda docs, clicking on "Expand parameters" gives you a sort of JSDoc style of documentation but it looks incomplete.
`add`, for example, only shows parameter names but not their type…
-
(I'm uncaffeinated from Reddit)
Now that I've had a chance to try the code out, I can confirm my initial suspicion that this isn't able to type anything which requires higher ranked types, and hen…
-
The type unification in Constraints.hs is a little messy and could probably just be replaced with an existing (hopefully very fast!) unification library. Does anyone know what the state-of-the-art is …