lambda-calculi come with no fixed evaluation strategy. Different strategies may then be considered, and it is important that they satisfy some abstract rewriting property, such as factorization or nomalization theorems. In this paper we provide simple proof techniques for these theorems. Our starting point is a revisitation of Takahashi’s technique to prove factorization for head reduction. Our technique is both simpler and more powerful, as it works in cases where Takahishi’s does not. We then pair factorization with two other abstract properties, defining essential systems, and show that normalization follows. Concretely, we apply the technique to four case studies, two classic ones, head and the leftmost-outermost reductions, and two less classic ones, non-deterministic weak call-by-value and least-level reductions.
Mon 2 DecDisplayed time zone: Beijing, Chongqing, Hong Kong, Urumqi change
15:30 - 17:00
|Factorization and Normalization, Essentially
|Formal Verifications of Call-by-Need and Call-by-Name Evaluations with Mutual Recursion
|Recursion Schemes in Coq