- Haskell - Haskell.org

Re: [Haskell] Queues / Lists with unbound tails
by andrew cooke 08 May '04

08 May '04

Claus Reinke said: > You can't really pop from a fixed-length queue. Apart from that, something like this? Just to clarify, I want something with a *single* operation that takes one value, adding it to the front of the queue, and returns a tuple containing the value that was at the end of the queue and a new queue, with the new value at the front, and without the returned value at the end. See the QUEUE type in my email. So when you push at the front, something pops off the end. If that's not a queue, or not pushing, or not popping then please ignore the words, and just go with the idea. Thanks, Andrew -- ` __ _ __ ___ ___| |_____ work web site: http://www.ctio.noao.edu/~andrew / _` / _/ _ \/ _ \ / / -_) personal web site: http://www.acooke.org/andrew \__,_\__\___/\___/_\_\___| list: http://www.acooke.org/andrew/compute.html

2 1

New release of Vital
by Keith Hanna 05 May '04

05 May '04

I am happy to announce a new release of Vital, a document-centered implementation of Haskell. Recently additioins include: * Hyperlinks, that provide an easy way of navigating between Vital documents; * Some new Vital documents, including a tutorial presentation of approaches to Exact Real Arithmetic (illustrating the infinite decimal expansion of pi, based upon Jerzy Karczmarczuk's philosophical musings on the subject and Jeremy Gibbon's recently discovered "spigot" algorithms); * A new website with lots of supporting materials. And, of course, there is the usual tidying-up of loose ends. The home page for Vital is at: http://www.cs.kent.ac.uk/projects/vital/ As before, the Vital system can be run via the web. Enjoy! Keith Hanna Univ of Kent, UK ---------------------------------------------------------------------------- Vital is a document-centered implementation of [a subset of] Haskell. It aims to present Haskell in a form suitable for end users in application areas such as engineering, mathematics and finance who often need a combination of: * the expressiveness and robustness that languages like Haskell can provide, with * a 'live' document-centered gui in which programs and results are presented together, and solutions to problems can be incrementally developed. Vital may also be useful in teaching/demonstrating some of the principles of functional programming. The main features of the Vital approach are: * Haskell modules are presented as 'documents'. A document is a free-format collection of declarations and expressions with their values shown alongside. * Documents may be developed interactively and (like a spreadsheet) are 'live' in the sense that any change to a document automatically results in dependent values being updated. * Hyperlinked comments provide an easy means for a user to navigate between related documents. * Data structures may be displayed in diagrammatic form by associating 'styles' with their declarations. For example, a value of a Tree datatype may be graphically displayed as a tree. * Styles are ordinary Haskell values. Definitions for styles may be gathered together as a 'stylesheet', itself an ordinary module. * Documents are notionally unbounded in extent and may be panned, allowing any region of a large or infinite data structure to be displayed. * 'Direct manipulation' of diagrammatically-displayed data structures is supported (with changes being reflected back into the Haskell source code). For example, using mouse gestures, a subtree of a tree may be selected, copied to the clipboard and subsequently pasted into another node of a tree. * Images ( both bit-mapped and synthetic) may be displayed. * Documents may be saved as ordinary Haskell text files (with layout data, etc. embedded in comments). At present, the Vital system supports only a subset of Haskell and type-checking is carried out dynamically (ie, at run time) -- but watch this space for forthcoming work on static type checking and type classes.

1 0

All About Monads tutorial missing
by Bayley, Alistair 05 May '04

05 May '04

Jeff Newbern's "All About Monads" tutorial seems to have vanished; or rather, the domain name seems to have changed owner: http://www.nomaware.com/monads/html/ There seems to be a version of the tutorial here (is it up to date?): http://www.lifl.fr/~boulet/formation/CALP/man/monads/html/ ----------------------------------------- ***************************************************************** Confidentiality Note: The information contained in this message, and any attachments, may contain confidential and/or privileged material. It is intended solely for the person(s) or entity to which it is addressed. Any review, retransmission, dissemination, or taking of any action in reliance upon this information by persons or entities other than the intended recipient(s) is prohibited. If you received this in error, please contact the sender and delete the material from any computer. *****************************************************************

