December 2014 - Haskell

ANNOUNCE: ioctl 0.0.1
by Maciej Piechotka 13 Sep '15

13 Sep '15

A package for type-safe I/O control. Currently only ioctl is supported. Currently simply a extract from my tuntap fork TODO: - Return the integer as well as structure (will break the API) - Port for Windows Network.Socket.IOCtl (as soon as I manage to setup some sane environment on this platform) - Wrapping around DeviceIoControl Example (in hsc): data NotRead = NotRead instance NotRead Int where ioctlReq _ = #const FIONREAD notRead s = ioctlsocket' s NotRead Regards

2 1

Haskell wiki slowness
by David Feuer 28 Dec '14

28 Dec '14

Does anyone know when the wiki will be back up to speed? Until then, could one of the infrastructure people please have status.haskell.org indicate a partial service disruption?

1 0

ANNOUNCE: GHC version 7.8.4
by Austin Seipp 23 Dec '14

23 Dec '14

============================================================== The (Interactive) Glasgow Haskell Compiler -- version 7.8.4 ============================================================== The GHC Team is pleased to announce a new patchlevel release of GHC, 7.8.4. This is an important bugfix release relative to 7.8.3 (with over 30 defects fixed), so we highly recommend upgrading from the previous 7.8 releases. The full release notes are here: https://downloads.haskell.org/~ghc/7.8.4/docs/html/users_guide/release-7-8-… How to get it ~~~~~~~~~~~~~ The easy way is to go to the web page, which should be self-explanatory: https://www.haskell.org/ghc/ We supply binary builds in the native package format for many platforms, and the source distribution is available from the same place. Packages will appear as they are built - if the package for your system isn't available yet, please try again later. Background ~~~~~~~~~~ Haskell is a standard lazy functional programming language. GHC is a state-of-the-art programming suite for Haskell. Included is an optimising compiler generating good code for a variety of platforms, together with an interactive system for convenient, quick development. The distribution includes space and time profiling facilities, a large collection of libraries, and support for various language extensions, including concurrency, exceptions, and foreign language interfaces (C, whatever). GHC is distributed under a BSD-style open source license. A wide variety of Haskell related resources (tutorials, libraries, specifications, documentation, compilers, interpreters, references, contact information, links to research groups) are available from the Haskell home page (see below). On-line GHC-related resources ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Relevant URLs on the World-Wide Web: GHC home page http://www.haskell.org/ghc/ GHC developers' home page http://ghc.haskell.org/trac/ghc/ Haskell home page http://www.haskell.org/ Supported Platforms ~~~~~~~~~~~~~~~~~~~ The list of platforms we support, and the people responsible for them, is here: http://ghc.haskell.org/trac/ghc/wiki/Platforms http://ghc.haskell.org/trac/ghc/wiki/CodeOwners Ports to other platforms are possible with varying degrees of difficulty. The Building Guide describes how to go about porting to a new platform: http://ghc.haskell.org/trac/ghc/wiki/Building Developers ~~~~~~~~~~ We welcome new contributors. Instructions on accessing our source code repository, and getting started with hacking on GHC, are available from the GHC's developer's site run by Trac: http://ghc.haskell.org/trac/ghc/ Mailing lists ~~~~~~~~~~~~~ We run mailing lists for GHC users and bug reports; to subscribe, use the web interfaces at http://www.haskell.org/mailman/listinfo/glasgow-haskell-users http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs There are several other haskell and ghc-related mailing lists on www.haskell.org; for the full list, see http://www.haskell.org/mailman/listinfo/ Some GHC developers hang out on #haskell on IRC, too: http://www.haskell.org/haskellwiki/IRC_channel Please report bugs using our bug tracking system. Instructions on reporting bugs can be found here: http://www.haskell.org/ghc/reportabug Hashes & Signatures ~~~~~~~~~~~~~~~~~ On https://downloads.haskell.org/~ghc/7.8.4/ you will find a signed copy of the SHA256 hashes for the tarballs, using my GPG key (keyid 0x3B58D86F). -- Regards, Austin Seipp, Haskell Consultant Well-Typed LLP, http://www.well-typed.com/

1 0

Call for papers LOPSTR 2015 -- 25th International Symposium on Logic-Based Program Synthesis and Transformation -- Siena, Italy
by Moreno Falaschi 22 Dec '14

22 Dec '14

