Write a Blog >>
POPL 2021
Sun 17 - Fri 22 January 2021 Online
Mon 18 Jan 2021 18:00 - 18:30 at PADL - Foundations and Programming Concepts Chair(s): Dominic Orchard

We describe a family of program transformations that compile a Horn Clause program into equivalent programs of a simpler and more regular structure. Our transformations, seen as morphisms between term algebras, commute with unification, clause unfoldings and Prolog’s LD-resolution, thus preserving the operational semantics of the Horn Clause programs. As applications, the resulting programs have simpler execution algorithms and can be compiled to minimalist instruction sets.

Mon 18 Jan

Displayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

18:00 - 19:30
Foundations and Programming ConceptsPADL at PADL
Chair(s): Dominic Orchard University of Kent, UK
Research paper
A Family of Unification-oblivious Program Transformations and Their Applications
Paul Tarau University of North Texas
Research paper
On Adding Pattern Matching to Haskell-based Deeply Embedded Domain Specific Languages
David Young University of Kansas, USA, Mark Grebe University of Central Missouri, USA, Andy Gill University of Kansas, USA