1 0

Haskell on OpenBSD
by dons＠cse.unsw.edu.au 05 May '04

05 May '04

I'm maintaining a page covering "Haskell on OpenBSD", along the lines[1] of the FreeBSD page: www.haskell.org/freebsd. I'll try to keep it a current snapshot of Haskell compilers, tools and libraries on this OS. http://www.cse.unsw.edu.au/~dons/haskell_openbsd.html Cheers, Don [1] If you look closely, you'll see that the OpenBSD page is rather similar to the FreeBSD page, though not quite as pretty. Thanks Oliver!

1 0

ANNOUNCE: HaskellDB 0.8
by Anders Höckersten 04 May '04

04 May '04

We are pleased to announce the first beta release of our "remake" of HaskellDB, version 0.8. HaskellDB is available for download from http://haskelldb.sourceforge.net HaskellDB is a Haskell library for expressing database queries and operations in a type safe and declarative way. HaskellDB compiles a relational algebra-like syntax into SQL, submits the operations to the database for processing, and returns the results as ordinary Haskell values. The original version of HaskellDB was written by Daan Leijen and is available at http://www.haskell.org/haskellDB/. The implementation is based on his paper which can be found at: http://www.cs.uu.nl/people/daan/download/papers/dsec.ps New in HaskellDB 0.8: - Improved compatibility with Microsoft Access - Internal restructuring of code - DBDirect generated files are now cleaner and probably more portable across HaskellDB versions - More test programs NOTE: Due to changes in DBDirect, any files generated using the old version of HaskellDB may have to be regenerated. The developers can be reached at haskelldb-users(a)lists.sourceforge.net or on #haskelldb at irc.freenode.net. / The HaskellDB development team

1 0

RE: [Haskell] how to print the Report in CM fonts?
by Simon Peyton-Jones 04 May '04

04 May '04

I guess this is a Tex/Latex question rather than a Haskell report one. I'm no Latex wizard, but maybe leaving out the \usepackage{times} which appears near the start of Haskell.verb would help? Simon | -----Original Message----- | From: haskell-bounces(a)haskell.org [mailto:haskell-bounces@haskell.org] On Behalf Of Boyko | Bantchev | Sent: 30 April 2004 13:27 | To: haskell(a)haskell.org | Subject: [Haskell] how to print the Report in CM fonts? | | Hello all, | | The Haskell98 Report, in its printed form, uses Times | and Courier fonts. I would like to have the Report printed | in the TeX-standard cm family of fonts (including the tt font | which I like much more than Courier as a `computer font'). | Some time ago, I tried to do this from the sources in the | CVS repository but failed. Could someone please explain how | to achieve this, i.e. what changes should be applied to the | files before tex-ing? And what is the set of files needed | for a current version? Thank you. | | Best regards, | | Boyko Bantchev | | | | ----------------------------- | КРАДЕЦ НА ЖИВОТИ | Психологически трилър, в който Анджелина Джоли | е ФБР агентката в преследване на престъпник-маниак | http://movies.mail.bg/takinglives/ | _______________________________________________ | Haskell mailing list | Haskell(a)haskell.org | http://www.haskell.org/mailman/listinfo/haskell

1 0

LOPSTR'04 call for papers (extended deadlines!)
by Sandro Etalle 04 May '04

04 May '04

