- Haskell - Haskell.org

ANN: C->Haskell 0.13.6
by Manuel M T Chakravarty 19 May '05

19 May '05

It is my pleasure to release version 0.13.6 "Pressing Forward" of the interface generator C->Haskell available from http://www.cse.unsw.edu.au/~chak/haskell/c2hs/ The main technical feature of this release is support for GHC 6.4, most of which has been kindly contributed by André Pang. Moreover, C->Haskell is now maintained in a darcs repository. Access details are on the web site. Manuel

1 0

ICLP 2005 Doctoral Consortium: Call for Applications
by ICLP 2005 18 May '05

18 May '05

International Conference on Logic Programming Doctoral Consortium Sitges (Barcelona), Spain October 2-5, 2005 http://www.cs.nmsu.edu/~epontell/DC2005 ----------- The ICLP Doctoral Consortium (DC) is the first ever doctoral consortium to be offered as part of the International Conference on Logic Programming. The DC will take place during ICLP 2005 in Sitges (Barcelona), Spain. The Doctoral Consortium is designed for doctoral students working in areas related to logic programming, who are planning to pursue a career in academia. The Doctoral Consortium aims to provide students with an opportunity to present and discuss their research directions and to obtain feedbacks from peers as well as world-renown experts in the field. The Doctoral Consortium will also offer invited speakers and panels discussions. ------------ The Doctoral Consortium is held the during the regular activities of the ICLP 2005 Conference. The aims of the Doctoral Consortium are: * To provide doctoral students working in the field of logic programming with a friendly and open forum to present their research ideas, listen to ongoing work from peer students, and receive constructive feedback * To provide students with relevant information about important issues for doctoral candidates and future academics * To develop a supportive community of scholars and a spirit of collaborative research. * To support a new generation of researchers with information and advice on academic, research, industrial, and non- traditional career paths. The Consortium is designed for students currently enrolled in a Ph.D. program, though we are also open to exceptions (e.g., students currently in a Masters program and interested in doctoral studies). The Consortium is for students at any stage of their doctoral studies are welcome to apply. Applicants are expected to be conducting research in the field of Logic Programming; topics of interest include (but are not limited to): * Theoretical Foundations of Logic and Constraint Logic Programming * Sequential and Parallel Implementation Technology * Static and Dynamic Analysis, Abstract Interpretation, Compilation Technology, Verification * Logic-based Paradigms (e.g., Answer Set Programming, Concurrent Logic Programming, Inductive Logic Programming) * Innovative Applications of Logic Programming The Consortium allows participants to interact with established researchers and with other students, through presentations, question- answer sessions, panel discussions, and invited presentations. The Doctoral Consortium will provide the possibility to reflect - through short activities, information sessions, and discussions - on the process and lessons of research and life in academia. Each participant will give a short, critiqued, research presentation. The Doctoral Consortium will be held on a date to be determined, in parallel with the regular activities of the ICLP 2005 conference; the ICLP conference will run from October 2nd to October 5th, 2005. Doctoral Consortium participants will be offered the opportunity to have their abstracts published in the ICLP 2005 conference proceedings. Discussants: Several renown faculty members and researchers in the field of Logic Programming will join in evaluating the submission packets and will participate in the Doctoral Consortium, providing feedback to the presenters. The list of the discussants will be published at a later date. -------- Detailed submission instructions can be found in the ICLP 2005 Doctoral Consortium web site, at: http://www.cs.nmsu.edu/~epontell/DC2005 -------- Important Dates Submission Deadline: June 1st, 2005 Acceptance Notification: July, 1st 2005 Last Date to Update Research Summary: July 15th, 2005 Doctoral Consortium: October 2-5, 2005 ICLP 2005 Conference: October 2-5, 2005 ------------ Doctoral Consortium Chair: Enrico Pontelli Department of Computer Science New Mexico State University MSC CS, Box 30001 Las Cruces, NM 88003, USA epontell _a_t_ cs.nmsu.edu

