bjz_

28 ms·

241.
by bjz_ 10y ago
Damn, your degree looks like it must have been a ton of fun!
242.
by bjz_ 10y ago
> All languages have design flaws. Thats why people keep making new languages. Arguing that Rust does not have design flaws is going to arouse more skepticism then anything else. As somebody who has used Rust since late 2012, I completel
243.
by bjz_ 10y ago
Yale Climate Connections on the melting permafrost in 2013: https://www.youtube.com/watch?v=FLCgybStZ4g - sad to see we have been moving so slowly in the three years since I watched it.
244.
by bjz_ 10y ago
They don't have 'Facebook' in the name. Probably much easier for them to go after trademark infringement.
245.
by bjz_ 10y ago
Are there downsides to the HOL approach when compared to constructive systems?
246.
by bjz_ 10y ago
I've heard some from people that it's almost like we are still at 'the assembly language' level when it comes to theorem proving. We still have a great deal to build in order to be productive at higher levels of abstract
247.
by bjz_ 10y ago
Their main docs are pretty good too: http://docs.idris-lang.org
248.
by bjz_ 10y ago
I found Idris pretty easy to get started with - that's part of it's goal, making dependent types easier to get started with. From there I think it would be easier to go to Agda or Coq, but I haven't explored much there myself
249.
by bjz_ 10y ago
What do you feel is lacking from Haskell's REPL?
250.
by bjz_ 10y ago
There's a huge difference between concrete syntax and static/dynamic semantics. I wish more developers would stop judging languages by their covers, but perhaps that is too much to ask...
251.
by bjz_ 10y ago
Module functors were an SML feature - not really in the original 'ML' language. I would put Haskell in the ML family, and it doesn't have module functors. Rust has type inference, and a core type syntax and semantics that is
252.
by bjz_ 10y ago
We really do need to spend time on the numerics APIs though... I would love to pour some time into it again... just figuring out how to fit it in with all the other stuff I'm doing :( I agree with the caution though. This takes time to
253.
by bjz_ 10y ago
I know you can do stuff like: @type pair(t, u) :: {t, u} @type result(t, e) :: {:ok, t} | {:error, e} I'm more talking about type parameters on functions, and also constraining by behaviors and protocols. For example the t
254.
by bjz_ 10y ago
I find the Haskell, SML, and OCaml repls very nice to use as a exploratory tools. It's made all the nicer due to the types, because you can quickly iterate on gluing things together in different ways. It's something I miss with Ru
255.
by bjz_ 10y ago
Anyone know what the performance implications for using this would be?
256.
by bjz_ 10y ago
> I never felt like I have more bugs in dynamic typed languages. What I felt is that I don't have to waste time writing stuff like ArrayList<Whatever> when just something = {} works perfectly well in practice. Java is a prett
257.
by bjz_ 10y ago
Oh great, thanks! Unfortunate that I missed it. Still no luck on the parametric polymorphism though... :(
258.
by bjz_ 10y ago
What flags?
259.
by bjz_ 10y ago
Dialyzer uses success types, which don't always let you know when you have a soundness problem. The only thing you can count on is that if it does cry out, there certainly is something you need to fix. It also lacks parametric polymorp
260.
by bjz_ 10y ago
But then you lose memory safety
261.
by bjz_ 10y ago
Came across this Dijkstra quote via https://www.youtube.com/watch?v=GqmsQeSzMdw > The purpose of abstraction is not to be vague, but to create a new semantic level in which one can be absolutely precise By taking away al
262.
by bjz_ 10y ago
> For a long time I thought that was a normal part of cs curriculums, but it seems not. Alas, not all CS programs are created equal. Many skip entirely over FP because it isn't 'what the industry does'.
263.
by bjz_ 10y ago
> Prolog and Lisp were the two languages we were forbidden to use in compiler design project Haskell/Ocaml/SML? :3
264.
by bjz_ 10y ago
Also be sure to check out typed racket!
265.
by bjz_ 10y ago
Yeah - should have been more clear on that ;)
266.
by bjz_ 10y ago
> Everybody who does PL theory more seriously probably knows that, but I didn't realize how close type inference and prolog-like systems look. Yup! This is more to do with a very specific part of type theory - ie. 'type reconst
267.
by bjz_ 10y ago
Yup - trying out Elm makes you realize how much complexity is in the React + Redux stack that is not really needed...
268.
by bjz_ 10y ago
Rust was supported from the start by Mozilla in order to enable the construction of an experimental browser engine (ie. Servo) that was completely separate from Gecko and Firefox. Afaik, there was never any explicit goal at the beginning to
269.
by bjz_ 10y ago
It used to be huge (including the entire standard library for simple apps). Afaik though the generated code has been improved in the last update to be compatible with google's closure compiler and things like browserify or webpack that
270.
by bjz_ 10y ago
> But my understanding is that strictness for Elm was chosen mainly to overcome issues with FRP, which it's now abandoned Laziness also requires you to ship a runtime, which is annoying on the web. Plus it's hard to debug perfo

More ›