Presentation Schedule

IFL2010

September 1, 2010
September 2, 2010
September 3, 2010

Below, you can find the presentation schedule for IFL 2010. Presentations are 20 minutes long and that includes questions.

There is also a Google Calendar available with the same content.

September 1, 2010

8.00 - 9.00	Registration
9.00 - 9.20	Welcome
9.20 - 10.40	Static Analysis I
	Session Chair: Tom Schrijvers
	1. Size Invariants and Ranking Functions Synthesis in a Functional Language
	Ricardo Peña and Agustin D. Delgado
	2. Data-Driven Detection of Catamorphisms Towards Problem Specific Use of Program Schemes for Inductive Program Synthesis
	Martin Hofmann
	3. Strictness Optimization for Higher-Order Functions in a Typed Intermediate Language
	Tom Lokhorst, Atze Dijkstra and Doaitse Swierstra
	4. Untyped General Polymorphic Functions
	Martin Pettai
10.40 - 11.20	Break (adjacent room)
11.20 - 12.40	Events and Workflow
	Session Chair: Kevin Hammond ~~Marco Morazan~~
	1. The Usual Tasks: A Library for Ad-Hoc Work in iTasks
	Bas Lijnse, Rinus Plasmeijer and Erik Crombag
	2. Gin: Graphical iTask Notation was switched with 4.
	Jeroen Henrix, Rinus Plasmeijer and Peter Achten
	3. Multiple-Occurrence I/O
	Gergely Patai
	4. iTask as a new paradigm to building GUI applications was switched with 2.
	Steffen Michels, Rinus Plasmeijer and Peter Achten
12.40 - 14.00	Lunch (adjacent room)
14.00 - 15.20	Compilers and Interpreters
	Session Chair: Bastiaan Heeren
	1. Towards Dependently-Typed Attribute Grammars
	Arie Middelkoop, Atze Dijkstra and Doaitse Swierstra
	2. Mapping Interpreters onto Runtime Support
	Stijn Timbermont
	3. Hiding State in ClaSH Hardware Descriptions
	Marco Gerards, Christiaan Baaij, Jan Kuper and Matthijs Kooiman
	4. Implementing a Non-Strict Purely Functional Language in JavaScript
	Eddy Bruel and Jan Martin Jansen
15.20 - 16.00	Break (adjacent room)
16.00 - 17.40	Concurrency I
	Session Chair: Viktoria Zsók
	1. Concurrent Non-Deferred Reference Counting on the Microgrid: First Experiences
	Stephan Herhut and Sven-Bodo Scholz
	2. First Results from Auto-Parallelising SAC for GPGPUs
	Jing Guo, Sven-Bodo Scholz, Jeyarajan Thiyagalingam
	3. Improving your CASH flow: the Computer Algebra SHell
	Christopher Brown, Kevin Hammond, Jost Berthold, Hans-Wolfgang Loidl
	4. mHume for parallel FPGA
	Abdallah Al Zain, Wim Vanderbauwhede and Greg Michaelson
	5. The Essence of Synchronisation in Asynchronous Data Flow Programming
	Clemens Grelck

September 2, 2010

9.00 - 10.20	Concurrency II
	Session Chair: Jost Berthold
	1. An Executable Semantics for D-Clean
	Viktória Zsók, Rinus Plasmeijer and Pieter Koopman
	2. Dependency Graphs for Parallelizing Erlang Programs
	Melinda Tóth, István Bózó, Zoltán Horváth and Atilla Erdödi
	3. Counter Automata for Parameterised Timing Analysis of Box-Based Systems
	Christoph Herrmann and Kevin Hammond
	4. Introducing the PilGRIM: a Pipelined Processor for Executing Lazy Functional Languages
	Arjan Boeijink, Jan Kuper and Philip Hölzenspies
10.20 - 11.00	Break (adjacent room)
11.00 - 12.00	Invited Talk by Johan Nordlander: The craft of building with Timber
	Session Chair: Jurriaan Hage
12.00 - 13.30	Lunch (adjacent room)
13.45 - 23.30	Social Event
	Bus leaves from Avifauna at 13.45

September 3, 2010

9.00 - 10.40	Libraries and DSLs
	Session Chair: Ralf Hinze
	1. A Database Coprocessor for Haskell
	Jeroen Weijers, Torsten Grust, George Giorgidze and Tom Schreiber
	2. The Design and Implementation of Feldspar: an Embedded Language for Digital Signal Processing
	Mary Sheeran, Anders Persson, David Engdal, Josef Svenningsson, Emil Axelsson and Koen Claessen
	3. Combinators for Local Search In Haskell
	David Senington and David Duke
	4. Modular Components with Monadic Effects
	Tom Schrijvers and Bruno Oliveira
	5. Experiences using F# for developing analysis scripts and tools over search engine query log data
	Stefan Savev and Peter Bailey
10.40 - 11.20	Break (adjacent room)
11.20 - 12.40	Concurrency III
	Session Chair: Rex Page
	1. A Comparison of Lock-based and Lock-free Taskpool Implementations in Haskell
	Michael Lesniak
	2. A high-level implementation of STM Haskell using the Transactional Locking II algorithm
	Andre Rauber Du Bois
	3. Twilight in Haskell - Software Transactional Memory with Safe I/O and Typed Conflict Management
	Annette Bieniusa, Arie Middelkoop and Peter Thiemann
	4. Towards Orthogonal Haskell Data Serialisation
	Jost Berthold
12.40 - 14.00	Lunch (adjacent room)
14.00 - 15.20	Semantics
	Session Chair: Luc Maranget
	1. From Bayesian Notation to Pure Racket, via Discrete Measure-Theoretic Probability in Lambda-ZFC
	Neil Toronto and Jay McCarthy
	2. On the relation of call-by-need and call-by-name in a natural semantics
	Lidia Sánchez-Gil, Mercedes Hidalgo Herrero and Yolanda Ortega Mallén
	3. Automating Derivations of Abstract Machines from Reduction Semantics: A Generic Formalization of Refocusing in Coq
	Dariusz Biernacki, Filip Sieczkowski and Malgorzata Biernacka
	4. Towards Strategies for Dataflow Programming
	Joaquin Aguado and Michael Mendler
15.20 - 16.00	Break (adjacent room)
16.00 - 17.40	Static Analysis II
	Session Chair: Janis Voigtländer
	1. Extensible Pattern Matching in an Extensible Language
	Samuel Tobin-Hochstadt
	2. Where are you going with those types?
	Vincent St-Amour, Matthias Felleisen, Matthew Flatt, Samuel Tobin-Hochstadt
	3. Purity in Erlang
	Mihalis Pitidis and Konstantinos Sagonas
	4. Theory, Practice and Pragmatics of Fusion
	Thomas Harper, Daniel James, and Ralf Hinze
	5. Composing Reactive GUIs in F# with WebSharper
	Joel Björnson, Anton Tayanovskyy and Adam Granicz

-- JurriaanHage - 29 Jul 2010