Difference between revisions of "NL-FP dag 2018"

From Clean
Jump to navigationJump to search
Line 79: Line 79:
 
== Talks ==
 
== Talks ==
  
−
=== Coming soon ===
+
== Talks ==
  
−
Coming soon
+
The following people requested to present a talk:
 +
 
 +
==== Camil Staps - Cloogle: a programming language search engine and its applications  ====
 +
 
 +
Cloogle (https://cloogle.org) is a search engine for the Clean language,
 +
similar to Haskell's Hoogle. The modular setup makes it fairly easy to
 +
be reused in other programs, like Integrated Development Environments
 +
(IDEs) and editor plugins. In this talk we give a general overview of
 +
the system and show how it evolved from a web interface to grep into its
 +
current state. We also discuss the things we are currently working on:
 +
client-side search and editor integration.
 +
 
 +
==== Victor Miraldo - Type-Directed Diffing of Structured Data ====
 +
 
 +
The Unix diff utility that compares lines of text is used pervasively
 +
by version control systems. Yet certain changes to a program may
 +
be di cult to describe accurately in terms of modi cations to indi-
 +
vidual lines of code. As a result, observing changes at such a  xed
 +
granularity may lead to unnecessary con icts between di erent ed-
 +
its. This talk discusses a generic representation for describing trans-
 +
formations between algebraic data types. These representa-
 +
tions can be used to give a more accurate account of modi cations
 +
made to algebraic data structures – and the abstract syntax trees of
 +
computer programs in particular – as opposed to only considering
 +
modi cations between their textual representations.
 +
 
 +
==== Jan Kuper - FPGA design using CλaSH ====
 +
 
 +
It is widely recognized that mainstream hardware design languages (VHDL, Verilog) have poor abstraction mechanisms, turning FPGA design into a cumbersome activity. Most high level synthesis languages only partially solve this problem, mostly because they take a sequential perspective. CλaSH, on the other hand, starts from a mathematical perspective exploiting the abstraction mechanisms of the functional programming language Haskell, including polymorphism, type derivation, and higher order functions. Since every CλaSH specification is an executable Haskell program, testing and debugging can be done at top level.
 +
Further advantages of a mathematical approach to hardware design are the possibility to transformations on a given design to get an optimal space-time performance.
 +
We will illustrate the approach with several examples.
  
 
== Past NL-FP Days ==
 
== Past NL-FP Days ==

Revision as of 11:09, 6 November 2017

The Dutch Functional Programming Day is an annual gathering of researchers, students, and practitioners sharing a common interest in functional programming. The day features talks that cover the latest advances in research, teaching, and applications in the functional programming area. Coffee and lunch breaks provide ample opportunity for networking with your colleagues and meeting new people. Experts and newcomers to the field are equally welcome.

The NL-FP day 2018 takes place on Friday, January 5, 2018 at the Walter Bos Complex of the Dutch Tax Service in Apeldoorn.

Location

The FP dag takes place in the Walter Bos Complex of the Dutch Tax Service at the John F. Kennedylaan 8, Apeldoorn.

OpenStreetMaps

Google Maps

How to get there

The main entrance of the Walterboscomplex is located at J.F. Kennedylaan 8, Apeldoorn. Participant need to report and identify themselves at the reception in order to receive visitor passes. Please wait for people from the organization to pick you up and escort you to De Kern where the presentations will be.

By public transport:

Every 15 minutes from Apeldoorn station to bus stop Belastingkantoor in about 10 minuten, using bus number 2 (Apenheul) or 6 (Rijkskantoren).

By car (in Dutch):

Vanaf Amersfoort (A1): Afslag nr. 19 (Hoenderloo/Apeldoorn). Rechtsaf richting Apeldoorn. Bij 1e verkeerslicht linksaf (Laan van Spitsbergen). Bij de rotonde 1e afslag rechtsaf (John F. Kennedylaan). Aan uw linkerhand ziet u het Walterboscomplex. U kunt het complex betreden via de hoofdentree (de 2e ingang met slagbomen).

Vanaf Deventer (A1): Afslag nr. 19 (Ede/Hoenderloo). Linksaf richting Apeldoorn. Bij 1e verkeerslicht linksaf (Laan van Spitsbergen). Bij de rotonde 1e afslag rechtsaf (John F. Kennedylaan). Aan uw linkerhand ziet u het Walterboscomplex. U kunt het complex betreden via de hoofdentree (de 2e ingang met slagbomen).

Vanaf Zwolle (A50): Afslag nr. 25 (Apeldoorn- Noord). Rechtsaf richting Apeldoorn. Bij 3e verkeerslicht rechtsaf (Anklaarseweg) vervolgens 1e verkeerslicht linksaf (Zwolseweg gaat over in Jachtlaan). Op groot kruispunt bij De Naald rechtdoor. Op rotonde (bij AGOVV voetbalterrein) 3e afslag rechtsaf slaan (John F. Kennedylaan). Aan uw linkerhand ziet u het Walterboscomplex. U kunt het complex betreden via de hoofdentree (de 2e ingang met slagbomen).

Vanaf Arnhem (A50): Afslag nr. 22 (Apeldoorn- Zuid/ Beekbergen). Weg volgen door Beekbergen. Na passeren viaduct bij de rotonde derde afslag rechtsaf en weg vervolgen (Laan van Westenenk, overgaand in Laan van Spitsbergen) tot aan de 2e rotonde, 1e afslag rechtsaf (John F. Kennedylaan). Aan uw linkerhand ziet u het Walterboscomplex. U kunt het complex betreden via de hoofdentree (de 2e ingang met slagbomen).

Registration, Cost, Deadline

Please note that to the nature of the location, registration in advance is required. As well as matching identification (passport, driver's license, or similar) before entering the venue! Photography and/or setting up a local WiFi network is explicitly not allowed.

Please register by sending an email to a.van.weelden@belastingdienst.nl including

  • your name, as shown on passport or driver's license
  • your affiliation, if any
  • whether you want vegetarian pizza
  • whether you want to give a talk

There are not costs for anything this year, as it is sponsored by the Dutch tax administration.

The registration deadline is December 15th, to allow us to order the right number of badges, drinks and pizza's.

Participants

Program

  • 9:30 Registration
  • 10:15 Welcome and a few words from our sponsor
  • 10:30 - 12:30 Presentations with a coffee break
  • 12:30 Lunch
  • 14:00 - 16:30 Presentations with a coffee break
  • 16:45 Drinks
  • 17:30 Pizza's

More details will follow.

Dinner

A dinner (pizza's) and drinks will be provided free of charge at the end of the day at the same location. Given that registration is mandatory this time, we'll assume that you stay around for this unless you specify otherwise.

Contact

  • Betsy Pepels
  • Arjen van Weelden at work or at home if your think that your e-mail did not reach me via my work address, which happens sometimes.

Talks

Talks

The following people requested to present a talk:

Camil Staps - Cloogle: a programming language search engine and its applications

Cloogle (https://cloogle.org) is a search engine for the Clean language, similar to Haskell's Hoogle. The modular setup makes it fairly easy to be reused in other programs, like Integrated Development Environments (IDEs) and editor plugins. In this talk we give a general overview of the system and show how it evolved from a web interface to grep into its current state. We also discuss the things we are currently working on: client-side search and editor integration.

Victor Miraldo - Type-Directed Diffing of Structured Data

The Unix diff utility that compares lines of text is used pervasively by version control systems. Yet certain changes to a program may be di cult to describe accurately in terms of modi cations to indi- vidual lines of code. As a result, observing changes at such a xed granularity may lead to unnecessary con icts between di erent ed- its. This talk discusses a generic representation for describing trans- formations between algebraic data types. These representa- tions can be used to give a more accurate account of modi cations made to algebraic data structures – and the abstract syntax trees of computer programs in particular – as opposed to only considering modi cations between their textual representations.

Jan Kuper - FPGA design using CλaSH

It is widely recognized that mainstream hardware design languages (VHDL, Verilog) have poor abstraction mechanisms, turning FPGA design into a cumbersome activity. Most high level synthesis languages only partially solve this problem, mostly because they take a sequential perspective. CλaSH, on the other hand, starts from a mathematical perspective exploiting the abstraction mechanisms of the functional programming language Haskell, including polymorphism, type derivation, and higher order functions. Since every CλaSH specification is an executable Haskell program, testing and debugging can be done at top level. Further advantages of a mathematical approach to hardware design are the possibility to transformations on a given design to get an optimal space-time performance. We will illustrate the approach with several examples.

Past NL-FP Days

Retrieved from "https://wiki.clean.cs.ru.nl/index.php?title=NL-FP_dag_2018&oldid=1445"