Write a Blog >>
ICFP 2018
Sun 23 - Sat 29 September 2018 St. Louis, Missouri, United States
Fri 28 Sep 2018 11:10 - 11:35 at New York Central - Session 1

Many functional programs —state machines, top-down and bottom-up parsers, evaluators, GUI initialization graphs, &c. — 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.

Fri 28 Sep
Times are displayed in time zone: (GMT-05:00) Guadalajara, Mexico City, Monterrey change

10:20 - 12:00: ML 2018 - Session 1 at New York Central
mlfamilyworkshop-2018-papers10:20 - 10:45
Stephen DolanUniversity of Cambridge
mlfamilyworkshop-2018-papers10:45 - 11:10
Aaron WeissNortheastern University, Daniel PattersonNortheastern University, Amal AhmedNortheastern University, USA
Link to publication Pre-print
mlfamilyworkshop-2018-papers11:10 - 11:35
Jeremy YallopUniversity of Cambridge, UK, Oleg Kiselyov
mlfamilyworkshop-2018-papers11:35 - 12:00
Martin ElsmanUniversity of Copenhagen, Denmark, Philip MunksgaardIntelligent Alpha AG, Switzerland, Ken Friis LarsenDIKU, University of Copenhagen
Link to publication