1 0

Re: runghc, ".hs" suffix
by Frederik Eaton 18 May '05

18 May '05

Excellent, thanks. Once you've committed this, it seems like there should be potential for haskell scripts to be used in some of the same situations as e.g. perl scripts. Is 'runhaskell' supposed to be a standard handle to a working haskell interpreter, e.g. possibly runhugs or runnhc? Should people put '#!/usr/bin/env runhaskell' at the top of scripts? Frederik On Mon, May 16, 2005 at 03:52:51PM +0100, Simon Marlow wrote: > I'm working on this. It's not trivial because GHC assumes all over the > place that the suffix on a file determines how it should be compiled, > but I've now implemented something similar to gcc's -x flag. > > Cheers, > Simon > > On 14 May 2005 20:04, Frederik Eaton wrote: > > > (moving to a separate thread) > > > > Also, how hard would it be to make it so that runghc doesn't require > > script file names to end with ".hs"? Some people like to keep their > > executable names language-neutral. > > > > Frederik > > > > On Wed, May 11, 2005 at 10:55:03AM +0100, Simon Marlow wrote: > >> On 11 May 2005 07:37, Frederik Eaton wrote: > >> > >>> It looks like runghc is exiting with status 0 if there is a > >>> problem. Shouldn't this be non-zero? > >>> > >>> $ runghc -V > >>> The Glorious Glasgow Haskell Compilation System, version 6.4 $ > >>> runghc /dev/null; echo $? Could not find module `/dev/null': > >>> use -v to see a list of the files searched for > >>> (one of the roots of the dependency analysis) > >>> > >>> <interactive>:1:76: > >>> Failed to load interface for `Main': > >>> Could not find module `Main': > >>> it is not a module in the current program, or in any known > >>> package. 0 > >> > >> It turns out I fixed this bug after 6.4, but later the fix was > >> accidentally reverted. So thanks for reporting this again, it'll > >> work properly in 6.4.1. > >> > >> Cheers, > >> Simon > >> > > > > _______________________________________________ > > Glasgow-haskell-bugs mailing list > > Glasgow-haskell-bugs(a)haskell.org > > http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs > > -- http://ofb.net/~frederik/

1 0

PPDP 2005 Submission Deadline Extended to February 22
by Amy Felty 18 May '05

18 May '05

