October 2007 - Haskell

ANNOUNCE: binary 0.4: high performance, pure binary parsing and serialisation
by Don Stewart 06 Oct '07

06 Oct '07

Binary: high performance, pure binary encoding, decoding and serialisation for Haskell ---------------------------------------------------------------------- The Binary Strike Team is pleased to announce release 0.4 of Data.Binary, the pure, efficient binary serialisation library for Haskell, now available from Hackage: tarball: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/binary/0.4 darcs: darcs get http://darcs.haskell.org/binary The 'binary' package provides efficient serialisation of Haskell values to and from lazy ByteStrings, and a low level layer for high performance decoding and decoding binary data. ByteStrings constructed this way may then be written to disk, written to the network, or further processed (e.g. stored in memory directly, or compressed in memory with zlib or bzlib). *Very* high performance can be expected, with throughput over 1G/sec observed in practice (good enough for most networking scenarios, we suspect). Encoding and decoding are achieved by the functions: encode :: Binary a => a -> ByteString decode :: Binary a => ByteString -> a which mirror the read/show functions. Convenience functions for serialising to disk are also provided: encodeFile :: Binary a => FilePath -> a -> IO () decodeFile :: Binary a => FilePath -> IO a To serialise your Haskell data, all you need do is write an instance of Binary for your type. For example, suppose in an interpreter we had the data type: import Data.Binary import Control.Monad data Exp = IntE Int | OpE String Exp Exp We can serialise this to bytestring form with the following instance: instance Binary Exp where put (IntE i) = putWord8 0 >> put i put (OpE s e1 e2) = putWord8 1 >> put s >> put e1 >> put e2 get = do tag <- getWord8 case tag of 0 -> liftM IntE get 1 -> liftM3 OpE get get get The binary library has been heavily tuned for performance, particularly for writing speed. On average, Data.Binary is 10x faster than NewBinary, and has the advantage of a pure interface, and bytestring return values. Binary was developed by a team of 8 during the Haskell Hackathon, Hac 07, in January 2007, and this maintainence release has taken place during the second hackathon. Binary is portable, using the foreign function interface and cpp, and has been tested with Hugs and GHC. Happy hacking! -- Don

1 0

2nd CFP: 3rd Int'l Workshop on Automated Specification and Verification of Web Systems (WWV'07)
by demis＠dimi.uniud.it 05 Oct '07

05 Oct '07