LOPSTR 2004 Verona, Italy, August 26-28, 2004 http://www.sci.univr.it/~lopstr04 CALL FOR PAPERS ******** EXTENDED DEADLINES ******* full papers: May 7, 2004 extended abstracts: May 17, 2004 The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development, and the workshop is open to contributions in logic-based program development in any language paradigm. Starting this year, LOPSTR will put extra emphasis to the field of verification; in fact LOPSTR will also incorporate the VCL (verification in computational logic) workshop series. LOPSTR'04 will be held at the University of Verona http://www.univr.it co-located with SAS 2004 http://www.sci.univr.it/~sas04, the International Static Analysis Symposium, PEPM 2004 http://www.sci.univr.it/~pepm04 - ACM SIGPLAN 2004 Workshop on Partial Evaluation and Semantics Based Program Manipulation, and PPDP 2004 http://www.sci.univr.it/~ppdp04 - 6th ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming. Past workshops were held in Manchester, UK (1991, 1992, 1998), Louvain-la-Neuve, Belgium (1993), Pisa, Italy (1994), Arnhem, the Netherlands (1995), Stockholm, Sweden (1996), Leuven, Belgium (1997), Venice, Italy (1999), London, UK (2000), Paphos, Cyprus (2001), Madrid, Spain (2002), Uppsala, Sweden (2003). Since 1994 the proceedings have been published in the LNCS series of Springer-Verlag. LOPSTR also aims to be a lively, friendly forum for presenting and discussing work in progress, so it is a real workshop in the sense that it is also intended to provide useful feedback to authors on their preliminary research. Formal proceedings of the workshop are produced only after the workshop, so that authors can incorporate this feedback in the published papers. Scope of the Workshop We solicit extended abstracts and full papers. Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large. The following is a non-exhaustive list of topics: * specification * synthesis * verification * transformation * specialisation * analysis * optimisation * composition * reuse * applications and tools * proofs as programs * component-based software development * agent-based software development * software architectures * design patterns and frameworks * program refinement and logics for refinement Submission Guidelines Authors can either submit extended abstracts (short papers) describing work in progress or they can choose to submit full papers. Contributions should be written in English and should be submitted electronically in Postscript or PDF format at http://profs.sci.univr.it/~lopstr04/index.html. Authors are also asked to send the title and abstract of their submission three days before the deadline to lopstr04(a)sci.univr.it. Prospective authors who have difficulties for the electronic submission may contact the chairman at lopstr04(a)sci.univr.it. Extended abstracts should not exceed 6 pages in llncs format and may describe work in progress. Promising abstracts relevant to the scope of LOPSTR will be selected for presentation at the workshop. The submission deadline for extended abstract is May 17, 2004 (extended, strict). Full papers should not exceed 16 pages (including references) in llncs format. These papers will be judged using ordinary conference quality criteria and accepted papers will have to be presented at the workshop and will automatically appear in the pre-proceedings as well as in the final collection of papers, published in the LNCS series. The submission deadline for full papers is May 7, 2004 (extended, strict). Accepted papers and abstracts will be collected in informal pre-proceedings which will be available at the workshop. After the workshop, authors of extended abstract which are judged mature for publication will be invited to submit full papers. These will be reviewed according to the usual refereeing procedures, and accepted papers will be published in the final collection of papers (together with the accepted full papers) which is expected to be published in the Lecture Notes in Computer Science series by Springer-Verlag. All the full papers accepted before the workshop will automatically appear in that book as well; there will be no additional refereeing (although authors will be given a chance to revise their paper, if they so wish, based upon the feedback from the LOPSTR event). Program Committee * Gilles Barthe (France) * Annalisa Bossi (Italy) * Maurice Bruynooghe (Belgium) * Francisco Bueno (Spain) * Giorgio Delzanno (Italy) * Tom Ellman (USA) * Sandro Etalle (The Netherlands) program chair * Norbert Fuchs (Switzerland) * Gopal Gupta (USA) * Patricia M. Hill (UK) * Kung-Kiu Lau (UK) * Fabio Martinelli (Italy) * Alberto Pettorossi (Italy) * Andreas Podelski (Germany) * C.R. Ramakrishnan (USA) * Abhik Roychoudhury (Singapore) * Wim Vanhoof (Belgium) * German Vidal (Spain) Important dates * submission deadline for full papers: May 7, 2004 (extended, strict) * submission deadline for extended abstracts: May 17, 2004 (extended, strict) * Notification: June 6 * Camera-ready: June 16 Sponsor Lopstr 2004 is sponsored by the Association for Logic Programming (ALP) http::/www.cwi.nl/projects/alp

1 0

ICCL Summer School 2004 - Final Call
by Int. Center for Computational Logic 03 May '04

03 May '04

