July 2009 - Haskell - Haskell.org

NASSLLI 2010 call for course and workshop proposals
by Chung-chieh Shan 09 Jul '09

09 Jul '09

NASSLLI 2010 North American Summer School in Logic, Language and Information 2010 June 21-26, Indiana University CALL for COURSE and WORKSHOP PROPOSALS The fourth NASSLLI (after previous editions at Stanford University, Indiana University, and UCLA) will return to Bloomington, Indiana, June 21-25, 2010. The summer school, loosely modeled on the long-running ESSLLI series in Europe, will consist of a number of courses and workshops, selected on the basis of the proposals. By default, courses and workshops meet for 90 or 120 minutes on each of five days. Proposals are invited that present interdisciplinary work between the areas of logic, linguistics, computer science, cognitive science, philosophy and artificial intelligence, though work in just one area is within the scope of the summer school if it can be applied in other fields. Examples of possible topics (adapting from previous NASSLLI courses) would include e.g. logics for communication, computational semantics, game theory (for logic, language and/or computation), dynamic semantics, modal logics, linear logic, machine learning techniques, statistical language models, and automated theorem proving. We encourage potential course or workshop contributors to check out previous programs at: http://www.linguistics.ucla.edu/nasslli04/program.html http://www.stanford.edu/group/nasslli/ http://www.indiana.edu/~nasslli/2003/program.html Courses and workshops should aim to be accessible to an interdisciplinary, graduate level audience. Courses may certainly focus on a single area, but lecturers should then include introductory background, try to avoid specialized notation that cannot be applied more widely, and spend time on the question of how the topic is relevant to other fields. A workshop can be more accessible if its program is bracketed by broader-audience talks that introduce and summarize the week's presentations. Associated Workshops/Conferences: In addition to courses and workshops taking place during the main NASSLLI five day session, Indiana University welcomes proposals for 1-3 day workshops or conferences hosted on campus immediately before or after the summer school, thus on the weekends of June 18-20 and June 27-29 2010. Previous such associated meetings have included a Mathematics of Language conference and Theoretical Aspects of Reasoning About Knowledge (TARK). Submission Details: Submissions should be by email, and should indicate 1) person(s) and affiliation 2) type of event (course or workshop; main session or weekend workshop/conference) 3) an outline of the course up to 500 words 4) an indication of whether special equipment is needed to teach that course (beamer, computer ...) 5) a statement about the instructor's experience in teaching in interdisciplinary settings 6) expected costs (whether you want to be paid hotel and/or travel, and descriptions of funding in hand or for which you will apply) Financial Details: A course may be taught by one or two persons. Conference fees are waived for all instructors. However, we are only able to pay for the full travel and expenses of one instructor per course. If two persons are lecturing, they may share a lump sum paid for both. We must also stress that while proposals from all over the world are welcomed, the Summer School can in general guarantee only toreimburse travel costs for travel from destinations within North America to Bloomington, although exceptions can be made depending on the financial situation. Furthermore, we encourage all lecturers to fund their own travel if this is feasible, since this will allow us to use our available funding for student scholarships. Workshops are more complicated financially than courses, and a proposal for a workshop should include a plan to obtain some outside funding for the speakers. Notifications of Interest: To give us an idea about the number of submissions, we would like you to email us, ideally within two weeks, in case you are interested in submitting a proposal. This will not commit you to actually submit one (and not emailing in advance does not preclude you from submitting a full proposal). Schedule: Jun 18 on, 2009 - unofficial notifications of intention to submit; Sep 15, 2009 - Deadline for submissions; Nov 1, 2009 - Course/workshop proposers notified of p.c. decisions; Nov 15, 2009 - Official announcement of program; May 15, 2009 - Material for courses available for printing; Jun 21, 2010 - Start of NASSLLI 2010 courses. Program Committee: David Beaver (committee chair), UT Austin Thony Gillies, Rutgers University John Horty, University of Maryland Sandra Kuebler, Indiana University Eric Pacuit, Stanford University Chris Potts, Stanford University Dan Roth, University of Illinois, Urbana/Champaign Chung-Chieh Shan, Rutgers University Matthias Scheutz, Indiana University Standing NASSLLI Steering Committee: David Beaver, UT Austin Larry Moss (committee chair), Indiana University Phokion Kolaitis, UC Santa Cruz / IBM Almaden Research Center Valeria de Paiva, Cuill Inc. Stuart Shieber, Harvard University Moshe Vardi, Rice University Website: News will be posted at: http://www.indiana.edu/~nasslli Inquiries: General inquiries regarding NASSLLI 2010, notifications of interest in course or workshop proposal submission, and final submissions of proposals should be directed to: nasslli AT indiana.edu Informal inquiries regarding potential courses or workshops may also be directed to: David Beaver, dib AT mail.utexas.edu (with "NASSLLI" in the subject line). Principal local organizers at Indiana University are Markus Dickinson, Sandra Kuebler, and Larry Moss, and they can be contacted via the main alias: nasslli AT indiana.edu

