Blogs (1) >>
POPL 2019
Sun 13 - Sat 19 January 2019 Cascais, Portugal
Tue 15 Jan 2019 15:00 - 15:28 at Sala X - Session 5 Chair(s): Alberto Pettorossi

Many functional programs — state machines top-down and bottom-up parsers, evaluators, GUI initialization graphs, etc. — are conveniently expressed as groups of mutually recursive bindings. One therefore expects program generators, such as those written in MetaOCaml, to be able to build programs with mutual recursion.

Unfortunately, currently MetaOCaml can only build recursive groups whose size is hard-coded in the generating program. The general case requires something other than quotation, and seemingly weakens static guarantees on the resulting code. We describe the challenges and propose a new language construct for assuredly generating binding groups of arbitrary size~– illustrating with a collection of examples for mutual, n-ary, heterogeneous, value and polymorphic recursion.

Conference Day
Tue 15 Jan

Displayed time zone: Belfast change

14:00 - 15:30
Session 5PEPM at Sala X
Chair(s): Alberto PettorossiUniversity of Rome Tor Vergata, Italy
14:00
30m
Talk
Extracting a Call-by-Name Partial Evaluator from a Proof of Termination
PEPM
Kenichi AsaiOchanomizu University
DOI File Attached
14:30
30m
Talk
Futures and Promises in Haskell and Scala
PEPM
Tamino DauthKarlsruhe University of Applied Sciences, Germany, Martin SulzmannKarlsruhe University of Applied Sciences, Germany
DOI File Attached
15:00
28m
Talk
Generating Mutually Recursive Definitions
PEPM
Jeremy YallopUniversity of Cambridge, UK, Oleg Kiselyov
DOI Pre-print
15:28
2m
Poster
Advanced Futures and Promises in C++ (poster)
PEPM
Tamino DauthKarlsruhe University of Applied Sciences, Germany, Martin SulzmannKarlsruhe University of Applied Sciences, Germany