- Haskell - Haskell.org

Call for papers DTP'11
by Wouter Swierstra 11 Apr '11

11 Apr '11

Dependently Typed Programming 2011 Call for Papers 27 of August 2011 Nijmegen, The Netherland In association with ITP 2011 Deadline for submission: 10 June 2011 http://www.cs.ru.nl/dtp11 Dependently typed programming is here today: where will it go tomorrow? On the one hand, dependent type theories have grown programming languages; on the other hand, the type systems of programming languages like Haskell (and even C#) are incorporating some kinds of type-level data. When types involve data, they can capture relationships between data, internalising invariants necessary for appropriate computation. When data describe types, we can express patterns of programming in code. We're beginning to see how to take advantage of the power and precision which dependent types afford, but there are still plenty of problems to address and issues to resolve. The design space is large: this workshop is a forum for researchers who are exploring it. We hope that the workshop will attract people who work on the design and implementation of dependently typed programming languages and development environments, or who are using existing systems to develop dependently typed programs and libraries. * Submissions * If you want to give a talk or a demo at the workshop, please send us a title and an abstract before 10 June 2011 to w.swierstra{at}cs.ru.nl. Slots will be of 30 minutes (unless you ask for less). We will try to fit as many talks as possible. We aim to publish post-proceedings containing refereed papers related to the topic of the workshop in a suitable journal. More information about this will come after the workshop. * Important Dates * 10 June 2011: Submission deadline 25 June 2011: Notification of acceptance 27 August 2911: DTP workshop * Program Committee * Ana Bove, Chalmers, Sweden Matthieu Sozeau, INRIA, France Wouter Swierstra, Radboud University, The Netherlands

1 0

ANNOUNCE: silently-1.1.1 (api changes and fewer temp files)
by Trystan Spangler 11 Apr '11

11 Apr '11

Silently, a package to prevent or capture output to handles, has undergone some api changes for version 1.1.1. silently and hSilently have been renamed to silence and hSilence. hSilence and hCapture now take a list of handles instead of just one. silence :: IO a -> IO a hSilence :: [Handle] -> IO a -> IO a capture :: IO a -> IO (String, a) hCapture :: [Handle] -> IO a -> IO (String, a) The 'capture' and 'hCapture' functions still use temp files behind the scenes. The 'silence' and 'hSilence' functions will write to the NUL device on Windows, to /dev/null on OSX and Linux, and use a temp file on other operating systems. Any temp files will be created in the temp folder if your system has one or the current directory if not. http://hackage.haskell.org/package/silently https://github.com/trystan/silently Another big thanks to everyone who had comments and suggestions, Trystan Spangler As an example, the program import System.IO.Silently main = do putStr "putStrLn: " >> putStrLn "puppies!" putStr "silenced: " >> silence (putStrLn "kittens!") putStrLn "" (captured, result) <- capture (putStr "wookies!" >> return 123) putStr "captured: " >> putStrLn captured putStr "returned: " >> putStrLn (show result) will print putStrLn: puppies! silenced: captured: wookies! returned: 123

1 0

CFP -- Haskell Symposium 2011
by Haskell Symposium 10 Apr '11

10 Apr '11

