- Haskell - Haskell.org

Re: [Haskell] ANNOUNCE: Basic serialization library using only existing SYB infrastructure
by Stefan O'Rear 15 Dec '06

15 Dec '06

> > darcs get http://members.cox.net/stefanor/genericserialize > > got the following error: > > darcs failed: Failed to download URL http://members.cox.net/stefanor/genericserialize/_darcs/patches/ Apparently the FTP upload failed yesterday; I reran it. From now on I'll test the uploads :) (The re-upload was tested successfully) I apologize for the inconvienience.

1 0

Haskell alternatives: functional programming in rich IDEs
by Bulat Ziganshin 15 Dec '06

15 Dec '06

Hello haskell, it was several times mentioned that Haskell doesn't provide rich environments for productive work, including lack of IDEs, bundled "real-world" libs and so on. i want to mention alternative environments that is better in these areas 1) F#, is Ocaml dialect integrated in .NET environment 2) Clean, very Haskell-like language with a commercial IDE, GUI libs and so on 3) Business Objects, integration of Haskell-like language into Java environment, http://labs.businessobjects.com/cal -- Best regards, Bulat mailto:Bulat.Ziganshin@gmail.com

3 2

PAPP 2007 CfP deadline extended
by Clemens Grelck 15 Dec '06

15 Dec '06

========================================= **** Deadline extension: December 20, 2006 **** Fourth International Workshop on Practical Aspects of High-level Parallel Programming (PAPP 2007) part of The International Conference on Computational Science May 27-30, 2007, University of Beijing, China http://graal.ens-lyon.fr/~abenoit/conf/papp2007.html ========================================= Aims and scope Computational Science applications are more and more complex to develop and require more and more computing power. Parallel and grid computing are solutions to the increasing need for computing power. High level languages offer a high degree of abstraction which ease the development of complex systems. Moreover, being based on formal semantics, it is possible to certify the correctness of critical parts of the applications. Algorithmic skeletons, parallel extensions of functional languages such as Haskell and ML, parallel logic and constraint programming, parallel execution of declarative programs such as SQL queries, etc. have produced methods and tools that improve the price/performance ratio of parallel software, and broaden the range of target applications. The PAPP workshop focuses on practical aspects of high-level parallel programming: design, implementation and optimization of high-level programming languages and tools (performance predictors working on high-level parallel/grid source code, visualisations of abstract behaviour, automatic hotspot detectors, high-level GRID resource managers, compilers, automatic generators, etc.), applications in all fields of computational science, benchmarks and experiments. Research on high-level grid programming is particularly relevant. The PAPP workshop is aimed both at researchers involved in the development of high level approaches for parallel and grid computing and computational science researchers who are potential users of these languages and tools. Topics We welcome submission of original, unpublished papers in English on topics including: * high-level models (CGM, BSP, MPM, LogP, etc.) and tools for parallel and grid computing * high-level parallel language design, implementation and optimisation * functional, logic, constraint programming for parallel, distributed and grid computing systems * algorithmic skeletons, patterns and high-level parallel libraries * generative (e.g. template-based) programming with algorithmic skeletons, patterns and high-level parallel libraries * applications in all fields of high-performance computing (using high-level tools) * benchmarks and experiments using such languages and tools Paper submission and publication Prospective authors are invited to submit full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Papers will go through a rigorous reviewing process. Each paper will be reviewed by at least three referees. The accepted papers will be published in the Springer-Verlag Lecture Notes in Computer Science (LNCS) series, as part of the ICCS proceedings. Submission must be done through the ICCS website: http://www.iccs-meeting.org/iccs2007/papers/upload.php. We invite you to submit a full paper of 8 pages formatted according to the rules of LNCS, describing new and original results, no later than December 20, 2006. Submission implies the willingness of at least one of the authors to register and present the paper. An early email to papp2007 at free.fr with your intention to submit a paper would be greatly appreciated (especially if you have doubts about the relevance of your paper). Accepted papers should be presented at the workshop. Authors will be invited to submit extended and revised versions of their papers. Accepted manuscripts will be published in a special issue of Scalable Computing: Practice and Experience. Important Dates * December 20, 2006 - Full paper due * February 3, 2007 - Notification * February 19, 2007 - Camera-ready paper due * July 2007 - Journal version due * September 2007 - Referee reports * October 2007 - Revision of papers, final notification * November 2007 - Final paper due Programme committee * Marco Aldinucci (Univ. of Pisa, Italy) * Anne Benoit (ENS Lyon, France) * Armelle Bonenfant (Univ. of St Andrews, UK) * Frédéric Gava (Univ. Paris XII Val de Marne, France) * Alexandros Gerbessiotis (NJIT, USA) * Clemens Grelck (Univ. of Luebeck, Germany) * Zhenjiang Hu (Univ. of Tokyo, Japan) * Rita Loogen (Univ. of Marburg, Germany) * Frédéric Loulergue (Univ. Orléans, France) * Susanna Pelagatti (Univ. of Pisa, Italy) * Casiano Rodriguez Leon (Univ. La Laguna, Spain) Organizers * Dr. Anne BENOIT Laboratoire d'Informatique du Parallelisme Ecole Normale Supérieure de Lyon 46 Allée d'Italie 69364 Lyon Cedex 07 - France * Pr. Frederic LOULERGUE Laboratoire d'Informatique Fondamentale d'Orléans Université d'Orléans Batiment IIIA - Rue Léonard de Vinci - BP6759 45067 Orléans Cedex 2 - France