============================================================ 25th International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2015 Special Issue of Formal Aspects of Computing http://alpha.diism.unisi.it/lopstr15/ University of Siena, Siena, IT, July 13-15, 2015 (co-located with PPDP 2015) DEADLINES Abstract submission: April 6, 2015 Paper/Extended abstract submission: April 13, 2015 ============================================================ The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium so that authors can incorporate this feedback in the published papers. The 25th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2015) will be held at the University of Siena, Siena, Italy; previous symposia were held in Canterbury, Madrid, Leuven, Odense, Hagenberg, Coimbra, Valencia, Lyngby, Venice, London, Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester, Leuven, Stockholm, Arnhem, Pisa, Louvain-la-Neuve, and Manchester. LOPSTR 2015 will be co-located with PPDP 2015 (International Symposium on Principles and Practice of Declarative Programming). Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large. Both full papers and extended abstracts describing applications in these areas are especially welcome. Contributions are welcome on all aspects of logic-based program development, including, but not limited to: * synthesis * transformation * specialization * composition * optimization * inversion * specification * analysis and verification * testing and certification * program and model manipulation * transformational techniques in SE * applications and tools Survey papers that present some aspects of the above topics from a new perspective, and application papers that describe experience with industrial applications are also welcome. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). Important Dates Abstract submission: April 6, 2015 Paper/Extended abstract submission: April 13, 2015 Notification: May 25, 2015 Camera-ready (for electronic pre-proceedings): June 15, 2015 Symposium: July 13-15, 2015 Submission Guidelines Authors should submit an electronic copy of the paper (written in English) in PDF, formatted in the Lecture Notes in Computer Science style. Each submission must include on its first page the paper title; authors and their affiliations; contact author's email; abstract; and three to four keywords which will be used to assist the PC in selecting appropriate reviewers for the paper. Page numbers should appear on the manuscript to help the reviewers in writing their report. Submissions cannot exceed 15 pages including references but excluding well-marked appendices not intended for publication. Reviewers are not required to read the appendices, and thus papers should be intelligible without them. Papers should be submitted via the Easychair submission website for LOPSTR 2015, which can be accessed through the website of LOPSTR 2015. Proceedings The formal post-conference proceedings will be published by Springer in the Lecture Notes in Computer Science series (to be confirmed). Full papers can be directly accepted for publication in the formal proceedings, or accepted only for presentation at the symposium and inclusion in informal proceedings. After the symposium, all authors of extended abstracts and full papers accepted only for presentation will be invited to revise and/or extend their submissions in the light of the feedback solicited at the symposium. Then, after another round of reviewing, these revised papers may also be published in the formal proceedings. Special journal issue After the symposium, a selection of the best papers will be invited to a special issue of the 'Formal Aspects of Computing' journal. The submissions to the special issue must be substantial extensions of the proceedings versions and will undergo the usual journal reviewing process. Program Committee Slim Abdennadher, German University of Cairo, Egypt Maria Alpuente, Universitat Politecnica de Valencia, Spain Demis Ballis, University of Udine, Italy Olaf Chitil, University of Kent, UK Michael Codish, Ben-Gurion University, Israel Moreno Falaschi, University of Siena, Italy (Program Chair) Jerome Feret, INRIA and ENS, France Maurizio Gabbrielli, University of Bologna, Italy Jurgen Giesl, RWTH Aachen University, Germany Miguel Gomez-Zamalloa, Complutense University of Madrid, Spain Arnaud Gotlieb, SIMULA Research Laboratory, Norway Gopal Gupta, University of Texas at Dallas, USA Manuel Hermenegildo, IMDEA, Spain Viktor Kuncak, EPFL Lausanne, Switzerland Luigi Liquori, INRIA Sophia-Antipolis Mediterranee, France Alexei Lisitsa, University of Liverpool, UK Narciso Marti-Oliet, Universidad Complutense de Madrid, Spain Jorge Navas, NASA, USA Kazuhiro Ogata, JAIST, Japan Carlos Olarte, ECT, Univ. Federal do Rio Grande do Norte, Brasil Catuscia Palamidessi, INRIA and Ecole Polytechnique, France Maurizio Proietti, IASI-CNR, Italy Albert Rubio, Universitat Politecnica de Catalunya, Barcelona, Spain Wim Vanhoof, University of Namur, Belgium Program and Symposium Chair: Moreno Falaschi, Dept. of Information Engineering and Mathematics, Univ. of Siena, Italy (moreno.falaschi(a)unisi.it) Organizing Committee Monica Bianchini, DIISM, Univ. of Siena, Italy Sara Brunetti, DIISM, Univ. of Siena, Italy Andrea Machetti, DIISM, Univ. of Siena, Italy Simonetta Palmas, DIISM, Univ. of Siena, Italy Maurizio Proietti, IASI-CNR, Italy Simone Rinaldi, DIISM, Univ. of Siena, Italy Elisa Tiezzi, DIISM, Univ. of Siena, Italy Sara Ugolini, Dip. Informatica, Univ. of Pisa

