Analysis and Transformation of Set-Theoretic Languages

Course Contents

This minicourse will discuss how types and transformations can be used to integrate algorithm design and analysis, program development, and high level compilation of set theoretic programming languages.

Topics:

• Introduction to SETL and sources of inefficiency; program improvemenet by finite differencing.
• Program improvement by real-time simulation of a typed set machine (equipped with high level input/output) on a RAM.
• Reconstruction and extension of the linear time fragment of Willard's database predicate retrieval theory.
• Design of a linear time fixed point language; experiments in productivity of algorithm implementation (live demonstration).

Programme

Monday August 14, 1995, 13:15-15:00 in Colloquium D

Tuesday August 15, 1995, 13:15-15:00 in Colloquium D

Wednesday August 16, 1995, 13:15-15:00 in Colloquium D

Thursday August 17, 1995, 13:15-15:00 in Colloquium D

Lecture Notes