1 0

ANNOUNCE: Basic serialization library using only existing SYB infrastructure
by Stefan O'Rear 14 Dec '06

14 Dec '06

Announcing GenericSerialize, a library for serialization using the existing generic-programming framework. It is often advocated that support for serialization should be added to the compiler (e.g. in the form of a deriving(Binary)). With this I intend to show that the existing infrastructure is sufficient, and has some advantages over a dedicated serialization interface. The main advantage that generic serialization posseses is that it is possible to simultaneously have several serialization modes. While interfaces such as AltBinary allow writing to any type of stream, the data format is fixed. By contrast, GenericSerialize supports multiple serialization modes; while the only currently existing module is for a subset of R5RS s-expressions, that module is less than 100 lines of code and is almost pure grammar. See the included README for (minimal...) usage examples. darcs get http://members.cox.net/stefanor/genericserialize wget http://members.cox.net/stefanor/genericserialize-0.0.tar.gz

1 0

ANNOUNCE: Phooey -- a Functional UI library for Haskell
by Conal Elliott 14 Dec '06

14 Dec '06

Announcing Phooey <http://conal.net/phooey>, a functional UI library for Haskell. GUIs are usually programmed in an "unnatural" style, in that implementation dependencies are inverted, relative to logical dependencies. This reversal results directly from the imperative orientation of most GUI libraries. While outputs depend on inputs from a user and semantic point of view, the imperative approach imposes an implementation dependence of inputs on outputs. Phooey ("*Ph*unctional *oo*s*e*r *y*nterfaces") retains the functional style, in which outputs are expressed in terms of inputs. In addition, Phooey supports dynamic input bounds, flexible layout, and mutually-referential widgets. As an example of Phooey's style, below is a simple shopping list GUI. The * total* displayed at the bottom of the window always shows the sum of the values of the *apples* and *bananas* input sliders. When a user changes the inputs, the output updates accordingly. Phooey is structured as an arrow, and this example uses arrow notation. The code: ui1 :: UI () () ui1 = title "Shopping List" $ proc () -> do a <- title "apples" (islider 3) -< (0,10) b <- title "bananas" (islider 7) -< (0,10) title "total" showDisplay -< a+b I am working on a paper about Phooey. For now, please see the Haddock documentation <http://darcs.haskell.org/packages/phooey/doc> (which includes more examples), and try the code via darcs get http://darcs.haskell.org/packages/phooey --partial Directions for building are in the README<http://darcs.haskell.org/packages/phooey/README>file. Distribution tarballs are here <http://darcs.haskell.org/packages/phooey/dist>. Comments and collaboration are very welcome! Cheers, - Conal P.S. I'm very grateful for Don Stewart's recent pointers on how to create & release Haskell projects.

5 8

haskell.org memory upgrade
by Paul Hudak 14 Dec '06

14 Dec '06

Dear Haskellers -- Haskell.org will go down today at 1500 EST for about 10 minutes for a memory upgrade. Sorry for the inconvenience, -Paul Hudak

1 0

PLAN-X 2007: Call for Participation [and Program Updates]
by Torsten Grust 14 Dec '06

14 Dec '06

