A Family of Unification-oblivious Program Transformations and Their Applications
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 JanDisplayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
18:00 - 19:30
|A Family of Unification-oblivious Program Transformations and Their Applications|
Paul Tarau University of North Texas
|On Adding Pattern Matching to Haskell-based Deeply Embedded Domain Specific Languages|