art-w

13 ms·

1.
Building a language that people want(blog.merigoux.fr)
2 points by art-w 7mo ago|0 comments
2.
by art-w 10mo ago
Two interesting projects in that space: - https://arcan-fe.com/ which introduces a new protocol for TUI applications, which leads to better interactions across the different layers (hard to describe! but the website has nic
3.
Why I love OCaml (2023)(mccd.space)
391 points by art-w 10mo ago|296 comments
4.
Raven: Scientific Computing for OCaml (Alpha Release)(discuss.ocaml.org)
3 points by art-w 1y ago|0 comments
5.
Fixing Slipshow's worst flaw using OCaml and a monad(choum.net)
2 points by art-w 2y ago|0 comments
6.
Release of OCaml 5.3.0(ocaml.org)
18 points by art-w 2y ago|1 comments
7.
by art-w 8y ago
As much as I love APL for its notation, Erlang does provides equivalent highlevel operators for processing sequences of elements. It's not fair to compare your highlevel implementation in APL to your lowlevel optimized (and quite unrea
8.
by art-w 9y ago
While I agree I was expecting a more visual story from the synopsis, I strongly recommend the movie "The Hunt" with Mads Mikkelsen to get a feeling of what he may have gone through. It's a really good movie.
9.
by art-w 11y ago
Have you looked at the table of contents? http://people.ucalgary.ca/~rzach/static/open-logic/open-logi... Summary: They are going for the foundations of maths, computer science, and logic with completeness, d
10.
by art-w 11y ago
Ha, you got me for a second. The bits aren't "stored" inside the vertex, but in the segments: It would be like saying that the space between bits "{0,1} {0,1}" contains 2 bits of information, and that we could encod
11.
by art-w 11y ago
I hope you are joking. This isn't a spreadsheet, it's a stupid bruteforce algorithm that misses the point of the dataflow paradigm: - Everything gets recomputed on any minor change. - If a cell is referenced by N other cells, it w
12.
by art-w 11y ago
Not exactly: you don't get the O(1) access to the two previous computations with loeb. It abstracts the collection used for memoization, but it doesn't provides "locality". Here's a presentation that dives into loeb
13.
by art-w 11y ago
Even if you manage to remove the explicit "reads" field, the "code" thunk is still going to point to the parent cells, so that wouldn't help the GC much.
14.
by art-w 11y ago
That's a bad example, since GHC will perform common expressions elimination, which effectively give the same name to the two `add 1 z` (unless you specifically ask it not to, with `-O0`.) Furthermore, Incremental isn't memoizing e
15.
by art-w 11y ago
I agree that some language features have a binary nature, like static/overridable or lazy/strict, but maybe we shouldn't classify all of them like that? The "new" keyword in Java is very much like the proposed &quot
16.
by art-w 11y ago
> If your argument isn't "well, you don't need new syntax and help from the compiler if you just pay attention and remember not to use with/try if you ever need guaranteed tail calls", then please state it more c
17.
by art-w 11y ago
Sure, finally breaks the tailcall syntax, just like it breaks the syntax rule "the function ends on a return". You are right that I haven't stated my motivation for arguing about tailcalls: - I really believe that tailcalls s
18.
by art-w 11y ago
What's so invisible about your examples? I agree that an optimizing interpreter makes the situation harder to analyse, because we can't remember every simplification it handles. Without it, the tailcalls are very explicit. Previou
19.
by art-w 11y ago
But tailcalls already have a syntax: return f(a, b, c) # tailcall on f return f(g(b)) # tailcall on f return f(a, b, c) + 0 # tail call on + The last function to be called before a return is tailcall. That's it. Nothi
20.
by art-w 12y ago
I disagree, HTML is a datastructure like any other, and it should be easy to build one without going through an untyped string or an auxiliary file. It's painful to make one html file per renderable item -- and debugging takes more tim
21.
by art-w 12y ago
You probably don't care what a "Tiger" search would return, but I find the DDG results vastly more informative: https://duckduckgo.com/?q=tiger Recommendations: animals, military, people, movies, bands, organ
22.
by art-w 12y ago
I'm sorry, I don't think I understand your message and my answer might be off as a result. Could you link to the current research on more general solutions than Checker, so I can get a clearer picture? > a type system limitatio
23.
by art-w 12y ago
People working on program synthesis consider the Occam razor "the shortest/simplest code" to be a good heuristic of the intended function (given a good test case.) Their main problem is the exponential space search.
24.
by art-w 12y ago
This example is bizarre, because a fast implementation is probably going to rely on a SAT solver, at which point the "queens code" (in any language) becomes a declarative specification of the solution! Also, I don't think tha
25.
by art-w 12y ago
It's not reasonable to embed every possible language constructs, semantic and logic into a theorem prover. So the trick is to make the host generic enough to be able to embed your needs as a domain specific language: your critic become