FUN in the AFTERNOON at YORK
Thursday, 22 November 2007
Program Specialization by Graph Reduction
This talk will demonstrate novel graph reduction techniques which use reduction beneath lambdas to achieve program specialization. Unlike other partial-evaluation and meta-programming systems, functions rather than annotations are used to control the specialization. This enables a more dynamic form of specialization where the specializing effect is inherited by interpreted languages. This inherited specializing effect will be graphically demonstrated.
The slides and examples for this talk are contained in the Java applet below (Java 1.5 or greater is required).
Use SPACE to step forward through the pages on the FitA tab, 'B' to go back. ALT+[ and ALT+] change the font size.