- Haskell - Haskell.org

ANN: CMI 1.0.0 - a cross-module inliner for C - written in Haskell
by Alastair Reid 24 Nov '03

24 Nov '03

[The following GPLed program may be of interest to you if: - You want examples of programs written in Haskell that do something useful. - You sometimes hack C code as well as Haskell and want to make your code smaller, faster or better structured. - You want a library of code for parsing and manipulating C programs. -- Alastair Reid www.haskell-consulting.com ] The University of Utah's Flux Research Group announces the first release of CMI, our cross-module inliner for C. CMI is an optimizing frontend for gcc which allows gcc to inline across module (i.e., function) boundaries without requiring you to put inline functions in header files or even mark inline functions for inlining. Get CMI's open source code and docs at: http://www.cs.utah.edu/flux/knit/cmi.html CMI: o makes your code go faster; o is a preprocessor for gcc; o supports most gcc extensions and is able to deal with such notoriosly tricky code as the glibc header files; o works by merging multiple C files into one file, topologically sorting the definitions so that definitions come before uses, and marks functions as inline; o controls code-bloat by deleting dead code and inlining up until a user-specified budget is reached; o can use user-specified heuristics to select which functions to inline (we include a tool which uses gprof output to choose inlinings to illustrate this); CMI is part of an ongoing R&D effort. We seek feedback, external users, and collaborators whose experiences and insight will help evolve CMI. CMI is a small part of Knit, our C Components project. To join the knit-users or knit-announce mailing lists, send email to majordomo(a)flux.cs.utah.edu with, e.g., "subscribe knit-users" in the body. Thanks go to DARPA for their support, and thanks go to the entire Knit crew, but especially Alastair Reid, for the fine research, development, and hard work that led to this release. and Alastair says... Enjoy! Jay Lepreau, lepreau(a)cs.utah.edu Flux Research Group, School of Computing University of Utah

1 0

RE: ANNOUNCE: Haddock version 0.6
by Simon Marlow 24 Nov '03

24 Nov '03

> In article <SMARTHOSTmGviaeSdaQ0009caeb(a)SMARTHOST.microsoft.com>, > "Simon Marlow" <simonmar(a)microsoft.com> wrote: > > > There is a new release of Haddock, version 0.6. This > version has several > > improvements over the previous release; the full list is below. > > Excellent! I was stuck on implicit parameters for awhile. > > I found one issue in 0.6 though, it seems to choke on explicit kind > declarations, for instance: > > newtype Constant (m :: * -> *) a = MkConstant a deriving (Eq); Yup, I'm afraid that's another extension not supported by Haddock at the moment. Cheers, Simon

1 0

ICALP'04 - Call for Papers
by Petri Salmela 24 Nov '03

24 Nov '03

