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.

Tue 15 Jan

pepm-2019-papers
14:00 - 15:30: PEPM 2019 - Session 5 at Sala X
Chair(s): Alberto PettorossiUniversity of Rome Tor Vergata, Italy
pepm-2019-papers14:00 - 14:30
Talk
Kenichi AsaiOchanomizu University
DOI File Attached
pepm-2019-papers14:30 - 15:00
Talk
Tamino DauthKarlsruhe University of Applied Sciences, Germany, Martin SulzmannKarlsruhe University of Applied Sciences, Germany
DOI File Attached
pepm-2019-papers15:00 - 15:28
Talk
Jeremy YallopUniversity of Cambridge, UK, Oleg Kiselyov
DOI Pre-print
pepm-2019-papers15:28 - 15:30
Poster
Tamino DauthKarlsruhe University of Applied Sciences, Germany, Martin SulzmannKarlsruhe University of Applied Sciences, Germany