- Haskell - Haskell.org

Haskell Weekly News: Issue 160 - December 1, 2010
by Daniel Santa Cruz 02 Dec '10

02 Dec '10

Welcome to issue 160 of the HWN, a newsletter covering developments in the [1]Haskell community in the week of November 21 - 27. My apologies for proving a much shorter version of the weekly news this time around. I'm really short on time this week, but decided to send this abbreviated version rather than skipping it. Hope to resume full coverage next week. Cheers! Top Reddit Stories * Lisk - Lisp and Haskell Domain: chrisdone.com Score: 70, Comments: 83 On Reddit: http://www.reddit.com/r/haskell/comments/ec0kp/lisk_lisp_and_haskell/ Original: http://chrisdone.com/posts/2010-11-25-lisk-lisp-haskell.html * lazycatmanatee is building a enormous suite of graphical, desktop apps in Haskell. Here's the screenshot feed Domain: flickr.com Score: 58, Comments: 11 On Reddit: http://www.reddit.com/r/haskell/comments/eb5kd/lazycatmanatee_is_building_a… Original: http://www.flickr.com/photos/48809572@N02/ * Category theory for Haskell programmers Domain: geoffhulette.wordpress.com Score: 49, Comments: 7 On Reddit: http://www.reddit.com/r/haskell/comments/eatd6/category_theory_for_haskell_… Original: http://geoffhulette.wordpress.com/2010/11/22/category-theory-for-haskell-pr… * Duck typing in Haskell Domain: chrisdone.com Score: 45, Comments: 10 On Reddit: http://www.reddit.com/r/haskell/comments/ea99a/duck_typing_in_haskell/ Original: http://chrisdone.com/posts/2010-11-22-duck-typing-in-haskell.html * GHC 7 I/O manager status update: bugs fixed, performance improved, plans afoot! Domain: serpentine.com Score: 41, Comments: 0 On Reddit: http://www.reddit.com/r/haskell/comments/ecls3/ghc_7_io_manager_status_upda… Original: http://www.serpentine.com/blog/2010/11/27/ghc-7-io-manager-status/ * And here I thought they were using Haskell... Domain: i.imgur.com Score: 34, Comments: 11 On Reddit: http://www.reddit.com/r/haskell/comments/ebgnj/and_here_i_thought_they_were… Original: http://i.imgur.com/ApzhX.png * Fun with monad comprehensions Domain: blog.n-sch.de Score: 33, Comments: 9 On Reddit: http://www.reddit.com/r/haskell/comments/ecu0w/fun_with_monad_comprehension… Original: http://blog.n-sch.de/2010/11/27/fun-with-monad-comprehensions/ * The 'text' package has been accepted into the Haskell Platform! Domain: self.haskell Score: 31, Comments: 20 On Reddit: http://www.reddit.com/r/haskell/comments/eb7fd/the_text_package_has_been_ac… Original: /r/haskell/comments/eb7fd/the_text_package_has_been_accepted_into_the/ * Yesod 0.6.3 Released Domain: docs.yesodweb.com Score: 24, Comments: 1 On Reddit: http://www.reddit.com/r/haskell/comments/e9jfd/yesod_063_released/ Original: http://docs.yesodweb.com/blog/yesod-0-6-3/ * how subtraction works for combinatorial species Domain: byorgey.wordpress.com Score: 24, Comments: 2 On Reddit: http://www.reddit.com/r/haskell/comments/ec5mx/how_subtraction_works_for_co… Original: http://byorgey.wordpress.com/2010/11/24/species-subtraction-made-simple/ Top StackOverflow Questions * Avoiding namespace pollution in Haskell votes: 14, answers: 3 http://stackoverflow.com/questions/4260507/avoiding-namespace-pollution-in-… * Keeping State in a Stateless world votes: 7, answers: 2 http://stackoverflow.com/questions/4259800/keeping-state-in-a-stateless-wor… * Updating a Big State Fast in Haskell votes: 7, answers: 2 http://stackoverflow.com/questions/4265660/updating-a-big-state-fast-in-has… * What is the most efficient purely functional algorithm for generating all prefixes of a list? votes: 7, answers: 2 http://stackoverflow.com/questions/4290370/what-is-the-most-efficient-purel… * How can I make a graphical command line in haskell/gtk2hs? votes: 6, answers: 2 http://stackoverflow.com/questions/4281984/how-can-i-make-a-graphical-comma… * Point-free form versus style votes: 5, answers: 3 http://stackoverflow.com/questions/4235741/point-free-form-versus-style * How to catch (and ignore) a call to the error function? votes: 4, answers: 2 http://stackoverflow.com/questions/4243117/how-to-catch-and-ignore-a-call-t… * Persistent console history in ghci votes: 4, answers: 1 http://stackoverflow.com/questions/4249351/persistent-console-history-in-gh… * Common Lisp equivalent to Haskell's main function? votes: 4, answers: 2 http://stackoverflow.com/questions/4285718/common-lisp-equivalent-to-haskel… * How can I write a MST algorithm (Prim or Kruskal) in Haskell? votes: 4, answers: 3 http://stackoverflow.com/questions/4290163/how-can-i-write-a-mst-algorithm-… About the Haskell Weekly News New editions are posted to [2]the Haskell mailing list as well as to [3]the Haskell Sequence and [4]Planet Haskell. [5]RSS is also available, and headlines appear on [6]haskell.org. To help create new editions of this newsletter, please send stories to dstcruz * at * gmail * dot * com. The code used to produce this version of the newsletter is not yet publicly available, as it is a complete hack designed to get things started again. Until next time, Daniel Santa Cruz References 1. http://haskell.org/ 2. http://www.haskell.org/mailman/listinfo/haskell 3. http://sequence.complete.org/ 4. http://planet.haskell.org/ 5. http://sequence.complete.org/node/feed 6. http://haskell.org/

