February 2001 - Haskell

PLI 2001 Announcement
by Rosario Pugliese 05 Feb '01

05 Feb '01

[Apologies for multiple copies] ---------------------------------------------------------------- PLI 2001 Principles, Logics, and Implementations of high-level programming languages (Sponsored by ACM) Firenze, ITALY September 2 - 8, 2001 http://music.dsi.unifi.it/pli01/ The colloquium on Principles, Logics, and Implementations of high- level programming languages is a collection of conferences and workshops aimed at the advancement of high-level programming languages. The events composing PLI will cover a spectrum of topics important to language development and use, including issues such as semantics, design, analysis, implementation, and application. Theoretical issues relevant to language design and programming will be represented. Implementation questions will provide an emphasis on compilation methods, distributed computation and static debugging techniques. There will also be a focus on industrial and educational applications. Conferences: ICFP (September 3-5) Int. Conf. on Functional Programming General chair: Benjamin Pierce (Univ. Pennsylvania) Program chair: Xavier Leroy (INRIA Rocquencourt) PPDP (September 5-7) Int. Conf. on Principles and Practice of Declarative Programming Conference chair: Rocco De Nicola (Univ. Firenze) Program chair: Harald Søndergaard (Univ. Melbourne) Workshops: · Multilanguage Infrastructure and Interoperability (BABEL) · ERLANG Workshop · Fixed Points in Computer Science (FICS) · HASKELL Workshop · Quantitative Aspects of Programming Languages (QAPL) · Rule-Based Programming (RULE) · Semantics, Applications, and Implementation of Program Generation (SAIG) · Scheme and Functional Programming (SCHEME) · Verification and Computational Logic (VCL) Submission deadline for ICFP and PPDP: March 15, 2001 Workshops chair: Betti Venneri (Univ. Firenze) Publicity chair: Rosario Pugliese (Univ. Firenze) Organizing Committee: Gianni Aguzzi (Univ. Firenze, co-chair), Giorgio Ghelli (Univ. Pisa, co-chair), Lorenzo Bettini (Univ. Firenze), Michele Loreti (Univ. Firenze), Dario Colazzo (Univ. Pisa) Contact Information: pli-inf(a)gdn.dsi.unifi.it Conference Venue: Auditorium Banca Toscana, Via Panciatichi, 87 (Firenze Nova), Firenze, ITALY

1 0

MD5 in Haskell
by Ian Lynagh 03 Feb '01

03 Feb '01

I apologise if this is off topic for this list - I haven't been here long. Someone recently mentioned that the MD5 function in GHC uses C code to do the work so returns an IO String rather than a String. I have written an MD5 implementation in pure Haskell code (following the RFC - I don't know if a better optimised version could be written although I may look into this). I've put the code at http://c93.keble.ox.ac.uk/~ian/md5/ License is GPL. Ian

2 2

realToFrac vs. fromRealFrac
by Manuel M. T. Chakravarty 03 Feb '01

03 Feb '01

