ICFP 2021
Sun 22 - Sat 28 August 2021
Fri 27 Aug 2021 01:30 - 02:30 at miniKanren - Afternoon Keynote and Session C Chair(s): Gregory Rosenblatt

Relational programming models work well for problems where a single input configuration has multiple valid solutions. Procedural Content Generation (PCG) is a class of such problems, typically in the context of virtual worlds or digital games in which interactors engage repeatedly with a virtual environment and expect to encounter variations that feel different, yet satisfy constraints related to playability and in-world consistency. For example, PCG algorithms may generate world maps, terrain, puzzle game levels, or text in dialogue or descriptions. In this talk, I will define several important properties for PCG algorithms, discuss relational programming techniques that support PCG, and motivate directions for future research in this area.

Ph.D. Carnegie Mellon University, 2015

Postdoc UC Santa Cruz, 2015-2016

Assistant Professor, NC State University, 2016-present

Fri 27 Aug

Displayed time zone: Seoul change

01:30 - 03:00
Afternoon Keynote and Session CminiKanren at miniKanren
Chair(s): Gregory Rosenblatt University of Alabama at Birmingham, USA
Relational Content Generation
Chris Martens North Carolina State University
Media Attached
Relational Floating-Point Arithmetic
Lucas Sandre University of Toronto Mississauga, Malaika Zaidi University of Toronto Mississauga, Lisa Zhang University of Toronto Mississauga
Pre-print Media Attached
Day closing
Closing Remarks