1 0

ANN: Hayoo! beta 0.4
by Timo B. Hübel 09 Jul '09

09 Jul '09

Hello! We are pleased to announce the next beta version 0.4 of Hayoo!, the Haskell API search engine with find-as-you-type and suggestions. Visit Hayoo! here: http://holumbus.fh-wedel.de/hayoo This release includes some major changes to the web interface: - The full description of a function can now be displayed upon request, using the small "+" symbol in front of the description text - The most common root modules for all functions found are shown as list, providing a shortcut for further restricting the current query - Some example queries on the start page for easier use of Hayoo! Additionally, we have again updated the search index. It contains all packages from Hackage as well as gtk2hs as of 06.07.2009, a total of 111.946 function and type definitions. Please let us know about any problems, hints and suggestions. Happy hacking, Timo

2 1

ANN: hsparql, a SPARQL query generator/DSL and client
by Jeff Wheeler 09 Jul '09

09 Jul '09

I'm excited to announce the first version of hsparql. HSparql makes it easy to query SPARQL-compliant servers using a relatively intuitive DSL and very simple client. SPARQL is a SQL-ish query language for stores of RDF data. So, SPARQL lets you search the structured data in several big databases. I wrote it so that I could search DBpedia [1], a neat site that pulls structured data from Wikipedia's infoboxes, and also ties it to remote data services like MusicBrainz and US Census information. HSparql isn't tied to DBpedia in any way, though, and can search any server. The DSL looks something like this: > simple :: Query [Variable] > simple = do > resource <- prefix (iriRef "http://dbpedia.org/resource/") > dbpprop <- prefix (iriRef "http://dbpedia.org/property/") > foaf <- prefix (iriRef "http://xmlns.com/foaf/0.1/") > > x <- var > name <- var > page <- var > > triple x (dbpprop .:. "genre") (resource .:. "Web_browser") > > triple x (foaf .:. "name") name > triple x (foaf .:. "page") page > > return [name, page] It's currently available on Hackage [2], and at the moment the source is only available from the tarball hosted there. I'd greatly appreciate any feedback on this package. Thanks! Jeff Wheeler [1] http://dbpedia.org/ [2] http://hackage.haskell.org/package/hsparql

2 1

Haskell Hack Day, Edinburgh, 30 August 2009
by Eric Kow 08 Jul '09

08 Jul '09

Dear Haskellers, I am pleased to report that we will be having a Haskell Hack Day in Edinburgh, on Sunday 30 August (before the ICFP begins). The day will be held at the ICFP conference venue, the Royal College of Physicians. The Hack Day will be free and open to all. Come join us; it'll be a lot of fun! Registration: http://www.haskell.org/haskellwiki/Hac7/Register More information: http://www.haskell.org/haskellwiki/Hac7 Note also, for those of you who want to double your hacking pleasure, we are on the look-out for some local pubs, cafes, etc that we can use for a little pre-Hack-Day-hacking Saturday. Please let us know if you would like to join this expedition as well and if you know of any good places to go. Thanks! Eric -- Eric Kow <http://www.nltg.brighton.ac.uk/home/Eric.Kow> PGP Key ID: 08AC04F9

1 0

ANN: texmath 0.1.0.1 - conversion of LaTeX math to MathML
by John MacFarlane 08 Jul '09

08 Jul '09

I'm pleased to announce an early release of texmath, a Haskell library for converting LaTeX math formulas to MathML. Hackage: http://hackage.haskell.org/package/texmath-0.1.0.1 Github: http://github.com/jgm/texmath/tree/master The package includes a standalone test program, testTeXMathML, and a CGI script, texmath-cgi, that can be used in web apps. This script is used in the demos at http://johnmacfarlane.net/texmath.xhtml http://johnmacfarlane.net/texmath.html texmath supports most of basic LaTeX and AMS extensions, but I'm sure some things have been left out, so let me know if you try a formula that should work but doesn't. John

1 0

ANNOUNCE: sendfile-0.3
by Matthew Elder 08 Jul '09

08 Jul '09

Announcing sendfile-0.3 at http://hackage.haskell.org/package/sendfile-0.3 [ List of Changes ] * The signature for sendFile' has changed it was: Handle -> FilePath -> Int -> Int -> IO () now is: Handle -> Handle -> Int -> IO () This allows you to pass in a handle instead of a FilePath for the infile, and since you can now directly manipulate the infile handle, there is no need for offset (one can use hSeek). * Documentation updated / expanded * fileSize function removed (didn't belong) * Errors are now wrapped in proper errnos (using Foreign.C.Error for nix and Win32.Error for win) and give useful messages on exception. * The Module Name has been changed to reflect its function: it was: SendFile now is: Network.Socket.SendFile Windows and Linux seem to be working well, who wants to contribute patches for BSD and Mac? Much thanks goes to Duncan Coutts for his constructive criticism and feedback on 0.2. As usual, please continue to send bugs / feedback / etc to happs(a)googlegroups.com. Cheers! Matthew Elder