"Haskell 2011" ACM SIGPLAN Haskell Symposium 2011 Tokyo, Japan 22nd September, 2011 CALL FOR PAPERS http://www.haskell.org/haskell-symposium/2011/ The ACM SIGPLAN Haskell Symposium 2011 will be co-located with the 2011 International Conference on Functional Programming (ICFP), in Tokyo, Japan. The purpose of the Haskell Symposium is to discuss experiences with Haskell and future developments for the language. The scope of the symposium includes all aspects of the design, semantics, theory, application, implementation, and teaching of Haskell. Topics of interest include, but are not limited to: * Language Design, with a focus on possible extensions and modifications of Haskell as well as critical discussions of the status quo; * Theory, such as formal treatments of the semantics of the present language or future extensions, type systems, and foundations for program analysis and transformation; * Implementations, including program analysis and transformation, static and dynamic compilation for sequential, parallel, and distributed architectures, memory management as well as foreign function and component interfaces; * Tools, in the form of profilers, tracers, debuggers, pre-processors, testing tools, and suchlike; * Functional Pearls, being elegant, instructive examples of using Haskell; * Applications, using Haskell for scientific and symbolic computing, database, multimedia, telecom and web applications, and so forth; * Practice and Experience, general experience with Haskell in education and industry. Papers in the latter three categories need not necessarily report original research results; they may instead, for example, report practical experience that will be useful to others, reusable programming idioms, or elegant new ways of approaching a problem. (More advice appears on the symposium webpage.) The key criterion for such a paper is that it makes a contribution from which other Haskellers can benefit. It is not enough simply to describe a program! Submission Details * Submission Deadline: Monday, 6th June 2011 * Author Notification: Friday, 1st July 2011 * Final Papers Due : Sunday, 10th July 2011 Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines (http://www.acm.org/sigs/sigplan/authorInformation.htm) The text should be in a 9pt font in two columns; the length is restricted to 12 pages, except for "Applications, Practice, and Experience" papers, which are restricted to 6 pages. Each submission must adhere to SIGPLAN's republication policy, as explained on the web. Violation risks summary rejection of the offending submission. Accepted papers will be published by the ACM and will appear in the ACM Digital Library. In addition, we solicit proposals for system demonstrations, based on running (perhaps prototype) software rather than necessarily on novel research results. Proposals are limited to 2-page abstracts, in the same ACM format as papers, and should explain why a demonstration would be of interest to the Haskell community. They will be assessed for relevance by the PC; accepted proposals will be published on the Symposium website, but not formally published in the proceedings. Links * http://www.haskell.org/haskell-symposium, the permanent homepage of the Haskell Symposium. * http://www.haskell.org/haskell-symposium/2011, the 2011 Haskell Symposium web page. * http://www.icfpconference.org/icfp2011, the ICFP 2011 web page. Programme Committee * Koen Claessen, Chalmers University of Technology (chair) * Conal Elliott, LambdaPix * Andy Gill, University of Kansas * Ralf Hinze, Oxford University * Graham Hutton, University of Nottingham * John Launchbury, Galois, Inc. * Sam Lindley, University of Edinburgh * Rita Loogen, Philipps-Universität Marburg * Neil Mitchell, Standard Chartered * Matthew Naylor, University of York * Bruno Oliveira, Seoul National University * Dimitrios Vytiniotis, Microsoft Research * Steve Zdancewic, University of Pennsylvania

1 0

ANNOUNCE: normaldistribution-1.0 – Minimum fuss normally distributed random values.
by Bjorn Buckwalter 09 Apr '11

09 Apr '11

Dear all, I'm pleased to announce the immediate availability of the normaldistribution library on hackage: http://hackage.haskell.org/package/normaldistribution This purpose of this library is to have a simple API and no dependencies beyond Haskell 98 in order to let you produce normally distributed random values with a minimum of fuss. This library does not attempt to be blazingly fast nor to pass stringent tests of randomness. It attempts to be very easy to install and use while being "good enough" for many applications (simulations, games, etc.). The API builds upon and is largely analogous to that of the Haskell 98 Random module (more recently System.Random). Pure: > (sample,g) = normal myRandomGen -- using a Random.RandomGen > samples = normals myRandomGen -- infinite list > samples2 = mkNormals 10831452 -- infinite list using a seed In the IO monad: > sample <- normalIO > samples <- normalsIO -- infinite list With custom mean and standard deviation: > (sample,g) = normal' (mean,sigma) myRandomGen > samples = normals' (mean,sigma) myRandomGen > samples2 = mkNormals' (mean,sigma) 10831452 > sample <- normalIO' (mean,sigma) > samples <- normalsIO' (mean,sigma) Internally the library uses the Central Limit Theorem to approximate normally distributed values from multiple uniformly distributed random values. Enjoy, Bjorn

1 0

Final CfP and Deadline Extension
by Herbert Kuchen 08 Apr '11

08 Apr '11

Final Call for Papers and Deadline Extension ============================================ 20th International Workshop on Functional and (Constraint) Logic Programming WFLP 2011 Odense, Denmark July 19, 2011 Co-located with PPDP 2011, LOPSTR 2011, AAIP 2011 The deadline has been extended to April 20, 2011. For details see: http://www.wi.uni-muenster.de/pi/konferenzen/wflp2011/wflp2011.htm

1 0

DSL 2011 - Last CFP
by Emilie Balland 08 Apr '11

08 Apr '11

