Partial deduction is a source-to-source transformation for logic programming, which is similar to supercompilation. It improves the behavior of programs by deforestation (getting rid of intermediate data structures) and tupling (avoiding repeating sub-computations). We will talk about the advantages of considering the whole conjunctions while driving, and how to ensure termination of the transformation.
Presenter: Ekaterina Verbitskaya
Date: December 10, 2018
Venue: room 3248, Faculty of Mathematics and Mechanics, Saint Petersburg State University, Stary Peterhof, Universitetski pr., 28