Skip to main navigation Skip to search Skip to main content

Factorization and normalization, essentially

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

λ-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 Takahashi’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.

Original languageEnglish
Title of host publicationProgramming Languages and Systems - 17th Asian Symposium, APLAS 2019, Proceedings
EditorsAnthony Widjaja Lin
PublisherSpringer
Pages159-180
Number of pages22
ISBN (Print)9783030341749
DOIs
Publication statusPublished - 1 Jan 2019
Event17th Asian Symposium on Programming Languages and Systems, APLAS 2019 - Bali, Indonesia
Duration: 1 Dec 20194 Dec 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11893 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference17th Asian Symposium on Programming Languages and Systems, APLAS 2019
Country/TerritoryIndonesia
City Bali
Period1/12/194/12/19

Fingerprint

Dive into the research topics of 'Factorization and normalization, essentially'. Together they form a unique fingerprint.

Cite this