Tue 9 Jan 2018 15:00 - 15:30 at Crocker - Session 2-2 Chair(s): Kohei Suenaga

Recursive programs can now be expressed as normal forms within some rewriting systems, including traditional combinatory logic, a new variant of lambda-calculus called closure calculus, and recent variants of combinatory logic that support queries of internal program structure. In all these settings, partial evaluation of primitive recursive functions, such as addition, can reduce open terms to normal form without fear of non-termination. In those settings where queries of program structure are supported, program optimizations that are expressed as non-standard rewriting rules can be represented as functions in the calculus, without any need for quotation or other meta-theory.

Tue 9 Jan

Displayed time zone: Tijuana, Baja California change

14:00 - 15:30
Session 2-2PEPM at Crocker
Chair(s): Kohei Suenaga Graduate School of Informatics, Kyoto University
14:00
30m
Talk
Partially Static Data as Free Extension of Algebras (Short Paper)
PEPM
Jeremy Yallop University of Cambridge, UK, Tamara von Glehn University of Cambridge, Ohad Kammar University of Oxford
Pre-print
14:30
30m
Talk
Program Generation for ML Modules (Short Paper)
PEPM
Takahisa Watanabe University of Tsukuba, Japan, Yukiyoshi Kameyama University of Tsukuba, Japan
DOI
15:00
30m
Talk
Recursive Programs in Normal Form (Short Paper)
PEPM
Barry Jay University of Technology Sydney
DOI