Printable pdf-version at: http://www.math.utu.fi/icalp04/icalp-call.pdf ___________________________________________________________________ CALL FOR PAPERS - ICALP'04 31st International Colloquium on Automata, Languages and Programming July 12-16, 2004, Turku, Finland http://www.math.utu.fi/icalp04/ ___________________________________________________________________ The 31st International Colloquium on Automata, Languages and Programming sponsored by the European Association of Theoretical Computer Science will take place in Turku, on July 12-16, 2004. It is organised at Turku University by the Department of Mathematics and Turku Centre for Computer Science. ICALP04 is colocated with the 19th International Conference on Logic in Computer Science (LICS04). Papers presenting original research on all aspects of theoretical computer science are sought. Typical but not exclusive topics of interest are: Track A: * Algorithmic aspects of parallel and distributed computing * Algorithms and data structures * Algorithms and models for large networks * Algorithms for computationally hard problems * Automata theory and formal languages * Bioinformatics * Computational complexity * Combinatorics and structures in Computer Science * Cryptography * Machine learning * Molecular computing, neural and evolutionary algorithms * Proof complexity * Quantum computing Track B: * Algebraic and categorical models * Applications of automata in logic * Concurrency, mobility and distributed systems * Databases, semi-structured data and finite model theory * Logics and their applications * Principles of programming languages * Program logics, formal methods and model checking * Security analysis and verification * Semantics of programming languages * Specification, refinement and verification * Type systems and typed calculi SUBMISSIONS: ************ Authors are invited to submit a paper of no more than 12 pages in LNCS-style, presenting original research on the theory of computer science. Submissions should indicate which track the paper is submitted to. No simultaneous submission to other conferences with published proceedings is allowed. Accepted papers will be published in the Lecture Notes in Computer Science by Springer. IMPORTANT DATES: **************** Workshop proposals: November 30, 2003 Submissions: February 8, 2004 Notification: March 31, 2004 Final version: April 27, 2004 CONFERENCE CHAIR: ***************** Juhani Karhumäki Department of Mathematics and Turku Centre for Computer Science University of Turku FIN-20014 Turku, Finland email: karhumak(a)cs.utu.fi INVITED SPEAKERS: ***************** Joint ICALP-LICS: R. Harper (Carnegie Mellon) A. Razborov (Princeton & Moscow) M. Yannakakis (Stanford) ICALP: P. Flajolet (INRIA) M. Henzinger (Google) M. Hofmann (Munich) W. Rytter (Warsaw & NJIT) PROGRAM COMMITTEE: ****************** Track A A. Atserias, Barcelona (ES) G. Brodal, Aarhus (DK) J. Cassaigne, Marseille (FR) J. Díaz, Barcelona (ES), chair R. Fleischer, Hong Kong (HK) H. Gabow, Boulder (US) L. Goldberg, Warwick (UK) J. Hromkovic, Aachen (DE) G. Italiano, Roma (IT) T. Jiang, Riverside (US) C. Kaklamanis, Patras (GR) J. Kari, Turku (FI) C. Moore, Santa Fe (US) P. Pudlak, Prague (CZ) P. Raghavan, Verity, Stanford (US) M. Santha, Paris (FR) B. Voecking, Dortmund (DE) G. Woeginger, Twente (NL) M. Yung, Columbia U. (US) Track B R.-J. Back, Turku (FI) P.-L. Curien, Paris (FR) A. Gordon, Microsoft, Cambridge (UK) S. Hayashi, Kobe (JP) T. Henzinger, Berkeley (US) M. Hofmann, Munich (DE) B. Jacobs, Nijmegen (NL) E. Moggi, Genova (IT) J. Parrow, Uppsala (SE) C. Palamidessi, University Park, Penn. (US) B. Pierce, Philadelphia (US) A. Rabinovich, Tel Aviv (IL) D. Sannella, Edinburg (UK), chair W. Thomas, Aachen (DE) I. Walukiewicz, Bordeaux (FR) ORGANIZING COMMITTEE: ********************* J. Karhumäki, Conference Chair T. Järvi, Co-chair (ICALP) L. Hella, Co-chair (LICS) V. Halava M. Hirvensalo I. Petre P. Sibelius T. Knuutila CONTACT ADDRESSES: **************** For further information see: http://www.math.utu.fi/icalp04/ or contact: icalp04(a)cs.utu.fi or karhumak(a)cs.utu.fi

1 0

ANNOUNCE: Chameleon version (03-11)
by Martin Sulzmann 24 Nov '03

24 Nov '03

We are pleased to announce Chameleon version 03-11. Latest version can be downloaded via http://www.comp.nus.edu.sg/~sulzmann/chameleon/ The current version is a substantial improvement over previous versions. New/Improved features include: * Compilation of Chameleon to (plain) Haskell. * Mixing Haskell and Chameleon overloading. * Updated Chameleon manual. The manual (http://www.comp.nus.edu.sg/~sulzmann/chameleon/download/haskell.html) contains lots more information and an extensive collection of examples. Martin Sulzmann (sulzmann(a)comp.nus.edu.sg) Jeremy Wazny (jeremyrw(a)students.cs.mu.OZ.AU)

1 0

ANNOUNCE: Haddock version 0.6
by Simon Marlow 23 Nov '03

23 Nov '03

