Copenhagen Programming Language Seminar
Parametric polymorphism constrains the behavior of pure functionalprograms in a way that allows the derivation of interesting theorems about them solely from their types, i.e., virtually for free. This observation underlies a number of transformations which can be used to improve the performance of such programs. Unfortunately, the standard
parametricity theorem, from which the free theorems guaranteeing correctness of such transformations derives, fails for nonstrict languages supporting a polymorphic strict evaluation primitive such as Haskell's seq.
Fritz Henglein. Administrative host: Camilla Jensen. All are welcome.
The Copenhagen Programming Language Seminar (COPLAS) is a collaboration between DIKU, ITU and KVL.
To receive information about COPLAS talks by email, send a message to email@example.com with the word 'subscribe' as subject or in the body.
For more information about COPLAS, see http://www.coplas.org