- Haskell - Haskell.org

haskell for XMI processing?
by Johannes Waldmann 21 Apr '04

21 Apr '04

I wonder if Haskell (HXmlToolbox) has been used for processing XMI data. -- -- Johannes Waldmann, Tel/Fax: (0341) 3076 6479 / 6480 -- ------ http://www.imn.htwk-leipzig.de/~waldmann/ ---------

1 0

PDMC'04: Call for Papers
by Martin Leucker 20 Apr '04

20 Apr '04

[[ -- Apologies for multiple copies of this message -- ]] ============================================================================= Call for Papers 3rd International Workshop on PARALLEL AND DISTRIBUTED METHODS IN VERIFICATION (PDMC 2004) September 4, 2004, London, U.K. Workshop affiliated to CONCUR'04, 31 August - 3 September 2004. http://www.fi.muni.cz/~brim/PDMC04 ============================================================================= OBJECTIVES: The growing importance of automated formal verification in industry is driving a growing interest in those aspects which have a direct impact on its applicability to real world problems. One of the main technical challenges is in devising tools that allow to handle large state spaces. Over the last years numerous approaches have been developed. Recently, an increasing interest is in parallelizing and distributing of verification techniques. The aim of the PDMC workshop series is to cover all aspects of parallel and distributed methods and techniques for formal verification. Theoretical results, algorithms and case studies are equally welcome. After two successful meetings in 2002 and 2003 with primary focus on parallelization of model checking, the scope of the workshop have been extended to cover all approaches where parallel and distributed techniques can make the automated verification more effective and/or extend its applicability. This extension is also reflected in the new name of the workshop. The PDMC workshop aims to provide a working forum for presenting, sharing, and discussing recent achievements in the field of parallel and distributed verification. The workshop will consist of invited talks and a selection from submitted papers. SCOPE AND TOPICS: Papers describing recent work on all aspects of parallel and distributed verification are solicited as contributions to PDMC. Topics of interest include, but are not limited to: * parallel and distributed model checking * parallel and distributed equivalence checking * parallel and distributed satisfiability checking * slicing and distributing the state space * distributed theorem proving * distributed constraints solving * parallel methods in probabilistic model checking * file systems for distributed transitions systems * parallel methods in performance evaluation * tools and case studies * industrial applications SUBMISSION GUIDELINES: There are two categories of submissions: regular papers and presentations. * Manuscripts of regular papers are limited to a maximum of 10 pages (excluding bibliography and technical appendices) in postscript or PDF format (ENTCS style strongly recommended). * Presentation reports on relevant results submitted to other forums or already published or on not yet finished work in progress. Presentations will appear in the workshop preliminary proceedings, but will not be considered for the final workshop proceedings. The space limit for presentations is 10 pages (excluding bibliography and technical appendices) in postscript or PDF format (ENTCS style strongly recommended). Submissions should be made electronically using PDMC'04 Submission Page. PROCEEDINGS: The preliminary workshop proceedings will be available as a Research Report of Imperial College London. The final proceedings appear as a volume of Electronic Notes in Theoretical Computer Science. After the workshop, selected authors will be invited to submit full versions of their papers (regular papers or presentation results not submitted for journal publication) to a special issue of IEEE Transaction of Parallel and Distributed Systems (under negotiation). IMPORTANT DATES: * May 29, 2004: Submission deadline for regular papers. * July 5, 2004: Notification of acceptance. * July 10, 2004: Deadline for presentations. * July 31, 2004: Camera ready copy for proceedings. INVITED SPEAKER: Boi B. Faltings (Swiss Federal Institute of Technology, Lausanne) PROGRAM COMMITTEE: * Howard Barringer (Manchester Univ., UK) * Lubos Brim (Masaryk Univ., CZ) - Co-chair * Gianpiero Cabodi (Torino, IT) * Wan Fokkink (CWI Amsterdam, NL) * Hubert Garavel (INRIA, FR) * Hanne Gottliebsen (Queen Mary Univ. of London, UK) * Orna Grumberg (Haifa, Israel) * Boudewijn R. Haverkort (Univ. of Twente, NL) * Michael Jones (Brigham Young Univ., USA) * Marta Kwiatkowska (Univ. of Birmingham, UK) * Martin Lange (LMU Muenchen, DE) * Reinhard Letz (TU Muenchen, DE) * Martin Leucker (Uppsala Univ., SE) - Co-chair * Sharad Malik (Princeton Univ., USA) * Eric Mercer (Brigham Young Univ., USA) * Michel Rueher (Universite Nice Sophia Antipolis, FR) * Pascal Van Hentenryck (Brown University, USA) * Willem Visser (NASA Ames Research Center, USA) Lubos Brim & Martin Leucker workshop organizers

