Aram Hăvărneanu @aramh

Mathematical engineer bringing type safety to the cloud. Previously worked on CUE @cue_lang. JSR PC, @(R6)+; I wrote the arm64, sparc64, and Solaris Go ports. Joined May 2009

Tweets

6K
Followers

3K
Following

1K
Likes

11K

Aram Hăvărneanu @aramh

2 days ago

Functional programming is all about the careful control of side effects. On the other hand app designers perform effects on your behalf just because you look at an app! Unbelievable. Effectful operation have to be explicit, and app features have to be compositional.

Aram Hăvărneanu @aramh

2 days ago

5 5 58 4K 15

2 1 30 2K 6

Aram Hăvărneanu @aramh

3 days ago

I suppose the author being hopelessly naïve about what the MIT permits users to do explains why they are so naïve right now about not understanding why this move is a spectacularly bad idea.

Aram Hăvărneanu @aramh

3 days ago

I suppose the author being hopelessly naïve about what the MIT permits users to do explains why they are so naïve right now about not understanding why this move is a spectacularly bad idea.

1 0 12 4K 1

5 1 24 3K 6

Aram Hăvărneanu @aramh

5 days ago

In some sense a variable and the space its value resides in form something akin to an entangled pair. But they also from something like a traversable wormhole. Hmm.

Aram Hăvărneanu @aramh

5 days ago

In some sense a variable and the space its value resides in form something akin to an entangled pair. But they also from something like a traversable wormhole. Hmm.

4 6 39 3K 18

1 1 8 954 3

Aram Hăvărneanu @aramh

5 days ago

There is an uncanny correspondence between computation and physics: linearity ≅ unitarity confluence ≅ causality parallelism ≅ relativity nondeterminism ≅ Cauchy surface divergence ≅ naked singularity

4 6 39 3K 18

Aram Hăvărneanu @aramh

5 days ago

A data structure is laid out in space (i.e. memory). The most general data structure is a graph. Nodes point to other nodes (i.e. to their address—their spatial coordinate). There can be cycles. A data structure can evolve over time (i.e. computation mutates it). New nodes can…

7 5 64 3K 47

Aram Hăvărneanu @aramh

5 days ago

More on the advantages of separating capabilities from pointers, using linear logic.

Aram Hăvărneanu @aramh

5 days ago

More on the advantages of separating capabilities from pointers, using linear logic.

0 0 3 881 2

0 0 10 784 4

Aram Hăvărneanu @aramh

5 days ago

@jameskjx You can update shared structure in place! In fact that is the reason why the described system is better than other systems. Inside an existential package, there can be aliasing in space. There is no aliasing in time (which is why updates are always safe), but time moves forward,…

2 2 5 580 0

Aram Hăvărneanu @aramh

6 days ago

How references should work in a linear language. A reference is an existential package comprising of a linear access capability (a typed token) paired with an exponential location (an untyped pointer). Ref t = ∃l. (Cap l t) ⊗ !(Ptr l) The location is a freely-copyable…

10 2 69 4K 34

Aram Hăvărneanu @aramh

a week ago

I already have several counter-arguments to my own idea. One of them would be that it doesn't behave very well with weakening, requiring syntactic transpositions.

Aram Hăvărneanu @aramh

a week ago

I already have several counter-arguments to my own idea. One of them would be that it doesn't behave very well with weakening, requiring syntactic transpositions.