pseudonom-

12 ms·

91.
by pseudonom- 12y ago
It's not exactly what you're asking for but Ur/Web puts an expressive type system to some slightly unusual ends: http://www.impredicative.com/ur/ .
92.
by pseudonom- 12y ago
I'm not sure if they will meet your standards, but Idris and ATS strive to be practical dependently typed languages: http://www.ats-lang.org/Examples.html http://www.idris-lang.org/
93.
by pseudonom- 12y ago
Attoparsec is pretty fast. http://www.serpentine.com/blog/2014/05/31/attoparsec/
94.
by pseudonom- 12y ago
Care to elaborate on what you like about its syntax? I can imagine preferring it to Haskell or Lisp, but not thinking it's beautiful.
95.
by pseudonom- 12y ago
That sort of unprincipled, implicit conversion is generally frowned upon (by Elm, Haskell, ML, &c.). It reduces type safety. If all you want is syntactic sugar, Elm has infix lift operators so: let p = lift2 (+) Mouse.x Mouse.y
96.
by pseudonom- 12y ago
Pi doesn't make much sense as a signal (a time-varying value).
97.
by pseudonom- 12y ago
Well, it sounds like what you're looking for is property based testing. You can setup something like QuickCheck to run at compilation.
98.
by pseudonom- 12y ago
> One where "a = b / c" won't even compile if c might be 0. Dependently typed languages can provide this.
99.
by pseudonom- 12y ago
As another point to triangulate from, Haskell is also whitespace-sensitive and I have never had a non-trivial whitespace error in it.
100.
by pseudonom- 12y ago
My understanding is that there's a fundamental trade-off between expressivity and efficiency (while maintaining referential transparency): https://blogs.janestreet.com/breaking-down-frp/ http://people.s
101.
by pseudonom- 12y ago
bitemyapp seems to have pretty clear opinions on Haskell vs Clojure: http://bitemyapp.com/posts/2014-04-29-meditations-on-learnin...
102.
by pseudonom- 12y ago
I think the point of the above comment is that Go doesn't even include those decades old features.
103.
by pseudonom- 12y ago
I made a little website to do this a few months ago: http://angler.herokuapp.com/
104.
by pseudonom- 12y ago
Ha. I made a little website to automatically suggest Anglo-Saxon words a few months ago: http://angler.herokuapp.com/
105.
by pseudonom- 12y ago
Maybe for reversible computing? [0] [0] https://en.wikipedia.org/wiki/Reversible_computing
106.
by pseudonom- 12y ago
As a sort of side note, why is it filter p (x :: xs) with (filter p xs) | (_ ** xs') = if p x then (_ ** x :: xs') else (_ ** xs') rather than filter p (x :: xs) = if p x then (_ ** x :: snd (filter p x
107.
by pseudonom- 13y ago
I've used Elm a fair bit which is, in many ways, similar (compile-to-JS, statically typed, purely fuctional language). Between expressive types, a REPL, etc., I have never felt compelled to try to debug the generated Javascript.
108.
by pseudonom- 13y ago
My impression is that Fay has been in (at least moderate) use the longest. GHCJS seems to be getting a lot more viable lately. Elm (which is only Haskellish rather than fully Haskell-compatible) isn't listed on that page, but is gettin
109.
by pseudonom- 13y ago
Ur/Web's [0] pretty obscure but also does this. As does Opa [1]. [0] http://impredicative.com/ur/ [1] http://opalang.org/