Home
Important Dates
Call for Papers
Paper Submission
Committees
Sponsors
Local Information
Venue
Accommodation
Directions
Useful to Know
The social event
Photos
Registration
Register
Participants
Programme information
Presentation Schedule
Contact
Center
Home
Courses
People
Projects
Page
Edit Page
Rename Page
Attach File
Printable
Wiki Source
More ...
Web
Recent Changes
Notify Service
News
?
Page Index
Search
More ...
Wiki
About TWiki
Text Formatting
Registration
Change Password
Reset Password
Users
Groups
Log In
or
Register
Presentation Schedule
IFL2010
%TOC% Below, you can find the presentation schedule for IFL 2010. Presentations are *20 minutes long* and that *includes questions*. There is also a [[Calendar][Google Calendar]] available with the same content. ---+++ September 1, 2010 <table> <col width="110"> <col width="*"> <tr><td>8.00 - 9.00</td><td> _Registration_ </td></tr> <tr><td>9.00 - 9.20</td><td> _Welcome_ </td></tr> <tr><td>9.20 - 10.40</td><td> _Static Analysis I_ </td></tr> <tr><td> </td><td>Session Chair: Tom Schrijvers</td></tr> <tr><td> </td><td>1. _Size Invariants and Ranking Functions Synthesis in a Functional Language_ </td></tr> <tr><td> </td><td> Ricardo Peña and Agustin D. Delgado</td></tr> <tr><td> </td><td>2. _Data-Driven Detection of Catamorphisms Towards Problem Specific Use of Program Schemes for Inductive Program Synthesis_ </td></tr> <tr><td> </td><td>Martin Hofmann</td></tr> <tr><td> </td><td>3. _Strictness Optimization for Higher-Order Functions in a Typed Intermediate Language_ </td></tr> <tr><td> </td><td>Tom Lokhorst, Atze Dijkstra and Doaitse Swierstra </td></tr> <tr><td> </td><td>4. _Untyped General Polymorphic Functions_ </td></tr> <tr><td> </td><td>Martin Pettai </td></tr> <tr><td>10.40 - 11.20 </td><td> _Break (adjacent room)_ </td></tr> <tr><td>11.20 - 12.40 </td><td> _Events and Workflow_ </td></tr> <tr><td> </td><td>Session Chair: Kevin Hammond <strike>Marco Morazan</strike></td></tr> <tr><td> </td><td>1. _The Usual Tasks: A Library for Ad-Hoc Work in iTasks_ </td></tr> <tr><td> </td><td>Bas Lijnse, Rinus Plasmeijer and Erik Crombag</td></tr> <tr><td> </td><td>2. _Gin: Graphical iTask Notation_ *was switched with 4.* </td></tr> <tr><td> </td><td>Jeroen Henrix, Rinus Plasmeijer and Peter Achten</td></tr> <tr><td> </td><td>3. _Multiple-Occurrence I/O_ </td></tr> <tr><td> </td><td>Gergely Patai</td></tr> <tr><td> </td><td>4. _iTask as a new paradigm to building GUI applications_ *was switched with 2.* </td></tr> <tr><td> </td><td>Steffen Michels, Rinus Plasmeijer and Peter Achten</td></tr> <tr><td>12.40 - 14.00 </td><td> _Lunch (adjacent room)_ </td></tr> <tr><td>14.00 - 15.20 </td><td>Compilers and Interpreters</td></tr> <tr><td> </td><td>Session Chair: Bastiaan Heeren</td></tr> <tr><td> </td><td>1. _Towards Dependently-Typed Attribute Grammars_ </td></tr> <tr><td> </td><td>Arie Middelkoop, Atze Dijkstra and Doaitse Swierstra</td></tr> <tr><td> </td><td>2. _Mapping Interpreters onto Runtime Support_ </td></tr> <tr><td> </td><td>Stijn Timbermont </td></tr> <tr><td> </td><td>3. _Hiding State in !ClaSH Hardware Descriptions_ </td></tr> <tr><td> </td><td>Marco Gerards, Christiaan Baaij, Jan Kuper and Matthijs Kooiman</td></tr> <tr><td> </td><td>4. _Implementing a Non-Strict Purely Functional Language in !JavaScript_ </td></tr> <tr><td> </td><td>Eddy Bruel and Jan Martin Jansen</td></tr> <tr><td>15.20 - 16.00 </td><td> _Break (adjacent room)_ </td></tr> <tr><td>16.00 - 17.40 </td><td> _Concurrency I_ </td></tr> <tr><td> </td><td>Session Chair: Viktoria Zsók</td></tr> <tr><td> </td><td>1. _Concurrent Non-Deferred Reference Counting on the Microgrid: First Experiences_ </td></tr> <tr><td> </td><td>Stephan Herhut and Sven-Bodo Scholz</td></tr> <tr><td> </td><td>2. _First Results from Auto-Parallelising SAC for GPGPUs_ </td></tr> <tr><td> </td><td>Jing Guo, Sven-Bodo Scholz, Jeyarajan Thiyagalingam</td></tr> <tr><td> </td><td>3. _Improving your CASH flow: the Computer Algebra SHell_ </td></tr> <tr><td> </td><td>Christopher Brown, Kevin Hammond, Jost Berthold, Hans-Wolfgang Loidl</td></tr> <tr><td> </td><td>4. _mHume for parallel FPGA_ </td></tr> <tr><td> </td><td>Abdallah Al Zain, Wim Vanderbauwhede and Greg Michaelson</td></tr> <tr><td> </td><td>5. _The Essence of Synchronisation in Asynchronous Data Flow Programming_ </td></tr> <tr><td> </td><td>Clemens Grelck</td></tr> </table> ---+++ September 2, 2010 <table> <col width="110"> <col width="*"> <tr><td>9.00 - 10.20 </td><td>Concurrency II</td></tr> <tr><td> </td><td>Session Chair: Jost Berthold</td></tr> <tr><td> </td><td>1. _An Executable Semantics for D-Clean_ </td></tr> <tr><td> </td><td>Viktória Zsók, Rinus Plasmeijer and Pieter Koopman</td></tr> <tr><td> </td><td>2. _Dependency Graphs for Parallelizing Erlang Programs_ </td></tr> <tr><td> </td><td>Melinda Tóth, István Bózó, Zoltán Horváth and Atilla Erdödi</td></tr> <tr><td> </td><td>3. _Counter Automata for Parameterised Timing Analysis of Box-Based Systems_ </td></tr> <tr><td> </td><td>Christoph Herrmann and Kevin Hammond</td></tr> <tr><td> </td><td>4. _Introducing the !PilGRIM: a Pipelined Processor for Executing Lazy Functional Languages_ </td></tr> <tr><td> </td><td>Arjan Boeijink, Jan Kuper and Philip Hölzenspies</td></tr> <tr><td>10.20 - 11.00 </td><td> _Break (adjacent room)_ </td></tr> <tr><td>11.00 - 12.00 </td><td> *Invited Talk* by Johan Nordlander: _The craft of building with Timber_ </td></tr> <tr><td> </td><td>Session Chair: Jurriaan Hage</td></tr> <tr><td>12.00 - 13.30 </td><td> _Lunch (adjacent room)_ </td></tr> <tr><td>13.45 - 23.30 </td><td> _Social Event_ </td></tr> <tr><td> </td><td> *Bus leaves from Avifauna at 13.45* </td></tr> </table> ---+++ September 3, 2010 <table> <col width="110"> <col width="*"> <tr><td>9.00 - 10.40 </td><td>Libraries and DSLs</td></tr> <tr><td> </td><td>Session Chair: Ralf Hinze</td></tr> <tr><td> </td><td>1. _A Database Coprocessor for Haskell_ </td></tr> <tr><td> </td><td>Jeroen Weijers, Torsten Grust, George Giorgidze and Tom Schreiber</td></tr> <tr><td> </td><td>2. _The Design and Implementation of Feldspar: an Embedded Language for Digital Signal Processing_ </td></tr> <tr><td> </td><td>Mary Sheeran, Anders Persson, David Engdal, Josef Svenningsson, Emil Axelsson and Koen Claessen</td></tr> <tr><td> </td><td>3. _Combinators for Local Search In Haskell_ </td></tr> <tr><td> </td><td>David Senington and David Duke</td></tr> <tr><td> </td><td>4. _Modular Components with Monadic Effects_ </td></tr> <tr><td> </td><td>Tom Schrijvers and Bruno Oliveira</td></tr> <tr><td> </td><td>5. _Experiences using F# for developing analysis scripts and tools over search engine query log data_ </td></tr> <tr><td> </td><td>Stefan Savev and Peter Bailey</td></tr> <tr><td>10.40 - 11.20 </td><td> _Break (adjacent room)_ </td></tr> <tr><td>11.20 - 12.40 </td><td>Concurrency III</td></tr> <tr><td> </td><td>Session Chair: Rex Page</td></tr> <tr><td> </td><td>1. _A Comparison of Lock-based and Lock-free Taskpool Implementations in Haskell_ </td></tr> <tr><td> </td><td>Michael Lesniak</td></tr> <tr><td> </td><td>2. _A high-level implementation of STM Haskell using the Transactional Locking II algorithm_ </td></tr> <tr><td> </td><td>Andre Rauber Du Bois</td></tr> <tr><td> </td><td>3. _Twilight in Haskell - Software Transactional Memory with Safe I/O and Typed Conflict Management_ </td></tr> <tr><td> </td><td>Annette Bieniusa, Arie Middelkoop and Peter Thiemann</td></tr> <tr><td> </td><td>4. _Towards Orthogonal Haskell Data Serialisation_ </td></tr> <tr><td> </td><td>Jost Berthold</td></tr> <tr><td>12.40 - 14.00 </td><td> _Lunch (adjacent room)_ </td></tr> <tr><td>14.00 - 15.20 </td><td>Semantics</td></tr> <tr><td> </td><td>Session Chair: Luc Maranget</td></tr> <tr><td> </td><td>1. _From Bayesian Notation to Pure Racket, via Discrete Measure-Theoretic Probability in Lambda-ZFC_ </td></tr> <tr><td> </td><td>Neil Toronto and Jay !McCarthy</td></tr> <tr><td> </td><td>2. _On the relation of call-by-need and call-by-name in a natural semantics_ </td></tr> <tr><td> </td><td>Lidia Sánchez-Gil, Mercedes Hidalgo Herrero and Yolanda Ortega Mallén</td></tr> <tr><td> </td><td>3. _Automating Derivations of Abstract Machines from Reduction Semantics: A Generic Formalization of Refocusing in Coq_ </td></tr> <tr><td> </td><td>Dariusz Biernacki, Filip Sieczkowski and Malgorzata Biernacka</td></tr> <tr><td> </td><td>4. _Towards Strategies for Dataflow Programming_ </td></tr> <tr><td> </td><td>Joaquin Aguado and Michael Mendler</td></tr> <tr><td>15.20 - 16.00 </td><td> _Break (adjacent room)_ </td></tr> <tr><td>16.00 - 17.40 </td><td>Static Analysis II</td></tr> <tr><td> </td><td>Session Chair: Janis Voigtländer</td></tr> <tr><td> </td><td>1. _Extensible Pattern Matching in an Extensible Language_ </td></tr> <tr><td> </td><td>Samuel Tobin-Hochstadt</td></tr> <tr><td> </td><td>2. _Where are you going with those types?_ </td></tr> <tr><td> </td><td>Vincent St-Amour, Matthias Felleisen, Matthew Flatt, Samuel Tobin-Hochstadt</td></tr> <tr><td> </td><td>3. _Purity in Erlang_ </td></tr> <tr><td> </td><td>Mihalis Pitidis and Konstantinos Sagonas</td></tr> <tr><td> </td><td>4. _Theory, Practice and Pragmatics of Fusion_ </td></tr> <tr><td> </td><td>Thomas Harper, Daniel James, and Ralf Hinze</td></tr> <tr><td> </td><td>5. _Composing Reactive GUIs in F# with !WebSharper_ </td></tr> <tr><td> </td><td>Joel Björnson, Anton Tayanovskyy and Adam Granicz</td></tr> </table> -- Main.JurriaanHage - 29 Jul 2010