Call for Papers: PPDP 2005 Seventh ACM-SIGPLAN International Symposium on Principles and Practice of Declarative Programming Lisboa, Portugal, 11-13 July 2005 IMPORTANT DATES Submission 22 February 2005 **** NEW **** Notification 1 April 2005 Final Version 1 May 2005 INVITED SPEAKERS: Joint ICALP/PPDP Giuseppe Castagna (ENS Paris) John Mitchell (Stanford University) PPDP Manuel Hermenegildo (Technical University of Madrid, University of New Mexico) WEB SITES: PPDP 2005: http://centria.di.fct.unl.pt/conferences/ppdp05/ PPDP 2005 CFP: http://www.site.uottawa.ca/~afelty/ppdp05/ PPDP: http://pauillac.inria.fr/~fages/PPDP/ SCOPE OF THE CONFERENCE: PPDP 2005 aims to provide a forum that brings together those in the declarative programming communities, including those working in the logic, constraint and functional programming paradigms. The goal is to stimulate research in the use of logical formalisms and methods for specifying, performing, and analyzing computations, and to stimulate cross-fertilization by including work from one community that could be of particular interest and relevance to the others. Topics of more specific interest are enhancements to such formalisms with mechanisms for mobility, modularity, concurrency, object-orientation, and static analysis, as well as the fuller exploitation of the programming-as-proof-search framework through new designs and improved implementation methods. At the level of methodology, the use of logic-based principles in the design of tools for program development, analysis, and verification relative to all declarative paradigms is of interest. Papers related to the use of declarative paradigms and tools in industry and education are especially solicited. This list is not exhaustive: submissions related to new and interesting ideas relating broadly to declarative programming are encouraged. Prospective authors are encouraged to communicate with the Program Chair about the suitability of a specific topic. TOPICS (Not exhaustive): Logic, Constraint, and Functional Programming; Applications of Declarative Programming; Methodologies for Program Design and Development; Declarative Aspects of Object-Oriented Programming; Concurrent Extensions to Declarative Languages; Declarative Mobile Computing; Integration of Paradigms; Proof Theoretic and Semantic Foundations; Type and Module Systems; Program Analysis and Verification; Program Transformation; Abstract Machines and Compilation; Programming Environments PAPER SUBMISSIONS: Papers should be submitted electronically by 22 FEBRUARY 2005 via the symposium's web page. Acceptable formats are PostScript or PDF, viewable by gv. Submissions should not exceed 12 pages (including bibliography and appendices) in standard ACM conference format (see URL below). They must be written in English, must have a cover page with an abstract of up to 200 words, keywords, postal and electronic mailing addresses, and phone and fax numbers of the corresponding author. EVALUATION OF SUBMISSIONS: Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should include a clear identification of what has been accomplished and why it is significant. They must describe original, previously unpublished work that has not been simultaneously submitted for publication elsewhere. Authors who wish to provide additional material to the reviewers beyond the 12-page limit can do so in clearly marked appendices: reviewers are not required to read such appendices. Submissions that do not meet these guidelines may not be considered. PROCEEDINGS: Proceedings will be published by ACM Press. ACM formatting guidelines are available online, along with formatting templates or style files for LaTeX, Word Perfect, and Word: http://www.acm.org/sigs/pubs/proceed/template.html. Authors of accepted papers will be required to sign the ACM copyright form. RELATED EVENTS: PPDP 2005 will be co-located with the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), which will take place 11-15 July 2005. See http://icalp05.di.fct.unl.pt for more information. CONFERENCE CHAIR: Pedro Barahona, Universidade Nova de Lisboa, web: http://centria.di.fct.unl.pt/~pb, email: pb(a)di.fct.unl.pt PROGRAM CHAIR: Amy Felty, University of Ottawa, web: http://www.site.uottawa.ca/~afelty, email: afelty(a)site.uottawa.ca PROGRAM COMMITTEE: Pedro Barahona (Univ. Nova de Lisboa, Portugal) Gopal Gupta (Univ. Texas at Dallas, USA) Michael Hanus (Univ. Kiel, Germany) Kohei Honda (Queen Mary & Westfield Coll., UK) Michael Maher (National ICT, Australia) Maria Chiara Meo (Univ. G. D'annunzio, Italy) Gopalan Nadathur (Univ. Minnesota, USA) Atsushi Ohori (JAIST, Japan) Carsten Schuermann (Yale Univ., USA) German Vidal (Technical Univ. Valencia, Spain) Joe Wells (Heriot-Watt Univ., UK) Elena Zucca (Univ. Genova, Italy) PREVIOUS PPDP CONFERENCES: Paris (1999), Montreal (2000), Firenze (2001), Pittsburgh (2002), Uppsala (2003), Verona (2004).

1 1

Workaround for building profiling libs and apps with Cabal
by Satnam Singh 18 May '05

18 May '05