1 0

ANN: HaLVM 1.0: the Haskell Lightweight Virtual Machine
by Adam Wick 30 Nov '10

30 Nov '10

Galois, Inc. is pleased to announce the immediate release of the Haskell Lightweight Virtual Machine (or HaLVM), version 1.0. The HaLVM is a port of the GHC runtime system to the Xen hypervisor, allowing programmers to create Haskell programs that run directly on Xen's "bare metal." Internally, Galois has used this system in several projects with much success, and we hope y'all will have an equally great time with it. What might you do with a HaLVM? Pretty much anything you want. :) Explore designs for operating system decomposition, examine new notions of mobile computation with the HaLVM and Xen migration, or find interesting network services and lock them inside small, cheap, single-purpose VMs. The HaLVM is the result of many years of effort, by many people inside Galois. Although it is not yet totally bug-free, we have decided that broad adoption wins over perfection and thus we are releasing it for general review. As such, there will be some rough edges, and we urge you to read the documentation to understand the platforms we test on. We are releasing the HaLVM under a non-restrictive BSD3 license. You can find it here: http://halvm.org We welcome user feedback, feature requests, bug notices, patches, and feature additions; see the page above for guidelines on getting involved. Finally, we'd like to give many things to the GHC and Xen communities, without which this work would not be possible. If you have any questions or concerns, please don't hesitate to contact the HaLVM's maintainers at halvm-devel(a)community.galois.com. Have a lovely day! - Adam

1 0

TLDI 2011 Call for participation
by Stephanie Weirich 30 Nov '10

30 Nov '10

********************************************************************* CALL FOR PARTICIPATION TLDI 2011 ACM SIGPLAN Workshop on Types in Language Design and Implementation 25 January 2011 Austin, TX, USA To be held in conjunction with POPL 2011 http://www.mpi-sws.org/~dreyer/tldi2011/ ********************************************************************* IMPORTANT DATES Deadline for student travel grant applications: December 17, 2010 Hotel reservation deadline: December 21, 2010 Notification of student travel awards: December 27, 2010 Early registration deadline: December 31, 2010 VENUE TLDI'11 and all POPL'11 affiliated events will take place at the Omni Austin Hotel in downtown Austin, TX. REGISTRATION To register for TLDI'11, follow the link from the POPL 2011 page, at https://regmaster3.com/2011conf/POPL11/register.php SCOPE The role of types and proofs in all aspects of language design, compiler construction, and software development has expanded greatly in recent years. Type systems, type-based analyses and type-theoretic deductive systems have been central to advances in compilation techniques for modern programming languages, verification of safety and security properties of programs, program transformation and optimization, and many other areas. The ACM SIGPLAN Workshop on Types in Language Design and Implementation brings researchers together to share new ideas and results concerning all aspects of types and programming, and is now an annual event. WORKSHOP PROGRAM Session 1: Invited Talk (9:30 - 10:30) Type Design Patterns for Computer Mathematics Georges Gonthier (Microsoft Research, Cambridge) Break (10:30-11:00) Session 2 (11:00-12:30) Singleton: A General-Purpose Dependently-Typed Assembly Language Simon Winwood and Manuel Chakravarty A Type and Effect System for Deadlock Avoidance in Low-Level Languages Prodromos Gerakios, Nikolaos Papaspyrou and Konstantinos Sagonas Extended Alias Type System using Separating Implication Toshiyuki Maeda, Haruki Sato and Akinori Yonezawa Lunch (12:30-14:30) Session 3: Invited Talk (14:30-15:30) Type Safety from the Ground Up Chris Hawblitzel (Microsoft Research, Redmond) Break (15:30-16:00) Session 4 (16:00-17:30) AuraConf: A Unified Approach to Authorization and Confidentiality Jeffrey Vaughan Information Flow Enforcement in Monadic Libraries Dominique Devriese and Frank Piessens The Essence of Monotonic State Alexandre Pilkiewicz and François Pottier