I am not sure whether the following issue has already been mentioned earlier. Chapter 6 ``Predefined Types and Classes'' of The Report says at its very end, Also available are the following coercion functions: fromIntegral :: (Integral a, Num b) => a -> b fromRealFrac :: (RealFrac a, Fractional b) => a -> b (`fromRealFrac' is also defined in Figure 7.) However, in Appendix A ``Standard Prelude'', we have realToFrac :: (Real a, Fractional b) => a -> b realToFrac = fromRational . toRational instead of a definition for `fromRealFrac'. Both GHC and Hugs go by Appendix A. What was the original intention? Cheers, Manuel

2 1

Fundeps and quantified constructors
by nubie nubie 03 Feb '01

03 Feb '01

So I want to have a polymorphic Collection type, just because. > class Collection c e | c -> e where > empty :: c > put :: c -> e -> c > data SomeCollection e = forall c . Collection c e => MakeSomeCollection c Hugs (February 2000) doesn't like it. It says Variable "e" in constraint is not locally bound I feel that e *is* bound, sort of, because c is bound and there's a fundep c->e. Who's wrong, me or Hugs? The following things work as expected: > data IntCollection = forall c . Collection c Int => MakeIntCollection c > data AnyCollection = forall c e . Collection c e => MakeAnyCollection c Regards -- anatoli __________________________________________________ Get personalized email addresses from Yahoo! Mail - only $35 a year! http://personal.mail.yahoo.com/

1 0

Notes of haskell
by Luis Ricardo 02 Feb '01

02 Feb '01

I shearch notes of haskell. Luis Ricardo Portugal

1 0

AW: What does "Compiled code too complex" error message of Hugs m ean?
by Laaser Christian 02 Feb '01

02 Feb '01

I never built Hugs on Windows before :-( ... and a trial to do so with cygwin/gcc was unsuccessful. Have you got a precompiled binary for Win (hugs.exe) with these settings, which you could send me / I could download from somewhere? Christian > -----Urspr> üngliche Nachricht----- > Von: Jan Kort [SMTP:kort@wins.uva.nl] > Gesendet am: Mittwoch, 31. Januar 2001 13:34 > An: Laaser Christian > Cc: 'haskell(a)haskell.org' > Betreff: Re: What does "Compiled code too complex" error message of Hugs mean? > > Laaser Christian wrote: > > > > When loading some Haskell files with Hugs, I get the error message "Compiled code too complex". However, the compilation with GHC 4.08.1 succeeds. > > What does this message mean? What can I do about it? > > > > You can grep for that sentence in "hugs98/src", it will point to the > file "machine.c". There you will see it says "if (nextLab>=NUM_FIXUPS) ...". > So grep for "NUM_FIXUPS" it will point to the file "prelude.h". I > think the default value is 400, you should increase it to 1000 or so. > I have it at 10000, but that's probably not necesary in your case > and if you increase constants too much starting up Hugs will become > slower. > > Jan

3 2

ESSLLI 2001 Call for Workshop Abstracts: Finite State Methods in Natural Language Processing
by Ahti Pietarinen 02 Feb '01

02 Feb '01

CALL FOR ABSTRACTS Finite State Methods in Natural Language Processing ESSLLI Workshop, August 20-24 2001, Helsinki Description: Finite state methods are used in various areas of linguistic computation, including tokenization, lexicography, spell checking, part of speech tagging, speech recognition, grapheme to phoneme conversion, computational phonology and morphology, as well as computational syntax. In recent years the use of finite state methods has increased both in practical applications (such as in morphological analyzers for a variety of languages), as well as in more theoretical approaches (such as in recent attempts to formalize optimality-theoretic analyses in phonology by finite-state means). The aim of the workshop is to bring together researchers and Ph.D. students working with finite-state methods within natural language processing and computational linguistics. The workshop belongs to the program of the 13th European Summer School in Logic, Language and Information (ESSLLI) which is organized at the University of Helsinki from August 13 until August 24, 2001 (see the home page http://www.helsinki.fi/esslli for more information). Submission guidelines: Extended abstracts (up to four pages) for forty-five minute talks are invited from all areas of interest for the workshop. The abstract should be submitted by e-mail to Gertjan van Noord, vannoord(a)let.rug.nl before the deadline given below, in Postscript or PDF. Note that all participants of the workshop must register for the ESSLLI summer school. Organisers: Lauri Karttunen Xerox Research Kimmo Koskenniemi University of Helsinki Gertjan van Noord University of Groningen Important Dates: Submission deadline: April 27, 2001 Notification of contributors: May 15, 2001 Workshop Dates: August 20-24, 2001 Sponsor The workshop is co-financed by the NWO PIONIER project Algorithms for Linguistic Processing. Further info at http://www.let.rug.nl/~vannoord/alp/

1 0

Knight Problem
by Christoph M. 02 Feb '01

02 Feb '01

Hi ! Does anybody know how to solve the "Knight Problem" ? Cheers, Christoph

4 3

RE: Source tar ball for Simon Marlow's Haskell Web Server??
by Simon Marlow 01 Feb '01

01 Feb '01

> I looked on www.haskell.org for the Simon Marlow's Web Server, > but couldn't find. Did I overlook it? The source is here: http://research.microsoft.com/~simonmar/hws.tar.gz Cheers, Simon

1 0

Source tar ball for Simon Marlow's Haskell Web Server??
by Bill Halchin 01 Feb '01

01 Feb '01

Hello, I looked on www.haskell.org for the Simon Marlow's Web Server, but couldn't find. Did I overlook it? Regards, Bill Halchin _________________________________________________________________ Get your FREE download of MSN Explorer at http://explorer.msn.com

1 0