I recently tried to build a version of an application with Cabal to use with profiling by simply adding: ghc-options: -prof -auto-all to my Cabal file but this did not work because the generated .hi interface files ended in .hi and not .p_hi as expected and the .o and .a files also did not have the expected names. As a work-around I wrote a small script "fixhi" to create symbolic links for the expected filenames. The script can be adjusted to perform a rename by substituting the "ln -s" with "mv". The script is at the end of the message. It is designed to be run in the install directory of the package for a specific version e.g. lagavulin> pwd /c/Program Files/lava/lava-0.1 lagavulin> fixhi Symbolically linking ./Lava/Below.hi to ./Lava/Below.p_hi Symbolically linking ./Lava/Beside.hi to ./Lava/Beside.p_hi Symbolically linking ./Lava/Bit.hi to ./Lava/Bit.p_hi Symbolically linking ./Lava/Classes.hi to ./Lava/Classes.p_hi Symbolically linking ./Lava/Col.hi to ./Lava/Col.p_hi <...lots of lines deleted...> Symbolically linking ./Xilinx/Adder.hi to ./Xilinx/Adder.p_hi Symbolically linking ./Xilinx/Comparator.hi to ./Xilinx/Comparator.p_hi Symbolically linking ./Xilinx/Components.hi to ./Xilinx/Components.p_hi Symbolically linking ./Xilinx/OneBitAdder.hi to ./Xilinx/OneBitAdder.p_hi Symbolically linking ./Xilinx/OneBitSubtractor.hi to ./Xilinx/OneBitSubtractor.p_hi Symbolically linking ./Xilinx/Subtractor.hi to ./Xilinx/Subtractor.p_hi Symbolically linking ./Xilinx.hi to ./Xilinx.p_hi Symbolically linking ./HSlava-0.1.o to ./HSlava-0.1_p.o Symbolically linking ./libHSlava-0.1.a to ./libHSlava-0.1_p.a lagavulin> Application of the script should be idempotent. A simple change could allow the script to take a path to the installation so it can be run from elsewhere (e.g. a Makefile). I also expected when I used ghc --make to compile my programs that use this library to also be automatically compiled with "-prof -auto-all" but I guess that must be another option to Cabal and I had to add this to the ghc compilation command for the clients of this library. Hopefully the next version of Cabal will make it easier to build profiled and non-profiled versions of libraries and applications. Until then maybe the script below might provide some utility to others. I've only tested it under Microsoft Windows with msys (other OS-es are kind of hard to come by where I work). Cheers, Satnam Singh Microsoft One Microsoft Way Redmond Washington 98052-6399 USA #!/bin/sh # Workaround script for producing profiling interface files and libs # with the expected extension for use with Cabal. # Find and symbolically link to the interface files. for intfFile in `find . -name "*.hi" -print` do echo Symbolically linking $intfFile to ${intfFile%*.*}.p_hi ln -f -s $intfFile ${intfFile%*.*}.p_hi done # Find all the libraries and objects and link to them too. # First delete old profiling library files. rm -rf *_p.a *_p.o for objFile in `find . -name "*.o" -print` do echo Symbolically linking $objFile to ${objFile%*.*}_p.o ln -f -s $objFile ${objFile%*.*}_p.o done for libFile in `find . -name "*.a" -print` do echo Symbolically linking $libFile to ${libFile%*.*}_p.a ln -f -s $libFile ${libFile%*.*}_p.a done

1 0

Curry and Functional Logic Programming 2005 (2nd CfP)
by mh＠informatik.uni-kiel.de 18 May '05

18 May '05

