December 2015 - Haskell

Haskell-related PhD Studentship at Kent
by Meng Wang 22 Mar '16

22 Mar '16

Dear Haskellers, I am seeking a PhD student on a Haskell-related project: http://www.cs.kent.ac.uk/research/studyingforaphd/phd-wang.html This would be a good opportunity for someone who is interested in applying Haskell ideas to real problems. The funding covers maintenance, EU student fees and research related expenses. But non-EU students are welcome to apply too. For Sep 2015 starting, the application deadline is 17 April 2015. If you are interested, please contact me at m.w.wang(a)kent.ac.uk<mailto:m.w.wang@kent.ac.uk>. Best wishes, Meng — Dr Meng Wang School of Computing University of Kent http://www.cs.kent.ac.uk/people/staff/mw516/

1 1

[ICGT2016] CFP: Int.Conf. Graph Transformation, Vienna, July 2016
by Rachid Echahed 18 Feb '16

18 Feb '16

[Apologies if you receive multiple copies of this CFP] ========================================================================== Call for Papers ICGT 2016 9th International Conference on Graph Transformation www.graph-transformation.org Held as Part of STAF 2016 http://staf2016.conf.tuwien.ac.at/ July 5-6, 2016, Vienna, Austria ========================================================================== Important Dates: Abstract submission: 15 February 2016 Full paper submission: 29 February 2016 Notification of acceptance: 07 April 2016 Final version due: 21 April 2016 Conference: 5-6 July 2016 ========================================================================== Graphs are used almost everywhere when representing or modelling structures and systems, not only in applied and theoretical computer science, but also in, e.g., natural and engineering sciences. Graph transformation and graph grammars are the fundamental modelling paradigms for describing, formalizing, and analyzing graphs that change over time when modelling, e.g., dynamic data structures, systems, or models. The International Conference on Graph Transformation (ICGT) series aims to bring together researchers from different areas in this context and to provide a forum for presenting new results, discussing novel ideas and sharing experience. In order to foster a lively exchange of perspectives on the subject of the conference, the programme committee of the ninth edition of ICGT encourages all kinds of contributions related to graph transformation. Topics of interest include, BUT ARE NOT LIMITED TO the following subjects: - General models of graph transformation (e.g., high-level, adhesive, node, edge, and hyperedge replacement systems) - Analysis and verification of graph transformation systems - Graph theoretical properties of graph languages - Automata on graphs and parsing of graph languages - Logical aspects of graph transformation - Computational models based on graph transformation - Structuring and modularization concepts for graph transformation systems - Hierarchical graphs and decompositions of graphs - Parallel, concurrent, and distributed graph transformation - Modelling and analysis of dynamic data structures - Term graph rewriting - Graph transformation and Petri nets - Ontologies and ontology evolution - Graph databases - Modelling and realizing software architectures, refactoring, evolution, workflows, business processes, access control, security policies, service-oriented applications, semantic web, ... - Natural language processing, natural computing, bioinformatics, quantum computing, ubiquitous computing, visual computing, image generation, natural and engineering sciences, ... - Model-driven development and model transformation based on graph transformation - Model checking, program verification, simulation and animation - Syntax, semantics and implementation of programming languages, domain-specific languages, and visual languages - Graph transformation languages and tool support - Efficient algorithms (pattern matching, graph traversal etc.) The 9th International Conference on Graph Transformation (ICGT 2016) will be held in Vienna, Austria, as a STAF event (http://staf2016.conf.tuwien.ac.at/) The conference takes place under the auspices of EATCS (http://www.eatcs.org/) EASST (http://www.easst.org/) and IFIP (http://www.ifip.org/) WG 1.3. Program Committee ----------------- Rachid Echahed (Co-Chair, CNRS and University of Grenoble Alpes, France) Mark Minas (Co-Chair, Universität der Bundeswehr München, Germany) Gábor Bergmann (Budapest University of Technology and Economics, Hungary) Paolo Bottoni (Sapienza Univ. di Roma, Italy) Andrea Corradini (Università di Pisa, Italy) Juan de Lara (Universidad Autonoma de Madrid, Spain) Frank Drewes (Umeå University, Sweden) Claudia Ermel (Technische Universität Berlin, Germany) Holger Giese (Hasso Plattner Institute, University of Potsdam, Germany) Annegret Habel (Universität Oldenburg, Germany) Reiko Heckel (University of Leicester, UK) Berthold Hoffmann (Universität Bremen, Germany) Dirk Janssens (Universiteit Antwerpen, Belgium) Barbara König (University of Duisburg-Essen, Germany) Christian Krause (SAP Innovation Centre Potsdam, Germany) Sabine Kuske (Universität Bremen, Germany) Leen Lambers (Hasso Plattner Institute, University of Potsdam, Germany) Yngve Lamo (Bergen University College, Norway) Tihamér Levendovszky (Vanderbilt University, USA) Mohamed Mosbah (LaBRI , Université de Bordeaux, France) Fernando Orejas (Technical University of Catalonia, Spain) Francesco Parisi-Presicce (Sapienza Univ. di Roma, Italy) Detlef Plump (University of York, UK) Arend Rensink (University of Twente, The Netherlands) Leila Ribeiro (Universidade Federal do Rio Grande do Sul, Brazil) Andy Schürr (Technische Universität Darmstadt, Germany) Martin Strecker (Université de Toulouse, France) Gabriele Taentzer (Philipps-Universität Marburg, Germany) Matthias Tichy (University of Ulm, Germany) Pieter Van Gorp (Eindhoven University of Technology, The Netherlands) Hans Vangheluwe (Universiteit Antwerpen, Belgium) Bernhard Westfechtel (University of Bayreuth, Germany) Albert Zündorf (Kassel University, Germany) Paper Submission ---------------- Papers are solicited in three categories: * Research papers (limited to 16 pages in Springer LNCS format) describe innovative contributions and are evaluated with respect to their originality, significance, and technical soundness. Additional material intended for reviewers but not for publication in the final version may be included in a clearly marked appendix. * Case studies (limited to 12 pages in Springer LNCS format) describe applications of graph transformations in any application domain. * Tool presentation papers (limited to 12 pages in Springer LNCS format) demonstrate the main features and functionality of graph-based tools. A tool presentation paper may have an appendix with a detailed demo description (up to 5 pages), which will be reviewed but not included in the proceedings. Papers can be submitted at http://www.easychair.org/conferences/?conf=icgt2016. Submitted papers must use Springer's LNCS format (http://www.springer.com/lncs) Simultaneous submission to other conferences with proceedings or submission of material that has already been published elsewhere is not allowed. The page limits are strict and include references. Proceedings will be published by Springer in the Lecture Notes in Computer Science (http://www.springer.com/lncs) series. Important Dates --------------- Abstract submission: 15 February 2016 Full paper submission: 29 February 2016 Notification of acceptance: 07 April 2016 Final version due: 21 April 2016 Conference: 5-6 July 2016 Further Information ------------------- Web page: http://www.graph-transformation.org https://sites.google.com/site/icgt2016/ Contact: icgt2016(a)gmail.com

