Personal tools

DHD UHac/DHD Program

From HaskellWiki

< DHD UHac(Difference between revisions)
Jump to: navigation, search
m
(Reorder summaries, add Holes)
Line 38: Line 38:
 
| [[#case-study|Case Study Invitation]]
 
| [[#case-study|Case Study Invitation]]
 
| Jurriaan Hage
 
| Jurriaan Hage
  +
|-
  +
|
  +
| [[#holes|Holes in GHC]]
  +
| Thijs Alkemade
 
|-
 
|-
 
| 12:15
 
| 12:15
Line 76: Line 80:
 
using primitives not available in the chosen version, while still
 
using primitives not available in the chosen version, while still
 
allowing the latest features.
 
allowing the latest features.
 
=== <span id="practice"></span>Haskell in Practice: How Haskell Has Been Used in a (Paid) IT Project. ===
 
 
Stef Joosten (Ordina), Martijn Schrage (Oblomov Systems)
 
 
This presentation shows how new thinking helps the judiciary to gain control over and to reduce cost in a landscape of many different IT systems that serve the courts of law in the Netherlands.
 
 
Although Haskell plays a role outside the limelight, the results have become possible because of a tool, Ampersand, which has been built in Haskell.
 
 
The presentation is accompanied by a brief demonstration.
 
 
=== <span id="fclabels"></span>fclabels: First Class Record Labels for Haskell ===
 
 
Sebastiaan Visser (Silk)
 
 
Haskell's record system for algebraic datatypes uses labels as accessors for fields within constructors. Record labels can be used for both selection and modification of individual fields within value, but only selection can be composed in a natural way. The special syntax for updates makes composing modifications very cumbersome. The fclabels package tries to solve this problem by implementing field accessors as first class Haskell values instead of special syntax. Labels are implemented as lenses and can easily be composed for both selection and modification. To avoid boilerplate labels can be derived using Template Haskell. This talk will give a brief introduction into the usage of the library and will show a bit of the inner workings as a bridge to future extensions.
 
   
 
=== <span id="hesselink"></span>''TBD'' ===
 
=== <span id="hesselink"></span>''TBD'' ===
Line 119: Line 107:
 
with experienced Haskell programmers, which is why I am now seeking for
 
with experienced Haskell programmers, which is why I am now seeking for
 
participants.
 
participants.
  +
  +
=== <span id="holes"></span>Holes in GHC ===
  +
  +
Thijs Alkemade (UU)
  +
  +
This will be a demonstration of work-in-progress on adding holes for type-based debugging with GHC. See the [http://hackage.haskell.org/trac/ghc/wiki/Holes GHC Trac page] for details.
  +
  +
=== <span id="practice"></span>Haskell in Practice: How Haskell Has Been Used in a (Paid) IT Project. ===
  +
  +
Stef Joosten (Ordina), Martijn Schrage (Oblomov Systems)
  +
  +
This presentation shows how new thinking helps the judiciary to gain control over and to reduce cost in a landscape of many different IT systems that serve the courts of law in the Netherlands.
  +
  +
Although Haskell plays a role outside the limelight, the results have become possible because of a tool, Ampersand, which has been built in Haskell.
  +
  +
The presentation is accompanied by a brief demonstration.
  +
  +
=== <span id="fclabels"></span>fclabels: First Class Record Labels for Haskell ===
  +
  +
Sebastiaan Visser (Silk)
  +
  +
Haskell's record system for algebraic datatypes uses labels as accessors for fields within constructors. Record labels can be used for both selection and modification of individual fields within value, but only selection can be composed in a natural way. The special syntax for updates makes composing modifications very cumbersome. The fclabels package tries to solve this problem by implementing field accessors as first class Haskell values instead of special syntax. Labels are implemented as lenses and can easily be composed for both selection and modification. To avoid boilerplate labels can be derived using Template Haskell. This talk will give a brief introduction into the usage of the library and will show a bit of the inner workings as a bridge to future extensions.

Revision as of 12:24, 30 March 2012


This is the current program for the Dutch HUG Day. It may still change.

Time Title Speaker
9:30 Coffee and Tea
10:00 Welcome Sean Leather, Stef Joosten
10:15 WebSockets Jasper Van der Jeugt
10:45 TBD Erik Hesselink
11:15 More Talks
11:45 Lightning Talks
DotFS Paul van der Walt, Sjoerd Timmer
Case Study Invitation Jurriaan Hage
Holes in GHC Thijs Alkemade
12:15 Lunch (Provided by Ordina)
13:15 Haskell in Practice Stef Joosten, Martijn Schrage
13:45 fclabels Sebastiaan Visser
14:15 More Talks
15:15 Closing Jurriën Stutterheim
15:30 Depart for UHac

1 Summaries

1.1 Supporting Different Versions of the WebSockets Protocol

Jasper Van der Jeugt (Ghent)

The Haskell websockets library allows you to write WebSocket-enabled servers in Haskell, bidirectional communication with the browser. However, browsers and their related specifications change fast, and there are different versions of the WebSockets protocol. This talk discusses a type-safe technique which disallows the programmer from using primitives not available in the chosen version, while still allowing the latest features.

1.2 TBD

Erik Hesselink (Silk)

1.3 DotFS - Or How Fred Solved His Config Clutter

Paul van der Walt (UU), Sjoerd Timmer (UU)

Everyone who has more than one account on Linux/Unix/OS X systems knows how hard is can be to keep track of all the different config files in your home directory. .vimrc, .muttrc, .hgrc, .screenrc, .bashrc, and .xinitrc are just a few, but we're sure you can come up with many more yourself. Imagine how wonderful your life could be if you just had an easy tool to keep track of different versions of all these files on all your machines. We argue that traditional version control systems on their own are not up the task and we provide an alternative.

1.4 Invitation to Participate in a Functional Programming Case Study

Jurriaan Hage (UU)

I want to invite you to participate in an experiment in Haskell. In this experiment we are going to pit HaRe (the Haskell Refactorer) against Holmes (my plagiarism detector). The goal is to find out how much time somebody needs to refactor a Haskell program into something that is not recognizable by Holmes as plagiarism. We shall be looking at two groups of study: experienced programmers (we shall pretend they are paid for by newbies to make their assignments for them, and to do so without starting from scratch), and the newbies themselves. This experiment is a collaboration with Simon Thompson of Kent. He will take charge of the newbies, my task is to perform the experiment with experienced Haskell programmers, which is why I am now seeking for participants.

1.5 Holes in GHC

Thijs Alkemade (UU)

This will be a demonstration of work-in-progress on adding holes for type-based debugging with GHC. See the GHC Trac page for details.

1.6 Haskell in Practice: How Haskell Has Been Used in a (Paid) IT Project.

Stef Joosten (Ordina), Martijn Schrage (Oblomov Systems)

This presentation shows how new thinking helps the judiciary to gain control over and to reduce cost in a landscape of many different IT systems that serve the courts of law in the Netherlands.

Although Haskell plays a role outside the limelight, the results have become possible because of a tool, Ampersand, which has been built in Haskell.

The presentation is accompanied by a brief demonstration.

1.7 fclabels: First Class Record Labels for Haskell

Sebastiaan Visser (Silk)

Haskell's record system for algebraic datatypes uses labels as accessors for fields within constructors. Record labels can be used for both selection and modification of individual fields within value, but only selection can be composed in a natural way. The special syntax for updates makes composing modifications very cumbersome. The fclabels package tries to solve this problem by implementing field accessors as first class Haskell values instead of special syntax. Labels are implemented as lenses and can easily be composed for both selection and modification. To avoid boilerplate labels can be derived using Template Haskell. This talk will give a brief introduction into the usage of the library and will show a bit of the inner workings as a bridge to future extensions.