=========================== Call for Papers ============================ DSL 2011: Conference on Domain-Specific Languages (IFIP sponsorship pending approval) 6-8 September 2011, Bordeaux, France http://dsl2011.bordeaux.inria.fr/ IMPORTANT DATES * 2011-04-18 : Abstracts due * 2011-04-25 : Submissions due * 2011-06-10 : Authors notified of decisions * 2011-07-11 : Final manuscripts due * 2011-09-05 : Distilled tutorials * 2011-09-06 / 2011-09-08 : Main conference CALL FOR PAPERS Domain-specific languages have long been a popular way to shorten the distance from ideas to products in software engineering. On one hand, the interface of a DSL lets domain experts express high-level concepts succinctly in familiar notation, such as grammars for text or scripts for animation, and often provides guarantees and tools that take advantage of the specifics of the domain to help write and maintain these particular programs. On the other hand, the implementation of a DSL can automate many tasks traditionally performed by a few experts to turn a specification into an executable, thus making this expertise available widely. Overall, a DSL thus mediates a collaboration between its users and implementers that results in software that is more usable, more portable, more reliable, and more understandable. These benefits of DSLs have been delivered in domains old and new, such as signal processing, data mining, and Web scripting. Widely known examples of DSLs include Matlab, Verilog, SQL, LINQ, HTML, OpenGL, Macromedia Director, Mathematica, Maple, AutoLisp/AutoCAD, XSLT, RPM, Make, lex/yacc, LaTeX, PostScript, and Excel. Despite these successes, the adoption of DSLs have been stunted by the lack of general tools and principles for developing, compiling, and verifying domain-specific programs. General support for building and using DSLs is thus urgently needed. Languages that straddle the line between the domain-specific and the general-purpose, such as Perl, Tcl/Tk, and JavaScript, suggest that such support be based on modern notions of language design and software engineering. The goal of this conference, following the last one in 2009, is to explore how present and future DSLs can fruitfully draw from and potentially enrich these notions. We seek research papers on the theory and practice of DSLs, including but not limited to the following topics. * Foundations, including semantics, formal methods, type theory, and complexity theory * Language design, including concrete syntax, semantics, and types * Software engineering, including domain analysis, software design, and round-trip engineering * Modularity and composability of DSLs * Software processes, including metrics for software and language evaluation * Implementation, including parsing, compiling, program generation, program analysis, transformation, optimization, and parallelization * Reverse engineering, re-engineering, design discovery, automated refactoring * Hardware/software codesign * Programming environments and tools, including visual languages, debuggers, testing, and verification * Teaching DSLs and the use of DSLs in teaching * Case studies in any domain, especially the general lessons they provide for DSL design and implementation The conference will include a visit to the city of Bordeaux, a tour and tasting at the wine museum and cellar, and a banquet at La Belle Époque. INSTRUCTIONS FOR AUTHORS Papers will be judged on the depth of their insight and the extent to which they translate specific experience into general lessons for software engineers and DSL designers and implementers. Where appropriate, papers should refer to actual languages, tools, and techniques, provide pointers to full definitions, proofs, and implementations, and include empirical results. Proceedings will be published in Electronic Proceedings in Theoretical Computer Science ( http://info.eptcs.org/) . Submissions and final manuscripts should be at most 25 pages in EPTCS format. PROGRAM COMMITTEE * Emilie Balland (INRIA) * Olaf Chitil (University of Kent) * Zoé Drey (IRIT) * Nate Foster (Cornell University) * Mayer Goldberg (Ben-Gurion University) * Shan Shan Huang (LogicBlox) * Sam Kamin (University of Illinois at Urbana-Champaign) * Jerzy Karczmarczuk (University of Caen) * Jan Midtgaard (Aarhus University) * Keiko Nakata (Tallinn University of Technology) * Klaus Ostermann (University of Marburg) * Jeremy Siek (University of Colorado at Boulder) * Tony Sloane (Macquarie University) * Josef Svenningsson (Chalmers University of Technology) * Paul Tarau (University of North Texas) * Dana N. Xu (INRIA) ORGANIZERS Local chair: Emilie Balland (INRIA) Program chairs: Olivier Danvy (Aarhus University), Chung-chieh Shan (Rutgers University) ------------------------------------------------------------------------

1 0