We apologize if you receive multiple copies of this announcement. ====================================================================== CALL FOR PAPERS WCFLP 2005 International Workshop on Curry and Functional Logic Programming An ACM SIGPLAN sponsored workshop at ICFP 2005 Tallinn, Estonia September 29, 2005 WWW: http://www.informatik.uni-kiel.de/~mh/wcflp2005 ====================================================================== The integration of functional and logic programming has been extensively studied during the last years. The declarative multi-paradigm language Curry is one of the important results of this work since it combines in a seamless way the most relevant features of functional, logic, and concurrent programming. The development of Curry is an international initiative intended to provide a common platform for the research, teaching, and application of integrated functional logic languages. Various implementations of Curry are available and they have been used in a number of different applications. The aim of this workshop is to bring together researchers interested in Curry, related functional logic languages, and general aspects of integrating declarative programming paradigms. It promotes the cross-fertilizing exchange of ideas and experiences among researches and students from the different communities interested in the foundations, applications, and combinations of high-level, declarative programming languages and related areas. WCFLP 2005 includes the annual Workshop on Functional and Logic Programming (WFLP). Previous WFLP editions were: WFLP 2004 (Aachen, Germany), WFLP 2003 (Valencia, Spain), WFLP 2002 (Grado, Italy), WFLP 2001 (Kiel, Germany), WFLP 2000 (Benicassim, Spain), WFLP'99 (Grenoble, France), WFLP'98 (Bad Honnef, Germany), WFLP'97 (Schwarzenberg, Germany), WFLP'96 (Marburg, Germany), WFLP'95 (Schwarzenberg, Germany), WFLP'94 (Schwarzenberg, Germany), WFLP'93 (Rattenberg, Germany), and WFLP'92 (Karlsruhe, Germany). ---------------------------------------------------------------------- TOPICS WCFLP 2005 solicits papers in all areas of functional and (constraint) logic programming, including (but not limited to): * Language Design: modules and type systems, multi-paradigm languages, concurrency and distribution, objects * Foundations: formal semantics, rewriting and narrowing, type theory * Implementation: abstract machines, parallelism, compile-time and run-time optimizations, interfacing with external languages * Transformation and Analysis: abstract interpretation, specialization, partial evaluation, program transformation, meta-programming * Software Engineering: design patterns, specification, verification and validation, debugging, test generation, programming pearls * Integration of Paradigms: integration of declarative programming with other paradigms such as imperative, object-oriented, concurrent, and real-time programming * Applications: declarative programming in education and industry, domain-specific languages, visual/graphical user interfaces, embedded systems, WWW applications, knowledge representation and machine learning, deductive databases, advanced programming environments and tools The primary focus is on new and original research results but submissions describing innovative products, prototypes under development or interesting experiments (e.g., benchmarks) are also encouraged. ---------------------------------------------------------------------- PUBLICATION Abstracts of workshop papers will be published in ACM SIGPLAN Notices. Full workshop proceedings will be published by ACM's printing vendor and in ACM's Digital Library under the usual copyright policy. It is intended to publish a special issue of the best papers after the workshop. ---------------------------------------------------------------------- IMPORTANT DATES Deadline for submissions: June 5, 2005 Notification of acceptance: June 30, 2005 Camera-ready papers: July 12, 2005 Workshop: September 29, 2005 ---------------------------------------------------------------------- PROGRAM COMMITTEE Sergio Antoy (Portland State University, co-chair) Olaf Chitil (University of Kent) Rachid Echahed (IMAG, Grenoble) Moreno Falaschi (University of Siena) Michael Hanus (CAU Kiel, co-chair) Frank Huch (CAU Kiel) Tetsuo Ida (University of Tsukuba) Herbert Kuchen (Univ. Muenster) John W. Lloyd (Australian National University ) Francisco J. Lopez-Fraguas (UC Madrid) Wolfgang Lux (Univ. Muenster) Julio Marino (UP Madrid) Peter Thiemann (Univ. Freiburg) German Vidal (UP Valencia) ---------------------------------------------------------------------- PROGRAM CO-CHAIRS Sergio Antoy Michael Hanus Portland State University Institut fuer Informatik Dept. of Computer Science CAU Kiel P.O. Box 751 Olshausenstr. 40 Portland, OR 97207-0751 D-24098 Kiel USA Germany Phone: +1 (503) 725-4036 Phone: +49-431-880-7271 Fax: +1 (503) 725-3211 Fax: +49-431/880-7613 email: antoy(a)cs.pdx.edu email: mh(a)informatik.uni-kiel.de ---------------------------------------------------------------------- SUBMISSION Authors are invited to submit an extended abstract (no longer than 8 pages including figures and references) or a system description (no longer than 3 pages) in PDF or Postscript format. Submissions should include the title, authors' names, affiliations, addresses, and e-mail. All submissions must be written in English. Authors are strongly encouraged to use LaTeX2e and the ACM Proceedings Format (http://www.acm.org/sigs/pubs/proceed/template.html) All submissions must be original work. Submissions must be unpublished and not submitted for publication elsewhere. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. Further details about the procedure to submit papers electronically are available at the workshop's web page at http://www.informatik.uni-kiel.de/~mh/wcflp2005 ----------------------------------------------------------------------