1 1

ANN: HaskRel; Employing GHC as a DBMS with support for the relational algebra
by Thor Michael Støre 31 Dec '15

31 Dec '15

Hello, After much scratching of my head over intricate parts of this "Haskell" thing I'm happy to announce that I've finally released my first effort in it: HaskRel. Overview -------- Because I've spent quite a bit of time on database prompts I thought it would be a fun exercise to see how much GHC can be made to operate like a DBMS, and how much of the relational model of database management (as defined by Chris Date et al. today) I'm able to make it accommodate. I'm pleased to register that the relational algebra, base variables and assignment works as one would expect at a database prompt. It does not qualify as an actual RDBMS (unsurprisingly), since it doesn't implement many other things that are required for it to be a proper RDBMS, either because I haven't gotten around to it or they cannot be implemented in Haskell. I've put the source up on GitHub and published it on Hackage: Hackage: http://hackage.haskell.org/package/HaskRel GitHub: https://github.com/thormick/HaskRel/tree/master/HaskRel HaskRel employs a Data.Set of Data.HList.Record as a relation type, for which it defines "Relation" as a synonym. It supports base variables (files) of this type, and implements the functions of the relational algebra such that they can be expressed upon both constants or literal values, upon variables, and upon expressions on variables. Example ------- The following is a minimal definition of a database with a single relation variable, "sp": module MiniDB where import Data.HList.CommonMain import Database.HaskRel.RDBMS sp :: Relvar '[Attr "sno" String, Attr "pno" String, Attr "qty" Integer] sp = Relvar "SP.rv" "Attr" has been defined as a synonym for "Data.Tagged.Tagged", because that is employed to represent what are known as attributes in relational theory. Loading this in GHCi we can first create a relation constant, do some relational assignment, and print the results (pardon the long lines): *MiniDB> let s = ( relation' [ ( "S1", "Smith", 20, "London" ), ( "S2", "Jones", 10, "Paris" ), ( "S3", "Blake", 30, "Paris" ) ] :: Relation '[Attr "sno" String, Attr "sName" String, Attr "status" Integer, Attr "city" String] ) *MiniDB> pt s ┌───────────────┬─────────────────┬───────────────────┬────────────────┐ │ sno :: String │ sName :: String │ status :: Integer │ city :: String │ ╞═══════════════╪═════════════════╪═══════════════════╪════════════════╡ │ S1 │ Smith │ 20 │ London │ │ S2 │ Jones │ 10 │ Paris │ │ S3 │ Blake │ 30 │ Paris │ └───────────────┴─────────────────┴───────────────────┴────────────────┘ *MiniDB> sp `assign` ( relation' [ ("S1", "P1", 300), ("S1", "P3", 400), ("S1", "P5", 100), ("S2", "P1", 300), ("S3", "P2", 200) ] :: Relation '[Attr "sno" String, Attr "pno" String, Attr "qty" Integer] ) Value assigned to ./SP.rv *MiniDB> pt sp ┌───────────────┬───────────────┬────────────────┐ │ sno :: String │ pno :: String │ qty :: Integer │ ╞═══════════════╪═══════════════╪════════════════╡ │ S1 │ P1 │ 300 │ │ S1 │ P3 │ 400 │ │ S1 │ P5 │ 100 │ │ S2 │ P1 │ 300 │ │ S3 │ P2 │ 200 │ └───────────────┴───────────────┴────────────────┘ (Mind that correct display of the Unicode table drawing characters depends on using the right fixed-width font.) Fundamental operations of the relational algebra can of course be performed on them: *MiniDB> p $ s `naturalJoin` sp ┌─────┬───────┬────────┬────────┬─────┬─────┐ │ sno │ sName │ status │ city │ pno │ qty │ ╞═════╪═══════╪════════╪════════╪═════╪═════╡ │ S1 │ Smith │ 20 │ London │ P1 │ 300 │ │ S1 │ Smith │ 20 │ London │ P3 │ 400 │ │ S1 │ Smith │ 20 │ London │ P5 │ 100 │ │ S2 │ Jones │ 10 │ Paris │ P1 │ 300 │ │ S3 │ Blake │ 30 │ Paris │ P2 │ 200 │ └─────┴───────┴────────┴────────┴─────┴─────┘ A proper relational database management system (which, again, this isn't, for several other reasons) must support type inference for relational expressions (see The Third Manifesto, relational model prescription 18). Fortunately, that is of course no problem for GHC with the right extensions: *MiniDB> :t s s :: Relation '[Attr "sno" String, Attr "sName" String, Attr "status" Integer, Attr "city" String] *MiniDB> :t sp sp :: Relvar '[Attr "sno" String, Attr "pno" String, Attr "qty" Integer] *MiniDB> :t s `naturalJoin` sp s `naturalJoin` sp :: IO (containers-0.5.6.2:Data.Set.Base.Set (RTuple '[Tagged "sno" String, Tagged "sName" String, Tagged "status" Integer, Tagged "city" String, Tagged "pno" [Char], Tagged "qty" Integer])) DML is also supported, of course: *MiniDB> insert sp ( relation' [ ("S1", "P2", 200), ("S1", "P3", 400), ("S1", "P4", 200) ] :: Relation '[Attr "sno" String, Attr "pno" String, Attr "qty" Integer] ) Inserted 2 of 3 tuples into ./SP.rv Concise expression of "update" require a set of language extensions (this in addition to DataKinds, which this module enables by default since it is quite ubiquitous in this endeavor): *MiniDB> :set -XQuasiQuotes -XKindSignatures -XViewPatterns *MiniDB> :{ *MiniDB| update sp (\[pun|pno qty|] -> ( pno == "P2" || pno == "P3" || pno == "P4" ) && qty < 300 ) *MiniDB| (\[pun|qty|] -> case qty + 50 of qty -> [pun|qty|]) *MiniDB| :} Updated 3 of 7 tuples in ./SP.rv *MiniDB> pt$ sp `restrict` \[pun|pno|] -> ( pno == "P2" || pno == "P3" || pno == "P4" ) ┌───────────────┬───────────────┬────────────────┐ │ sno :: String │ pno :: String │ qty :: Integer │ ╞═══════════════╪═══════════════╪════════════════╡ │ S1 │ P2 │ 250 │ │ S1 │ P3 │ 400 │ │ S1 │ P4 │ 250 │ │ S3 │ P2 │ 250 │ └───────────────┴───────────────┴────────────────┘ And of course delete-by-predicate: *MiniDB> count sp 7 *MiniDB> deleteP sp (\[pun|pno|] -> pno == "P3") Deleted 1 tuples from SP.rv *MiniDB> count sp 6 For an overview of the functions of the relational algebra and relational assignment defined by HaskRel see: http://hackage.haskell.org/package/HaskRel/docs/Database-HaskRel-Relational… Summary ------- This is a personal, spare-time project, the motivations for which have been to learn Haskell, and see how much of the relational model Haskell/GHC can accommodate, or how much like an RDBMS GHC can operate. Making this practically usable has not been part of the scope. Ascertaining that Haskell/GHC accommodates the relational algebra, relational base variables and operations thereupon in such a straight forward manner, was quite nice. It was particularly fun to see how this allowed examples of expressions in Tutorial D from Chris Date's "SQL and Relational Theory, 2nd. ed" to be expressed in Haskell in a manner quite verbatim to the originals (see https://github.com/thormick/HaskRel/blob/master/HaskRel/examples/SuppliersP… and chapters 6 and 7 of said book). It was also interesting to see trivial querying and DML operations on GHCi operate in a manner similar to what one would expect in a DBMS. Even if this isn't of practical use I still hope it is of some interest, or at least that it can enable Haskell as a demonstrator of some parts of the relational model for database management. Thanks, Thor Michael Støre

