This will be a cool demo once the kinks get worked out. It lets you see first-hand that you can choose which redex to beta-expand first. Haskell is an excellent choice for this because -- unlike almost every other language -- it does not matter the order you evaluate subexpressions in. I feel like this could be useful to show someone when teaching them to program.
The language in the function editor on the right looks like Haskell. I'm confused as to what the language you run is supposed to be, though. It doesn't seem to have Haskell syntax or semantics. The lists aren't comma-separated, and the main expression seems to require parenthesis? And what is this program doing?
It is supposed to be Haskell-ish, but admittedly I haven't done much Haskell in a while. I just went roughly with what Steve suggested. But yeah, the missing commas in lists is a pretty big mistake!
Very nice. It took me a while to realize that array literals aren't supported, but once I did that I was able to write concatMap and watch it being evaluated.
A couple of points:
- If there is a syntax error, the box just turns red. It would be nice to see what the issue is.
- You could probably make it clearer that it's possible to execute arbitrary expressions, by editing the map term, for example.
2. But what should we expand then? Just the first one? Part what makes it interesting is that you can decide for yourself what to expand, and it doesn't matter in which order you do it (Church-Rosser).
3. Feel free to hack CodeMirror or Ace in there! :)
The language in the function editor on the right looks like Haskell. I'm confused as to what the language you run is supposed to be, though. It doesn't seem to have Haskell syntax or semantics. The lists aren't comma-separated, and the main expression seems to require parenthesis? And what is this program doing?
vs. in Haskell