Gregory's Server@neauoire what ? you don't like that kind of stuff ? 😂
|
10 comments
  @maxime_andre I've tried to implement Lamping's graph reduction in uxntal, I've noodled with pretty much every one of these programs: https://github.com/HigherOrderCO/Wikind I've ran their little webserver thing and got the tictactoe program to show @maxime_andre I'm only superficially interested in this stuff, I mean, it's cool and everything -- I like to read about alternative ways of doing combinatory logic, I'm always looking for things that I couldn't do in uxn, that I might draw inspiration from. I think I also just like running these types of programs that are easy to reflect about. I think so far, the most accessible implementation of interaction net is Inpla, I've been thinking about making a visual editor for it. @maxime_andre Did you ever read Shinya's thesis? http://sro.sussex.ac.uk/id/eprint/54469/1/Sato%2C_Shinya.pdf @neauoire yes this morning during breakfast 😂 . and another time a couple of weeks ago iirc (or maybe it was another paper, but related to inpla) @maxime_andre When I read it, I was like okay, I need a graphical editor for this. It'll be so nice to see the graph instead of using textual representation, for once, this would make sense. A lot of folks are interested in flow-based programming but mapping over non-structural programming, this would be the ideal candidate. @maxime_andre Just stumbled on a pdf that is basically a focused version of Shinya's chapter 5(LL0) implementation! @neauoire ah yes this one is more readable :) @neauoire ok ok, on my side i've tried to implement the graph reduction too, but i have not played with the examples. I'd like to understand how it works, and build my little toy. I've managed to calculate 2^2, 2+2 in church encoding, but it starts to be a little boring. I've not implemented the inet -> lambda translation to show the result. |
@maxime_andre like yeah okay you love LaTeX we get it