Code and proofs for Verse-ML, an equation-style sub-ml language. Part of an undergraduate senior thesis with Norman Ramsey, Milod Kazerounian, and Roger Burtonpatel.
Coverage: Do these rules cover what you consider to be important per what we've discussed in the language?
Formatting: Is the first rule, Ge-Ctx-Stuck, sound with regards to premises being adjacent vs. above each other?
Productive next steps: Would it be helpful to add rules for things like literals and value constructors, or focus my efforts on a more significant task like our termination, soundness, and completeness proofs?
The current representation of "temporarily stuck" definitely will not do. Otherwise I got bogged down with some questionable notation choices.
The rule looks wrong (a \rho where it needs a \rhohat), but the rule looks well formed.
Yes, I think you want a rule for value constructors. Value constructors can subsume literals, so no, no literals. Before adding more rules or attempting a proof, fix what you have.
Looking for thoughts on:
https://github.com/rogerburtonpatel/vml/blob/main/tex/syntax-and-judgement/syntax-judgement-V-.pdf
Thanks!