3 2

ANN: wxInstall Achelanne and wxHaskell 0.92.2.0
by Henk-Jan van Tuyl 30 Dec '15

30 Dec '15

L.S., I am happy to announce a new version of wxHaskell: 0.92.2.0 and new installation packages for wxHaskell on Windows: wxInstall Achelanne 0.1 (32 bit and 64 bit) Changes in wxHaskell since 0.92.1: - Solved warnings for wxcore, wxdirect, wxc - Added support for Pickerctrl, Hyperlinkctrl and some Streams in wxc and wxcore - Solved several bugs - Added some image Functions in wxc and wxcore - Added enumerateFonts function in wxcore - Updated wxBITMAP_TYPE_ constants - Adapted to GHC 7.10.3 Thanks to everyone who contributed! wxInstall Achelanne[0] is created because GHC 7.10.3 for Windows is accompanied with a newer GCC: 5.2.0. A detailed description can be found at the wxHaskell-for-Windows homepage[1]. What is wxHaskell? ------------------ wxHaskell[2] is a portable and native GUI library for Haskell. The goal of the project is to provide an industrial strength GUI library for Haskell, but without the burden of developing (and maintaining) one ourselves. wxHaskell is therefore built on top of wxWidgets – a comprehensive C++ library that is portable across all major GUI platforms; including GTK, Windows, X11, and MacOS X. Furthermore, it is a mature library (in development since 1992) that supports a wide range of widgets with the native look-and-feel. Links ----- See the homepage of wxHaskell for more information: https://wiki.haskell.org/WxHaskell The packages are: - wxc https://hackage.haskell.org/package/wxc - wxdirect https://hackage.haskell.org/package/wxdirect - wxcore https://hackage.haskell.org/package/wxcore - wx https://hackage.haskell.org/package/wx Regards, Henk-Jan van Tuyl [0] http://sourceforge.net/projects/wxhaskell/files/wxInstall/ [1] https://wiki.haskell.org/WxHaskell/Windows#Installing_the_easy_way [2] https://wiki.haskell.org/WxHaskell -- Folding@home What if you could share your unused computer power to help find a cure? In just 5 minutes you can join the world's biggest networked computer and get us closer sooner. Watch the video. http://folding.stanford.edu/ http://Van.Tuyl.eu/ http://members.chello.nl/hjgtuyl/tourdemonad.html Haskell programming --

