Write a Blog >>
APLAS 2019
Sun 1 - Wed 4 December 2019 Bali, Indonesia
Mon 2 Dec 2019 15:30 - 16:00 at Bali Room - Semantics Chair(s): Atsushi Igarashi

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 Dec
Times are displayed in time zone: Beijing, Chongqing, Hong Kong, Urumqi change

15:30 - 17:00: SemanticsResearch Papers at Bali Room
Chair(s): Atsushi IgarashiKyoto University, Japan
15:30 - 16:00
Research Papers
Beniamino AccattoliInria & Ecole Polytechnique, Claudia FaggianIRIF, Giulio GuerrieriUniversity of Bath
16:00 - 16:30
Research Papers
Masayuki MizunoTohoku University , Eijiro SumiiTohoku University
16:30 - 17:00
Research Papers
Kosuke MurataKyushu Institute of Technology , Kento EmotoKyushu Institute of Technology