There is a new release of Haddock, version 0.6. This version has several improvements over the previous release; the full list is below. Source and binary distributions can be obtained from Haddock's homepage: http://www.haskell.org/haddock/ Enjoy! Simon Changes in version 0.6: * Implicit parameters, zip comprehensions and 'mdo' are now supported by the parser. * Some lexical bugs were fixed, mainly concerning literal paragraphs next to non-literal paragraphs. * New options: --gen-index, --use-index, --gen-contents and --use-contents, for generting a combined index and contents for several libraries from the appropriate .haddock files. * There is now one index rather than separate Function/Constructor and Type/Class indices. Where a name refers to several entities, these are listed separately in the index. * New option: -v, elicits more verbose warnings. Some warnings are now turned off by default; Haddock should be a little less noisy in general. * Markup for definition lists has been added. See the documentation for details. * New option: --package for setting the package name. The package is listed alongside each module name in the combined contents. * Entities which are re-exported from another package now at least leave a hyperlink in the generated HTML, rather than nothing at all. * Some fixes for bugs which caused incorrect hyperlinks in the generated HTML. In particular, instances should now be linked correctly. * Some aesthetic improvements to the generated HTML.

4 4

lifting functions to tuples?
by Abraham Egnor 21 Nov '03

21 Nov '03

The classic way to write a lift function for tuples is, of course: liftTup f (a, b) = (f a, f b) which has a type of (a -> b) -> (a, a) -> (b, b). I've been wondering if it would be possible to write a function that doesn't require the types in the tuple to be the same, just that the types in the second tuple are the result of applying the type transformation implied in the function to be lifted to the types in the first tuple. Now, in Haskell98, this isn't possible because of the monomorphism restriction; however, ghc conveniently has a way to disable that. However, I'm still having problems figuring out if it's even doable within the current constraints of the glasgow-extended type system. One possibility I tried is: liftTup (f :: forall a b. a -> b) (p, q) = (f p, f q) which does, in fact, compile. A very odd type is inferred: liftTup :: forall b1 b a1 a. (forall a2 b2. a2 -> b2) -> (a, a1) -> (b, b1) I call this odd because there's no mention of the type dependencies inherent in the actual function. However, any attempt to apply it to a polymorphic function results in the following errors: random.hs:17: Could not deduce (Num b) from the context () arising from use of `inc' at random.hs:17 Probable fix: Add (Num b) to the expected type of an expression In the first argument of `liftTup', namely `inc' In the definition of `tupInc': tupInc = liftTup inc random.hs:17: Inferred type is less polymorphic than expected Quantified type variable `b' is unified with another quantified type variable `a' In the first argument of `liftTup', namely `inc' In the definition of `tupInc': tupInc = liftTup inc which seems to be a direct consequence of the odd derived type. However, I can't think of a way to write a better one. The problem, as far as I can tell, is that there's no way in the type system to deal in type transformations, i.e. apply the conversion implied by (a -> b) to a given type a' to produce the appropriate b'. Thoughts? Abe

6 9

WS-FM 2004 Second Call For Papers
by Mario Bravetti 21 Nov '03

21 Nov '03