1 0

CIA04: Extended Submission Deadline
by Matthias Klusch 19 Apr '04

19 Apr '04

++ Apologies for multiple copies due to cross-posting ++ Dear colleague(s), due to many requests in the past days, the paper submission deadline for the 8th international workshop CIA 2004 on cooperative information agents to be held September 27-29, 2004 in Erfurt(Germany), in cooperation with ACM SIGART and ACM SIGWeb has been EXTENDED to **** May 10, 2004 (Monday) *** For more information on this event please visit http://www.dfki.de/~klusch/cia2004/ Best regards, The CIA 2004 Organisational Board __________________________________________________ Dr. Matthias Klusch German Research Center for Artificial Intelligence Stuhlsatzenhausweg 3, 66123 Saarbrücken, Germany phone +49-6813025297, fax +49-6813022235 http://www.dfki.de/~klusch __________________________________________________

1 0

ANNOUNCE: JVM-Bridge 0.3 released
by Ashley Yakeley 19 Apr '04

19 Apr '04

Release 0.3 of Haskell/Java VM Bridge is now available in source-code form. New in Version 0.3: * Windows support (thanks to Thomas Pasch) * Can now work with third-party Java libraries * Minor bug fixes Haskell/Java VM Bridge allows Haskell programs access to the Java Virtual Machine. It comes in two parts: the 'Native' part, that abstracts away differences in the various Java VMs, and the 'Haskell' part that provides a Haskell API. The Native part is not Haskell-specific, and could potentially be used by other languages wishing to access the Java VM. Features include: * Calling of Java methods, access to fields, array-handling; * Integration of garbage collectors; * Reconciliation of exception models; * Reconciliation of thread models, including 'synchronized' monitor support and the ability to fork Haskell actions as Java threads; * Strong typing for Java classes and method argument lists (as tuples), and use of Haskell lists as arrays; * Creation of Java classes 'on the fly' (using DefineClass and the Java Class File Format) that can have Haskell callback methods; * Lifted monads which do all the necessary JNI class and method/field ID preloading and 'JNIEnv'-pointer variable handling for you -- these can be automatically generated via a tool (MakeJVMModule); * Layered design includes lower-level IO-based interface; * Automatic generation of modules for Java API classes; * All relevant imports, flags and libraries etc. handled by a single GHC package 'javavm'; * No 'unsafe' Haskell calls or pure function FFI anywhere; * Easy to port to new Java VMs. You will need: * An x86 machine running some form of Unix, or a Mac OS X machine, or a Windows machine with MinGW installed (see Building.win32 for notes on this); * GHC 6.2.1 or later; Earlier versions of GHC may work, but there's a bug in ghc-pkg in GHC 6.2 that causes package problems and may necessitate editing your package.conf by hand. Use 6.2.1 instead. * A Java VM. Haddock documentation is available by running "make doc". There are currently no annotations however. Some simple examples have been included such as a program that shows a Java Frame containing an instance of a Haskell-defined subclass of Canvas that has a Haskell 'paint' method that draws an oval. You should be able to figure out most of it from that. Haskell/JVM Bridge and source code is licensed under the GNU Lesser GPL. <http://sourceforge.net/projects/jvm-bridge/> Future plans: * use hierarchical module structure * separate out pure (non-FFI) Haskell into a separate package -- Ashley Yakeley, Seattle WA

