[ Nederlands ] [ English ]

22e NL-FP dag 2014

De Nederlandse Functioneel Programmeren dag 2014 vond plaats op vrijdag 10 januari 2014 bij de Universiteit van Amsterdam. Op de NL-FP dag ontmoeten geïnteresseerden in functioneel programmeren elkaar. Gedurende de dag worden een aantal presentaties gehouden over FP-gerelateerde onderzoeksresultaten en over het gebruik van FP in het onderwijs. Daarnaast is er ruime gelegenheid om elkaar te spreken, informatie uit te wisselen, demos te geven en oude bekenden te ontmoeten. De meeste aanwezigen zijn geavanceerde functionele programmeurs, maar beginners zijn natuurlijk ook van harte welkom!

De volgende Nederlandse Functioneel Programmeren dag zal plaats vinden op vrijdag 9 januari 2015 bij de Universiteit Twente.

Inhoud

• Aanmelden
• Locatie
• Diner
• Programma
• Deelnemers
• Presentaties
• Contact
• Vorige NL-FP dagen

Aanmelden

Meld je aan bij Clemens Grelck. Graag hoor ik dat je een presentatie wilt geven. Geef dan ook een voorlopige titel aan (dit kan later natuurlijk nog veranderen). Schroom niet om je op te geven, de NL-FP dag is een informele bijeenkomst en ook een prima podium om eigen ervaringen of nieuwe ideeën te delen. Presentatie of geen presentatie, meld je in ieder geval aan (in verband met het reserveren van lunch en koffie).

Let op: Omdat het programma in de tussentijd afgerond is, ben ik niet meer op zoek naar presentaties, maar u mag uw wel nog aanmelden voor de dag.

We moeten een kleine financiele bijdrage van 25EUR vragen voor de catering. A.u.b. contant betalen bij aankomst; we geven natuurlijk ontvangstbewijzen.

Traditiegetrouw wordt er na afloop, op eigen kosten, met een groep gegeten. Geef bij je aanmelding aan of je mee wilt gaan eten. Afhankelijk van het aantal deelnemers kan dan een geschikt restaurant gezocht worden. BELANGRIJK: Als je mee wilt gaan eten geef dat dan uiterlijk mandag 5 januari door.

Locatie

De NL-FP dag vindt plaats in zaal C0.05 in het nieuwe gebouw van de Faculteit Natuurwetenschappen, Wiskunde en Informatica (links onder) op Science Park 904. Deze locatie is heel goed te bereiken per NS trein (station Amsterdam Science Park, rechts onder) en per GVB bus. De sprinters rijden twee keer per uur op het traject Hoofddorp-Schiphol-Centraal-Science Park-Weesp-Amersfoort an op het traject Centraal-Science Park-Weesp-Almere-Zwolle. Bus lijnen 40 en 240 vanaf Amstel station rijden beide een keer per kwartier, lijn 40 vanaf Muiderpoort station ook een keer par kwartier.

Parkeeren is beperkt mogelijk op Science Park maar erg duur (ongeveer 20 EUR voor de hele dag).

Diner

Het gezamenlijk diner zal plaats vinden bij de ponteneur. Deze eetcafe/restaurant is weiniger dan 5 minuten loopafstand van station Amsterdam Muiderpoort. De 3-gangen keuze menu is 25.50 plus drankjes. Naar het eind van de wetenschappelijk programma gaan we tezamen van Science Park Amsterdam naar de ponteneur (ongeveer 20 minuten).

Programma

Deelnemers

Presentations

Jose Pedro Magalhaes: Advanced Functional Programming for Fun and Profit

Abstract: Functional programming, especially when using advanced techniques such as GADTs, type functions, and kind polymorphism, is not only fun; it can also be profitable. In this talk I'll describe my experience in using advanced functional programming in Haskell within Chordify, a web startup that brings chord recognition to the masses.

Vadim Zaytsev: Imperative and Declarative Views on Software Language Evolution

Abstract:

Jurrien Stutterheim: Tonic: Task Oriented Notation Inferred from Code

Abstract: In this talk we present Tonic, a system for visually gaining insight in iTasks programs’ structure and behaviour. Tonic helps non-programmers to understand iTasks programs by automatically generating a visual representation of a program at compile-time and aims to provide live runtime information while a program is executing.

Jacco Krijnen: Expand: Towards an Extensible Pandoc

Abstract: The Pandoc program is a versatile tool for converting between document formats. It comes with a great variety of readers, each converting a specific input format into the universal Pandoc format, and a great variety of writers, each mapping a document represented in this universal format onto a specific output format. Unfortunately the intermediate Pandoc format is fixed, which implies that a new, unforeseen document element cannot be added. In this paper we propose a more flexible approach, using our collection of Haskell libraries for constructing extensible parsers and attribute grammars. Both the parsing and the unparsing of a specific document can be constructed out of a collection of precompiled descriptions of document elements written in Haskell. This collection can be extended by any user, without having to touch existing code. The Haskell type system is used to enforce that each component is well defined, and to verify that the composition of a collection components is consistent, i.e. that features needed by a component have been defined by that component or any of the other components. In this way we can get back the flexibility e.g. offered by the packages in the LaTeX package eco-system.

