Log In Sign Up

Factorization and Normalization, Essentially

by   Beniamino Accattoli, et al.

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 normalization 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.


page 1

page 2

page 3

page 4


Factorize Factorization

We present a new technique for proving factorization theorems for compou...

Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic (long version)

In each variant of the lambda-calculus, factorization and normalization ...

Natural Deduction and Normalization Proofs for the Intersection Type Discipline

Refining and extending previous work by Retoré, we develop a systematic ...

Index-Stratified Types (Extended Version)

We present Tores, a core language for encoding metatheoretic proofs. The...

Type-theoretic weak factorization systems

This article presents three characterizations of the weak factorization ...

Call-by-need, neededness and all that

We show that call-by-need is observationally equivalent to weak-head nee...

On Investigation of Unsupervised Speech Factorization Based on Normalization Flow

Speech signals are complex composites of various information, including ...