1 0

ESSLLI 2004 - Deadline for Early Registration 1st of May
by Carlos Areces 17 Apr '04

17 Apr '04

======================================================================= ESSLLI 2004 ESSLLI 2004 ESSLLI 2004 ESSLLI 2004 ESSLLI 2004 ESSLLI 2004 Deadline for Early Registration ******** 1 May 2004 ******** ESSLLI 2004 Nancy, France 9-20 August, 2004 ======================================================================= This is a reminder that the deadline for early registration for ESSLLI 2004, the 16th European Summer School in Logic, Language and Information is ******** 1 May 2004 ******** To qualify for the lower registration fee, you have to register before this date. To register go to: http://esslli2004.loria.fr click on the registration button, fill out the online form, print out the result, and fax (or surface-mail) it in. As well as registering, you can use the same form to reserve student accommodation and book lunch tickets (the lunch menu is available on the ESSLLI 2004 website). Once again, are happy to announce that the evening lecturers at ESSLLI 2004 will be: Elisabeth Andre Gerard Huet Karen Sparck Jones Vladimir Lifschitz In addition, the site now contains information about travel to Nancy, and tourist information about Nancy. Please note: we can only guarantee 360 student accommodation places, and these will be distributed on a first-come-first-served basis. We look forward to seeing you in Nancy this August! Carlos Areces, Patrick Blackburn (for the Organising committee) Helene Kirchner (Director of Loria) ======================================================================= ESSLLI 2004 ESSLLI 2004 ESSLLI 2004 ESSLLI 2004 ESSLLI 2004 ESSLLI 2004 =======================================================================

1 0

Arrows and XML filters
by David Menendez 17 Apr '04

17 Apr '04

I don't know if this has come up before. If it has, I'd be interested in a link to the discussion. Last week, I noticed that filters used in the Haskell XML Toolbox (and elsewhere) are easily made into arrows. Specifically, for any filter f :: a -> [b] we can write Kleisli f :: Kleisli [] a b It then turns out that many of the filter combinators correspond exactly to arrow combinators. For example: Kleisli (g `o` f) === Kleisli f >>> Kleisli g Kleisli (f .> g) === Kleisli f >>> Kleisli g Kleisli (f +++ g) === Kleisli f <+> Kleisli g Kleisli this === returnA Kleisli none === zeroArrow Similarly, for the functions 'cat' and 'seqF', we can write > asum :: ArrowPlus a => [a b c] -> a b c > asum = foldr (<+>) zeroArrow > > seqA :: Arrow a => [a b b] -> a b b > seqA = foldr (>>>) returnA And so forth. The predicate combinators can't be made as general, but they still work in an arrow framework. > orElse :: Kleisli [] a b -> Kleisli [] a b -> Kleisli [] a b > orElse (Kleisli f) (Kleisli g) = > Kleisli (\t -> let res = f t in if null res then g t else res) The tree filters work similarly: > type TFilterA node = Kleisli [] (NTree node) (NTree node) > processChildren :: TFilterA node -> TFilterA node > processChildren (Kleisli f) = > Kleisli (\(NTree n cs) -> [NTree n (concatMap f cs)]) I don't know if this has any practical value. (Perhaps for future XML libraries?) If nothing else, it's given me some experience with and (I hope) a better understanding of arrows. -- David Menendez <zednenem(a)psualum.com> <http://www.eyrie.org/~zednenem/>

1 0

[CFP] 2004 Scheme Workshop
by oscar waddell 15 Apr '04

15 Apr '04

