I'll offer a partial response to my own post, having successfully gotten Boomerang going, with some work. I used an old version of OCaml:
opam switch create 4.04.2
git checkout e64f97b
Made sure I had OASIS, and ran make to completion.
Is the Boomerang language still being maintained? The GitHub repo [link redacted] hasn't been updated in about two years, and I think it's missing some stuff—notably the 'INSTALL.txt' instructions mentioned in the documentation.
OCaml isn't a language I've much studied. After installing it (v4.05) and some other prerequisites, such as jbuilder, I am able to run make, whereupon the following error presents itself:
File "stdlib/util.ml", line 684, characters 9-37:
Error: The function applied to this argument has type
compare:('a -> 'a -> int) -> 'a list
This argument cannot be applied with label ~cmp
I apologize for the long delay. It's typical, I'm afraid.
I'm not sure what you mean by reversible, or inversion.
I say 'invertible' when talking about things that seem more like mathematical functions, and 'reversible' when describing programs or algorithms, in the 'reversible computing' (q.v.) sense. In the considerable area where they overlap, I tend to use them interchangeably, which may be the source of the confusion.
I'm not from the PL/Haskell world but can still suggest 1 for a formal overview of the quite diverse "lens landscape". It might help you identify what you're interested in and provide relevant references and pointers for further reading.
It did. Johnson and Rosebrugh have another paper, 2, about spans, which helped me to a breakthrough. I think what I was grasping at, in my first post, was that head and tail are 'complementary,' and the combined form $(\mathtt{lhead}\times \mathtt{ltail})$ is a 'span' from head to tail.
The most illuminating paper I've encountered has been 3, which I think is quite elegant. A symmetric lens is the nearest to the-thing-that-I-was-looking-for-that-turned-out-to-be-called-a-lens. The 'lensified cons' which I postulated could be constructed as a symmetric lens.
-Jonathan
Hi Jonathan,
I'm not sure what you mean by reversible, or inversion. In general, the "inverse" of a get is not unique — you typically have a choice of many puts that can all be equally "good". Bx frameworks try to hammer out what laws can be used to precisely say what "good" means.
I'm not from the PL/Haskell world but can still suggest [1] for a formal overview of the quite diverse "lens landscape". It might help you identify what you're interested in and provide relevant references and pointers for further reading.
From a more practical, hands-on side, I guess you might be interested in BiGUL [2], a relatively well-documented and mature Haskell library that can be used to easily program your example (and do much more).
The bx community is very diverse and we try hard (struggle?) to leverage this as an advantage. You might find our current bx benchmark interesting as it allows a direct comparison of the different bx approaches applied to the exact same example [3].
Cheers,
Tony
How are you, ladies & gentlemen?
I'm interested in source-to-source program transformations, which I think should be reversible, implying monomorphism. To do this, one needs to be able to invert the components of these transformations, so I was happy to discover the idea of lenses, which plugged a hole in my mental compendium about a decade old.
Allow me to raise the very simple example of list decomposition, using Haskell notation. There's an obvious sense in which the inverse of the cons operation is pattern-matching on the the list head|tail, with the same notation, (:), used for both.1 Similarly, one can say that destructuring is "the same" as the (head⨯tail) joint operation. By another abuse of notation, in the form of entropy: $H(\text{<destructuring>}) = H(\mathtt{head}) + H(\mathtt{tail})$.
Now let me "lift" head and tail into the category of very well behaved (VWB?) lenses, which I'll call lhead and ltail, as
lhead⭧ = head
lhead⭨ x (_:xs) = x:xs
ltail⭧ = tail
ltail⭨ xs (x:_) = x:xs
where the Get operations are the original head and tail.2 Intuitively, the joint information provided by lhead|ltail is "the same" as that of cons plus pattern-matching, in that we could transform programs written in one syntactic convention into the other. There's probably a symmetric argument to show that a lensified cons has equivalent expressive power as well. If I were a category theorist, I might draw a little diagram.
Unfortunately, I'm asking questions on several topics, here, about which my knowledge level is abecedarian. Are there particular subcategories of lenses which show the algebraic behavior I'm suggesting? Is there a domain-theoretic way of describing the special relationship between lhead⭨, ltail⭨ and cons? I have the impression that some kind of higher-order functor should exist to map regular functions to these lenses.3 I hope someone will know what I'm talking about, even if I don't.
Thanks,
Jonathan J-S