Call for Participation P L A N - X 2 0 0 7 Programming Language Technologies for XML An ACM SIGPLAN Workshop collocated with POPL 2007 Nice, France -- January 20, 2007 www.plan-x-2007.org || UPDATE: - Christoph Koch (U Saarland, Germany) will give the || || PLAN-X 2007 keynote speech. || || - The detailed program is available (included below). || Please join us for PLAN-X 2007, the fifth workshop in the PLAN-X series, dedicated to the interaction and integration of programming language technology and the world of XML. The XML data model and its associated languages add interesting twists to programming language practice as well as theory. Just like its four predecessors, the PLAN-X 2007 workshop turns the spotlight on how programming language technology can embrace and explain streaming XML transformations, types for XPath and XML updates, web service contracts, tree patterns in XQuery, LINQ and XML Schema, and more. PLAN-X 2007 will feature eight talks, three system demonstrations, extensive opportunity for discussion, and a keynote address (speaker to be announced). PLAN-X 2007 will be held in the Plaza Hotel (Nice, France) all-day on Saturday, January 20, 2007, just after and collocated with POPL 2007, the ACM SIGPLAN - SIGACT Symposium on Principles of Programming Languages (January 17-19, 2007). -- PROGRAM (Saturday, January 20, 2007) 09:00--10:00 Welcome Invited Talk by Christoph Koch (U Saarland, Germany) (title to be announced) 10:00--10:30 Coffee break 10:30--12:00 Session 1: Research Papers Streaming XML Transformations Using Term Rewriting (Alain Frisch, Keisuke Nakano) How to Recognise Different Kinds of Tree Patterns From Quite a Long Way Away (Jan Hidders, Philippe Michiels, Jerome Simeon, Roel Vercammen) Lux: A Lightweight, Statically Typed XML Update Language (James Cheney) 12:00--01:30 Workshop lunch (provided) 01:30--03:10 Session 2: Research Papers and Demo Presentations A Theory of Contracts for Web Services (Giuseppe Castagna, Nils Gesbert, Luca Padovani) XML Transformation Language Based on Monadic Second Order Logic (Kazuhiro Inaba, Haruo Hosoya) Demo: MTran: An XML Transformation Language Bases on Monadic Second Order Logic (Kazuhiro Inaba, Haruo Hosoya) Demo: XCentric: A Logic-Programming Language for XML Processing (Jorge Coelho, Mário Florido) Demo: LINQ to XSD (Ralf Lämmel) Demo: GeLaBa: A Framework to Define Classes of XML Documents and to Automatically Derive Specialized Infrastructures (Benoit Pin, Georges André Silber) 03:10--04:00 Interactive Demos and Coffee break 04:00--05:30 Session 3: Research Papers XPath Typing Using a Modal Logic with Converse for Finite Trees (Pierre Geneves, Nabil Layaida, Alan Schmitt) Deciding Equivalence of Top-Down XML Transformations in Polynomial Time (Sebastian Maneth, Helmut Seidl) A Logic Your Typechecker Can Count On: Unordered Tree Types in Practice (Nate Foster, Benjamin C. Pierce, Alan Schmitt) -- REGISTRATION PLAN-X 2007 is held in cooperation with POPL 2007. You can register for the workshop via the POPL 2007 registration process (online or offline). Please visit http://www.regmaster.com/conf/popl2007.html Registration rates are shown below. The rates are unaffected by the POPL 2007 early bird registration deadline. Note that you can upgrade an existing POPL 2007 registration to include PLAN-X 2007. Workshop-only registration is possible as well. ACM or SIGPLAN Member $89 Non-Member $99 Student $89 Your registration includes a copy of the PLAN-X 2007 informal proceedings, coffee breaks, and lunch. -- PLAN-X 2007 Workshop Chairs - General Chair - Program Chair Torsten Grust Giorgio Ghelli TU München U Pisa Munich, Germany Pisa, Italy grust(a)in.tum.de ghelli(a)di.unipi.it -- PLAN-X 2007 Program Committee - Michael Benedikt (Lucent, USA) - Daniela Florescu (Oracle, USA) - Alain Frisch (INRIA Roquencourt, France) - Giorgio Ghelli, Chair (U Pisa, Italy) - Haruo Hosoya (U Tokyo, Japan) - Anders Møller (U Aarhus, Denmark) - Mukund Raghavachari (IBM T.J. Watson Research Center, USA) - Alan Schmitt (INRIA Rhône-Alpes, France) - Sophie Tison (U Lille, France) - Philip Wadler (U Edinburgh, UK)

1 0

TLDI'07: Last Call for Participation
by Francois Pottier 14 Dec '06

14 Dec '06