1 0

ANN: hat-2.04, a Haskell Tracer
by Malcolm Wallace 17 May '05

17 May '05

hat-2.04 -------- http://haskell.org/hat/ We are pleased to announce a new release of Hat, the Haskell Tracer. Hat is a very useful tool for understanding and debugging programs. Hat is compiler independent, and can be used on any Unix-like platform. It supports the full Haskell'98 language, plus hierarchical module namespaces, and several type system extensions, namely: multi-parameter type classes, functional dependencies, and existential quantification of datatype declarations. The main interactive trace browsers currently are hat-observe and hat-trail, but many more experimental browsers are included (see below). Particular features of note in this new release, hat-2.04, are: * Supports compilers from ghc-5.04.2 and nhc98-1.18 upwards, now including the entire ghc-6 series. As well as the usual Unix/Linux platforms, we believe it also works under MacOS X and Cygwin (but would value your feedback.) We recommend you use 'hmake' to manage compilation of your traced programs. * Support for a few more of the standard hierarchical library modules (although the tracing versions are still only a subset of the full list.) * Various improvements, such as recording full source positions in the trace rather than just start-positions, and recording do-notation, mean that visual linkage from the trace to your program is far more helpful. * A range of new (experimental) tracing tools: Interactive browsers: hat-anim, hat-explore, hat-detect Batch-mode tools: hat-cover, hat-nonterm, black-hat * Numerous small bug fixes. See the website http://haskell.org/hat/ for full details. There is a dedicated mailing list for bug-reports and other discussion of Hat: http://www.haskell.org/mailman/listinfo/hat Regards, The Hat team [ The core Hat team currently consists of Olaf Chitil, Colin Runciman, and Malcolm Wallace with thanks to many other students, visitors, collaborators and reviewers. The original development of Hat was funded by EPSRC grant number GR/M81953, with later additional support from the Universities of York, Kent, Aachen, and Microsoft Research (Cambridge). ]

1 0

ANN: SearchPath 0.5 and Request for https module URLs
by S. Alexander Jacobson 17 May '05

17 May '05

At Simon Marlow's suggestion, I have implemented Internet import chasing. You wrap your compiler/interpreter call with "searchpath", pass the correct parameters and it will find all your module imports, if they are not local, it will look them up in Internet module directories you specify, retrieve the relevant modules, put them on your path and then run your compiler/interpeter with the appropriate commandline options. e.g. searchpath ghc MyModule.hs OtherModule -isomeDir --internet localModules.map -iotherdir --internet https://hackage.org/modules.map -iotherDir2 -cache cache will result in the download of all the modules it can find each directory and execute: ghc MyModule.hs OtherModule -isomeDir --icache/internet1 -iotherdir -icache/internet2 -iotherDir2 Mapfiles have the form: #comment HAppS http://happs.org #comment *.*.HaXml.* http://www.cs.york.ac.uk/fp/darcs/HaXml/src #another comment Simon, I am now handling import chasing, Haskell extensions, literate haskell, latex haskell, and HTTPS URLs (via curl). It works with the ghc command line, except that it doesn't handle multiple directories passed on the same -i. (Can someone tell me what the official path separator is for ghc -i?). It doesn't yet work with other compilers/interpreters, but should be easy to adapt. It does not handle package files right now. Request: This will work better as people expose their modules via http(s). If your modules are visible this way, please email me a baseURL. Location: http://happs.org/SearchPath.hs -Alex- ______________________________________________________________ S. Alexander Jacobson tel:917-770-6565 http://alexjacobson.com

1 0