Patrick Bahr: Calculating Correct Compilers

Abstract: We present a new approach to the longstanding problem of calculating compilers. In particular, we develop a simple but general recipe that allows us to derive correct compilers from high-level semantics by systematic calculation, with all the required compilation machinery falling naturally out of the calculation process. Our approach is based upon a new application of well-known transformation techniques, and has been applied to calculate compilers for a wide range of language features and their combination, including arithmetic, exceptions, local and global state, various forms of lambda calculi, bounded and unbounded loops, non-determinism, and interrupts.

Peter Kourzanov: Structure and Interpretation of Definite Clause Grammars

Abstract: Definite clause grammars (DCG) is a technique that allows one to embed a parser for a context-sensitive language into logic programming, via Horn clauses. A carefully designed grammar parser can be run forwards, backwards and sideways. In this talk we shall de-construct DCGs using syntax-rules and miniKanren, a library for R5RS Scheme implementing a compact logic-programming system, keeping reversibility in mind. Parsing expression grammars (PEG) is a related technique that like DCG also suffers from the inability to express left-recursive grammars. We make a link between DCGs and PEGs by borrowing the mechanism from DCGs, adding syntactic sugar from PEGs and propose a way to run left-recursive parsers in an on-line fashion. Finally, we re-interpret DCGs as executable, bidirectional DSL specifications and transformations, perhaps better suited for DSL design than R5RS syntax-rules.

Michal Gajda: Fastest Protein Data Bank Parser on Earth is Written in Haskell

Abstract: Protein Data Bank file format is used for the majority of biomolecular data available today. I have written a high level library for processing biomolecular data in this format. The benchmarks indicate that the library is competitive to the other frequently used Protein Data Bank parsing software on a single core, and much faster when used on multicore. It also features a convenient iterator mechanism, and a simple API modeled after BioPython I will also shortly present current status of the BioHaskell effort to build bioinformatic libraries for Haskell.

Tijs van der Storm: Rascal: Functional Programming for Source Code Analysis and Transformation

Abstract: Rascal is a meta programming language developed at CWI. It has been specifically designed for transforming and analyzing source code. This includes applications like static analysis, source code metrics computation, legacy renovation and implementation of domain-specific language compilers, type checkers and IDEs. In this talk I will introduce the language and some its more notable features, including built-in context-free grammars, a wide range of built-in data types, primitives for tree traversal, and powerful constructs for pattern matching. Time permitting I'll demonstrate the language and environment using the example of a simple DSL for state machines.

Arjan Boeijink: Keeping the PilGRIM at a Steady Pace: Avoiding Pipeline Stalls in a Lazy Functional Processor

Abstract: The PilGRIM (Pipelined Graph Reduction Instruction Machine) is a processor design with a high level instruction set specialized for functional languages. With the PilGRIM we attempt to exploit the potential of modern hardware architecture to minimize the overhead of executing functional languages. Execution of lazy functional programs is both memory and control flow intensive, which makes it challenging to keep a deep pipeline filled with useful work. This talk will introduce the core ideas of the PilGRIM design, and show how the high level instruction set and extra runtime information can be used to avoid many pipeline stalls.

Raphael Poss: Compositional Hardware Virtualization

Abstract: Abstractions that hide hardware away from programming are useful in that they allow the programmer to concentrate on "more important" tasks, such as decomposing problems, expressing them in exact semantics, and proving that implementation matches specification. Nevertheless the syntactic variance problem still exists: in any functional language, there are multiple ways to write the same function which cannot be automatically optimized from one to another. One of them will be "better" for extra-functional reasons, more often than not performance and efficiency. But how to determine this? In this talk, I will propose that compositional hardware virtualization, a notion I will describe, is a fundamental building block of the operational intuition that functional programmers unconsciously use when choosing between different candidate function implementations.

Lesley Wevers: Optimizing Transaction Execution in a Purely Functional Database: Towards Database Maintenance without Downtime

Abstract: Current database systems needs to be taken offline to perform major changes. This is of course not acceptable for applications that need to be available at all times. We are developing a new kind of database system based on functional languages, where we use techniques such as laziness and memoization to optimize database transactions in ways not possible in traditional database systems. Using these techniques, we want to make it possible to perform database maintenance without downtime.

Tom Ellis: Opaleye: an Embedded Relational Query Language for Haskell

Abstract: Opaleye is a relational query language embedded domain specific language for Haskell, which compiles to SQL and can run against a PostgreSQL database server. It has some similarity to HaskellDB, but is based on a firm theory derived from category theoretical principles, and therefore avoids bugs that HaskellDB suffers. I will give a brief introduction to the library and the technology behind it.

Contact

Vorige NL-FP dagen