1 0

haskell.org downtime: Tuesday Nov 30th
by Ian Lynagh 29 Nov '10

29 Nov '10

Hi all, We plan to have some haskell.org downtime on Tuesday Nov 30th, while we migrate to the new server. If you think something is missing from http://new-www.haskell.org/ then please let us know as soon as possible! Thanks Ian

8 11

ANNOUNCE: iteratee-compress 0.1.2
by Maciej Piechotka 28 Nov '10

28 Nov '10

Iteratee-compress provides compressing and decompressing enumerators including flushing. Currently only gzip is provided but at bzip and LZMA are planned. This is bug-fixing release Changes from previous version: - Fix infinite loop/segfault bug - Fix bug in which part of the output was lost - Support for iteratee 0.5 and 0.6 Next goals: - BZip support - LZMA support - Generic interface for flushing To think about: - Should inner iteratee be able to request flushing? Regards

1 1

ANNOUNCE: iteratee-compress 0.1.2
by Maciej Piechotka 28 Nov '10

28 Nov '10

Iteratee-compress provides compressing and decompressing enumerators including flushing. Currently only gzip is provided but at bzip and LZMA are planned. This is bug-fixing release Changes from previous version: - Fix infinite loop/segfault bug - Fix bug in which part of the output was lost Next goals: - BZip support - LZMA support - Generic interface for flushing To think about: - Should inner iteratee be able to request flushing? Regards

1 0

SLE 2011 - Call for papers
by João Fernandes 27 Nov '10

27 Nov '10