1 0

CfP: Workshop on Program Transformation for Programmability in Heterogeneous Architectures (Co-located with CGO16); Deadline Jan 15
by Salvador Tamarit 23 Dec '15

23 Dec '15

********************************************************************************* PROHA 2016, CALL FOR PAPERS First Workshop on Program Transformation for Programmability in Heterogeneous Architectures http://goo.gl/RzGbzY Barcelona, 12th March 2016, in conjunction with the CGO'16 Conference ********************************************************************************* Important Dates: Paper submission deadline: 15 January 2016 23:59 (UTC) Author notification: 5 February 2016 Final manuscript due: 26 February 2016 Scope: Developing and maintaining high-performance applications and libraries for heterogeneous architectures is a difficult task, usually requiring code transformations performed by an expert. Tools assisting in and, if possible, automating such transformations are of course of great interest. However, such tools require significant knowledge and reasoning capabilities. For example, the former could be a machine-understandable descriptions of what a piece of code is expected to do, while the latter could be a set of transformations and a corresponding logical context in which they are applicable, respectively. Furthermore, strategies to identify the sequence of transformations leading to the best resulting code need to be elaborated. This workshop will focus on techniques and foundations which make it possible to perform source code transformations, which preserve the intended semantics of the original code and improve efficiency, portability or maintainability. The topics of interest for the workshop include, but are not limited to: * Program annotations to capture algorithmic properties and intended code semantics. * Programming paradigms able to express underlying (mathematical) properties of code. * Usage of dynamic and static mechanisms to infer relevant code properties. * Transformations which preserve intended semantics. * Strategies to apply transformations. * Heuristics to guide program transformation and techniques to synthesize / learn these heuristics. * Tools Submission Guidelines: Submissions are to be written in English and not exceed 10 pages, including bibliography. Submissions should be written in ACM double-column format using a 10-point type. Authors should follow the information for formatting ACM SIGPLAN conference papers, which can be found at http://www.sigplan.org/Resources/Author . Authors should submit their papers in pdf format using the EasyChair submission website https://easychair.org/conferences/?conf=proha2016 . Publication: The proceedings will be made publicly available through ArXiV. Workshop Organizers: - Manuel Carro, IMDEA Software Institute and Technical University of Madrid - Colin W. Glass, University of Stuttgart - Jan Kuper, University of Twente - Julio Mariño, Technical University of Madrid - Lutz Schubert, University of Ulm - Guillermo Vigueras, IMDEA Software Institute - Salvador Tamarit, Technical University of Madrid If you have any questions, please contact the program chair at manuel.carro(a)imdea.org