****************************************************************************** The 2007 ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI'07) Affiliated with the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'07) Call for Participation http://www.cs.berkeley.edu/~necula/tldi07/ ****************************************************************************** Preliminary programme Invited talks: Kathleen Fisher (AT&T Research) Conor McBride (University of Nottingham) Accepted papers: A Garbage-Collecting Typed Assembly Language Chris Hawblitzel, Heng Huang, Lea Wittie and Juan Chen A graphical presentation of MLF types with a linear-time unification algorithm Didier Rémy and Boris Yakobowski An Open Framework for Foundational Proof-Carrying Code Xinyu Feng, Zhaozhong Ni, Zhong Shao and Yu Guo Modular Information Hiding and Type-Safe Linking for C Saurabh Srivastava, Michael Hicks and Jeffrey Foster Semantics of an Effect Analysis for Exceptions Nick Benton and Peter Buchlovsky System F with Type Equality Coercions Martin Sulzmann, Manuel Chakravarty, Simon Peyton Jones and Kevin Donnelly ****************************************************************************** Scope The role of types and proofs in all aspects of language design, compiler construction, and software development has expanded greatly in recent years. Type systems, type analyses, and formal deduction have led to new concepts in compilation techniques for modern programming languages, verification of safety and security properties of programs, program transformation and optimization, and many other areas. In light of this expanding role of types, the ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI'07) follows five previous International Workshops on types in compilation and language design (TIC'97, TIC'98, TIC'00, and TLDI'03 and TLDI'05), with the hope of bringing together researchers to share new ideas and results in this area. ****************************************************************************** General Chair François Pottier INRIA Rocquencourt BP 105 78153 Le Chesnay Cedex FRANCE francois.pottier(a)inria.fr Program Chair George Necula University of California 783 Soda Hall Berkeley, CA 94720 necula(a)cs.berkeley.edu Program Committee Damien Doligez, INRIA Peter Lee, Carnegie Mellon University Andrew Kennedy, Microsoft Research, Cambridge Naoki Kobayashi, Tohoku University George Necula (chair), University of California, Berkeley Randy Pollack, Edinburgh University Norman Ramsey, Harvard University David Tarditi, Microsoft Research, Redmond Stephanie Weirich, University of Pennsylvania Hongwei Xi, Boston University

1 0

interpreter ouput in color
by Walter Moreira 13 Dec '06

13 Dec '06

Hi all. I was wondering if some people miss the colored output of some applications, such like the IPython enhanced shell. I've been googling for similar options for Haskell but I found nothing. I feel that the type error messages, for example, would be a lot more readable (or at least quicker to read). Is there a way to write plugins for ghci to get this?, or do you people have some suggestion about what would be the easiest component to hack for applying colors? Thank you. Cheers, Walter

1 0

Re: [Haskell] ANNOUNCE: Phooey -- a Functional UI library for Haskell
by Conal Elliott 13 Dec '06

13 Dec '06

Hi Neil, Thanks for the pointer. From first skim-through at some PropLang library & example code, I'm not seeing much similarity between the two systems. GuiHaskell looks nifty. Cheers, - Conal On 12/13/06, Neil Mitchell <ndmitchell(a)gmail.com> wrote: > > Hi, > > > Thanks for your comments, Steve. They're getting me closer to a clear > > explanation, which will be helpful in the paper I'm writing. > > I was going to polish up PropLang before releasing it, but if you're > writing a paper, and I go and release PropLang just after you've put > the finishing touches on it, you'll hunt me down and kill me :) > > As such, here is an announcement that PropLang exists, and is cool. > > See the darcs repo: http://www.cs.york.ac.uk/fp/darcs/proplang/ - and > hopefully see some documentation in the future :) > > No arrows, but seems to have the same underlying idea. > > The darcs repo has a text editor (it had another sample, I'm sure, but > I can't see it!) > > Some selected hilights: > > -- CREATE VARIABLES > > -- is a document open > document <- newVar False > > -- is a document modified > modified <- newVar False > > -- the filename of the document, if its been saved > filename <- newVar Nothing > > -- SET UP RELATIONS BETWEEN PROPERTIES > txt!enabled =<= document > new!enabled =< with1 document not > saveas!enabled =< with2 document modified (&&) > --save!enabled =< with2 document modified (&&) > save!enabled =< (&&) =$$= document =$= modified > close!enabled =<= document > revert!enabled =<= modified > > -- SUPPORTS EVENTS TOO > new!onClicked += newDocument gui > save!onClicked += saveDocument gui > saveas!onClicked += saveAsDocument gui > close!onClicked += closeDocument gui > open!onClicked += openDocument gui > > -- COOL AND SIMPLE UNDO > revert!onClicked += (txt!text -<- lasttxt) > > modified =< with2 (txt!text) (lasttxt) (/=) > > let titleformat d m f = "TextEditor" ++ > (if d then " - " ++ maybe "<untitled>" id > f else "") ++ > (if m then " *" else "") > > -- REALLY COOL SETTING OF THE TITLE AUTOMATICALLY > window!text =< titleformat =$$= document =$= modified =$= filename > > -- CREATE A STATUS BAR WITH THE WORD COUNT IN ONE LINE! > sb!text =< (\x -> "Word count: " ++ show (length $ words x)) =$$= > txt!text > > I'll write up a tutorial or something at some point. > > It's written using Gtk2Hs, and works fine on both Linux and Windows. > GuiHaskell is written using this: > http://www-users.cs.york.ac.uk/~ndm/projects/guihaskell.php > > Thanks > > Neil >

1 0