============================================================ CALL FOR PAPERS SLE 2011 4th International Conference on Software Language Engineering Braga, Portugal, 3-6 July 2011 http://planet-sl.org/sle2011/ Co-located with the 4th Summer School on Generative and Transformational Techniques in Software Engineering (GTTSE 2011) ============================================================= IMPORTANT DATES * 2010: Workshop Proposals: December 21 * 2011: Paper submission: April 08 (midnight Apia Samoa time) Author notification: May 13 Paper submission for online proceedings: June 17 SLE: July 03-06 Camera-ready copy submission for post-proceedings: August 29 --------------------------------------------------------- Software language engineering is devoted to topics related to artificial languages in software engineering. The foremost mission of the International Conference on Software Language Engineering (SLE) is to encourage and organize communication between communities that traditionally have looked at soft- ware languages from different, more specialized, and yet complementary perspectives. Thus, technologies, methods, experiments and case studies from modelware, grammarware, and ontologyware serving the objectives of software languages are of particular relevance to SLE. We invite high-quality submissions to all conference tracks. Submissions must be PDF files following the Springer LNCS style and will be managed using the EasyChair submission system. Please check the conference web site for further information. SLE 2011 will include a Doctoral Symposium that will provide a supportive yet questioning setting in which PhD students can present their work, including goals, methods, and preliminary results. The Symposium aims to provide students with useful guidance and feedback on various aspects of their research from established researchers and the other student attendees. Please forward this call to anyone who might be interested. http://planet-sl.org/sle2011/ --------------------------------------------------------- PAPER SUBMISSION Submitted papers must be original work and must not be previously published in, currently submitted to, or currently in consideration for any journal, book, conference, or workshop. Each submitted paper will be reviewed closely by at least three members of the program committee. Accepted papers will be distributed at the conference via the online proceedings as well as published in the post-proceedings, which will appear in the Springer Lecture Notes in Computer Science (LNCS) series. Authors will have the opportunity to revise their accepted paper(s) for the pre- and post- proceedings. For an accepted paper to appear in the proceedings, at least one author must attend the event and present the work. --------------------------------------------------------- RESEARCH PAPERS Research papers should report a substantial research contribution to SLE and/or a successful application of SLE techniques. We solicit high-quality contributions in the area of SLE ranging from theoretical and conceptual contributions to tools, techniques, and frameworks that support the aforementioned lifecycle activities. We list examples of tools, techniques, applications, and problems of interest to clarify the types of contributes that we seek: * Formalisms used in designing and specifying languages and tools that analyze such language descriptions * Language implementation techniques * Program and model transformation tools * Composition, integration, and mapping tools for managing different aspects of software languages or different manifestations of a given language * Transformations and transformation languages between languages and models * Language evolution * Approaches to elicitation, specification, or verification of requirements for software languages * Language development frameworks, methodologies, techniques, best practices, and tools for the broader language lifecycle covering phases such as analysis, testing , and documentation. * Design challenges in SLE * Applications of languages including innovative domain-specific languages or "little" languages The preceding list is neither exclusive nor exhaustive. Visit the conference web site for more information about the scope and topics of interest of SLE, or contact the program co-chairs with questions. Page limit: 20 --------------------------------------------------------- SHORT PAPERS Short paper may describe interesting or thought-provoking concepts that are not yet fully developed or evaluated, make an initial contribution to challenging research issues in SLE, or discuss and analyze controversial issues in the field. Page limit: 10 --------------------------------------------------------- TOOL DEMONSTRATION PAPERS Because of SLE's ample interest in tools, we seek papers that present software tools related to the field of SLE. These papers will accompany a tool demonstration to be given at the conference. The selection criteria include the originality of the tool, its innovative aspects, the relevance of the tool to SLE, and the maturity of the tool. Submissions may also include an appendix (that will not be published) containing additional screen-shots and discussion of the proposed demonstration. Page limit: 10 --------------------------------------------------------- MINI-TUTORIAL PAPERS SLE is composed of various research areas, such as grammarware, modelware, language schemas, and semantic technologies. The cross product of attendees at SLE creates a situation where the contribution from one session may be difficult to understand by those not initiated to the area. To help unite the various communities of SLE 2011, we solicit mini-tutorials that provide discussion points for mapping common ideas between related and complementary research topics of SLE. A mini-tutorial submission should be between 15 and 20 pages. --------------------------------------------------------- CO-LOCATED WORKSHOPS A call for one-day workshop proposals to be held in conjunction with the SLE2011 conference is already open. We encourage proposals on SLE-related topics that are novel or of emerging importance. Each workshop proposal will be evaluated according to the value and relevance of its topic, the expertise and experience of the workshop organizers, and the workshop's potential for attracting participants and generating useful results. See the conference webpage for full details. --------------------------------------------------------- DOCTORAL SYMPOSIUM The Doctoral Symposium provides a forum for both early and late-stage PhD students to present their research and get detailed feedback and advice from researchers both in and out of their particular research area. Submissions are invited from PhD students working on any topic that falls within the SLE conference remit. Submissions consist of two parts, a research abstract and a letter of recommendation from the student's supervisor. See the upcoming Doctoral Symposium call for submissions for full details. Participants will also be invited to present a poster on their research as part of the conference poster session. ------------------------------------------------------------ GENERAL CHAIR João Saraiva Universidade do Minho, Portugal jas(a)di.uminho.pt PROGRAM CO-CHAIRS Uwe Aßmann Dresden University of Technology, Germany uwe.assmann(a)tu-dresden.de Anthony Sloane Macquarie University, Australia anthony.sloane(a)mq.edu.au DOCTORAL SYMPOSIUM CHAIRS Perdita Stevens University of Edinburgh, UK perdita.stevens(a)ed.ac.uk Eric Van Wyk University of Minnesota, USA evw(a)cs.umn.edu ORGANIZATION COMMITTEE José Creissac Campos (Finance Chair) Universidade do Minho, Portugal João Paulo Fernandes (Web and Publicity co-Chair) Universidade do Porto& Universidade do Minho, Portugal Jurgen Vinju (Workshop Selection Chair) CWI, The Netherlands Vadim Zaytsev (Publicity co-Chair) CWI, The Netherlands

