Viewing profile — art-w

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…

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 implementa…

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…

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, an…

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 i…

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…

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 …

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.

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 …

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 i…

> 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 cal…

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 t…

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. Wi…

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…

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 f…

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, …

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 g…

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 probl…

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 specifica…

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 …