- Haskell - Haskell.org

RE: Haddock
by Simon Marlow 02 May '02

02 May '02

> I just tried haddock-0.1. Good thing! Two quibbles, though: > * the parser chokes on CVS headers like -- $Id ...$ > ( but -- -- $Id ..$ is OK) Yes, because '-- $' has a special meaning in Haddock (it's a named documentation comment). > * is there support for hierarchical namespaces? > ( with module Foo.Bar in file Foo/Bar.hs, and so on ) Yes, hierarchical modules are supported. You must pass the full filenames of each of the modules to be processed to Haddock, though. Cheers, Simon

1 0

Haddock
by Johannes Waldmann 02 May '02

02 May '02

I just tried haddock-0.1. Good thing! Two quibbles, though: * the parser chokes on CVS headers like -- $Id ...$ ( but -- -- $Id ..$ is OK) * is there support for hierarchical namespaces? ( with module Foo.Bar in file Foo/Bar.hs, and so on ) Best regards, -- -- Johannes Waldmann ---- http://www.informatik.uni-leipzig.de/~joe/ -- -- joe(a)informatik.uni-leipzig.de -- phone/fax (+49) 341 9732 204/252 --

1 0

e = exp 1
by Serge D. Mechveliani 02 May '02

02 May '02

I wrote about e :: Double for the Library. It can be obtained as exp 1, but I wonder whether it is good for the library to add the `e' denotation. ----------------- Serge Mechveliani mechvel(a)botik.ru

2 1

e :: Double
by Serge D. Mechveliani 02 May '02

02 May '02

Please, has Haskell e :: Double ( ~= limit (1 + 1/n)^n ) in its standard library? ----------------- Serge Mechveliani mechvel(a)botik.ru

2 1

finding sublist
by Serge D. Mechveliani 02 May '02

02 May '02

Thanks to people who helped me with the task >> Import two space separated columns of integers from file. Claus Reinke <claus.reinke(a)talk21.com> recommends to exploit `lines'. Indeed, it bocomes shorter now: main = readFile "data" >>= (putStr . show . twoIntLists) where twoIntLists str = case span (not . null) $ dropWhile null $ lines str of (lns, lns') -> (readInts lns, readInts lns') readInts = map (\ str -> read str :: Integer) . dropWhile null Another question: has the Haskell Standard library a function for such a usable task as finding of occurence of a segment in a list? Say findSegmentBy (...) [2,2,3] [0,0,2,2,1,2,2,3,1,2,3] --> ([0,0,2,2,1], [2,2,3,1,2,3]) I have heard, an efficient algorithm (for large lists) for this is not so simple. ----------------- Serge Mechveliani mechvel(a)botik.ru

1 0

ANNOUNCE: Haddock version 0.1, a Haskell documentation tool
by Simon Marlow 01 May '02

01 May '02

I'm pleased to announce version 0.1 of Haddock, a documentation generation tool for Haskell source code. It's available from http://www.haskell.org/haddock/ Here's the README: Haddock, a Haskell Documentation Tool ===================================== This is Haddock, a tool for automatically generating documentation from annotated Haskell source code. It is primary intended for documenting libraries, but it should be useful for any kind of Haskell code. Like other systems ([1],[2]), Haddock lets you write documentation annotations next to the definitions of functions and types in the source code, in a syntax that is easy on the eye when writing the source code (no heavyweight mark-up). The documentation generated by Haddock is fully hyperlinked - click on a type name in a type signature to go straight to the definition, and documentation, for that type. Haddock understands Haskell's module system, so you can structure your code however you like without worrying that internal structure will be exposed in the generated documentation. For example, it is common to implement a library in several modules, but define the external API by having a single module which re-exports parts of these implementation modules. Using Haddock, you can still write documentation annotations next to the actual definitions of the functions and types in the library, but the documentation annotations from the implementation will be propagated to the external API when the documentation is generated. Abstract types and classes are handled correctly. In fact, even without any documentation annotations, Haddock can generate useful documentation from your source code. Haddock can generate documentation in multiple formats; currently HTML is implemented, and there is partial support for generating DocBook. The generated HTML uses stylesheets, so you need a fairly up-to-date browser to view it properly (Mozilla, Konqueror, Opera, and IE 6 should all be ok). Full documentation can be found in the doc/ subdirectory, in DocBook format. Please send questions and suggestions to me: Simon Marlow <simonmar(a)microsoft.com> [1] IDoc - A No Frills Haskell Interface Documentation System http://www.cse.unsw.edu.au/~chak/haskell/idoc/ [2] HDoc http://www.fmi.uni-passau.de/~groessli/hdoc/

1 0

Read File
by Bahadır SEVİNÇ 01 May '02

01 May '02

Dear Haskellers, I want to read some data from a text file. I accomplished it but I want to read data from file as a Integer list for example text file has [1,2,3,5] and when I read this data from file I handeled it as string. What can I do to get it as integer list. Thanks.......... Bahadır SEVİNÇ

2 1

PLAN-X: new deadline (May 31)
by Shriram Krishnamurthi 01 May '02

01 May '02

Note that both submission and notification dates have changed from earlier announcements. The original submission date was awkwardly placed with respect to several other conference and workshop deadlines. ------- PLAN-X: PROGRAMMING LANGUAGE TECHNOLOGIES FOR XML Oct 3, 2002 Pittsburgh, PA (Co-located with PLI) CALL FOR PAPERS Submission deadline: May 31, 2002 [not May 1, as previously announced] XML has emerged as the de facto standard for data interchange on the web. The use of XML as a common format for representation, interchange, and transformation of data poses new challenges to programming languages, applications, and database systems. During the last few years, the database research community has devoted a lot of attention to XML's data representation challenges, as evidenced by the number of XML-related publications in premier database conferences and journals. In contrast, the attention devoted to XML by the programming language research community has been minimal. This is unfortunate, since the robustness of current and future programming standards and tools for XML will depend on the strength of their foundations in core programming technologies e.g., XML parsing (parsing theory and incremental parsing), XML schemas (type systems), XPATH expressions and XSLT programs (pattern-matching languages and their optimization), XSLT debuggers (dynamic program analysis and slicing). Since XML is a new domain, core programming technologies developed in past research cannot be used unchanged; instead, novel research is required to address the unique challenges posed by XML and its use in web applications and standalone applications. This workshop aims to bring together researchers from the programming languages and XML communities, a) to foster novel research to address unique challenges being posed by XML on current and future programming technologies; b) to exchange information on early research experiences with XML-related programming systems, tools, and languages; and c) to expose the PLI community to XML technologies and the potential impact of these technologies on future software. SUBMISSION PROCEDURE We solicit submissions on original research not previously published or currently submitted for publication elsewhere, in the form of extended abstracts. These extended abstracts should not exceed 5000 words (approximately 10 pages). Detailed submission instructions will be posted soon at http://www.research.avayalabs.com/user/wadler/planx. PROCEEDINGS There will be no formal proceedings. An informal proceedings will be distributed at the workshop. [The intention is that papers presented at PLAN-X should not be blocked from later submission to an 'archival' conference.] IMPORTANT DATES Submission deadline 31 May 2002 Notification of acceptance or rejection 31 July 2002 Final papers due for informal proceedings 4 Sep 2002 WEB PAGE: http://www.research.avayalabs.com/user/wadler/planx/ GENERAL CHAIR: Vivek Sarkar, IBM PROGRAM CO-CHAIRS: Benjamin Pierce (University of Pennsylvania) Philip Wadler (Avaya Labs) PROGRAM COMMITTEE: Allen Brown (Microsoft) Peter Buneman (Edinburgh) Sophie Cluet (Xyleme / INRIA) Mary Fernandez (AT&T Labs) Shriram Krishnamurthi (Brown) Makoto Murata (IBM Japan) Benjamin Pierce (University of Pennsylvania) Michael Schwartzbach (Aarhus) Dan Suciu (University of Washington) Philip Wadler (Avaya Labs) INVITED SPEAKER: James Clark

1 0

Re: Announce+Question: jDrIFT
by Noel Winstanley 30 Apr '02

30 Apr '02

Hi, I'd be happy to transfer ownership of DrIFT to a good home. I've not had the inclination to maintain DrIFT for ages now, for various reasons: my job takes too much of my coding time; I've lost touch with the latest changes to the haskell report / GHC / MPCs whatever etc; and I became dispirited by the reception that DrIFT initially received (no theoretic foundation -- it munges strings!!). It all seemed less important once I escaped academia... Anyhow, its great to hear of the different plans you have for DrIFT -- I'm glad its of some use to you. Good Luck Noel -- Noel Winstanley Engineer - Esgem Limited www.esgem.com Registered in England at 7 Monarch Court, Emerson's Green, Bristol BS16 7FH. Reg No. 3372135 Tel: 0117 957 2345

2 1

read int lists
by Serge D. Mechveliani 30 Apr '02

30 Apr '02

Dear Haskellers, There is certain site (contact daly(a)idsi.net ) where some computer algebra programs are gathered and compared. I submit here my CA program DoCon written in Haskell. And they require certain large set of tests to fill in. It appears also that many of the tests concern Haskell itself (or its implementation libraries) rather than DoCon library. In particular, they require the code for the task: Import two space separated columns of integers from file. The suggestions are: \Axiom & \\ \Derive & [Transfer Load daTa] (from file.dat) \Macsyma & xy: read_num_data_to_matrix("file", nrows, 2) \Maple & xy:= readdata("file", integer, 2): \Mathematica & xy = ReadList["file", Number, RecordLists -> True] \MuPAD & \\ \Reduce & \\ \DoCon (Haskell) & ?? We need main = readFile "data" >>= (putStr . process) If it was one integer list, then, something like process str = read ("[" ++ (map (\ '\n' -> ',') str) ++ "]") :: [Integer] would do. But the file contains something like ----------- 1 2 3 4 ----------- , and it should convert to ([1,2],[3,4]) :: ([Integer], [Integer]) Although I wonder whether other systems do the needed thing, still, can people suggest any shorter/nicer program than the following one? (use advanced lexical libraries, etc. ...) process :: String -> String process str = shows (firstList [] $ dropWhile (== '\n') $ filter (/= ' ') str ) "\n" firstList :: [Integer] -> String -> ([Integer], [Integer]) firstList ns ('\n':'\n':str) = (reverse ns, secondList str) firstList ns str = case reads str :: [(Integer, String)] of [(n,str')] -> firstList (n:ns) str' _ -> (ns, []) secondList :: String -> [Integer] secondList str = case reads str :: [(Integer, String)] of [(n,str')] -> n:(secondList str') _ -> [] Thank you in advance for the help. ----------------- Serge Mechveliani mechvel(a)botik.ru

2 1