[ We apologize for multiple copies ] *********************************************************************** 2nd Call for Papers 3rd International Workshop on Automated Specification and Verification of Web Systems (WWV'07) San Servolo island, Venice (Italy) December 14, 2007 http://wwv07.dimi.uniud.it/ IMPORTANT DATES Abstract Submission October 14, 2007 Full Paper Submission October 21, 2007 Acceptance Notification November 12, 2007 Camera Ready November 23, 2007 Workshop December 14, 2007 SCOPE The increased complexity of Web sites and the explosive growth of Web-based applications has turned their design and construction into a challenging problem. Nowadays, many companies have diverted their Web sites into interactive, completely-automated, Web-based applications (such as Amazon, on-line banking, or travel agencies) with a high complexity that requires appropriate specification and verification techniques and tools. Systematic, formal approaches to the analysis and verification can address the problems of this particular domain with automated and reliable tools that also incorporate semantic aspects. We solicit original papers on formal methods and techniques applied to Web sites, Web services or Web-based applications, such as: * rule-based approaches to Web site analysis, certification, specification, verification, and optimization * formal models for describing and reasoning about Web sites * model-checking, synthesis and debugging of Web sites * abstract interpretation and program transformation applied to the semantic Web * intelligent tutoring and advisory systems for Web specifications authoring * Web quality and Web metrics * Web usability and accessibility * Testing and evaluation of Web systems and applications The WWV series provides a forum for researchers from the communities of Rule-based programming, Automated Software Engineering, and Web-oriented research to facilitate the cross-fertilization and the advancement of hybrid methods that combine the three areas. LOCATION WWV'07 will be held in December in the convention centre of the island of San Servolo, Venice, Italy. SUBMISSION PROCEDURE Submissions must be received by October 21, 2007. In addition, an ASCII version of the title and abstract must have been submitted by October 14, 2007. Submitted papers should be at most 15 pages in the Electronic Notes in Theoretical Computer Science (ENTCS) style, and should include an abstract and the author's information. See the author's instructions of ENTCS style at http://www.entcs.org. PUBLICATION Accepted papers will be published in a preliminary proceedings volume, which will be available during the workshop. After the workshop, the final proceedings are going to be published in the Elsevier series Electronic Notes in Theoretical Computer Science (ENTCS, ISSN: 1571-0661). INVITED SPEAKERS Paolo Traverso ITC-IRST, Italy Joost Visser Software Improvement Group, The Netherlands PROGRAM CO-CHAIRS Santiago Escobar Technical University of Valencia, Spain Massimo Marchiori University of Padova, Italy WORKSHOP CHAIR Demis Ballis University of Udine, Italy PROGRAM COMMITTEE Jesus Almendros University of Almeria, Spain Maria Alpuente Technical University of Valencia, Spain Uwe Assmann Linköpings Universitet, Sweden Demis Ballis University of Udine, Italy Gilles Barthe INRIA Sophia-Antipolis, France Tevfik Bultan University of California, Santa Barbara, USA Santiago Escobar Technical University of Valencia, Spain Moreno Falaschi University of Siena, Italy Nora Koch Ludwig Maximilians Universität München, Germany Temur Kutsia RISC Linz, Austria Massimo Marchiori University of Padova, Italy Tiziana Margaria University of Potsdam, Germany Catherine Meadows Naval Research Laboratory, USA Sebastian Schaffert Salzburg Research, Austria

1 0

PEPM 2008: abstracts due Oct 12
by Oege.de.Moor＠comlab.ox.ac.uk 05 Oct '07

05 Oct '07

>>> LAST CALL <<< >>> abstracts - Oct 12, full papers - Oct 17 <<< PEPM 2008 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation January 7-8, 2008, San Francisco Keynotes by Ras Bodik (Berkeley) and Monica Lam (Stanford) Co-located with POPL http://www.program-transformation.org/PEPM08/WebHome PEPM is a leading venue for the presentation of cutting-edge research in program analysis, program generation and program transformation. Its proceedings are published by ACM Press; full details of the scope, submission process, and program committee can be found at the above URL. The program committee would particularly welcome submissions from researchers in functional programming on any topic relating to analysis, optimisation and synthesis of Haskell programs Abstracts are due on October 12, and the deadline for full paper submission is October 17. Prospective authors are welcome to contact the program chairs, Robert Glueck (glueck(a)acm.org) and Oege de Moor (oege(a)comlab.ox.ac.uk) with any queries they might have.

1 0

reading from stdin
by Axel Simon 04 Oct '07

04 Oct '07

Hi, I'm trying to continuously output data to a file handle while reading single characters from the user to adjust the speed at which things are output. I'm interested to get this to work in Hugs on Windows. I successfully used the following function ghci under Mac OS: {{{ getUserInput :: IO (Maybe Char) getUserInput = do hasInput <- hReady stdin if hasInput then liftM Just (hGetChar stdin) else return Nothing }}} This function returns a character to me if there's one available. If anybody could give me a hint how to get this working in Hugs under Windows, please tell me. For the entertainment value, here's what's happening currently: a) ghci under Unix A character is returned if it is available, otherwise the function returns immediately. b) Hugs under Unix Characters are not recognised when typed. The characters are returned as soon as return is hit. The function does not block. c) ghci under Windows The function does not block until a character is entered. Once a character is entered, the function blocks until return is hit. d) Hugs under Windows The function aborts immediately somewhere in IO.hWaitForInput with an 'invalid operation (unsupported opperation)' error. I don't know what the right behaviour is, and I don't really care. But: a) is the behaviour I want, but unfortunately for platform d) b) must be due to ghci and Hugs having different opinions on whether stdin should be line buffered or unbuffered c) this is weird d) this is broken How can I get platform d) working with the behaviour of a)? Thanks a lot, Axel. P.S.: Sorry to post to haskell@..., but nothing else seemed to match.

1 0

new SOE release with performance improvement
by Paul L 04 Oct '07

04 Oct '07

Thanks to the help from Peter Verswyvelen, a new SOE version is available at http://www.haskell.org/soe, under the name SOE-20071003.zip. This update makes better handling of events and buffer swap, and results in less CPU usage and smoother animation. The performance improvement may be quite apparent on some systems, in particular, those with software GL emulation rather than accelerated hardware. So if you are having performance issues running current SOE, I suggest you it a try. It has been tested on Windows, Linux, and OS X. PS: there's no change to GLFW since previous release, so if you have already installed GLFW, you don't need to re-install it. Regards, Paul Liu -- Yale Haskell Group http://www.haskell.org/yale

1 0

SAS 2008 Preliminary Call for Papers
by German Vidal 02 Oct '07

02 Oct '07

PLEASE POST --> SAS 2008 at the Technical University of Valencia We are happy to announce that SAS 2008, the Static Analysis Symposium, will take place at the Technical University of Valencia: Submission of abstract: January 12, 2008 Submission of full paper: January 19, 2008 Notification: March 7, 2008 Camera-ready version: April 5, 2008 Conference: July 16-18, 2008 Please see: http://www.dsic.upv.es/~sas2008/ Maria Alpuente, German Vidal (PC co-chairs) --------------------------------------------------------------------------- Call for papers Static Analysis Symposium - SAS 2008 16-18 July 2008, Valencia, Spain (co-located with LOPSTR 2008) url http://www.dsic.upv.es/~sas2008 email sas2008(a)dsic.upv.es Static Analysis is increasingly recognized as a fundamental tool for high performance implementations and verification of programming languages and systems. The series of Static Analysis Symposia has served as the primary venue for presentation of theoretical, practical, and application advances in the area. The technical programme for SAS 2008 will consist of invited lectures and presentations of refereed papers. Contributions are welcome on all aspects of static analysis, including, but not limited to: abstract domains abstract interpretation abstract testing compiler optimizations control flow analysis data flow analysis model checking program specialization security analysis theoretical analysis frameworks type based analysis verification systems Submissions can address any programming paradigm, including concurrent, constraint, functional, imperative, logic, and object-oriented programming. Survey papers, that present some aspect 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 or a conference with refereed proceedings. Submitted papers should be at most 15 pages formatted in LNCS style (excluding bibliography and well-marked appendices not intended for publication). PC members are not required to read the appendices, and thus papers should be intelligible without them. The conference proceedings is planned to be published by Springer-Verlag in the Lecture Notes in Computer Science series. Invited Speakers Roberto Giacobazzi (Universita' degli Studi di Verona, Italy) Ben Liblit (University of Wisconsin-Madison, USA) PC co-chairs Maria Alpuente (Technical University of Valencia, Spain) German Vidal (Technical University of Valencia, Spain) PC members Elvira Albert (Complutense University of Madrid, Spain) Roberto Bagnara (University of Parma, Italy) Maurice Bruynooghe (Katholieke Universiteit Leuven, Belgium) Radhia Cousot (CNRS & Ecole Polytechnique, France) Javier Esparza (Technical University of Munchen, Germany) Sandro Etalle (University of Twente, The Netherlands) Moreno Falaschi (University of Siena, Italy) Stephen Fink (IBM T.J. Watson Research Center, USA) John Gallagher (Roskilde University, Denmark) Maria del Mar Gallardo (University of Malaga, Spain) Chris Hankin (Imperial College, UK) Manuel Hermenegildo (Technical University of Madrid, Spain) Julia Lawall (University of Copenhagen, Denmark) Alexey Loginov (IBM T.J. Watson Research Center, USA) Hanne Riis Nielson (Technical University of Denmark, Denmark) David Schmidt (Kansas State University, USA) Harald Sondergaard (University of Melbourne, Australia) Tachio Terauchi (Tohoku University, Japan) Ji Wang (National Laboratory for Parallel and Distributed Processing, China) Local chair Alicia Villanueva (Technical University of Valencia, Spain) Important dates Submission of abstract: January 12, 2008 Submission of full paper: January 19, 2008 Notification: March 7, 2008 Camera-ready version: April 5, 2008 Conference: July 16-18, 2008 ---------------------------------------------------------------------------

1 0

[Last CFP] FLOPS 2008
by Jacques Garrigue 02 Oct '07

02 Oct '07

[We apologize for the multiple postings of this announce] LAST CALL FOR PAPERS Ninth International Symposium on Functional and Logic Programming (FLOPS 2008) April 14-16, 2008 Ise, Japan Submission deadline: October 10, 2007 Keynotes: Peter Dybjer, Naoki Kobayashi, and Torsten Schaub http://www.math.nagoya-u.ac.jp/~garrigue/FLOPS2008/ FLOPS is a forum for research on all issues concerning declarative programming, including functional programming and logic programming, and aims to promote cross-fertilization and integration between the two paradigms. Previous FLOPS meetings were held in Fuji Susono (1995), Shonan Village (1996), Kyoto (1998), Tsukuba (1999), Tokyo (2001), Aizu (2002), Nara (2004), and Fuji Susono (2006). TOPICS FLOPS solicits original papers in all areas of functional and logic programming, including (but not limited to): Declarative Pearls: new and excellent declarative programs with illustrative applications; Language issues: language design and constructs, programming methodology, integration of paradigms, interfacing with other languages, type systems, constraints, concurrency and distributed computing; Foundations: logic and semantics, rewrite systems and narrowing, type theory, proof systems; Implementation issues: compilation techniques, memory management, program analysis and transformation, partial evaluation, parallelism; Applications: case studies, real-world applications, graphical user interfaces, Internet applications, XML, databases, formal methods and model checking. The proceedings are expected to be published as an LNCS volume. The proceedings of the previous meeting (FLOPS2006) were published as LNCS 3945. INVITED SPEAKERS Peter Dybjer (Chalmers, Sweden) Naoki Kobayashi (Tohoku, Japan) Torsten Schaub (Potsdam, Germany) PC CO-CHAIRS Jacques Garrigue (Nagoya, Japan) Manuel Hermenegildo (Madrid, Spain and New Mexico, USA) PC MEMBERS Maria Alpuente (Valencia, Spain) Sergio Antoy (Portland, OR, USA) Matthias Blume (TTI, Chicago, USA) Tyng-Ruey Chuang (Academia Sinica, Taiwan) Zhenjiang Hu (Tokyo, Japan) Oleg Kiselyov (FNMOC, Monterey, USA) Herbert Kuchen (Muenster, Germany) Dale Miller (INRIA, Palaiseau, France) Atsushi Ohori (Tohoku, Japan) Enrico Pontelli (New Mexico, USA) Kristoffer Rose (IBM Watson, USA) Kazunori Ueda (Waseda, Japan) Peter Van Roy (Louvain-la-Neuve, Belgium) Benjamin Werner (INRIA, Palaiseau, France) LOCAL CHAIR Shoji Yuen (Nagoya, Japan) SUBMISSION Submissions must be unpublished and not submitted for publication elsewhere. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. Submissions should fall into one of the following categories: Regular research papers: they should describe new results and will be judged on originality, correctness, and significance. System descriptions: they should contain a link to a working system and will be judged on originality, usefulness, and design. All submissions must be written in English and can be up to 15 proceedings pages long. Authors are strongly encouraged to use LaTeX2e and the Springer llncs class file, available at http://www.springer.de/comp/lncs/authors.html Regular research papers should be supported by proofs and/or experimental results. In case of lack of space, this supporting information should be made accessible otherwise (e.g., a link to a web page, or an appendix). Submission is Web-based. Please visit the conference site. IMPORTANT DATES Submission deadline: October 10, 2007 Author notification: December 21, 2007 Camera-ready copy: January 21, 2008 Conference: April 14-16, 2008 PLACE Ise, Japan Previous FLOPS: FLOPS 2006, Fuji Susono: http://hagi.is.s.u-tokyo.ac.jp/FLOPS2006/ FLOPS 2004, Nara: http://logic.cs.tsukuba.ac.jp/FLOPS2004/ FLOPS 2002, Aizu: http://www.ipl.t.u-tokyo.ac.jp/FLOPS2002/ FLOPS 2001, Tokyo: http://www.ueda.info.waseda.ac.jp/flops2001/ SPONSOR Japan Society for Software Science and Technology (JSSST) SIG-PPL IN COOPERATION with Asian Association for Foundation of Software (AAFS) Association for Logic Programming (ALP) ACM SIGPLAN (pending) INQUIRIES to <flops2008 at math.nagoya-u.ac.jp>

1 0

Announce: AutoForms release 0.3
by Mads Lindstrøm 01 Oct '07

01 Oct '07

Hi all I am happy to release version 0.3 of AutoForms. AutoForms is a library to ease the creation of Graphical User Interfaces. It does this by using generic programming to construct GUI components. The AutoForms user creates an ordinary algebraic data type (ADT), which should reflect the data model of an application. From this ADT AutoForms automatically constructs a GUI component, by using the structure and identifiers of the ADT. To facilitate this construction, AutoForms uses the "Scrap your boilerplate" approach to generic programming. What happened since release 0.2? * Moved website to http://www.haskell.org/haskellwiki/AutoForms * Closer integration with WxHaskell * Bug-fixes * Cabalized AutoForms * Handles sum-types. E.g. data Foo = Foo Int | Bar Int [Char] * Added a custom monadic interface to AutoForms * More examples * Layout managers * Plus many other changes See http://www.haskell.org/haskellwiki/AutoForms for more information. Greetings, Mads Lindstrøm

1 0