1 0

PhD and Postdoc Positions in Language-based Security at Chalmers
by Andrei Sabelfeld 25 Nov '10

25 Nov '10

*PhD* and *Postdoc* Positions in Programming Language-based Security Dept. of Computer Science and Engineering, Chalmers University of Technology, Sweden Application deadline: January 12, 2011 ------------------------------------------------------------------------ *Job description* The PhD students and postdocs will join a world-leading team of researchers on programming language-based security. Language-based security facilitates specifying and enforcing security policies at the level of programming languages early in the software design and construction phase. The focus of the advertised positions is on the following directions of work: - To design rich security policies for confidentiality and integrity, as demanded by practical applications (such as web applications). - To develop practical enforcement mechanisms for these policies in expressive programming languages (such as web languages). These enforcement mechanisms may combine static (for example, type system-based) and dynamic (for example, execution monitoring-based) techniques. - To support the above with case studies in web-application security. In pursuing these goals, there are possibilities for collaboration with our high-profile academic and industrial partners. ------------------------------------------------------------------------ *Details about Employment* PhD student positions are limited to five years and will then normally include 20 per cent departmental work, mostly teaching duties. Salary for the position is as specified in Chalmers' general agreement for PhD student positions. Currently the starting salary is around 25,000SEK a month before tax. The positions are intended to start in spring or fall 2011. Postdoc positions are typically for one year with possibility for extension with one year (two years in total is the typical duration). As a Chalmers employee, the monthly salary will be set according to current salary agreements (currently around 33,000SEK before tax). The starting date is negotiable. ------------------------------------------------------------------------ *Suitable Background* Applicants for a PhD position must have a degree in Computing Science or in a related subject with a strong Computing Science component. They must also have a strong, documented interest in doing research. The ideal candidate for the project will have strong background in both programming languages and security. You may even apply if you have not yet completed your degree, but expect to do so before the position starts. Applicants for a Postdoc position should have a recent PhD degree in Computing Science. They must have a well-documented research track record. Expertise in either programming languages or security and interest to both areas is a prerequisite. You may even apply if you have not yet completed your PhD degree, but expect to do so before the position starts. ------------------------------------------------------------------------ *The Department* The department provides a strong, international, and dynamic research environment with about 75 faculty and 75 PhD students. For more information, see http://www.chalmers.se/cse/EN/ . Knowledge of Swedish is not a prerequisite for application. English is our working language for research. Both Swedish and English are used in undergraduate courses. Half of our researchers and PhD students are native Swedes. The rest come from more than 30 different countries. ------------------------------------------------------------------------ *How to Apply* Electronic application can be submitted following these guidelines: PhD positions: http://www.chalmers.se/cse/EN/news/vacancies/positions/phd-student-position… Postdoc positions: http://www.chalmers.se/cse/EN/news/vacancies/positions/post-doc-positions-in

1 0

Call for Papers: PAPP 2011
by Frédéric Loulergue 25 Nov '10

25 Nov '10

