Ylies Falcone | 23 Sep 15:21 2014

Last CFP: ACM Symposium on Applied Computing Software Verification and Testing Track

30th Annual ACM Symposium on Applied Computing
Software Verification and Testing Track
April 13 - 17, 2015, Salamanca, Spain

More information:
http://fmt.cs.utwente.nl/conferences/sac-svt2015/ and

Important dates
* September 26, 2014: Submission of regular papers -- EXTENDED 
* November 17, 2014: Notification of paper acceptance/rejection
* December 8, 2014: Camera-ready copies of accepted papers

ACM Symposium on Applied Computing
The ACM Symposium on Applied Computing (SAC) has gathered scientists
from different areas of computing over the past twenty-nine
years. The forum represents an opportunity to interact with different
communities sharing an interest in applied computing.

SAC 2015 is sponsored by SIGAPP and will be held at the UNESCO world
heritage city of Salamanca in Spain.

Software Verification and Testing Track
We invite authors to submit new results in formal verification and
testing, as well as development of technologies to improve the
(Continue reading)

Tom Schrijvers | 22 Sep 17:34 2014

Postdoctoral Position in Programming Languages at KU Leuven

Postdoctoral Position in Programming Languages at KU Leuven

The Declarative Languages and Artificial Intelligence (DTAI) group of KU Leuven
(Belgium) invites applicants for a postdoctoral position in the area of
programming languages. This position has been created at the occasion of the
new appointment of prof. Tom Schrijvers as research professor at KU Leuven. The
position's aim is to reinforce the research activities in functional
programming, logic programming and/or programming language theory.

To apply you must hold a recent PhD (or be about to graduate) in one of the
above areas of programming languages. Candidates are expected to have
high-quality publications in peer-reviewed conferences and journals.

The postdoc will work closely with prof. Schrijvers and his PhD students,
participate in ongoing research activities and enjoy the freedom to develop new
lines of research.

The position is for 2 x 1 year and can be further extended. The salary is
competitive and the starting date negotiable.  Moreover, KU Leuven's policy of
equal opportunities and diversity applies to this position.

Please send your application to prof. Tom Schrijvers (tom dot schrijvers at cs
dot kuleuven dot be) by October 15, 2014. Your application should contain:

 - A cover letter explaining your interest in the position.

 - Your curriculum vitae.

 - A short research statement (max. 3 pages).

 - The names and contact details of three people who can, if asked, write
   letters of reference.

Haskell mailing list
Haskell <at> haskell.org
Daniel Santa Cruz | 18 Sep 06:28 2014

Haskell Weekly News: Issue 306

Welcome to issue 306 of the HWN, an issue covering crowd-sourced bits
of information about Haskell from around the web. This issue covers
from September 07 to 13, 2014

Quotes of the Week

   * prophile: at this point ekmett is more part of the language than a
     practitioner of it

   * Qfwfq: Simon is a title, not a forename.