Announcing Djinn, version 2004-12-11, a coding wizard
by Lennart Augustsson 07 Apr '11

07 Apr '11

Howdy, y'all! I've written a small program that takes a (Haskell) type and gives you back a function of that type if one exists. It's kind of fun, so I thought I'd share it. It's probably best explained with a sample session. calvin% djinn Welcome to Djinn version 2005-12-11. Type :h to get help. # Djinn is interactive if not given any arguments. # Let's see if it can find the identity function. Djinn> f ? a->a f :: a -> a f x1 = x1 # Yes, that was easy. Let's try some tuple munging. Djinn> sel ? ((a,b),(c,d)) -> (b,c) sel :: ((a, b), (c, d)) -> (b, c) sel ((_, v5), (v6, _)) = (v5, v6) # We can ask for the impossible, but then we get what we # deserve. Djinn> cast ? a->b -- cast cannot be realized. # OK, let's be bold and try some functions that are tricky to write: # return, bind, and callCC in the continuation monad Djinn> type C a = (a -> r) -> r Djinn> returnC ? a -> C a returnC :: a -> C a returnC x1 x2 = x2 x1 Djinn> bindC ? C a -> (a -> C b) -> C b bindC :: C a -> (a -> C b) -> C b bindC x1 x2 x3 = x1 (\ c15 -> x2 c15 (\ c17 -> x3 c17)) Djinn> callCC ? ((a -> C b) -> C a) -> C a callCC :: ((a -> C b) -> C a) -> C a callCC x1 x2 = x1 (\ c15 _ -> x2 c15) (\ c11 -> x2 c11) # Well, poor Djinn has a sweaty brow after deducing the code # for callCC so we had better quit. Djinn> :q Bye. To play with Djinn do a darcs get http://darcs.augustsson.net/Darcs/Djinn or get http://darcs.augustsson.net/Darcs/Djinn/Djinn.tar.gz Then just type make. (You need a Haskell 98 implementation and some libraries.) And then start djinn. For the curious, Djinn uses a decision procedure for intuitionistic propositional calculus due to Roy Dyckhoff. It's a variation of Gentzen's LJ system. This means that (in theory) Djinn will always find a function if one exists, and if one doesn't exist Djinn will terminate telling you so. This is the very first version, so expect bugs. :) Share and enjoy. -- Lennart

8 13

Haskell Weekly News: Issue 176
by Daniel Santa Cruz 07 Apr '11

07 Apr '11

