feat(untyped): the Leftmost Reduction Theorem#700
Conversation
|
Can you add 2 theorems :
|
|
@lengyijun Sounds good, I'll get both into a separate PR soon :) |
|
Should we rename
|
|
@m-ow Hi, what's your plan after this pr |
|
Honestly, no fixed plan yet, but your project sounds really interesting. Feel free to point me at what's the priority on your side, happy to take a look! |
|
We will formalize "2 vars are not enough" after this pr is merged. There will still be 1400 cases unprocessed. I haven't even studied them at all. You can randomly pick a few and research them. I will also pr my fork step by step. |
|
@m-ow Before I review for more detailed changes, I think I'm missing some high-level points about the defintions (some of which I maybe should have asked in earlier PRs, sorry!).
|
|
You're right, it's not there. The results here only rely on the inductive Standard relation, both sources I followed actually keep the sequence definition as a separate development. It's clearly worth having though, sorry for the gap! If you think it's best, I'll open a new PR to add the sequence definition and its equivalence with Standard. |
|
Yeah, it is pretty standard to use some equivalent inductive that's easier to work with (I assume this is why we have Maybe because these are so closely related they should just go in the same module? Feel free to move things around as needed. |
Introduces leftmost reduction
⭢ℓ, a beta-step contracting the redex at position 0, together with normal forms, and proves the Leftmost Reduction Theorem: if a term beta-reduces to a normal form, the leftmost strategy reaches it too.The result falls out of standardization, following Copes (2018).
Builds on top of #679