The 2004 Scheme Workshop will be held with ICFP this September in Snowbird, Utah. Plans for this one-day event include presentations of technical and experience papers as well as panel discussions. It should be a useful and fun day for anyone with an interest in Scheme or functional programming languages. Please take a moment to read the "call for papers" appended below and consider submitting a paper. The submission deadline is June 9, 2004. See you in Utah, -Oscar Waddell workshop chair ======================================================================= CALL FOR PAPERS 2004 Scheme Workshop http://www.cs.indiana.edu/scheme2004 Snowbird, Utah, USA 22 September 2004 The workshop will be held in conjunction with ICFP 2004. http://www.cs.indiana.edu/icfp04/ ---------------------------------------------------------------------- Important dates Submission deadline June 9, 2004 Author notification July 23, 2004 Final paper due August 23, 2004 Workshop September 22, 2004 ---------------------------------------------------------------------- Purpose The 2004 Scheme Workshop is a forum for discussing experience with and future development of the Scheme programming language. The scope of the workshop includes all aspects of the design, implementation, theory, and application of Scheme. We encourage everyone interested in Scheme to participate. The workshop has been accepted by the ICFP'04 workshop committee; formal approval by the SIGPLAN executive committee is pending. ---------------------------------------------------------------------- Scope We invite submissions for both technical and experience papers. Topics of interest for Technical Papers include (but are not limited to): * Design Language critiques and extensions, concurrency and distribution, components and composition, language embedding, object systems, exception handling, syntactic abstraction, module systems and libraries, multiparadigm programming, scripting. * Implementation Compilers, interpreters, runtime systems, virtual machines, resource management, program analysis and transformation, partial evaluation, compile-time and run-time optimization, foreign function and operating system interfaces, embedded systems. * Development tools Profilers, tracers, debuggers, program development environments, program understanding tools, performance and conformance test suites. * Theory Formal semantics, correctness of analyses and transformations, lambda calculus, continuations. Topics of interest for Experience Papers include (but are not limited to): * Applications Domain-specific languages, graphical user interfaces, web programming, network applications, multimedia programming, systems programming, symbolic computing, large systems, use of Scheme as a scripting language. * Practice and experience Experience with Scheme in education and industry. * Scheme pearls Elegant, instructive uses of Scheme. Following the model of ICFP 2004, experience papers need not necessarily report original research results; they may instead report practical experience that will be useful to others, re-usable programming idioms, or elegant new ways of approaching a problem. The key criterion for such a paper is that it makes a contribution from which other practitioners can benefit. It is not enough simply to describe a program! System Demonstrations. Authors of both technical and experience papers are invited to describe, in an appendix, proposals for system demonstrations to be given during the workshop. Panel Discussions. We also invite proposals for panel discussions on topics of interest to the Scheme community. Authors of accepted proposals will give a brief presentation on the topic and then moderate the discussion that follows. ---------------------------------------------------------------------- Submission guidelines Authors should submit a 100-200 word abstract and a full paper to the program chair via e-mail by the end of Wednesday, June 9, Universal Coordinated Time. (The end of the day UTC corresponds to 8:00 PM EDT, 6:00 PM MDT, and 5:00 PM PDT.) Papers must be submitted in either PDF format or as PostScript documents that are interpretable by Ghostscript. Papers must be printable on US Letter sized paper. Submissions should be typeset in 10 point font on 12 point baseline in two columns 20pc (3.33in) wide and 54pc (9in) tall with a column gutter of 2pc (0.33in). Submissions should be be no more than 15 pages including text, figures, and bibliography. Authors wishing to supply additional material to the reviewers beyond the 15 page limit may do so in clearly marked appendices, on the understanding that reviewers are not required to read the appendices. Suitable LaTeX class files may be downloaded from the workshop web site. (This is not the standard ACM conference style; it is a larger format adopted by POPL'05 to be easier on reviewer's eyes.) We anticipate that experience papers will be shorter, generally around 10 pages in length. Submitted papers must have content that has not previously been published in other conferences or refereed venues. Simultaneous submission to other conferences or refereed venues is unacceptable. Each paper should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, saying why it is significant, and comparing it with previous work. Authors should strive to make the technical content of their papers understandable to a broad audience. Submissions that do not meet these guidelines will not be considered. ------------------------------------------------------------------------------- Organizers Workshop chair: Oscar Waddell Computer Science Department Indiana University Bloomington, IN 47405-7104 owaddell(a)cs.indiana.edu Program committee: J. Michael Ashley (Beckman Coulter, Inc.) Danny Dubé (Université Laval) Robert Bruce Findler (University of Chicago) Richard Kelsey (Ember Corporation) Julia Lawall (University of Copenhagen) Michael Sperber (DeinProgramm) Steering committee: William D. Clinger (Northeastern University) Marc Feeley (University of Montreal) Matthias Felleisen (Northeastern University) Matthew Flatt (University of Utah) Dan Friedman (Indiana University) Christian Queinnec (University Paris 6) Manuel Serrano (INRIA) Olin Shivers (Georgia Institute of Technology) Mitchell Wand (Northeastern University)