Welcome to issue 176 of the HWN, a newsletter covering developments in the [1]Haskell community. This release covers the week of March 27 to April 02, 2011. You can find the HTML version at: http://bit.ly/fEdQka Announcements Wren Ng Thornton [2]announced the release of version 0.3.4 of unix-bytestring. Ian Lynagh and the GHC team [3]announced version 7.0.3 of GHC, containing a handful of bugfixes. Jose A. Ortega Ruiz [4]annouced the release of version 0.13 of xmobar. Might want to check it out specially if you are using xmonad! Jason Dagit [5]annouced release 0.2.0 of the nehe-tuts package, tutorials for using OpenGL. David Sorokin [6]annouced the release of his new library aivika: a multi-paradigm simulation library. Tom Hawkins [7]annouced version 0.3.1 of ImProve: an imperative DSL for hard realtime embedded applications. Eric Y. Kow [8]introduced the first issue of Parallel Haskell Digest, "a newsletter aiming to show off all the work that's going on using parallelism and concurrency in the Haskell community." Here is to hoping we get more of these! George Giorgidze [9]announced version 0.5.5 of DSH (Database Supported Haskell). Jasper Van der Jeugt [10]annouced the 7th Ghent Functional Programming Group meeting on Tuesday, April 26, in celebration of the group's first year of existance. The meetup will be at the Technicum building of Ghent University at 19:30. Quotes of the Week * lispy: [in response to "C++ is a huge language, the type system is complex"] real and imaginary components :) the imaginary bits are the type safety * gwern: amazing `catch` (how sweet the type), that saved an exception like me! I once was thrown, but now am caught; was impure, but now pure be * hpc: appEndo sounds like a harry potter spell * monochrom: yeah, get out of Turing tarpit, provable termination, only to get into Godel tarpit * xplat: to me, the great thing about pointfree programming is you don't have to let variable names get in the way of your logic. and the great thing about pointful programming is you don't have to let '(flip .) . (.) . (flip flip . join)' get in the way of your logic. it's nice to have multiple tools in your toolbox * lispy: I've never looked at the gtk2hs source. I'm not sure I can muster the intestinal fortitude * kmc: time to play "transfinite ordinal or asian emoticon" * killing-joke: rip oop. "Object-oriented programming is eliminated entirely from the introductory curriculum, because it is both anti-modular and anti-parallel by its very nature, and hence unsuitable for a modern CS curriculum." Top Reddit Stories * Promo code to get Learn You a Haskell 40% off + e- book for free + swag From (learnyouahaskell.com) scored 68 with 25 comments. Read on [11]reddit. Read the [12]original post. * Real Time Edge Detection in Parallel Haskell From (disciple-devel.blogspot.com) scored 39 with 9 comments. Read on [13]reddit. Read the [14]original post. * Modern OpenGL with Haskell From (arcadianvisions.com) scored 39 with 10 comments. Read on [15]reddit. Read the [16]original post. * GHC migration to Git complete From (haskell.org) scored 37 with 15 comments. Read on [17]reddit. Read the [18]original post. * Haskell is 21 years old today! From (twitter.com) scored 37 with 8 comments. Read on [19]reddit. Read the [20]original post. * Re-implementing XMonad's core in Coq : Wouter Swiestra :: PDF From (cs.ru.nl), scored 34 with 13 comments. Read on [21]reddit. Read the [22]original post. * GHC 7.0.3 released From (haskell.org) scored 33 with 9 comments. Read on [23]reddit. Read the [24]original post. * "Reactive-banana and the essence of FRP". I implemented a small FRP library that can be mixed freely with imperative code. From (apfelmus.nfshost.com) scored 30 with 7 comments. Read on [25]reddit. Read the [26]original post. * New release of OpenGL NeHe tutorials in Haskell From (self.haskell), scored 27 with 22 comments. Read on [27]reddit. * Do you read academic papers on a Kindle? From (dmwit.com) scored 26 with 27 comments. Read on [28]reddit. Read the [29]original post. Top StackOverflow Questions * [30]Implementing lazy functional languages votes: 19, answers: 3 * [31]Is it possible to roll your own syntax sugar (like do-notation, or arrow-notation) in Haskell? votes: 12, answers: 2 * [32]Are there any LL Parser Generators for Functional Languages such as Haskell or Scala? votes: 11, answers: 4 * [33]Programming language for functional parallelism: F# vs Haskell votes: 10, answers: 6 * [34]easy "undo" in functional data structures votes: 8, answers: 2 About the Haskell Weekly News If you have any comments/thoughts on the newsletter, don't hesitate to contact me at dstcruz(a)gmail.com. Happy coding! Until next time, Daniel Santa Cruz References 1. http://haskell.org/ 2. http://article.gmane.org/gmane.comp.lang.haskell.libraries/15521 3. http://article.gmane.org/gmane.comp.lang.haskell.general/18607 4. http://article.gmane.org/gmane.comp.lang.haskell.cafe/87583 5. http://article.gmane.org/gmane.comp.lang.haskell.cafe/87584 6. http://article.gmane.org/gmane.comp.lang.haskell.general/18612 7. http://article.gmane.org/gmane.comp.lang.haskell.cafe/87628 8. http://article.gmane.org/gmane.comp.lang.haskell.cafe/87709 9. http://article.gmane.org/gmane.comp.lang.haskell.general/18635 10. http://article.gmane.org/gmane.comp.lang.haskell.cafe/87752 11. http://www.reddit.com/r/haskell/comments/ge10y/promo_code_to_get_learn_you_… 12. http://learnyouahaskell.com/ 13. http://www.reddit.com/r/haskell/comments/gdudz/real_time_edge_detection_in_… 14. http://disciple-devel.blogspot.com/2011/03/real-time-edge-detection-in-hask… 15. http://www.reddit.com/r/haskell/comments/gepfm/modern_opengl_with_haskell/ 16. http://www.arcadianvisions.com/blog/?p=224 17. http://www.reddit.com/r/haskell/comments/ggu2r/ghc_migrati%C3%B6n_t%C3%B6_g… 18. http://www.haskell.org/pipermail/cvs-ghc/2011-April/060798.html 19. http://www.reddit.com/r/haskell/comments/ggwv3/haskell_is_21_years_old_toda… 20. http://twitter.com/donsbot/status/54026417721188352 21. http://www.reddit.com/r/haskell/comments/gf3sb/reimplementing_xmonads_core_… 22. http://www.cs.ru.nl/~wouters/Talks/BrouwerExtraction.pdf 23. http://www.reddit.com/r/haskell/comments/gcmsz/ghc_703_released/ 24. http://www.haskell.org/pipermail/haskell/2011-March/022673.html 25. http://www.reddit.com/r/haskell/comments/gd46d/reactivebanana_and_the_essen… 26. http://apfelmus.nfshost.com/blog/2011/03/28-essence-frp.html 27. http://www.reddit.com/r/haskell/comments/gcsi1/new_release_of_opengl_nehe_t… 28. http://www.reddit.com/r/haskell/comments/gfz5k/do_you_read_academic_papers_… 29. http://dmwit.com/pdfsplit 30. http://stackoverflow.com/questions/5451645/implementing-lazy-functional-lan… 31. http://stackoverflow.com/questions/5450003/is-it-possible-to-roll-your-own-… 32. http://stackoverflow.com/questions/5507665/are-there-any-ll-parser-generato… 33. http://stackoverflow.com/questions/5492930/programming-language-for-functio… 34. http://stackoverflow.com/questions/5447054/easy-undo-in-functional-data-str…