====================================================================== 1st International Workshop on Web Services and Formal Methods (WS-FM 2004) February 23, 2004, Pisa, Italy Workshop affiliated to COORDINATION 2004, February 24 - 27, 2004 Homepage: http://www.cs.unibo.it/~lucchi/ws-fm04/ ====================================================================== SCOPE Web Services technology aims at providing standard mechanisms for describing the interface and the services available on the web, as well as protocols for locating such services and invoking them (e.g. WSDL, UDDI, SOAP). Innovations are moving towards two main directions: The first one tends to the definition of new standards that support the specification of complex services out of simpler ones (the so called Web Service choreography). Several proposals have been already set up: BPML, XLANG and BizTalk, WSFL, BPEL4WS, etc... The second approach consists of the design of new (meta-)Web Services to be exploited at run-time by other Web Services: e.g. managing the cooperation of Web Services or acting as dynamic registry services. Formal methods, which provide formal machinery for representing and analysing the behavior of communicating concurrent/distributed systems, may potentially play a fundamental role in the development of such innovations. First of all they may help in understanding the basic mechanisms (in terms of semantics) which characterize different choreography languages and to focus on the essence of new features that are needed. Secondly they may provide a formal basis for reasoning about Web Service semantics (behaviour and equivalence): e.g. for realizing registry services where retrieval is based on the meaning of a service and not just a Web Service name. Thirdly also studies on formal coordination paradigms can be exploited for developing mechanisms for complex run-time Web Service coordination. Finally, given the importance of critical application areas for Web Services like E-commerce, the development of the Web Service technology can certainly take advantage from formal analisys of security properties and performance in concurrency theory. The aim of the workshop is to bring together researchers working on Web Services and Formal Methods in order to activate a fruitful collaboration in this direction of research. This, potentially, could also have a great impact on the current standardization phase of Web Service technologies. LIST OF TOPICS The topics of interest include, but are not limited to: - Protocols and standards for WS (SOAP, WSDL, UDDI, etc... ) - Languages and descripion methodologies for Coreography/Orchestration/Workflow (BPML, XLANG and BizTalk, WSFL, BPEL4WS, etc... ) - Coordination techniques for WS (transactions, agreement, coordination services, etc...) - Semantics-based dynamic WS discovery services (based on Semantic Web/Ontology techniques or other semantic theories) - Security, Performance Evaluation and Quality of Service of WS - Semi-structured data and XML related technologies - Comparisons with different related technologies/approaches SUBMISSIONS Submissions may be of two forms: - Original papers (neither published nor submitted to other conferences/workshops) - Contribution papers (possibly published or currently submitted) In both cases the paper should be up to 12 pages 12 pt. Accepted original papers will be published in the workshop proceedings: contacts with Electronic Notes in Theoretical Computer Science (Elsevier) have been established to publish them as an ENTCS volume. A time-slot will be reseved for the presentation at the workshop of a limited number of accepted contribution papers. Moreover, full versions of papers selected among both original and contribution papers will be likely invited for publication in a special issue of Theoretical Computer Science (Elsevier). Papers should be submitted following the instructions at the workshop homepage: http://www.cs.unibo.it/~lucchi/ws-fm04/ IMPORTANT DATES December 15, 2003: Submission deadline January 26, 2004: Notification of acceptance February 9, 2004: Pre-Final version February 23, 2004: Workshop date PROGRAM CO-CHAIRS Mario Bravetti and Gianluigi Zavattaro PROGRAM COMMITTEE Roberto Bruni (University of Pisa) Michael Butler (University of Southampton) Rocco De Nicola (University of Florence) Schahram Dustdar (Wien University of Technology) Gianluigi Ferrari (University of Pisa) Peter Furniss (Choreology Ltd UK) Andy Gordon (Microsoft Reasearch Cambridge) Roberto Gorrieri (University of Bologna) Stefania Gnesi (CNR Pisa) Nickolas Kavantzas (Oracle Co. US) Frank Leymann (IBM Research Germany) Fabio Martinelli (CNR Pisa) Shin Nakajima (Hosei University and PRESTO, JST) Manuel Nunez (University Complutense of Madrid) Vladimiro Sassone (University of Sussex) Friedrich Vogt (Technical University of Hamburg-Harburg) ORGANIZING COMMITTEE Roberto Bruni, Gianluigi Ferrari, Claudio Guidi, Roberto Lucchi, Emilio Tuosto SPONSORS Microsoft Research

1 0

RE: Haddock and Template Haskell
by Simon Marlow 21 Nov '03

21 Nov '03

> is Haddock compatible with Template Haskell or does it get > confused by $(...) > syntax? If it is compatible, how does the documentation of > TH-generated code look? There are two issues: Q. Will Haddock parse a file containing Template Haskell code? A. No, the parser doesn't currently understand the TH extensions. Q. Can you generate Haddock documentation for code *generated* by a TH splice? A. It only really makes sense for top-level splices, and you would have to arrange to dump the generated code from GHC and feed it into Haddock (this sounds like quite a lot of work to get GHC to dump parseable Haskell code). Or merge GHC with Haddock :-) Cheers, Simon

2 1

RE: Haddock and DocBook
by Simon Marlow 21 Nov '03

21 Nov '03

> the Haddock documentation says: > -S, --docbook > Reserved for future use (output documentation in SGML > DocBook format). > I would appreciate very much if the output wouldn't be just > in SGML DocBook > but in XML DocBook format. Would it be possible to implement > it this way? XML DocBook is very similar to SGML DocBook, so almost certainly. Cheers, Simon

1 0

Haddock and DocBook
by Wolfgang Jeltsch 21 Nov '03

21 Nov '03

Hello, the Haddock documentation says: -S, --docbook Reserved for future use (output documentation in SGML DocBook format). I would appreciate very much if the output wouldn't be just in SGML DocBook but in XML DocBook format. Would it be possible to implement it this way? Wolfgang

1 0