1 0

simulating dependent types; ghc/ghci discrepancy
by John D. Barnett 14 Apr '04

14 Apr '04

Hello all- I'm still playing with simulating dependent types using rank-2 polymorphism, and I've run into a small stumbling block on unwrapping existential datatypes: they can't be let-bound (monomorphic restriction?), but can be unwrapped in a case or lambda. Actually, I find that assignment in do-notation works nicely (since I'm already writing monadic code). As an example: module DepTest where data Show' = forall a . Show a => Show' a print' :: Show' -> IO () print' x = do (Show' x') <- return x print x' -- here, the type of x' is known test :: IO () test = print' (Show' True) This works fine. My problem is that I'd like to do this interactively, in ghci. *DepTest> :t Show' True Show' True :: Show' *DepTest> Show' x <- return $ Show' True *DepTest> :t x x :: forall a. a *DepTest> x getTcTyVar a {- tv aXJ -} getTcTyVar a {- tv aXJ -} getTcTyVar a {- tv aXJ -} getTcTyVar a {- tv aXJ -} getTcTyVar a {- tv aXJ -} getTcTyVar a {- tv aXJ -} Interrupted. First, the type of x seems like it should be either Bool or (forall a. Show a => a), but not (forall a.a). Second, egads, what did I do? Is it possible to unwrap an existential type in ghci? Thanks- John

3 5

ANNOUNCE: HSQL 1.4 released
by Krasimir Angelov 14 Apr '04

14 Apr '04

I am pleased to announce the HSQL library version 1.4. The HSQL is a simple library, which provides interface to multiple databases. MySQL, PostgreSQL, ODBC and SQLite are currently supported. What is new? ~~~~~~~~~~~~ 1. The ODBC interface provides the "driverConnect" function which is an alternative to "connect" but allows to use a connection string instead of DSN, UserID and Pasword 2. The HSQL for Windows now supports MySQL and PostgreSQL databases. 3. A binary distributions are provided. There is an installation program for Windows-binary distribution and there are binary RPMs for Linux. All binaries are compiled for ghc-6.2.1 and Hugs Nov2003. 4. Some bugfixes Known bugs ~~~~~~~~~~ There is a bug in ghc-pkg from ghc-6.2.1. If you want to build libraries for GHCi you need to have ld.exe somewhere in the search path. The easiest way to workaround this is to copy ld.exe from ${GHC_INSTALL_DIR}/gcc-lib subdirectory to ${GHC_INSTALL_DIR}/bin before to install HSQL from binary under Windows. Credits ~~~~~~~ Great thanks to Victor Blomqvist and Conny Andersson for their work on binary distributions. Cheers, Krasimir __________________________________ Do you Yahoo!? Yahoo! Tax Center - File online by April 15th http://taxes.yahoo.com/filing.html

1 0

ANNOUNCE: Happy version 1.14
by Simon Marlow 14 Apr '04

14 Apr '04

A new version of Happy, the parser generator for Haskell, has been released. Version 1.14 is a small increment relative to 1.13, whose purpose is mainly to introduce one new feature which will be reuqired to compile future versions of GHC. >From the release notes: * New meta-veriable $> represents the rightmost token. * Happy's OPTIONS pragma is merged with an existing one in the grammar file, if any. Sources, binaries and documentation are on Happy's web page: http://www.haskell.org/happy/ Cheers, Simon

1 0