Blogs (1) >>
POPL 2019
Sun 13 - Sat 19 January 2019 Cascais, Portugal
Mon 14 Jan 2019 12:00 - 12:30 at Sala X - Session 1 Chair(s): Manuel Hermenegildo

Closure calculus is simpler than pure lambda-calculus as it does not mention free variables or index manipulation, variable renaming, implicit substitution, or any other meta-theory. Further, all programs, even recursive ones, can be expressed as normal forms. Third, there are reduction-preserving translations to calculi built from combinations of operators, in the style of combinatory logic. These improvements are achieved without sacrificing three fundamental properties of lambda-calculus, being a confluent rewriting system, supporting the Turing computable numerical functions, and supporting simple typing.

Mon 14 Jan

11:00 - 12:30: PEPM 2019 - Session 1 at Sala X
Chair(s): Manuel HermenegildoIMDEA Software Institute and T.U. of Madrid (UPM)
pepm-2019-papers11:00 - 11:05
Day opening
Atsushi IgarashiKyoto University, Japan, Manuel HermenegildoIMDEA Software Institute and T.U. of Madrid (UPM)
pepm-2019-papers11:05 - 12:00
Christian HumerOracle Labs, Switzerland
File Attached
pepm-2019-papers12:00 - 12:30
Barry JayUniversity of Technology Sydney