headers
Frederic Blanqui | 7 Jan 2010 09:26
Picon
Picon
Favicon

HOR 2010 1st CALL FOR ABSTRACTS


               **************************************
               *                                    *
               *  HOR 2010  1st CALL FOR ABSTRACTS  *
               *                                    *
               **************************************

      5th International Workshop on Higher-Order Rewriting
                   (Affiliated with RTA'2010)
              Wednesday July 14, 2010, Edinburgh, UK

                 http://hor.pps.jussieu.fr/10/

IMPORTANT DATES:
  March   25, 2010 : deadline electronic submission of paper
  April   20, 2010 : notification of acceptance of papers
  May     17, 2010 : deadline for final version of accepted papers

HOR 2010 is a forum to present work concerning all aspects
of higher-order rewriting. The aim is to provide an informal and
friendly setting to discuss recent work and work in progress.

HOR 2010 is part of FLoC 2010 in Edinburgh.
HOR 2007 was part of RDP 2007 in Paris, France.
HOR 2006 was part of FLoC 2006 in Seattle, USA.
HOR 2004 was part of RDP 2004 in Aachen, Germany.
HOR 2002 was part of FLoC 2002 in Copenhagen, Denmark.

TOPICS of interest include (but are not limited to):
  APPLICATIONS:   proof checking, theorem proving, generic programming,
(Continue reading)

Permalink | Reply | 0 comments |
headers
Bas van Dijk | 7 Jan 2010 11:50
Picon
Gravatar

ANNOUNCE: safer-file-handles-0.1

Hello,

I'm happy to announce another member in the 'monadic regions' family:
safer-file-handles:

http://hackage.haskell.org/package/safer-file-handles-0.1

The package uses my 'regions' and 'explicit-iomodes' packages to add
two safety features on top of the regular System.IO file handles and
operations:

 * Regional file handles. Files must be opened in a region. When the
region terminates all opened files are automatically closed. The main
advantage of regions is that the handles to the opened files can not
be returned from the region which ensures no I/O with closed files is
possible.

 * Explicit IOModes. The regional file handles are parameterized by
the IOMode in which they were opened. All operations on handles
explicitly specify the needed IOMode. This way it is impossible to
read from a write-only handle or write to a read-only handle for
example.

The primary technique used in this package is called "Lightweight
monadic regions" which was invented by Oleg Kiselyov and Chung-chieh
Shan. See:

http://okmij.org/ftp/Haskell/regions.html#light-weight

This technique is implemented in the 'regions' package which is
(Continue reading)

Permalink | Reply | 0 comments |
headers
Mario Blažević | 8 Jan 2010 01:29
Favicon

ANN: Streaming Component Combinators 0.4

Version 0.4 of Streaming Component Combinators, or SCC for short, has
been released on Hackage. Get it at

http://hackage.haskell.org/package/scc

    There isn't much new high-level functionality compared to the
previous version, but the implementation has been heavily refactored and
the foundations completely replaced.

    I'm particularly happy to have found a way to drop the ugly reliance
on Data.Dynamic and to encode the required constraints in the type
system instead. The foundation of streaming components in this version
is the new Control.Concurrent.Coroutine module, whose main export is the monad
transformer Coroutine. It can transform any monad into a suspendable, resumable,
trampoline-style-runnable monad. Coroutines can be nested, which was the
requirement for streaming and the main stumbling block for the implementation.
The solution, worth at least 10 milliOlegs according to my estimate, was to
parameterize the Coroutine with a functor that wraps the coroutine suspension,
and to use nested functors for suspension from nested coroutines. The type system
automatically figures out how many wrappings to apply to each suspension
depending on how many intermediate coroutines it suspends.

   In other news is the project's Wiki page at
http://trac.haskell.org/SCC/wiki/. It's still rudimentary, but growing.

   All feedback will be appreciated.
Permalink | Reply | 0 comments |
headers
Ivan Lazar Miljenovic | 8 Jan 2010 15:08
Picon
Gravatar

ANNOUNCE: SourceGraph-0.6.0.0 and Graphalyze-0.9.0.0

I'm pleased to announce the latest releases of SourceGraph [1] and
Graphalyze [2].

[1]: http://hackage.haskell.org/package/SourceGraph
[2]: http://hackage.haskell.org/package/Graphalyze

SourceGraph is a program that performs static code analysis on Haskell
projects on the by applying graph theoretic techniques to the project's
call graph.  Graphalyze is a library for analysing discrete data using
graph theory, and as such performs the heavy lifting for SourceGraph.

Sample analysis reports generated by SourceGraph are available at
http://code.haskell.org/~ivanm/Sample_SourceGraph/SampleReports.html .
I will also be demoing SourceGraph at PEPM [3] in Madrid on 19 January.

[3]: http://www.program-transformation.org/PEPM10/

Changes since the previous version include:

* Now supports "implicitly exported" entities (as requested by Curt
  Sampson).  This includes instantiated class methods from other
  modules and functions, etc. that start with an underscore (see
  http://www.haskell.org/ghc/docs/latest/html/users_guide/options-sanity.html
  for more information).

* All inaccessible entities are now reported, not just those that were
  root nodes in the call graph.

* Edges are now colour-coded based upon whether they are part of a
  clique, cycle or a chain.
(Continue reading)

Permalink | Reply | 4 comments |
headers
Emilio Tuosto | 9 Jan 2010 12:59
X-Face
Picon
Picon
Favicon

Last CfP for TGC 2010: EXTENDED deadline Jan. 20 2010

Due to several requests, the TGC'10 chairs have decided to extend the 
deadline for submsissions to January 20th

================================================================
                         Call for Papers

                             TGC 2010
                   Fifth International Symposium on
                     TRUSTWORTHY GLOBAL COMPUTING

                   http://www.pst.ifi.lmu.de/tgc2010
                   LMU, Munich, February 26-26, 2010
----------------------------------------------------------------
          co-located with the review of FP6 GCII projects
                       AEOLUS and SENSORIA
================================================================

IMPORTANT DATES
---------------
Paper submissions:          January 20, 2010 EXTENDED
Final version (pre-proc.):  February, 2010
Conference:                 February 24-26, 2010
Final version (post-proc.): March 22, 2010

SCOPE
------
The Symposium on Trustworthy Global Computing is an international
annual venue dedicated to safe and reliable computation in global
computers. It focuses on providing frameworks, tools, and protocols
for constructing well-behaved applications and on reasoning rigorously
(Continue reading)

Permalink | Reply | 0 comments |
headers
Johan Jeuring | 10 Jan 2010 20:09
Picon

ANNOUNCE: Palindromes 0.2


Palindromes 0.2
==============================================

Palindromes is a package for finding palindromes in files.

Palindromes 0.2 is now available on hackage.

Visit the homepage

   http://www.jeuring.net/Palindromes/

In version 0.2, the following features have been added:

- Read from standard input, via the flag -i
- More flexible flag handling
- Read multiple files
- Specify minimum length of palindromes returned, via the flag -m int

For more information, consult the README file in the distribution.

-- Johan Jeuring
Permalink | Reply | 0 comments |
headers
Torsten Grust | 11 Jan 2010 22:05
Picon
Gravatar

Open Position (PhD student or Postdoc), U Tübingen, Germany 

 [ Dear Haskellers!  This job opening may sound a bit database-ish
   on a first read, but there is lots of Haskell and functional
   programming inside.  Please contact me if you're in doubt.

   Best wishes, --Torsten ]

                    Join us on the fringes between
                  database and programming languages

The Database Systems Research Group (Prof. Torsten Grust) at the
Wilhelm-Schickard-Institute for Computer Science of Eberhard Karls 
Universität Tübingen, Germany, opens a position for a

                          Research Assistant
         (PhD student or Postdoc level, three-year, full-time)

in the Ferry research project[1]. Ferry explores how far we can push the
idea of relational database engines that support the super-fast
execution of programs written in a variety of programming languages. Our
current focus is on LINQ, Ruby, and Philip Wadler's Links, but consider
this list as open-ended.

= DATABASE-SUPPORTED PROGRAM EXECUTION =

We search for, design, and implement new compilation strategies that map
data types and idioms prevalent in (functional) programming and
scripting languages into efficient database queries. Ferry targets
off-the-shelf SQL database systems as well as a number of off-beat
database engines (e.g., X100, MonetDB, or kdb+).
(Continue reading)

Permalink | Reply | 0 comments |
headers
Julien Verlaguet | 12 Jan 2010 01:13
Picon

Job at Mylife

Dear Haskell Programmers,

Our company, MyLife, is continuing to seek OCaml programmers to expand our
team in the Silicon Valley.

We develop back-end people search technologies and the vast majority of our
code is written in Objective Caml and runs on Linux.  We love that as it
provides us with an opportunity to tackle on big challenges with great
productivity.  We are now looking for talented and passionate people to share
the fun in Mountain View, California.


The primary requirements for the job are:

- proficiency in a functional programming language and eventually OCaml

- familiarity with Linux and shell scripting

- proficiency in written English, as much of our team communications are
written (brainstorms, bug reports, etc.)

- ability to understand end-user requirements and translate them into robust
software that gets the job done

The ideal candidate will have a good nose for hunting bugs, diagnosing
performance problems, and hacking his/her way through colleagues' code.


Please contact us at ocaml-job <at> mylife.com if you are interested or might be
interested in the future.



Julien
_______________________________________________
Haskell mailing list
Haskell <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Permalink | Reply | 0 comments |
headers
John Hughes | 12 Jan 2010 14:36
Picon
Picon

AST 2010 reminder--call for papers and presentations

Just a reminder: the submission deadline for AST 2010 (Automation of Software Test 2010, associated with ICSE 2010 in Cape Town) is only a week away. If you’re planning to submit a paper or a presentation for the workshop, then now’s the time to be putting it together!

 

http://www.cs.allegheny.edu/ast2010/

 

John Hughes

_______________________________________________
Haskell mailing list
Haskell <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Permalink | Reply | 0 comments |
headers
Malcolm Wallace | 13 Jan 2010 18:27
Picon

ANN: HaXml-1.20.1

I am pleased to announce a new, stable, release of HaXml.  (Actually,  
1.20 has been available for some time, but I am just getting round to  
the announcement, and a fresh bugfix means a version bump to 1.20.1.)

                                    HaXml-1.20.1
                                    ------------
                              http://haskell.org/HaXml
                      http://hackage.haskell.org/package/HaXml

If you have been using the previous stable version, 1.13.x, you are  
strongly encouraged to upgrade, as no further bugfixes will be back- 
propagated.  (Ideally, Cabal and Hackage should also now cease to  
recommend 1.13.x as a preferred version, but I do not know how to  
change that.  A simple "cabal install HaXml" will unfortunately still  
find 1.13.x, so please use "cabal install HaXml-1.20.1" with explicit  
version number.)

There have been significant API changes since 1.13.x, and a brief  
migration guide is included on the website.  In summary:

     * There is a SAX-like stream parser.
     * Ordinary parsing of XML documents can now also be lazy.
     * Some types have changed.
     * Some old classes have been re-arranged into a single new class.

Regards,
     Malcolm
Permalink | Reply | 1 comment |

Gmane