Closed nrnrnr closed 8 months ago
Posting this when it's a little more workable from your end. End of weekend.
Finished today. Sleeping on it and posting tomorrow.
https://github.com/rogerburtonpatel/vml/commit/b8b9e9bc8113dd6414c242472f03ca5d3aa2ec19
Notes:
I like the first part, up to the last 2 sentences.
Other things:
I looked up the history of pattern matching and came upon the more precise definition of Tree patterns. I think it's good to include; correct me if I'm wrong. I definitely want to be precise in this.
Do I need to define expressiveness in the intro? "Probably not" was my thought. That said, I don't want a pro reading my paper to say, "He's using the word 'expressiveness' here without defining it; he has no idea what he's talking about.
This sentence: 'We go on to claim that there are no programs generatable with the subset that cannot be created using pattern matching with popular extensions, implying set equality. '
needs work. I like its ideas but not its form. Would very much appreciate workshopping this, and the last sentence, with you. Thank you as always.
Overall, I'm fairly happy with this as a shitty first draft. It's got a long way to go!
For now I think we're good here. Can reopen when it's time.
Norman will review