1 0

Associate or Full Professorship in Programming Languages at Oxford
by Jeremy Gibbons 17 Dec '15

17 Dec '15

The Department of Computer Science at University of Oxford has an opening for an Associate or Full Professorship in Programming Languages, as described below. Please pass this advert on to anyone who may be interested. I would be happy to answer any questions. -jg * Applications are invited for the post of Associate Professor (or Professor) of Programming Languages, to be held in the Department of Computer Science, to start as soon as possible. The successful candidate will also be appointed to a Fellowship at Kellogg College. You will join a vibrant and rapidly-growing computer science department, with a long history of fundamental research in the area of programming languages, benefiting from a rich academic environment for computer science research, with many researchers working in closely-related areas. You will be a member of both the University and the College community, which is an intellectually stimulating research environment, performing to the highest international levels in research and publications, and will have access to the excellent research facilities which Oxford offers. You will have a role to play in the running of the College as a member of its Governing Body, together with your departmental research, teaching, and examining duties. Candidates should hold a doctoral degree in computer science (or cognate discipline), with a proven global research record in peer-reviewed journals, including the ability to attract research funding. You should have experience in teaching programming languages and related topics within Computer Science at graduate level, including supervising graduate students. Experience of research collaborations on a national or global level is highly desirable. Applications are particularly welcome from women and black and minority ethnic candidates, who are under-represented in academic posts in Oxford. The closing date for applications is 12.00 midday on 15 February 2016. For further particulars, and details of how to apply, see: http://tinyurl.com/p3ckkab Contact Person: Michael Wooldridge (mjw(a)cs.ox.ac.uk) [or JG, at the address below] Vacancy ID : 121645 Grade 36S: Salary on scale from £45,066 - £59,914 pa (plus benefits) Closing Date : 15-Feb-2016 Jeremy.Gibbons(a)cs.ox.ac.uk Oxford University Department of Computer Science, Wolfson Building, Parks Road, Oxford OX1 3QD, UK. +44 1865 283521 http://www.cs.ox.ac.uk/people/jeremy.gibbons/