1 0

ANNOUNCE: ChristmasTree 0.1 (excuses for second attempt)
by S.Doaitse Swierstra 07 Jul '09

07 Jul '09

We are pleased to announce the availability of the package "ChristmasTree", which contains the code associated with our paper at the last Haskell symposium: @inproceedings{1411296, author = {Marcos Viera and S. Doaitse Swierstra and Eelco Lempsink}, title = {Haskell, do you read me?: constructing and composing efficient top-down parsers at runtime}, booktitle = {Haskell '08: Proceedings of the first ACM SIGPLAN symposium on Haskell}, year = {2008}, isbn = {978-1-60558-064-7}, pages = {63--74}, location = {Victoria, BC, Canada}, doi = {http://doi.acm.org/10.1145/1411286.1411296}, publisher = {ACM}, address = {New York, NY, USA}, } The name of the package stands for: "Changing Haskell's Read Implementation Such That by Manipulating Abstract Syntax Trees it Reads Expressions Efficiently" which, given the time of year, seems appropriate. Feel free to download and unpack this "present" at what for the Dutch is called "Sinterklaasavond" (http://en.wikipedia.org/wiki/Sinterklaas) Arthur Baars Marcos Viera Eelco Lempsink Doaitse Swierstra PS: the package uses our library supporting transformation of typed abstract syntax, which we placed in a separate package TTTAS

2 1

[Haskell] Announcing the new Haskell Prime process, and Haskell 2010
by Simon Marlow 07 Jul '09

07 Jul '09

At last year's Haskell Symposium, it was announced that we would change the Haskell Prime process to make it less monolithic. Since then, everyone has been busy using Haskell (or implementing it), and we haven't made much progress on the standardisation side of things. Well, with ICFP and the Haskell Symposium approaching we felt it was time to get the new process moving and hopefully produce a language revision this year. I've updated the Haskell' wiki with the new information; in particular the process is documented here: http://hackage.haskell.org/trac/haskell-prime/wiki/Process We're aiming to announce the list of accepted proposals at the Haskell Symposium this year. However, owing to the short timescale, the list is going to be correspondingly short, and limited to extensions which are either already fully specified (i.e. the FFI) or are small and well-understood. The following list is very provisional; we'll be making the final decisions next month. ForeignFunctionInterface LineCommentSyntax PatternGuards DoAndIfThenElse Remove n+k patterns RelaxedDependencyAnalysis EmptyDataDeclarations HierarchicalModules NonDecreasingIndentation remove FixityResolution from the context-free grammar change the syntax of QualifiedOperators In the coming weeks we'll be refining proposals in preparation for Haskell 2010. By all means suggest more possibilities; however note that as per the new process, a proposal must be "complete" (i.e. in the form of an addendum) in order to be a candidate for acceptance. I have updated the status page http://hackage.haskell.org/trac/haskell-prime/wiki/Status marking everything except the proposals that have been already implemented in the draft Report as "old". The new process requires a proposal to have an owner or owners in order to make progress; once a proposal has an owner it will move into the "under discussion" state. To take up ownership of an existing proposal, or to start a new proposal, ask on the mailing list. There are other ways you can get involved; some suggestions are on the Haskell' main page: http://hackage.haskell.org/trac/haskell-prime/wiki (hmm, I suppose we should fix that logo too...) Cheers, Simon

3 2

ANNOUNCE: sendfile-0.2, now with portable offset + bytecount parameters
by Matthew Elder 05 Jul '09

05 Jul '09

Announcing sendfile-0.2, now with portable offset + bytecount parameters! See: http://hackage.haskell.org/package/sendfile-0.2 Testers needed / wanted! Happy Hacking, Matthew Elder

1 0

ANN: Gtk2hsGenerics
by Michael Dever 05 Jul '09

05 Jul '09

Hi all, Apologies if this goes through twice. I extracted some functions from working on haskellfm, and made them a bit generic. There's no new functionality in this, but some handy functions that I found useful while working on it. They take some of the pain out extracting information from stores and adding more information in. The modules are: Graphics.UI.Gtk.Generics.ListStore: Functionality for: Repopulating an existing ListStore with a list of new data. Obtaining an element from a ListStore, identified by a TreePath. Prepending/Appending a ListStore with another list. Graphics.UI.Gtk.Generics.TreeStore: Functionality for: Obtaining all the objects from a TreeStore that correspond to a TreePath. Finding a TreePath to match the elements in a supplied list. Graphics.UI.Gtk.Generics.TreeView *At the moment this only applies to a TreeView with ListStore.* Functionality for: Getting a single selection from a TreeView containing a ListStore. Getting multiple selections from a TreeView containing a ListStore. Applying a function to a single selection of a TreeView containing a ListStore. Applying a function across multiple selections from a TreeView containing a ListStore. The package is available on Hackage at: http://hackage.haskell.org/package/Gtk2hsGenerics-0.1 Regards, Michael

1 0