Top Reddit Stories

   * Haskell for all: Morte: an intermediate language for super-optimizing
     functional programs
     Domain: haskellforall.com, Score: 110, Comments: 83
     Original: [1] http://goo.gl/MjPyyr
     On Reddit: [2] http://goo.gl/v2btl4

   * AMP has landed in GHC Main!
     Domain: haskell.org, Score: 88, Comments: 71
     Original: [3] http://goo.gl/giu1Xh
     On Reddit: [4] http://goo.gl/ZGJ76S

   * [Meta] What's with all these downvotes on beginner questions?
     Domain: self.haskell, Score: 69, Comments: 67
     Original: [5] http://goo.gl/ik2uu2
     On Reddit: [6] http://goo.gl/ik2uu2

   * Haskell Implementors Workshop 2014 videos [youtube]
     Domain: youtube.com, Score: 59, Comments: 11
     Original: [7] http://goo.gl/ijM6hs
     On Reddit: [8] http://goo.gl/48GOSr

   * FP Complete is hiring: Haskell web UI developer
     Domain: fpcomplete.com, Score: 59, Comments: 14
     Original: [9] http://goo.gl/0kPlFl
     On Reddit: [10] http://goo.gl/WtivSo

   * How to get (approx) stack traces with profiled builds
     Domain: self.haskell, Score: 46, Comments: 15
     Original: [11] http://goo.gl/ZAurK6
     On Reddit: [12] http://goo.gl/ZAurK6

   * Hakaru: An embedded probabilistic programming language
     Domain: indiana.edu, Score: 40, Comments: 10
     Original: [13] http://goo.gl/PLcCGW
     On Reddit: [14] http://goo.gl/aP7giY

   * Why does David Turner say type classes were a bad idea?
     Domain: self.haskell, Score: 37, Comments: 96
     Original: [15] http://goo.gl/WqRLZQ
     On Reddit: [16] http://goo.gl/WqRLZQ

   * Let's Build a Browser Engine in Haskell: Part 2
     Domain: hrothen.github.io, Score: 33, Comments: 14
     Original: [17] http://goo.gl/PyxMOy
     On Reddit: [18] http://goo.gl/45L7hs

   * Proposal for copatterns in Idris
     Domain: github.com, Score: 30, Comments: 38
     Original: [19] http://goo.gl/7Zv7U1
     On Reddit: [20] http://goo.gl/pPIq8p

   * GHC Blog: Static pointers and serialisation (by SPJ)
     Domain: ghc.haskell.org, Score: 28, Comments: 2
     Original: [21] http://goo.gl/HJrm4t
     On Reddit: [22] http://goo.gl/kPxJj5

   * introduction to the basic lens operators
     Domain: intolerable.me, Score: 26, Comments: 12
     Original: [23] http://goo.gl/VXlKnm
     On Reddit: [24] http://goo.gl/b0bLfE

   * Prisms lead to typeclasses for subtractive types
     Domain: gelisam.blogspot.ca, Score: 22, Comments: 6
     Original: [25] http://goo.gl/l9QIIm
     On Reddit: [26] http://goo.gl/GMD5Cj

   * Preventing memoization in (AI) search problems
     Domain: okmij.org, Score: 22, Comments: 16
     Original: [27] http://goo.gl/oEb6WD
     On Reddit: [28] http://goo.gl/jqVKPS

   * A shallow survey of formal methods for C code
     Domain: imperialviolet.org, Score: 21, Comments: 7
     Original: [29] http://goo.gl/rJgycy
     On Reddit: [30] http://goo.gl/RrXwns

   * Haskell Lectures
     Domain: shuklan.com, Score: 21, Comments: 1
     Original: [31] http://goo.gl/Ef0E4
     On Reddit: [32] http://goo.gl/VASdCX

   * A Netwire 5 Tutorial
     Domain: self.haskell, Score: 20, Comments: 5
     Original: [33] http://goo.gl/BmcKWr
     On Reddit: [34] http://goo.gl/BmcKWr

   * Haskell Symposium talk on inline Objective-C in Haskell
     Domain: speakerdeck.com, Score: 20, Comments: 0
     Original: [35] http://goo.gl/VDHOiP
     On Reddit: [36] http://goo.gl/TyL90G

   * HaLVM / Unikernel talk at the Xen User Summit on Monday, September 15th
     Domain: sched.co, Score: 19, Comments: 8
     Original: [37] http://goo.gl/HoVwWT
     On Reddit: [38] http://goo.gl/9lqCE0

   * Fun with (Extended Kalman) Filters
     Domain: idontgetoutmuch.wordpress.com, Score: 18, Comments: 2
     Original: [39] http://goo.gl/8EGSQR
     On Reddit: [40] http://goo.gl/aTASRU

Top StackOverflow Questions

   * Why does OCaml sometimes require eta expansion?
     votes: 12, answers: 1
     Read on SO: [41] http://goo.gl/TsBuz5

   * Can Haskell evaluate and not garbage collect random indexes in a list?
     votes: 11, answers: 2
     Read on SO: [42] http://goo.gl/zXsBT1

   * How do I install dependencies when cross compiling haskell code?
     votes: 10, answers: 1
     Read on SO: [43] http://goo.gl/3qH6zK

   * Haskell lenses: how to make view play nicely with traverse?
     votes: 10, answers: 3
     Read on SO: [44] http://goo.gl/EWrR5j

   * Is there an instance of Monad but not of MonadFix?
     votes: 10, answers: 2
     Read on SO: [45] http://goo.gl/EAh0qc

   * How can the continuation monad be expressed using the free monad?
     votes: 10, answers: 3
     Read on SO: [46] http://goo.gl/ymMoFw