1 0

Google Summer of Code
by Njagi Mwaniki 22 Dec '14

22 Dec '14

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA512 Which books or resources or libraries should one read to get ready for the Google summer of code? Also which projects would be easiest to work on for beginners? Anything that would make one ready for Google summer of code and complete their project with ease. I'm currently taking cs194 from upenn online http://www.seas.upenn.edu/~cis194/lectures.html -----BEGIN PGP SIGNATURE----- Version: GnuPG v2 iQJ8BAEBCgBmBQJUmDMUXxSAAAAAAC4AKGlzc3Vlci1mcHJAbm90YXRpb25zLm9w ZW5wZ3AuZmlmdGhob3JzZW1hbi5uZXRGMjlGREM4Qjk5M0I2NEFEODkwMzFEQkRB MDNCNjA0MzJCQzVCQjdEAAoJEKA7YEMrxbt9E74P/ip0kSsrcOitj8J14LbO3dkk pTLyI2xkH8C9zH2xcPkft37fb1MTdr/ycyjGiksw2X6RgK9EshlSGtG1VdRod7ku ZxiMEja1HsemAPof1wGG7ONIXDtoqtmH+VTDmvt4StKsG84UkNT3BALys/VRd5iF kwOLzMZP2O0MZPUbCb8R13mxI1XdfJoaKC16N0+pKftv+t3/tsyxC0ADpSrM1NG7 mq6840OhCyhD/lGp2zVVVhdL/qVnnF5BV7BFuHvQSxEEiZdD9TDQDuMp/qIUA4Ml S58wJmxubi0me7TxLUmhSrwozFpGZk6tijYbJVuQ68VKwwOBbZzvDClEzUDMw3w5 9Ao9kBAL+GoGrNsfOgDbX3NC0yhLmHfC+gXiaOsaClmYOUsL//IZVL3Mu3yHDjZv Yed7h/GSTveaYcLliFHxxj9iLDWKFTeYZs5s2plGNvqWcXC0pch+K6+JrpQUKXPO nEAhdVppHF+e8Uepap6CnfLE16ZfFDbbevw5WMtw8al0nOufbC7l9FDvp91quJnH 2iSmb5AbZC5dlcFsfissUFT7HAksGVPdGAJIfKdZ8+5mGkqUcxCDRjF1Gqq98PMq lV97ZUBo6NcTdXsRX+Ee55J5bw2pnM72LTsxTOc/tvC9BOpmCzSwGpIQa+Nx83bU 2zvuYHf6mXePqvmeqE6Z =ewGo -----END PGP SIGNATURE-----

1 0

PhD studentship on dependent type theory for concurrent processes
by Martin Berger 22 Dec '14

22 Dec '14

Applications are invited for a fully funded PhD studentship in the Department of Informatics at the University of Sussex, starting in October 2015. The topics for the studentship is: dependent types for concurrent processes. That involved combining two major research traditions in type theory: (1) dependent type-theories a la Martin-Loef and homotopy type theory, and (2) types for concurrent processes such as session types. For further details, see http://www.sussex.ac.uk/informatics/pgstudy/doctoral/projects or contact Martin Berger <M.F.Berger(a)sussex.ac.uk>. The studentship is for three years and includes a stipend of £13,863 per year and full tuition fees for Home/EU applicants. For overseas applicants, a contribution of up to £12,000 towards overseas fees is paid, 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 in the School prior to submitting their application. Initial contact with supervisors should be made at least two weeks prior to the closing date for applications. Informal enquiries may be addressed to <M.F.Berger(a)sussex.ac.uk>. For further details about the application process, please see http://www.sussex.ac.uk/informatics/pgstudy/doctoral/funding Closing date for applications is 23 February 2015.