1 0

Re: [Haskell] How to contact OpenGL package maintainer (where is Sven?)
by Jason Dagit 06 Apr '11

06 Apr '11

No response yet from Sven after about a month and no one seems to have heard from him in over a year. I'm going to take over for now under the assumption that Sven is missing. == My plans for moving forward == * Assemble an opengl taskforce, a few people have already mentioned an interest in being on the team * clean up the current cabal files (I already wrote patches for that) * put the repos on github to make team collaboration easier * add the RULES that Andy Gill suggested for realToFrac * look at adding instances for MArray so that GLfloat et al can be stored in IOUArrays * add support for opengl 4.x * look at adding deprecation pragmas for deprecated opengl calls * new hackage releases * anything else that comes up Thanks, Jason On Sun, Mar 27, 2011 at 2:11 PM, Jason Dagit <dagitj(a)gmail.com> wrote: > I sent the message below to Haskell-Cafe about a week ago. I got one > response saying that Sven has disappeared in the past but reappeared when > updates were necessary. I still haven't heard from Sven. Now I'm widening > my search. My original email to Sven was on March 11th. > > It looks like the OpenGL packages on hackage[1,2,3,4] have not been > updated in some time. No updates later than Oct 2009. I tried to email > Sven directly using the email address listed on hackage but after over two > weeks I still haven't heard from him. I sent some patches to the opengl list > about a week ago but I noticed that Sven hasn't posted on that list since > Oct 2009 when he released the current version of OpenGLRaw. None of the > public darcs repos have patches newer than Oct 2009. Also, the homepage url > listed in the packages is a 404: > http://www.haskell.org/HOpenGL/ > > My concern is that Sven has disappeared for some reason. I hope he's well. > He has always done top notch work in the past maintaining these libraries. > Perhaps he's simply busy or lost interest? > > Does anyone know if he was looking for a new maintainer? Perhaps you've > heard from him more recently than Oct 2009? > > If a new maintainer is needed, I would consider nominating myself :) > > Thanks, > Jason > > [1] http://hackage.haskell.org/package/OpenGLRaw > [2] http://hackage.haskell.org/package/OpenGL > [3] http://hackage.haskell.org/package/GLURaw > [4] http://hackage.haskell.org/package/GLUT >

2 2

Extended submission deadline, AAIP 2011
by Emanuel Kitzelmann 05 Apr '11

05 Apr '11

4th Workshop on Approaches and Applications of Inductive Programming, AAIP 2011 *The deadline for paper submissions has been extended to April 24, 2011.* More information on AAIP 2011: http://www.cogsys.wiai.uni-bamberg.de/aaip11/ -- Dr. Emanuel Kitzelmann International Computer Science Institute (ICSI) 1947 Center Street, Suite 600 Berkeley, CA 94704, USA e-mail: emanuel(a)icsi.berkeley.edu phone: +1 510 666 2883

1 0