Eighth International Workshop on Practical Aspects of High-Level Parallel Programming (PAPP 2011) part of The International Conference on Computational Science June 1-3, 2011, Tsukuba, Japan http://www.papp-workshop.org AIMS AND SCOPE Computational Science applications are more and more complex to develop and require more and more computing power. Sequential computing cannot go further. Major companies in the computing industry now recognise the urgency of re-orienting an entire industry towards massively parallel computing. Parallel and grid computing are solutions to the increasing need for computing power. The trend is towards the increase of cores in processors, the number of processors and the need for scalable computing everywhere. But parallel and distributed programming is still dominated by low-level techniques such as send/receive message passing. Thus high-level approaches should play a key role in the shift to scalable computing in every computer. Algorithmic skeletons, parallel extensions of functional languages such as Haskell and ML, parallel logic and constraint programming, parallel execution of declarative programs such as SQL queries, genericity and meta-programming in object-oriented languages, etc. have produced methods and tools that improve the price/performance ratio of parallel software, and broaden the range of target applications. Also, high level languages offer a high degree of abstraction which ease the development of complex systems. Moreover, being based on formal semantics, it is possible to certify the correctness of critical parts of the applications. The PAPP workshop focuses on practical aspects of high-level parallel programming: design, implementation and optimisation of high-level programming languages, semantics of parallel languages, formal verification, design or certification of libraries, middle-wares and tools (performance predictors working on high-level parallel/grid source code, visualisations of abstract behaviour, automatic hot-spot detectors, high-level GRID resource managers, compilers, automatic generators, etc.), application of proof assistants to parallel applications, applications in all fields of computational science, benchmarks and experiments. Research on high-level grid programming is particularly relevant as well as domain specific parallel software. The aim of all these languages and tools is to improve and ease the development of applications (safety, expressivity, efficiency, etc.). Thus the PAPP workshop focuses on applications. The PAPP workshop is aimed both at researchers involved in the development of high level approaches for parallel and grid computing and computational science researchers who are potential users of these languages and tools. Topics We welcome submission of original, unpublished papers in English on topics including: * applications in all fields of high-performance computing and visualisation (using high-level tools) * high-level models (CGM, BSP, MPM, LogP, etc.) and tools for parallel and grid computing * high-level parallel language design, implementation and optimisation * practical aspects of computer assisted verification for high-level parallel languages * modular, object-oriented, functional, logic, constraint programming for parallel, distributed and grid computing systems * algorithmic skeletons, patterns and high-level parallel libraries * generative (e.g. template-based) programming with algorithmic skeletons, patterns and high-level parallel libraries * benchmarks and experiments using such languages and tools PAPER SUBMISSION AND PUBLICATION Prospective authors are invited to submit full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Papers will go through a rigorous reviewing process. Each paper will be reviewed by at least three referees. The accepted papers will be published in the Procedia Computer Science series, as part of the ICCS proceedings. Submission must be done through the ICCS website. We invite you to submit a full paper of at most 10 pages describing new and original results, no later than January 8, 2011. Submission implies the willingness of at least one of the authors to register and present the paper. Accepted papers should be presented at the workshop. IMPORTANT DATES * January 8, 2011: Full paper due * February 20, 2011: Notification * March 7, 2011: Camera-ready paper due PROGRAMME COMMITTEE * Marco Aldinucci (University of Torino, Italy) * Jost Berthold (University of Copenhagen, Denmark) * Kento Emoto (University of Tokyo, Japan) * Frédéric Gava (University Paris-East, France) * Alexandros Gerbessiotis (NJIT, USA) * Clemens Grelck (University of Amsterdam, Netherlands) * Hideya Iwasaki (The University of Electro-communications, Japan) * Roman Leshchinskiy (Standard Chartered Bank, UK) * Frédéric Loulergue, chair (University of Orléans, France) * Bruno Raffin (INRIA, France) * Aamir Shafi (NUST, Pakistan)

1 0

ANNOUNCE: Graphalyze-0.11.0.0 and SourceGraph-0.7.0.0
by Ivan Lazar Miljenovic 24 Nov '10

24 Nov '10

I am pleased to announce the 0.7.0.0 release of my graph-theoretic source code analysis tool SourceGraph [1], and the library it uses Graphalyze 0.11.0.0 [2]. [1]: http://hackage.haskell.org/package/SourceGraph [2]: http://hackage.haskell.org/package/Graphalyze Changes in SourceGraph (apart from those resulting from improvements to Graphalyze): * Edge widths are now log-based rather than being the number of function calls; this avoids having absurdly thick edges. * Source files that were not able to be parsed are now listed both to stderror and in the resulting report (thus helping you work out why you're missing some code) * Also builds with Cabal-1.10; whilst I do not currently have GHC 7 installed anywhere and thus can't test this, I know of no reason why SourceGraph cannot be built with GHC 7 (unless it uses a library that isn't buildable on GHC 7 that I have no control over). Changes in Graphalyze: * Legends can now contain text-only fields rather than just graphs; also, the title of each legend is now displayed first rather than what it describes. * To fix a bug spotted by Han Joosten, the reports currently use Posix-style path separators even on Windows (otherwise, HTML documents produced on Windows were not in a state to be uploaded elsewhere). -- Ivan Lazar Miljenovic Ivan.Miljenovic(a)gmail.com IvanMiljenovic.wordpress.com

1 0