1 0

ANN: deepseq-bounded, seqaid, leaky
by Andrew Seniuk 21 Dec '14

21 Dec '14

This trio of related packages explores strictness control in a variety of ways. deepseq-bounded provides classes and generic functions to artificially force evaluation, to extents controlled by static or dynamic configuration. seqaid puts that into practise, providing a GHC plugin to auto-instrument your package with a strictness harness, which is dynamically optimisable during runtime. This is supported directly in the GHC compilation pipeline, without requiring (or performing!) any edits to your sources. leaky is a minimal, prototypic executable that leaks space under current state-of-the-art compilation (GHC 7.8.3 -O2, at the present time). deepseq-bounded hackage: https://hackage.haskell.org/package/deepseq-bounded homepage: http://www.fremissant.net/deepseq-bounded seqaid hackage: https://hackage.haskell.org/package/seqaid homepage: http://www.fremissant.net/seqaid leaky hackage: https://hackage.haskell.org/package/leaky homepage: http://www.fremissant.net/leaky Reddit discussion for the three together: http://www.reddit.com/r/haskell/comments/2ps8f5/ann_deepseqbounded_seqaid_l… Easiest way to try them all, is to install seqaid and run the demo: cabal install seqaid seqaid demo This tests seqaid on a local copy of the leaky source package. It turned out to be routine to extend deepseq-bounded and seqaid to dynamically configurable parallelisation (paraid?). Many other wrappers could be explored, too! Maybe seqaid should be renamed to koolaid or something... It's a pretty complicated system, and just first release, so there's bound to be lots of problems. I've not set up a bug tracker, but will maintain a casual list of bugs and feature requests at http://www.fremissant.net/seqaid/trac and will set up a proper tracker if there's interest. Any isssues (or comments), I'm here, or on the reddit discussion (or email). Andrew Seniuk rasfar on #haskell

1 2

[TFP 2015] 1st call for papers
by Peter Achten 19 Dec '14

19 Dec '14

