IFL 2002 Programme

 
 Sunday 15th September
19:00 Registration and welcome reception (Medicine Faculty)
Monday 16th September
8:30 Registration
8:50 Opening
9:00 Session I: Parallelism (chair: Yolanda Ortega)
Cost Analysis Using Automatic Size and Time Inference. 
Álvaro J Rebón Portillo, Kevin Hammond, and Hans-Wolfgang Loidl
Porting the Eden System to GHC 5.00
Jost Berthold, Rita Loogen, Steffen Priebe, and Nils Weskamp
Thread Migration in a Parallel Graph Reducer
Andre Rauber Du Bois, Hans-Wolfgang Loidl, and Phil Trinder
10:30 Coffee break
11:00 Session II: Compilation Techniques (chair: Olaf Chitil)
Optimistic Evaluation
Robert Ennals and Simon Peyton-Jones
Selective Tail Call Elimination
Yasuhiko Minamide
Fusion in Practice
Diederik van Arkel, John van Groningen, and Sjaak Smetsers
Fast Functional Lists
Phil Bagwell
13:00 Lunch
14:30 Session III: Debugging (chair: Peter Achten)
Transforming Haskell for Tracing
Olaf Chitil, Colin Runciman, and Malcolm Wallace
Deriving Animations from Recursive Definitions
Alcino Cunha, José Barros, and João Saraiva
A Debugger for Concurrent Haskell
Frank Huch and Thomas Böttcher
16:00 Coffee break
16:30 Session IV: Abstract Machines (chair: Ricardo Peña)
Paging Lists in a Distributed Virtual Memory system for a Functional Language Using Heap-Exclusive Frames
Marco T. Morazán and Douglas R. Troeger
The Unified Model of Computation as an Implementation Platform for Functional Languages
Alex Ferguson and John Morrison
Extracting Global Properties from Local Functions
Juan José Sánchez and Thomas Arts
PolyAPM: Parallel Programming via Stepwise Refinement with Abstract Parallel Machines
Nils Ellmenreich and Christian Lengauer
18:30 Tool Demos
Tuesday 17th September
9:00 Session V: Array Processing (chair: Kevin Hammond)
Haxcel: A Spreadsheet Interface to Haskell
Björn Lisper and Johan Malmström
Introducing generalized rank conjunctions to SAC  or  how to write and compile nested array operations
Clemens Grelck and Sven-Bodo Scholz
An algorithm for inferring array types with varying levels of shape information
Sven-Bodo Scholz
10:30 Coffee break
11:00 Session VI: Tools and Compilation Techniques (chair: Rinus Plasmeijer)
Development of a generic e-learning Multiparadigm  Programming Language System
Jose E. Labra G, José M. Morales G., Roberto Turrado C., and Alfredo Jarero S.
A generic test-system
Pieter Koopman
Parametric Type Inferencing for Helium
Bastiaan Heeren and Jurriaan Hage
Compilation of Floating Point Arithmetic in Erlang/OTP and in HiPE
Kostis Sagonas
13:00 Lunch
14:30 Excursion to Segovia (including workshop dinner)
Wednesday 18th September
9:00 Session VII: Concurrency (chair: Phil Trinder)
Concurrency abstractions for Concurrent Haskell
Volker Stolz and Frank Huch
FunWorlds/HOpenGL -- Functional Programming and Virtual Worlds
Claus Reinke
Towards a Strongly Typed Functional Operating System
Arjen van Weelden Rinus Plasmeijer
10:30 Coffee break
11:00 Session VIII: Formal Reasoning (chair: Ralf Laemmel)
A Prototype of CPPCC - Safe Functional Mobile Code in Clean
Károly Daxkobler, Zoltán Horváth and Tamás Kozsik
Proving Make Correct: IO Proofs in Haskell and Clean
Andrew Butterfield, Malcolm Dowse, and Glenn Strong
From requirements to functional programs - the HasCasl development paradigm
Christian Maeder, Till Mossakowski, and Lutz Schröder
Reasoning about explicit strictness in a lazy language using mixed lazy/strict semantics
Marko van Eekelen and Maarten de Mol
13:00 Lunch
14:30 Session IX: Language Concepts (chair: Marko van Eekelen)
Functional Transformation of Circular Data
Baltasar Trancon y Widemann
Predictable Space Behaviour in FSM-Hume
Kevin Hammond and Greg Michaelson
Lazy Dynamic Input/Output in the lazy functional language Clean
Martijn Vervoort and Rinus Plasmeijer
16:00 Coffee break
16:30 Session X: Program generation (chair: Rita Loogen)
A program transformation for implementing on-demand strategy annotations
María Alpuente, Santiago Escobar, and Salvador Lucas
Dynamic Values Need Polytypic Functions
Peter Achten, Artem Alimarine, and Rinus Plasmeijer
Strategic polymorphism requires just two combinators!
Ralf Laemmel and Joost Visser
18:00 Closure

 
 
Last updated: September 11, 2002. Any comments to:  Fernando Rubio