Until next time,
[47]+Daniel Santa Cruz



Haskell mailing list
Haskell <at> haskell.org
Stefan Wehr | 17 Sep 11:01 2014

ANN: HacBerlin - Haskell Hackathon in Berlin, 26-28 Sep 2014

Hi everyone,

this is just a quick reminder: The Haskell Hackathon in Berlin starts
in 9 days and there are very few places left. Please register now:

Where: Berlin, Germany
When:  Fri 26 - Sun 28 September 2014

We will do lots of Haskell hacking and listen to two excellent talks:

* Beyond Parsec -- Revisiting Parser Combinators, by Andres Löh
* Chordify: Advanced Functional Programming for Fun and Profit, by
José Pedro Magalhães

Meet in Berlin, discuss, hack together and improve the Haskell
infrastructure. We welcome all programmers interested in Haskell,
beginners and experts!

For all details, visit our wiki page
(http://www.haskell.org/haskellwiki/HacBerlin2014) and make sure to
register now!

Stefan Wehr | 17 Sep 10:41 2014

[ANN] BOB 2015: Call for Contributions

Here's a quick reminder. The Deadline for BOB 2015 is in about two
weeks (30 September 2014). The BOB conference will have a strong focus
on functional programming, so Haskell submissions are very welcome.

Please consider submitting!

                         BOB Conference 2015
                       CALL FOR CONTRIBUTIONS
               English: http://bobkonf.de/2015/cfp.html
                German: http://bobkonf.de/2015/cfp.html
                    Deadline: September 30, 2014

You drive advanced software engineering methods, implement ambitious
architectures and are open to cutting-edge innovation? Attend this
conference, meet people that share your goals, and get to know the
best software tools and technologies available today. We strive to
offer you a day full of new experiences and impressions that you can
use to immediately improve your daily life as a software developer.

If you share our vision and want to contribute, submit a proposal for
a talk or tutorial!

We are looking for talks about best-of-breed software technology,

- functional programming
- reactive programming
- micro-service architectures
- persistent data structures and databases
- ...  everything really that isn't mainstream, but you think should

Presenters should provide the audience with information that is
practically useful for software developers.  This could take the form of

- experience reports
- introductory talks on technical background
- demos and how-tos

We accept proposals for presentations of 45 minutes (40 minutes talk
+ 5 minutes questions), as well as 90 minute tutorials for beginners.
The language of presentation should be either English or German.
It should include (in your presentation language of choice):

- an abstract of max. 1500 characters.
- a short bio/cv
- contact information (including at least email)
- a list of 3-5 concrete ideas of how your work can be applied in a
developer's daily life
- additional material (websites, blogs, slides, videos of past
  presentations, ...)

You can submit your proposal using the following form:


- direct questions to bobkonf at active minus group dot de
- proposal deadline: September 30, 2014
- notification: October 15, 2014

NOTE: The conference fee will be waived for presenters, but travel
expenses will not be covered.

Program Committee
- Matthias Fischmann, zerobuzz UG
- Matthias Neubauer, SICK AG
- Michael Sperber, Active Group
- Stefan Wehr, factis research

Wissenschaftlicher Beirat
- Annette Bieniusa, TU Kaiserslautern
- Torsten Grust, Uni Tübingen
- Peter Thiemann, Uni Freiburg
Francesco Calimeri | 16 Sep 23:00 2014

LPNMR 2015 - Preliminary Call for Papers - 13th International Conference on Logic Programming and Non-monotonic Reasoning

[apologies for any cross-posting]

                               Call for Papers

                       13th International Conference on
                Logic Programming and Non-monotonic Reasoning
                                 LPNMR 2015


                              Lexington, KY, USA
                            September 27-30, 2015

   (Collocated with the 4th Conference on Algorithmic Decision Theory 2015)


 LPNMR 2015 is the thirteenth in the series of international meetings on
 logic programming and non-monotonic reasoning. LPNMR is a forum for
 exchanging ideas on declarative logic programming, non-monotonic reasoning,
 and  knowledge representation. The aim of the conference is to facilitate
 interactions between researchers and practitioners interested in the
 design and implementation of logic-based programming languages and
 database systems, and those working in knowledge representation and
 nonmonotonic reasoning. LPNMR strives to encompass theoretical and
 experimental studies that have led or will lead to the construction of
 systems for declarative programming and knowledge representation, as well
 as their use in practical applications. This edition of LPNMR will feature
 several workshops, a special session dedicated to the 6th ASP Systems
 Competition, and will be collocated with the 4th Algorithmic Decision
 Theory Conference, ADT 2015. Joint LPNMR-ADT Doctoral Consortium will be
 a part of the program.

 Authors are invited to submit papers presenting original and unpublished
 research on all aspects of non-monotonic approaches in logic programming
 and knowledge representation. We invite submissions of both long and
 short papers.


 Conference topics include, but are not limited to:

 1. Foundations of LPNMR Systems:
   * Semantics of new and existing languages;
   * Action languages, causality;
   * Relationships among formalisms;
   * Complexity and expressive power;
   * Inference algorithms and heuristics for LPNMR systems;
   * Extensions of traditional LPNMR languages such as new logical
     connectives or new inference capabilities;
   * Updates, revision, and other operations on LPNMR systems;
   * Uncertainty in LPNMR systems.

 2. Implementation of LPNMR systems:
   * System descriptions, comparisons, evaluations;
   * Algorithms and novel techniques for efficient evaluation;
   * LPNMR benchmarks.

 3. Applications of LPNMR:
   * Use of LPNMR in formalization of Commonsense Reasoning and other
     areas of KR;
   * LPNMR languages and algorithms in planning, diagnosis, argumentation,
     reasoning with preferences, decision making and policies;
   * Applications of LPNMR languages in data integration and exchange
     systems, software engineering and model checking;
   * Applications of LPNMR to linguistics, psychology, and other sciences
   * Integration of LPNMR systems with other computational paradigms;
   * Embedded LPNMR: Systems using LPNMR subsystems.


 LPNMR 2015 welcomes submissions of long papers (13 pages) or short papers
 (6 pages) in the following categories:

   * Technical papers
   * System descriptions
   * Application descriptions

 The indicated number of pages includes title page, references and
 figures. All submissions will be peer-reviewed and accepted papers will
 appear in the conference proceedings published in the Springer-Verlag
 Lecture Notes in Artificial Intelligence (LNAI/LNCS) series. At least one
 author of each accepted paper is expected to register for the conference
 to present the work. Submissions must be formatted according to the
 Springer LNCS author instructions,


 must be written in English, and present original research. Paper
 submission will be electronic through the LPNMR-15 Easychair site:


 The Program Committee chairs are planning to arrange for the best papers to
 be published in a special issue of a premiere journal in the field.


 LPNMR 2015 will not accept any paper which, at the time of submission, is
 under review or has already been published or accepted for publication in
 a journal or another conference. Authors are also required not to submit
 their papers elsewhere during LPNMR's review period. However, these
 restrictions do not apply to previous workshops with a limited audience
 and without archival proceedings.


  WORKSHOPS - LPNMR 2015 will include specialized workshops to be held
on September 27
  prior to the main conference. Currently planned workshops include:

  - Grounding, Transforming, and Modularizing Theories with Variables
    Organizers: Marc Denecker, Tomi Janhunen

  - Action Languages, Process Modeling, and Policy Reasoning
    Organizer: Joohyung Lee

  - Natural Language Processing and Automated Reasoning
    Organizers: Marcello Balduccini, Ekaterina Ovchinnikova, Peter Schueller

  - Learning and Nonmonotonic Reasoning
    Organizers: Alessandra Russo and Alessandra Mileo

  ASP COMPETITION - A special session dedicated to a discussion of the
  6th ASP System Competition, including the methodology of the competition,
  benchmarks used, lessons learned and, most importantly, the results and
  the announcement of the winners.

  ALGORITHMIC DECISION THEORY (ADT) 2015 (collocated - same time and place)
  Algorithmic Decision Theory is a vibrant and growing area of research
  concerned with algorithmic aspects of problems arising in social choice
  and economics that involve optimal ways to aggregate preferences. The
  area abounds in hard computational problems and may be an axciting area
  of applications for ASP. The two conferences will seek ways to identify
  and promote synergies between their respective areas of focus.


  Details to be announced

  - Esra Erdem (LPNMR), Sabanci University, Turkey
  - Nick Mattei (ADT), NICTA, Australia


   * Paper registration: April 13, 2015
   * Paper submission:   April 20, 2015
   * Notification:       June 1, 2015
   * Final versions due: June 15, 2015


Lexington is a medium size, pleasant and quiet university town. It
is located in the heart of the so-called Bluegrass Region in
Central Kentucky. The city is surrounded by beautiful horse farms
on green pastures dotted with ponds and traditional architecture
stables, and small race tracks, and bordered by white or black
fences. The Horse Museum is as beautifully located as it is
interesting. Overall, the city has a nice feel that mixes well old
and new. The conference will be held in the Hilton Lexington
Downtown hotel.

 Victor Marek, University of Kentucky, KY, USA


 Giovambattista Ianni, University of Calabria, Italy
 Mirek Truszczynski, University of Kentucky, KY, USA


 Yuliya Lierler, University of Nebrska at Omaha, NE, USA


 Francesco Calimeri, University of Calabria, Italy


 Agostino Dovier, Università di Udine, Italy
 Agustín Valverde, Universidad de Màlaga, Spain
 Alessandra Mileo, National University of Ireland, Galway, INSIGHT
Centre for Data Analytics, Ireland
 Andrea Formisano, Dip. di Matematica e Informatica, Università di
Perugia, Italy
 Axel Polleres, Vienna University of Economics and Business, Austria
 Bart Bogaerts, Department of Computer Science, KU Leuven, Belgium
 Chiaki Sakama, Wakayama University, Japan
 Chitta Baral, Arizona State University, USA
 Christoph Redl, Vienna University of Technology, Austria
 Daniela Inclezan, Miami University, USA
 David Pearce, Universidad Politécnica de Madrid, Spain
 Emilia Oikarinen, Aalto University, Finland
 Enrico Pontelli, New Mexico State University, USA
 Esra Erdem, Sabanci University, Istanbul, Turkey
 Eugenia Ternovska, Simon Fraser University, Canada
 Fangkai Yang, The University of Texas at Austin, USA
 Fangzhen Lin, Hong Kong University of Science and Technology, Hong Kong
 Francesco Calimeri, Università della Calabria, Italy
 Gerhard Brewka, Leipzig University, Germany
 Giovanni Grasso, Oxford University, UK
 Hannes Strass, Leipzig University, Germany
 Hans Tompits, Vienna University of Technology, Austria
 James Delgrande, Simon Fraser University, Canada
 Jia-Huai You, University of Alberta, Canada
 Joohyung Lee, Arizona State University, USA
 Jose Julio Alferes, Universidade Nova de Lisboa, Portugal
 Kewen Wang, Griffith University, Australia
 Marc Denecker, K.U.Leuven, Belgium
 Marcello Balduccini, Drexel University, USA
 Marina De Vos, University of Bath, UK
 Martin Gebser, University of Potsdam, Germany
 Matthias Knorr, CENTRIA, Universidade Nova de Lisboa, Portugal
 Mauricio Osorio, Fundacion de la Universidad de las Americas, Puebla, Mexico
 Michael Fink, Vienna University of Technology, Austria
 Michael Gelfond, Texas Tech University, USA
 Orkunt Sabuncu, University of Potsdam, Germany
 Paul Fodor, Stony Brook University, USA
 Pedro Cabalar, University of Corunna, Spain
 Saadat Anwar, Arizona State University, USA
 Stefan Woltran, Vienna University of Technology
 Stefania Costantini, Dipartimento di Ingegneria e Scienze
dell'Informazione, e Matematica, Univ. di L'Aquila, Italy
 Terrance Swift, CENTRIA, Universidade Nova de Lisboa, Portugal
 Thomas Eiter, Vienna University of Technology, Austria
 Tomi Janhunen, Aalto University, Finland
 Torsten Schaub, University of Potsdam, Germany
 Vladimir Lifschitz, University of Texas at Austin, USA
 Wolfgang Faber, University of Huddersfield, UK
 Yi Zhou, University of Western Sydney, Australia
 Yisong Wang, Guizhou University, China
 Yuliya Lierler, University of Kentucky, USA


 lpnmr2015 <at> mat.unical.it
Haskell mailing list
Haskell <at> haskell.org
Henning Thielemann | 15 Sep 19:11 2014

ANN: patch-image

Right after the announcement of the latest version of Accelerate I like 
to announce an application build using that framework:

"patch-image" assembles a big image from several overlapping parts.


Now, let me extract the beginning of the docs:

   Compose a collage from overlapping image parts.
   In contrast to Hugin,
   this is not intended for creating panoramas from multiple photographies,
   but instead is specialised to creating highly accurate reconstructions
   of flat but big image sources, like record covers, posters or newspapers.
   It solves the problem that your scanner may be too small
   to capture a certain image as a whole.
   This is the workflow:
   Scan parts of an image that considerably overlap.
   They must all be approximately oriented correctly.
   The program uses the overlapping areas for reconstruction
   of the layout of the parts.
   If all parts are in the directory  <at> part <at> 
   then in the best case you can simply run:
   > patch-image --output=collage.jpeg part/*.jpeg
   If you get blurred areas,
   you might enable an additional rotation correction:
   > patch-image --finetune-rotate --output=collage.jpeg part/*.jpeg

Currently it depends on CUDA although this is not strictly necessary.
German Vidal | 11 Sep 13:19 2014

PhD position - Computer assisted validation in Erlang

PhD scholarship at MiST, DSIC (Universitat Politecnica de Valencia, Spain)

Computer assisted validation in Erlang

A fully-funded PhD position to start in early 2015.


The common goal of the MiST research group is the development of
techniques for assisting the construction of reliable software through
all phases of its life cycle. We aim at providing a solid formal basis
for our developments which would allow us to formally prove the
correctness and effectiveness of the techniques. The group keeps a
balance between theoretical and practical developments.

We have a new doctoral position available to start in early 2015.
Candidates should be motivated to successfully complete a full
Doctoral degree program.  The PhD scholarship will cover a four-year
period and is linked to a research project (see below) funded within
the National Plan for Research and Development. The successful
applicant will receive high level doctoral training in close
interaction with her/his direct supervisor and other project
researchers. Each scholarship includes a PhD fees exemption, an annual
salary of EUR 16422 (divided in 14 payments) and social security
entitlements. The possibility to apply for additional funding to cover
the cost of international stays of up to three months per year is also
associated with each PhD scholarship. Furthermore, travelling costs
for attending conferences and schools, computer equipment, etc., is
also covered by the group.

CAVI project

We live in a digital society in which the software reliability has
become a crucial aspect, both because the risks for human lives that a
software bug may cause and also for its associated economic cost. Most
current software products use heterogenous technologies and different
programming languages that are glued together by means of complex
mechanisms. This complexity, together with the fact that most software
components are made by third-party developers, makes the software
validation tasks a true challenge for software development companies
in terms of cost. However, validation tasks are crucial for
guaranteeing the quality of the software products. In this project, we
aim at advancing the knowledge and technology within the area of
software validation at different levels:

- Software testing. This is the technology most commonly used by the
software industry to prevent errors during the software
development. The controlled execution of a number of tests allows one
to validate, to some extent, the correctness of the software

- Formal verification. The main drawback of the previous technique is
that, despite the fact that they can be very helpful to locate the
bugs of a program, they cannot be used to ensure that a program is
error-free. Therefore, we will also consider formal verification
techniques that finitely approximate (by means of static analysis,
abstract interpretation, constraints, etc.) the possible executions of
a program. Thus, we may obtain a total assurance of the correctness of
a program, which makes these techniques specially adequate for
validating critical software.

- Program debugging. Complementary to the previous methods, we can
also find a number of debugging techniques that help the programmer to
detect and locate the most common program errors. 

We plan to apply most of our developments to the functional and
concurrent programming language Erlang; see, e.g.,

Applications and evaluation criteria

Formal applications for the PhD scholarships must be made online,
through the framework of the Spanish National Program for Training of
Researchers (FPI program):


In particular, in the above URL you can find:

- General requirements (basically, you should be already accepted
and/or enrolled in a PhD program)

- Frequently asked questions

- The online application site (you need to sign up first and then add
mainly the following documents: copy of your passport-in case you're
not spanish-, updated CV, academic certifications of your graduate
and master degrees, copy of the acceptance/registration to a PhD

Unfortunately, all the available information is only in Spanish.
Nevertheless, we will happy to help you with the process, so don't
hesitate to ask us for clarifications and help with the online
application in case you are interested.

Evaluation criteria:

- Academic performance and achievements of the candidate

- Knowledge on functional and/or logic programming paradigms
(including Erlang, Haskell and/or Prolog programming languages).

- Willingness to undertake research visits of up to three months in
other countries.

- Ability to write and interact in English.

Interested candidates are invited to contact German Vidal via email 
(gvidal <at> dsic.upv.es). 

Please note that the deadline for the application is approaching soon!
Liu Yang (Asst Prof | 11 Sep 10:50 2014

ICFEM 2014 Call for Participation

16th International Conference on Formal Engineering Methods

ICFEM 2014, Luxembourg, 3-7 November 2014


Call for Participation




The 16th International Conference on Formal Engineering Methods (ICFEM

2014) will be held at the Melia Hotel in Luxembourg, Luxembourg from

3rd November to 7 November 2014. Since 1997, ICFEM has been serving as

an international forum for researchers and practitioners who have been

seriously applying formal methods to practical applications.





+ Keynote speakers: Nikolaj Bjorner (Microsoft Research), Lionel

Briand (University of Luxembourg) and Vincent Danos (University of


+ A provisional programme and the list of accepted paper are now available

(http://icfem2014.uni.lu/program.php, http://icfem2014.uni.lu/accepted.php)

+ Early registration by September 27, 2014




PC Chairs


+ Stephan Merz (INRIA, France)

+ Jun Pang (University of Luxembourg, Luxembourg)

CONFIDENTIALITY:This email is intended solely for the person(s) named and may be confidential and/or privileged.If you are not the intended recipient,please delete it,notify us and do not copy,use,or disclose its contents.

Towards a sustainable earth:Print only when necessary.Thank you.
Haskell mailing list
Haskell <at> haskell.org
Stephen Britton | 8 Sep 00:25 2014

ANNOUNCE: New Hackage release - LargeCardinalHierarchy-0.0.1

Shalom Fellow Haskellers,

 I just uploaded my first documented Hackage release, the LargeCardinalHierarchy.hs package. I wrote this program four years ago during my junior year of university. It is a simple transfinite cardinal arithmetic library for all large cardinals listed on the following Wikipedia page:

The documentation was generated using Haddock 2.11.0 and the source code was written under GHC 6.8.2.

Stephen E. A. Britton
Haskell mailing list
Haskell <at> haskell.org
Jurriaan Hage | 6 Sep 14:45 2014

ANN: Helium now available from Hackage

Dear Haskellers,

I am happy to inform you that the programmer-friendly Helium Haskell compiler, known for its focus on error messages
and hints, domain specific type error diagnosis, and its compilation logging facility, is now available
from Hackage.

All you need to do is

cabal install helium
cabal install lvmrun

and you should be ready to go. The system has been tested under various instances of Windows, Mac, and Linux.

To use Helium, there is a texthint program that is much like ghci (but less powerful), and a runhelium program
that behaves like runhaskell. 

NB. the Hint environment is not yet availalble in this way (and, being pure Java, I am not sure if we will make
available in this way), and the server for logging the compiled programs is also not made available in this
If you have a need for either of these, please e-mail me. 

There is a website too:

To dispell one of the frequent misunderstandings about Helium: Helium DOES support a form of overloading.
But overloading is restricted to specific classes: Num, Eq, Ord, Show and Enum, with instances
for Eq and Show being derived, and for the others the instances are fixed. In other words: you can't write
your own
classes and instances. If you want, you can turn overloading off entirely, and profit from better error messages.

Any feedback is appreciated. Replying to this e-mail will do, or mail us at helium <at> cs.uu.nl .

Jurriaan Hage writing for the Helium Team

PS. no need to bother telling us about the warnings you get when compiling with GHC 7.8.x. We know about 
them, and they will be fixed in a future release. As it happens, we prepared this version of Helium with GHC 7.6.3.