----------------------------- C A L L F O R P A P E R S ----------------------------- ======== TFP 2015 =========== 16th Symposium on Trends in Functional Programming June 3-5, 2015 Inria Sophia Antipolis, France http://tfp2015.inria.fr/ The symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming, taking a broad view of current and future trends in the area. It aspires to be a lively environment for presenting the latest research results, and other contributions (see below). Authors of draft papers will be invited to submit revised papers based on the feedback receive at the symposium. A post-symposium refereeing process will then select a subset of these articles for formal publication. The selected revised papers are expected to be published as a Springer Lecture Notes in Computer Science (LNCS) volume. TFP 2015 will be the main event of a pair of functional programming events. TFP 2015 will be accompanied by the International Workshop on Trends in Functional Programming in Education (TFPIE), which will take place on June 2nd. The TFP symposium is the heir of the successful series of Scottish Functional Programming Workshops. Previous TFP symposia were held in * Edinburgh (Scotland) in 2003; * Munich (Germany) in 2004; * Tallinn (Estonia) in 2005; * Nottingham (UK) in 2006; * New York (USA) in 2007; * Nijmegen (The Netherlands) in 2008; * Komarno (Slovakia) in 2009; * Oklahoma (USA) in 2010; * Madrid (Spain) in 2011; * St. Andrews (UK) in 2012; * Provo (Utah, USA) in 2013; * and in Soesterberg (The Netherlands) in 2014. For further general information about TFP please see the TFP homepage. (http://www.tifp.org/) == INVITED SPEAKERS == TFP is pleased to announce talks by the following two invited speakers: * Laurence Rideau is a researcher at INRIA and is interested in the semantics of programming languages , the formal methods, and the verification tools for programs and mathematical proofs. She participated in the beginnings of the Compcert project (certified compiler), and is part of the Component Mathematical team in the MSR-INRIA joint laboratory, who performed the formalization of the Feit-Thompson theorem successfully. Thirty years ago, computers barged in mathematics with the famous proof of the Four Color Theorem. Initially limited to simple calculation, their role is now expanding to the reasoning whose complexity is beyond the capabilities of most humans, as the proof of the classification of finite simple groups. We present our large collaborative adventure around the formalization of the Feit-Thompson theorem (http://en.wikipedia.org/wiki/Feit%E2%80%93Thompson_theorem) that is a first step to the classification of finite groups and that uses a palette of methods and techniques that range from formal logic to software (and mathematics) engineering. * Sam Aaron (?) == SCOPE == The symposium recognizes that new trends may arise through various routes. As part of the Symposium's focus on trends we therefore identify the following five article categories. High-quality articles are solicited in any of these categories: Research Articles: leading-edge, previously unpublished research work Position Articles: on what new trends should or should not be Project Articles: descriptions of recently started new projects Evaluation Articles: what lessons can be drawn from a finished project Overview Articles: summarizing work with respect to a trendy subject Articles must be original and not simultaneously submitted for publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or experience-oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium. Topics suitable for the symposium include: Functional programming and multicore/manycore computing Functional programming in the cloud High performance functional computing Extra-functional (behavioural) properties of functional programs Dependently typed functional programming Validation and verification of functional programs Debugging and profiling for functional languages Functional programming in different application areas: security, mobility, telecommunications applications, embedded systems, global computing, grids, etc. Interoperability with imperative programming languages Novel memory management techniques Program analysis and transformation techniques Empirical performance studies Abstract/virtual machines and compilers for functional languages (Embedded) domain specific languages New implementation strategies Any new emerging trend in the functional programming area If you are in doubt on whether your article is within the scope of TFP, please contact the TFP 2015 program chair, Manuel Serrano. == BEST PAPER AWARDS == To reward excellent contributions, TFP awards a prize for the best paper accepted for the formal proceedings. TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. A student paper is one for which the authors state that the paper is mainly the work of students, the students are listed as first authors, and a student would present the paper. A prize for the best student paper is awarded each year. In both cases, it is the PC of TFP that awards the prize. In case the best paper happens to be a student paper, that paper will then receive both prizes. == SPONSORS == TFP is financially supported by ?????????????????? == PAPER SUBMISSIONS == Acceptance of articles for presentation at the symposium is based on a lightweight peer review process of extended abstracts (4 to 10 pages in length) or full papers (20 pages). The submission must clearly indicate which category it belongs to: research, position, project, evaluation, or overview paper. It should also indicate which authors are research students, and whether the main author(s) are students. A draft paper for which ALL authors are students will receive additional feedback by one of the PC members shortly after the symposium has taken place. We use EasyChair for the refereeing process. Papers must be submitted at: https://easychair.org/conferences/?conf=tfp2015 Papers must be written in English, and written using the LNCS style. For more information about formatting please consult the Springer LNCS web site: http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0 == IMPORTANT DATES == Submission of draft papers: March 17, 2015 Notification: March 24, 2015 Registration: April 7, 2015 TFP Symposium: June 3-5, 2015 Student papers feedback: June 9, 2015 Submission for formal review: July 1, 2015 Notification of acceptance: September 8, 2015 Camera ready paper: October 8, 2015 == PROGRAM COMMITTEE == Janis Voigtländer University of Bonn, DE Scott Owens University of Kent, UK Neil Sculthorpe Swansea University, UK Colin Runciman University of York, UK Manuel Serrano Inria (PC chair), FR Rinus Plasmeijer University of Nijmegen, NL Tomas Petricek University of Cambridge, UK Marco T. Morazan Seton Hall University, USA Wolfgang De Meuter Vrije Universiteit Brussel, BE Michel Mauny Ensta ParisTech, FR Sam Lindley The University of Edinburgh, UK Daan Leijen Microsoft, USA Jurriaan Hage Utrecht University, NL Andy Gill University of Kansas, USA Thomas Gazagnaire University of Cambrige, UK Lars-Ake Fredlund Universidad Politécnica de Madrid, ES Jean-Christophe Filliatre Université Paris Sud Orsay, FR Marc Feeley Université de Montréal, CA Olaf Chitil University of Kent, UK Edwin Brady University of St Andrews, UK

1 0

CFP: TFPIE 2015
by Johan Jeuring 18 Dec '14

18 Dec '14