ICCL Summer School 2004 Proof Theory and Automated Theorem Proving ------------------------------------------ PCC Workshop 2004 ------------------------------- Technische Universitaet Dresden June 14-25, 2004 <http://www.iccl.tu-dresden.de/events/SA-2004> Call for Participation ---------------------- This two-week meeting consists of two integrated parts, a summer school and a workshop, aimed at graduate students and researchers. The themes for the summer school are proof theory and automated theorem proving, the workshop is about proof, computation and complexity. As in the summer schools at TU Dresden in 2002 and 2003 and in the previous editions of the PCC workshop, people from distinct but communicating communities will gather in an informal and friendly atmosphere. We ask for a participation fee of 200 EUR. We request registration before May 10, 2004; please send an email to <mailto:PTEvent@ICCL.TU-Dresden.DE>, making sure you include a very brief bio (5-10 lines) stating your experience, interests, home page (if available), etc. It will be possible for some students to present their work: please indicate in your application if you would like to do so and give us some information about your proposed talk. We will select applicants in case of excessive demand. A limited number of grants covering all expenses is available, please indicate in your application if the only possibility for you to participate is via a grant. Applications for grants must include an estimate of travel costs and they should be sent together with the registration. We will provide assistance in finding an accommodation in Dresden. Week 1, June 14-17: courses on Term Rewriting Systems Franz Baader (TU Dresden) Deep Inference and the Calculus of Structures Alessio Guglielmi (TU Dresden) Game Semantics and Its Applications C.-H. L. Ong (Oxford) On June 14 Prof Wolfgang Bibel will give an invited lecture June 17-19: workshop For more details, please consult the workshop web page <http://www1.informatik.unibw-muenchen.de/Birgit/pcc04.html> Week 2, June 21-25: courses on Deduction Modulo Claude Kirchner (Loria & INRIA, Nancy) Logic Considered as a Branch of Geometry Francois Lamarche (Loria & INRIA, Nancy) Proofs as Programs Michel Parigot (CNRS - Universite' Paris 7) Automated Reasoning for Substructural Logics John Slaney (NICTA, Canberra and Australian National University) Automated Theorem Proving for Classical Logics Andrei Voronkov (Manchester) Venue ----- Dresden, on the river Elbe, is one of the most important art cities of Germany. You can find world-class museums and wonderful architecture and surroundings. We will organize trips and social events. Organization ------------ This event is organized by the International Center for Computational Logic (ICCL), Paola Bruscoli, Birgit Elbl, Sylvia Epp, Bertram Fronhoefer, Axel Grossmann, Alessio Guglielmi, Steffen Hoelldobler, Reinhard Kahle and Mariana Stantcheva; it is sponsored by Deutscher Akademischer Austausch Dienst (DAAD), under the program `Deutsche Sommer-Akademie', and CoLogNet. Please distribute this message broadly.

1 0

[Haskell] REMINDER - Contributions to HC&A Report (May 2004 edition)
by Arthur van Leeuwen 03 May '04

03 May '04

Dear Haskellers, we would like to remind you of the opportunity to contribute to the May 2004 edition of the Haskell Communities & Activities Report. Why not take the few minutes necessary to type up a new or updated entry and send it in? We would love to see people write on the following subject(s): - The Haskell Mailing List - The Haskell Cafe - The Haskell 98 reports - Concurrent Haskell - hierarchical libraries - HaskellDB - HXml - QuickCheck - Yale Haskell group - Parallel and Distributed Functional Languages Research Group at Heriot-Watt University Ofcourse, if you have done other interesting things with Haskell we would very much like to know about those as well! If at all possible, could you please send in your contribution by friday *this* week, i.e. May 7th 2004? We will update the topics list on http://www.haskell.org/communities/topics.html with a nice tickmark as soon as we have received your contribution, to show that you too support the Haskell Communities and Activities Report! Thanks, Arthur (interim editor, May 2004 edition) -- Haskell Communities and Activities Report (May 2004 edition) All contributions are due in by the end of next week! http://www.haskell.org/communities/

1 0

JELIA'04 - Deadline Reminder
by JELIA'04 03 May '04

03 May '04

/------------------------------------------------------------------/ DEADLINE REMINDER 9th European Conference on Logics in Artificial Intelligence JELIA'04 Lisbon, Portugal, September 27-30 http://centria.di.fct.unl.pt/~jelia2004 Submission deadline: May 9th (abstracts due May 6th) /------------------------------------------------------------------/

1 0