- Haskell - Haskell.org

RE: What are ZMZN and ->Z1T in a ghc space profile?
by Julian Seward (Intl Vendor) 16 Nov '01

16 Nov '01

I suspect you're both right. I seem to remember that it used to be the way Keith says, but was relatively recently changed to be the way Robert says. J | > > But, to answer your emmediate question: | > > | > > ZMZM = [] - The list Nil constructor | > > Z1T = ( ) - The 1-tuple constructor | > | > IIRC, the "1" is the number of commas, so Z1T is the *pair* | > constructor. | | The comments in OccName.lhs say: | | [copying direct from the file] | | Before After | -------------------------- | Trak Trak | foo_wib foozuwib | > zg | >1 zg1 | foo# foozh | foo## foozhzh | foo##1 foozhzh1 | fooZ fooZZ | :+ ZCzp | () Z0T 0-tuple | (,,,,) Z5T 5-tuple | (# #) Z1H unboxed 1-tuple (note the space) | (#,,,,#) Z5H unboxed 5-tuple | (NB: There is no Z1T nor Z0H.) | | Which, interestingly, says that there is no Z1T, despite | sengan having | supposedly found one. | | However it also suggests that, if Z1T did exist, then it | would be a 1-tuple. | | | The code itself backs this up and suggests that the number is | the number of | commas + 1: | | maybe_tuple "()" = Just("Z0T") | maybe_tuple ('(' : cs) = case count_commas (0::Int) cs of | (n, ')' : cs) -> Just ('Z' : | shows (n+1) "T") | other -> Nothing | maybe_tuple other = Nothing | | | Just in case anyone wasn't confused yet :-) | | | | -Rob | | | _______________________________________________ | Haskell mailing list | Haskell(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell |

1 0

What are ZMZN and ->Z1T in a ghc space profile?
by senganb＠ia.nsc.com 16 Nov '01

16 Nov '01

I searched on google, but had no luck. My program is an implementation of http://www-aig.jpl.nasa.gov/public/home/gat/lisp-study.html in haskell, and the dictionary read in is rather large (900Kb) so I assume most of the space should be [[Char]] Sengan

3 3

Re: Student Programming Projects
by Yoann Padioleau 16 Nov '01

16 Nov '01

Johannes Waldmann <joe(a)isun.informatik.uni-leipzig.de> writes: > > Next Semester, I am supposed to teach a short course in Haskell. > > Can anyone recommend interesting programming projects which can > > be completed in about a month? Thank you very much. > > apart from "pure" programming exercise > (see Haskell textbooks http://haskell.org/bookshelf/) > here are a few suggestions in the area of experimental mathematics. > also, check with your introductory discrete mathematics course (or equivalent). > a lot of combinatorial problems on finite structures > can be illustrated by finding (counter-)examples by computer. > > > say Ramsey colorings, Monochromatic arithmetic subsequences > (van der Waerden's theorem), words avoiding patterns, and so on. > http://www-igm.univ-mlv.fr/~berstel/Lothaire/ChapitresACW/C3.ps > > next, perhaps some game theory? > nim (and variants), other take-and-break games (octal games). > you can safely ignore all of the Sprague-Grundy theory, > and just define the game, and ask for some method > to determine quickly who wins. > > or graph theory: finding hamiltonian paths > (knights tours on a x b chessboards, for instance) > > if the students alreay took some computability theory, > then a nice topic is Posts Correspondence Problem, see > http://www.cs.ualberta.ca/~zhao/PCP/intro.htm > http://www.informatik.uni-leipzig.de/~pcp/pcpcontest_en.html > > also string rewriting: finding/avoiding loops. > this (open!) problem is easily stated: http://www.lri.fr/~rtaloop/95.html Wow, what some nice exercise, are you really serious ? do you think computer science student enjoy that kind of programs (except for the AI-related stuff)? why not make them programming something they would like to use !! why not a tetris/pong/reversi/any_video_game, see for example the book from Paul hudak (multimedia ... in haskell). this man understand what makes student happy : graphism,video games,compiler,operating systems, AI games and not this shit of mathematics/computer science theorist problem. This is the kind of things that make student think that functionnal programming is for doing useless things, and that C is cool cos you can do graphism, program your own operating systems, ... ICFP 2000 ask for an interesting problem: a raytracer, a thing that many student like cos you can then play with it and describe your own scene, and that contest show that ocaml/haskell were really cool for doing graphism-related work. > > > hope this helps. I'm happy to provide more detail. -- Yoann Padioleau, INSA de Rennes, France, http://www.irisa.fr/prive/padiolea Opinions expressed here are only mine. Je n'écris qu'à titre personnel. **____ Get Free. Be Smart. Simply use Linux and Free Software. ____**

2 1

CFP: EuroPar 20002
by Kevin Hammond 16 Nov '01

16 Nov '01

[Apologies for any duplication. Please can you distribute to those who might be interested... I am global chair of topic 10, Parallel Programming: Models, Methods and Programming Languages, and would welcome submissions from the Haskell community. Kevin] ***** Euro-Par 2002 - http://europar.upb.de ****** Paderborn, Germany August 27-30, 2002 First Call for Papers Euro-Par is well established as the premier European conference on all aspects of parallel computing. Previous events were held in Stockholm (1995), Lyon (1996), Passau (1997), Southampton (1998), Toulouse (1999), Munich (2000), and Manchester (2001). The conference normally attracts more than 300 participants coming from universities, research centres, and industry. The major themes of the conference can be divided into the broad categories of hardware, software, algorithms and applications. In common with previous years, Euro-Par 2002 will be organised as a number of parallel sessions on the following topics for which papers are solicited: 1. Support Tools and Environments 2. Performance Evaluation, Analysis and Optimization 3. Scheduling and Load Balancing 4. Compilers for High Performance (compilation and parallelization techniques) 5. Parallel and Distributed Databases, Data-Mining and Knowledge Discovery 6. Complexity Theory and Algorithms 7. Applications of High-Performance Computers 8. Parallel Computer Architecture and Instruction Level Parallelism 9. Distributed Systems and Algorithms 10. Parallel Programming: Models, Methods and Programming Languages 11. Numerical Algorithms 12. Routing and Communication in Interconnection Networks 13. Architectures and Algorithms for Multimedia Applications 14. Meta- and Grid-Computing 15. Discrete Optimization 16. Mobile Computing, Mobile Networks Further details for each topic can be found at: http://europar.upb.de/ Authors are requested to use the electronic form on the web site to submit their paper to the topic they judge most appropriate. All accepted papers will be available at the conference in the proceedings published by Springer-Verlag in the LNCS series. The conference will also feature invited talks and tutorials. Further information will appear on the website as it becomes available. -------------------------------------------------------------- Key Dates: February 8th, 2002 Final date for submissions April 30th, 2002 Acceptance notified May 31st, 2002 Deadline for final papers June 30th, 2002 Author registration deadline June 30th, 2002 Early registration deadline August 27th-30th, 2002 Euro-Par 2002 in Paderborn Apologies for multiple copies of this call for papers! If you would like to be removed from this mailing list or have received multiple copies and you would like some address(es) to be removed please email europar(a)upb.de

1 0

Contact Information
by Brian M. Ratzker 15 Nov '01

15 Nov '01

Could you please help me out? Who could I talk to in your company regarding marketing your web site? Would appreciate any help you can offer. Thanks Brian ====================================================== QUALIFIED TARGETED LEADS GUARANTEED!!! SIGN-UP as a myGeek Seller and deposit $20.00 between November 1, 2001 and November 30th, 2001 and we guarantee that you will receive Qualified Targeted Leads. If you're not satisfied with our service for any reason, within the first 30 days, we will REFUND your $20.00 Just click on the following link to learn more about myGeek.com: http://www.mygeek.com/login.jsp?MNO=98008&AID=1&PID=1 ===================================================== Thanks again, Brian Ratzker myGeek.com, Inc. 480.421.2200 ext 257

1 0

PhD Studentship (Please Forward)
by Kevin Hammond 15 Nov '01

15 Nov '01

Applications are invited for a PhD student to work on resource modelling for Hume, a concurrent bounded resource functional language aimed at embedded/safety critical systems. The student must be UK- or EC-resident, and possess a good undergraduate degree in Computer Science. The project will pay both fees and a maintenance grant at the standard rate. The studentship can be taken up either in the near future or later, to suit individual circumstances (e.g. at the start of the next academic year, September 2002). More information on the Hume language can be found at: http://www-fp.dcs.st-and.ac.uk/hume Please address informal enquiries to kh(a)dcs.st-and.ac.uk. The project is funded by the UK's Engineering and Physical Sciences Research Council (EPSRC). The prototype implementation is written in Haskell. We hope to make it available to interested parties in due course! Kevin

1 0

ANNOUNCE: linkchk-0.02 released
by Jens-Ulrik Petersen 14 Nov '01

14 Nov '01

Happy to announce linkchk version 0.02 is out. >From the NEWS file: * width of window is now fixed * new options to set: ** window width ** host to be pinged ** interface * checks ifconfig to see if interface is up * use implicit parameters for command-line options The tarball and i386 rpm are now available on: http://www.01.246.ne.jp/~juhp/haskell/linkchk/ linkchk is also on freshmeat.net. Enjoy, Jens

1 0

Here is a tiny idea for a QT based GUI library
by Eray Ozkural (exa) 13 Nov '01

13 Nov '01

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi people, In the past months I've seen a lot of interest in designing a standard GUI library for Haskell. I've just realized that a feature of QT 3.0[!] library, which is a well versed GUI library used in KDE, can make writing a GUI library quite easy. There is a class called QWidgetFactory[*] in QT 3.0 that enables application programmers to dynamically generate a GUI from a .ui file which is an XML file that describes it. If a functional combinator library would be able to generate the XML file in question then a GUI could be created quite easily. You also need to access objects in the created widget and implement slots for it, which I think should be possible using the C bindings. There are new C bindings for KDE and there ought to be some for QT as well. Are there any interested implementors? :) Happy hacking, [!] http://doc.trolltech.com/3.0/index.html [*] http://doc.trolltech.com/3.0/qwidgetfactory.html [+] http://doc.trolltech.com/3.0/designer-manual-5.html - -- Eray Ozkural (exa) <erayo(a)cs.bilkent.edu.tr> Comp. Sci. Dept., Bilkent University, Ankara www: http://www.cs.bilkent.edu.tr/~erayo GPG public key fingerprint: 360C 852F 88B0 A745 F31B EA0F 7C07 AE16 874D 539C -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.0.6 (GNU/Linux) Comment: For info see http://www.gnupg.org iD8DBQE76/b4fAeuFodNU5wRArWAAJ9wN7qFa23Q4p2ZNWIFoXNV4yJwnwCfZBrJ 4MwQbRhI01ZBzfsQs2E41Ig= =zY7d -----END PGP SIGNATURE-----

2 2

Re: seq / strictness and laziness
by Hal Daume 12 Nov '01

12 Nov '01

Dean Herington wrote: > > `seq` forces evaluation of only the top-level construct in its first > argument. (($!) similarly for its second argument.) I would guess your > "newcounts" are structured (probably a tuple or list), in which case you are > not forcing evaluation deeply enough. See > http://haskell.org/pipermail/haskell/2001-August/001581.html and followup > article. As someone who also had this problem a while ago, I'm curious why DeepSeq never made it into the Libraries. This would, imo, be something quite generally useful (and it would be really nice to be able to derive it). - Hal

2 1

how strict is Array.array?
by Johannes Waldmann 12 Nov '01

12 Nov '01

I was surprised to note that bounds $ array (0,1) undefined is undefined ( rather than (0,1) ) - why is this? just curious, -- -- Johannes Waldmann ---- http://www.informatik.uni-leipzig.de/~joe/ -- -- joe(a)informatik.uni-leipzig.de -- phone/fax (+49) 341 9732 204/252 --

1 0