Trends in Functional Programming in Education (TFPIE 2015) Call for papers https://wiki.science.ru.nl/tfpie/TFPIE2015 The 4th International Workshop on Trends in Functional Programming in Education, TFPIE 2015, will be held on June 2, 2015 in Sophia-Antipolis in France. It is co-located with the Symposium on Trends in Functional Programming (TFP 2015) which takes place from June 3 - 5. *** Goal *** The goal of TFPIE is to gather researchers, teachers and professionals that use, or are interested in the use of, functional programming in education. TFPIE aims to be a venue where novel ideas, classroom-tested ideas and work-in-progress on the use of functional programming in education are discussed. The one-day workshop will foster a spirit of open discussion by having a review process for publication after the workshop. The program chair of TFPIE 2015 will screen submissions to ensure that all presentations are within scope and are of interest to participants. Potential presenters are invited to submit an extended abstract (4-6 pages) or a draft paper (up to 16 pages) in EPTCS style. The authors of accepted presentations will have their preprints and their slides made available on the workshop's website/wiki. Visitors to the TFPIE 2015 website/wiki will be able to add comments. This includes presenters who may respond to comments and questions as well as provide pointers to improvements and follow-up work. After the workshop, presenters will be invited to submit (a revised version of) their article for review. The PC will select the best articles for publication in the journal Electronic Proceedings in Theoretical Computer Science (EPTCS). Articles rejected for presentation and extended abstracts will not be formally reviewed by the PC. TFPIE workshops have previously been held in St Andrews, Scotland (2012), Provo Utah, USA (2013), and Soesterberg, The Netherlands (2014). *** Program Committee *** Peter Achten, Radboud University Nijmegen, The Netherlands Edwin Brady, University of St Andrews, UK Johan Jeuring, Utrecht University and Open University, The Netherlands (Chair) Shriram Krishnamurthi, Brown University, US Rita Loogen, Philipps-Universität Marburg, Germany Marco Morazan, Seton Hall University, US Norman Ramsey, Tufts University, US *** Submission Guidelines *** TFPIE 2015 welcomes submissions describing techniques used in the classroom, tools used in and/or developed for the classroom and any creative use of functional programming (FP) to aid education in or outside Computer Science. Topics of interest include, but are not limited to: - FP and beginning CS students - FP and Computational Thinking - FP and Artificial Intelligence - FP in Robotics - FP and Music - Advanced FP for undergraduates - Tools supporting learning FP - FP in graduate education - Engaging students in research using FP - FP in Programming Languages - FP in the high school curriculum - FP as a stepping stone to other CS topics - FP and Philosophy *** Best Lectures *** In addition to papers, we request “best lecture” presentations. What is your best lecture topic in an FP related course? Do you have a fun way to present FP concepts to novices or perhaps an especially interesting presentation of a difficult topic? In either case, please consider sharing it. Best lecture topics will be selected for presentation based on a short abstract describing the lecture and its interest to TFPIE attendees. *** Submission *** Papers and abstracts can be submitted via easychair at the following link: https://easychair.org/conferences/?conf=tfpie2015 It is expected at at least one author for each submitted paper will attend the workshop. *** Important Dates *** April 7, 2015: Early Registration for TFP closes April 27, 2015: Submission deadline for draft TFPIE papers and abstracts May 3 2015: Notification of acceptance for presentation ?? (Probably May 22 2015): Registration for TFPIE closes - as does late registration for TFP June 2, 2015: Presentations in Sophia-Antipolis, France July 7, 2015: Full papers for EPTCS proceedings due. September 1, 2015: Notification of acceptance for proceedings September 22, 2015: Camera ready copy due for EPTCS Submission of an abstract implies no obligation to submit a full version; abstracts with no corresponding full versions by the full paper deadline will be considered as withdrawn.

1 0

Postdoctoral Position in Functional Programming
by Tom Schrijvers 17 Dec '14

17 Dec '14

I have a position available for a postdoctoral researcher to join my team at KU Leuven. The position involves working on domain-specific languages (DSLs) embedded in Haskell and building on our earlier work of Monadic Constraint Programming. There is plenty of room for personal input and international collaboration, as well as developing your own research ideas. The position is for 3 years. The salary is competitive and the starting date negotiable. To apply you must hold a recent PhD (or be about to graduate) related to functional programming. The application deadline is January 5, 2015. Send your application (cover letter, cv, 3 references) and any enquiries to tom.schrijvers(a)cs.kuleuven.be . -- prof. dr. ir. Tom Schrijvers Research Professor KU Leuven Department of Computer Science Celestijnenlaan 200A 3001 Leuven Belgium Phone: +32 16 327 830 http://people.cs.kuleuven.be/~tom.schrijvers/

1 0