`Dumatel' software announcement
by Serge D. Mechveliani 16 May '05

16 May '05

A N N O U N C E M E N T D u m a t e l a prover program based on equational reasoning, Version 1.02 is available, together with its source program and manual book, at the following addresses: http://www.botik.ru/~mechvel/papers.html click at `dumatel' (Russian site), ftp.botik.ru/pub/local/Mechveliani/dumatel/ (same site), http://www.haskell.org/dumatel/distrib/ (USA site) Dumatel-1.02 is --------------- a prover based on many-sorted term rewriting (TRW) and equational reasoning. It is a program package written in a purely functional, `lazy' language Haskell. It is presented as a library of functions and data structures. To use Dumatel-1.02, user needs to be familiar with Haskell programming. What it has. Abilities ---------------------- * TRW interpreter `reduce', subdued to an explicitly given partial term ordering parameter. * `Unfailing' Knuth-Bendix completion methods ukb, ukbb, where the latter method extends the former with a certain specialized completion for the Boolean connectives. * The inductive prover `prove', including also the refutation procedure for the predicate calculus, using ukbb. The prover reasons about equational specifications, transforming them dynamically. * So far, it is able to solve in a real time only simple problems, and not all of them. Examples of successful proof: (1) Prove list |-inductive- forall Xs ((reverse reverse Xs) = Xs), where "reverse" is defined recursively via the list concatenation "+", and "+" defined recursively via ":" (`cons'). (2) naturalNumbers |-inductive- forall [n, m] (n+m = m+n), where "+" is defined via the "successor" operator by the equations [n+0 = 0, n+(s m) = s (n+m)]. Example of failure: (3) naturalNumbers |-inductive- forall [n, m] (n*m = m*n), where the multiplication "*" is defined in (2) via "+": [n*0 = 0, n*(s m) = n + n*m]. See the book.ps for further information. Ports: Dumatel-1.02 was tested under ghc-6.2.2, Linux. ------ Manual (`book'): see dm/book.ps contained in the distribution. --------------- Remarks are welcome: mechvel(a)botik.ru -------------------- Serge Mechveliani, Program Systems Institute, 152020, Pereslavl-Zalessky, Russia. e-mail mechvel(a)botik.ru http://www.botik.ru/~mechvel

1 0

Re: Haddock Problem
by Dominic Steinitz 16 May '05

16 May '05

> > >On Sun, 2005-05-15 at 18:51 +0100, Dominic Steinitz wrote: >>/ > Dominic Steinitz writes: >/>/ > >/>/ I've downloaded >/>/ http://www.haskell.org/ghc/docs/latest/html/libraries/base/base.haddock and I >/>/ still get the same errors. Is this incompatible with Haddock version 0.6? >/ >Probably so because the current ghc library documentation is generated >with Haddock 0.7 (which is the current cvs version of Haddock). We're >hoping it will be released officially in the not to distant future >(though if you like you can use the cvs version now as it's perfectly >usable). > >The .haddock files are in a binary format and so are almost certainly >not compatible between versions (like ghc .hi files). > >It would be nice if haddock gave some sort of error message in this case >rather than ignoring the file. > >Duncan > > I think that's the answer. I just tried it on my windows machine and I got the following: C:\Documents and Settings\Dom\Codec>haddock -v -h -o docs -i http://haskell.org/ ghc/docs/latest/html/libraries/base,c:\ghc\ghc-6.4\doc\html\libraries\base\base. haddock haddock: Warning: The interface file "c:\\ghc\\ghc-6.4\\doc\\html\\libraries\\ba se\\base.haddock" could not be read. Maybe it's from a later version of Haddock? C:\Documents and Settings\Dom\Codec>haddock -v C:\Documents and Settings\Dom\Codec>haddock -V Haddock version 0.6, (c) Simon Marlow 2003 Why does the windows version give a warning when the linux one doesn't when they both appear to be the same version? And more importantly, can we have a version of haddock that is compatible with the latest release of ghc? I've tried building from source but run into problems. I'll post these separately if I have time. Yours, frustrated of Kingston.

1 1