1 0

Research internship at Facebook
by Simon Marlow 16 Dec '15

16 Dec '15

We have a research internship available for summer 2016 working with the Haxl team at Facebook. The internship is available to mid-term PhD students, and should be of interest to anyone who is interested in working on Haskell, concurrency, garbage collection, static analysis, or related areas. We have a number of projects in mind and we would aim to take the student's background and expertise into account when choosing the specific project. For more details and to apply, go here: https://www.facebook.com/careers/jobs/a0I1200000I9saG/ Cheers, Simon

1 0

Postdoctoral and PhD positions in LFCS on graph databases, provenance, and programming languages
by James Cheney 15 Dec '15

15 Dec '15

Hi, As a result of recent funding awards, I expect to be able to advertise two postdoctoral positions and a PhD position at the Laboratory for Foundations of Computer Science, University of Edinburgh in the near future: * The first postdoc position will be advertised early in January to start as soon as possible (in practice, this likely means February 2016 at the absolute earliest; I'd prefer to have someone by March or April if possible). The position will require a mix of research and development skills, to contribute to the development of a system for processing and analyzing provenance graph data in order to identify and mitigate advanced persistent threat attacks. Preferred programming languages among other project members include Haskell, Scala and Python. Experience with graph databases such as Titan/Cassandra or the Gremlin query language would be a big plus. I would like to hire someone to work on this project whose research dovetails well with the development needed for the project. This could mean a systems-oriented PL researcher interested in gaining experience with graph databases, provenance or security, or a researcher in one of these areas interested in gaining experience with PL. This position is part of the ADAPT project (A Diagnostics Approach for Advanced Persistent Threat Detection) funded by the DARPA Transparent Computing Program. The other partners in ADAPT are Galois, Inc., Xerox PARC, and Oregon State University. The funding is secure until June 2017 and funding after that point is contingent on continuation of the project by DARPA, until the program ends in June 2019. * The second postdoc and PhD studentship position will be advertised later in 2016 for a start date of mid-to-late 2016. Both will be part of the ERC-funded project "Skye: A programming language bridging theory and practice for scientific data curation". Relevant topics/background include heterogeneous metaprogramming, language-integrated query, and scientific data management and provenance. Both positions will have funding for up to 4 years in the period 2016-2021 (pending finalization of the grant agreement). This message does not constitute a formal advertisement of an employment opportunity; formal advertisements will follow when the details are finalized. Please contact me if interested in any of these opportunities or with any questions about the projects, and research environment, and preferably including a CV and summary of your research interests and how they relate to the position(s) you are interested in. --James

1 0

PhD scholarship on foundations of meta-programming
by Martin Berger 14 Dec '15

14 Dec '15

I apologise if you get this message multiple times. ------ Applications are invited for a fully funded PhD studentship in the Department of Informatics at the University of Sussex, starting in October 2016. The topic of the studentship is to develop the foundations of meta-programming, and extending our understanding of how to specify and verify meta-programs, in terms of theoretical understanding, implementation and tooling. For further details, see http://www.jobs.ac.uk/job/AMO053/foundations-of-meta-programming or contact Martin Berger <M.F.Berger(a)sussex.ac.uk>. The Scholarship normally includes a three year stipend at a standard rate (currently £14057 per annum) and, in addition, fees as follows: (a) for Home/EU applicants, full fees; (b) overseas applicants, a contribution of up to £12000 towards overseas fees, depending on qualifications. The studentship is available to students of any nationality. Applicants are normally expected to have a first-class Masters or Bachelors degree in Computer Science, Mathematics or a related discipline, and must obtain the support of the supervisor prior to submitting their application. Initial contact with supervisors should be made at least two weeks prior to the closing date for applications. For details about funding and the application procedure contact Luke Scott <L.Scott(a)sussex.ac.uk>. Closing date for applications is 4th January 2016.

1 0

[NL-FP 2016] Final CFP: Dutch Functional Programming Day 2016
by Atze Dijkstra 14 Dec '15

14 Dec '15

[My apologies for multiple received copies of the same message] Final Call for Participation: Dear all, The next Dutch Functional Programming day (NL-FP 2016) will be held on Friday, January 8, 2016 at the Utrecht University, The Netherlands. The program of the day now is online (see the below webpage). At the end of the day we will have a joint dinner. Besides the program, on the web page http://foswiki.cs.uu.nl/foswiki/NlFpDay2016/WebHome <http://foswiki.cs.uu.nl/foswiki/NlFpDay2016/WebHome> for the day you’ll also find the registration, which is by letting me know via email (with a subject header that begins with [NL-FP 2016]) whether you want to (1) participate, (2) join dinner, also see the webpage for additional details. There is still room for a demo or poster during lunch/break time. If you intend to participate, please let me know before the end of this year because we like to know how many people we can expect. Hope to meet you all in Utrecht at the next FP Day! Best regards, - Atze - Atze Dijkstra, Department of Information and Computing Sciences. /|\ Utrecht University, PO Box 80089, 3508 TB Utrecht, Netherlands. / | \ Tel.: +31-30-2534118/1454 | WWW : http://www.cs.uu.nl/~atze <http://www.cs.uu.nl/~atze> . /--| \ Fax : +31-30-2513971 .... | Email: atze(a)uu.nl <mailto:atze@uu.nl> ............... / |___\

1 0