- Haskell - Haskell.org

Haskell version of Crystal Space 3D?
by Benjamin L. Russell 23 Jun '05

23 Jun '05

Does anybody know any Haskell tool(s) corresponding to Crystal Space 3D ( see http://www.crystalspace3d.org/tikiwiki/tiki-view_articles.php )? To quote from "About Crystal Space" ( see http://www.crystalspace3d.org/tikiwiki/tiki-index.php?page=About+Crystal+Sp… ), "Crystal Space is a free (LGPL) and portable 3D Game Development Kit written in C++. It supports: true six degrees of freedom, colored lighting, lightmapped and stencil based lighting, shader support (CG, vertex programs, fragment programs, ...), mipmapping, portals, mirrors, alpha transparency, reflective surfaces, 3D sprites (frame based or with skeletal animation using cal3d animation library), procedural textures, particle systems, halos, volumetric fog, scripting (using Python, Perl, Java, or potentially other languages), 16-bit and 32-bit display support, OpenGL, and software renderer, font support (also with freetype), hierarchical transformations, physics plugin based on ODE, ... See the extensive list of features for more details." The reason that I ask is that I would like to learn how to write my own version of PlaneShift (a 3D fantasy MMORPG written using Crystal Space 3D) with Haskell, instead of C++, if possible. However, I haven't been able to find any Haskell tools or libraries specific enough for this kind of project. Many thanks, Benjamin L. Russell

4 7

7th GPCE Young Researchers Workshop Deadline: June 30, 2005
by GPCE YRW Organizers 22 Jun '05

22 Jun '05

[apologies for multiple copies] 7th GPCE Young Researchers Workshop 2005 In conjunction with Generative Programming and Component Engineering (GPCE'05) Co-located with ICFP 2005 http://serl.cs.colorado.edu/~rutherfo/gpce_yrw05/ gpce_yrw05 (at) serl (dot) cs (dot) colorado (dot) edu Call for Papers This call is of special interest to people who have recently started their career in the domain of generative and component based software development (the "young researchers"). We would like to encourage contributions from PhD students, post-docs, and practitioners in industry. The topics of the workshop are: Component-based software engineering: Reuse, distributed platforms, distributed systems, evolution, analysis and design patterns, development methods, formal methods Product line engineering: Architectures, scoping, domain analysis, product line implementation and testing, variability Generative programming: Reuse, meta-programming, partial evaluation, multi-stage and multi-level languages Runtime code generation, compilation, active libraries, synthesis from specifications, development methods, generation of non-code artifacts, formal methods, reflection Separation of concerns: Aspect-oriented programming, intentional programming, and multi-dimensional separation of concerns Integration of generative and component-based approaches Domain engineering, analysis, and languages Aims and Objectives After the great success of the 6th GPCE Young Researchers Workshop (see the 6th GPCE Young Researchers Workshop website) this workshop which is traditionally held in conjunction with the GPCE aims again at providing a platform for young international researchers to present their work. The presentations will be commented by experienced panelists. The workshop serves as a forum for the participants to get in contact with other researchers in the field and to become familiar with other approaches and future research topics. Authors of accepted papers receive feedback and hints on their research in a constructive and international atmosphere. Submission Guidelines Potential participants are asked to submit a short paper in English. It must be no longer than 2500 words or five pages (including figures, tables, and references). Format the paper according to the LNCS style (for the formatting details see "Information for LNCS Authors") and submit your paper in either Postscript format or PDF. The submission should be classified according to the progress of the work, e.g. third year's PhD work. All submitted papers will undergo a review process by a panel of renowned experts. All accepted papers will be published as downloadable versions on the home page of the 7th GPCE Young Researchers Workshop 2005. The number of accepted papers is limited to ten. Papers should be sent by e-mail (please use the text GPCE-YRW-2005-Submission as subject of your mail) to the address listed in the Workshop Website and Email section. Workshop Structure The workshop is intended to take one day during the GPCE conference. Accepted papers have to be presented at the workshop by their authors. Afterwards the presenters receive constructive feedback and hints from invited panelists who are experienced experts in the workshop topics. Furthermore there will be time for discussion with the whole audience about the presented work. Workshop Website and Email http://serl.cs.colorado.edu/~rutherfo/gpce_yrw05/ gpce_yrw05 (at) serl (dot) cs (dot) colorado (dot) edu Important Dates Submission due: June 30, 2005 Notification of Acceptance: Jul 11, 2005 Camera Ready Copy: August 5, 2005 Workshop: September 27, 2005 Organization Douglas R. Dechow, Tech-X Corporation Daniel Fötsch, University of Jena Sebastian Kiebusch, University of Leipzig Saverio Perugini, University of Dayton Matthew J. Rutherford, University of Colorado at Boulder Denis Shestakov, Turku Center for Computer Science Panelists TDB

1 0

SOS 2005: Call for Papers
by sos2005＠mcs.le.ac.uk 22 Jun '05

22 Jun '05

First Call for Papers: Structural Operational Semantics 2005 A Satellite Workshop of ICALP 2005 July 10, 2005, Lisbon, Portugal http://www.cs.le.ac.uk/events/SOS2005 Aim: Structural operational semantics (SOS) provides a framework for giving operational semantics to programming and specification languages. A growing number of programming languages from commercial and academic spheres have been given usable semantic descriptions by means of structural operational semantics. Because of its intuitive appeal and flexibility, structural operational semantics has found considerable application in the study of the semantics of concurrent processes. Moreover, it is becoming a viable alternative to denotational semantics in the static analysis of programs, and in proving compiler correctness. Recently, structural operational semantics has been successfully applied as a formal tool to establish results that hold for classes of process description languages. This has allowed for the generalization of well-known results in the field of process algebra, and for the development of a meta-theory for process calculi based on the realization that many of the results in this field only depend upon general semantic properties of language constructs. This workshop aims at being a forum for researchers, students and practitioners interested in new developments, and directions for future investigation, in the field of structural operational semantics. One of the specific goals of the workshop is to establish synergies between the concurrency and programming language communities working on the theory and practice of SOS. Moreover, it aims at widening the knowledge of SOS among postgraduate students and young researchers from the U.K. and abroad. Specific topics of interest include (but are not limited to): * programming languages * process algebras * higher-order formalisms * rule formats for operational specifications * meaning of operational specifications * comparisons between denotational, axiomatic and SOS * compositionality of modal logics with respect to operational specifications * congruence with respect to behavioural equivalences * conservative extensions * derivation of proof rules from operational specifications * software tools that automate, or are based on, SOS. Papers reporting on applications of SOS to software engineering and other areas of computer science are welcome. History: The first SOS Workshop took place on 30th of August 2004 in London as one of the satellite workshops of CONCUR 2004. Over 30 participants attended the workshop. PAPER SUBMISSION: We solicit unpublished papers reporting on original research on the general theme of SOS. Prospective authors are invited to submit their work in two stages: Firstly, the title and abstract of the paper, together with the details of the author(s), should be emailed to sos2005 AT mcs.le.ac.uk by: Friday, 13 May 2005. Secondly, a pdf file with their full paper, whose length normally should not exceed 15 pages, should be sent by email to sos2005 AT mcs.le.ac.uk by: Monday, 23 May 2005. The email message with the full paper should also include, in plain text, contact information for the author(s), the title and abstract of the submission. Authors will be notified of acceptance by Monday, 13 June 2005. Submissions from the PC members are allowed. Proceedings: Preliminary proceedings containing the abstracts of the talks will be published as a Technical Report of the Department of Computer Science of Leicester University, and will be available at the meeting. The final proceedings of the workshop will appear as a volume in the ENTCS series. If the quality and quantity of the papers accepted for the workshop warrant it, submissions will be invited for a special issue of an archival journal devoted to full versions of selected papers. IMPORTANT DATES: * Submission of abstract: Friday, 13 May 2005 * Submission of full paper: Monday, 23 May 2005 * Notification: Monday, 13 June 2005 * Final version: Friday, 24 June 2005 * Workshop: Sunday, 10 July 2005. PROGRAMME COMMITTEE: Luca Aceto (BRICS, Aalborg, DK) Wan Fokkink (Amsterdam, NL) Rob van Glabbeek (NICTA, AU) Matthew Hennessy (Sussex, UK) Ralf Laemmel (CWI, NL) Peter Mosses (Swansea, UK, co-chair) David Sands (Chalmers, SE) Alex Simpson (Edinburgh, UK) Simone Tini (Insubria, I) Irek Ulidowski (Leicester, UK, co-chair) Erik de Vink (Eindhoven, NL) INVITED SPEAKERS: Jan Friso Groote Jose Meseguer CONTACT: sos2005 AT mcs.le.ac.uk WORKSHOP ORGANISERS: Peter D. Mosses Department of Computer Science University of Wales Swansea Singleton Park Swansea, SA2 8PP United Kingdom Irek Ulidowski Department of Computer Science University of Leicester University Road Leicester, LE1 7RH United Kingdom

2 1

haddock
by Christian Maeder 22 Jun '05

22 Jun '05

Hi, haddock generates html-Files named after the module. Since hierarchical modules contain dots, such files are seen to have multiple extensions (regardless of case) by our apache web server. http://httpd.apache.org/docs-2.0/mod/mod_mime.html#multipleext Unfortunately "map" is the extension for our imap handler. Therefore accessing the file Data.Map.html fails: http://www.informatik.uni-bremen.de/agbkb/forschung/formal_methods/CoFI/het… As far as I can see only Data.Map causes the problem, but a clean solution would be to avoid multiple extensions for html-files generated by haddock! Is there a chance that haddock can be changed that way? (Replacing the dot by some other character, maybe "-", in html file names only?) Has only our web server a problem with Data.Map.html? Cheers Christian

1 0

FACS'05: Second Call for Papers
by Luis Barbosa 22 Jun '05

22 Jun '05

[apologies for cross-posting] --------------------------------------------- SECOND CALL FOR PAPERS FACS'05 II International Workshop on Formal Aspects of Component Software Macao October 24-25, 2005 www.iist.unu.edu/facs05/ --------------------------------------------- IMPORTANT DATES: Submission: Jul 15, 2005 Notification: Sep 15, 2005 Final Version: Sep 30, 2005 Workshop: Oct 24-25, 2005 INVITED SPEAKERS: * Farhad Arbab (CWI, LIACS, Leiden University and University of Waterloo) * Paolo Ciancarini (Università di Bologna) * Edmund Clarke (Carnegie Mellon University) AIMS AND SCOPE The objective of FACS'2005 is to bring together researchers in the areas of component software and formal methods to promote a deep understanding of this paradigm and its applications. The Workshop will also be interested in defining the common aspects of components and component-based development. It is expected that formal paper presentations be followed by lively debate in a stimulating atmosphere. Possible topics include, but are not limited to: * formal models for software components and component interaction * design and verification methods for component software * component composition and deployment: models, calculi, languages * component testing * specification of extra-functional properties in component software * certification of components and software architectures * component software vs object orientation * components for real-time, safety-critical, secure and/or embedded systems * experience reports and case studies in component software BACKGROUND: Component-based software emerged as a promising paradigm to deal with the ever increasing need for mastering systems' complexity, their evolution and reuse, and driving software engineering into sound production and engineering standards. Soon, however, it became a popular technology long before consensual definitions and principles, let alone formal foundations, have been put forward. Issues like mathematical models for components, their interaction and composition, or rigourous approaches to verification, deployment, testing and certification remain open research questions and challenging opportunities for formal methods. Moreover, new challenges are raised by applications to non conventional areas, such as safety-critical, mobile, and/or embedded systems. FACS'05 is the second in a series of workshops, founded by the International Institute for Software Technology of the United Nations University. The first FACS workshop was held in Pisa, Italy, in September 2003, collocated with FM'03. ORGANIZATION: UNU-IIST (Macao) PROGRAM COMMITTEE: Farhad Arbab (CWI, The Netherlands) Luis Barbosa (PC Chair, Universidade do Minho, Portugal) Marcello Bonsangue (LIACS-Leiden University, The Netherlands) Christiano Braga (Universidade Federal Fluminense, Brazil) Manfred Broy (Technical University of Munich, Germany) Calos Canal (Universidad de Malaga, Spain) João Faria (Universidade do Porto, Portugal) Jose Fiadeiro (University of Leicester, United Kingdom) Susanne Graf (VERIMAG, France) Mathai Joseph (Tata Consultancy Services Limited, India) Atsushi Igarashi (Kyoto University, Japan) Kung-Kiu Lau (The University of Manchester, United Kingdom) Zhiming Liu (PC Chair, UNU-IIST, Macao) Antónia Lopes (University of Lisbon, Portugal) Markus Lumpe (Iowa State University, USA) Tom Maibaum (McMaster University, Canada) Sun Meng (National University of Singapore, Singapore) Ugo Montanari (University of Pisa, Italy) David Naumann (Stevens Institute of Technology, USA) Anders Ravn (Aalborg University, Denmark) Bernhard Schätz (Technical University of Munich, Germany) Carolyn Talcott (SRI International, USA) ORGANISING COMMITTEE: He Jifeng, UNU-IIST, Macao (OC chair) Antonio Cerone, UNU-IIST, Macao Bernhard Aichernig, UNU-IIST, Macao Chan Iok Sam , UNU-IIST, Macao Xiaoshan Li, Univ. Macao RELATED EVENTS: ICTAC'05 will be held in Hanoi, Vietnam, the week before. SUBMISSION AND PUBLICATION: Submissions to the workshop will be judged on the basis of originality, relevance, technical soundness and presentation quality. Papers should be written in English and not exceed 15 pages in ENTCS format. Publication of the workshop proceedings in Electronic Notes in Theoretical Computer Science, Elsevier, is anticipated.

1 0

A MonadPlusT with fair operations and pruning
by oleg＠pobox.com 22 Jun '05

22 Jun '05

On Wed Jan 5 20:17:37 EST 2005, Andrew Bromage wrote on the Haskell-Cafe mailing list: > BTW, if someone would like an "interesting" monad to play with, here is > one that I've been playing with for a while. It's a nondeterminism > monad transformer with negation-as-failure and if-then-else with soft > cut. The appropriate contexts/continuations for an efficient > implementation (using the Hughes/Hinze technique) turn out to be quite > difficult to find. > > The operations that we need to implement are: > > - the Monad operations (return and bind), > - the MonadTrans operation (lift), > - the MonadPlus ones (mzero and mplus), and > - one other operation, which plays the role of logical if-then-else. We have implemented all the above operations, plus "don't care non-determinism" (aka `once') plus fair conjunctions and disjunctions, plus bagOfN. We have two implementations of the enhanced MonadPlus Transformer: one is based on genuine continuations. The other, direct-style realization, relies on the first-class delimited continuation transformer library by Sabry, Dybvig, and Peyton-Jones. The continuation-passing implementation uses two (rather than three) continuations: success, failure -- but no cut continuation. Still, control logical operations are supported. The continuation-passing implementation was indeed difficult to find, although the result is deceptively simple. The code is freely available under the MIT license: http://pobox.com/~oleg/ftp/packages/LogicT.tar.gz Our joint work (with Amr Sabry, Chung-chieh Shan and Daniel P. Friedman) is described in the paper to be presented at ICFP'05: http://pobox.com/~oleg/ftp/papers/LogicT.pdf Since Andrew Bromage wished for that interesting monad, perhaps he has in mind a good example of its use. We are particularly interested in a short example illustrating soft-cut (and, perhaps, `once'). To be sure, the paper has several examples. Since we have a couple of pages left, we would like to describe something more extensive. Alas, all examples we have in mind are either too simple or take too much space to describe. Comments and suggestions are very appreciated.

2 1

OS requirements for "Haskell version of Crystal Space 3D?"
by Benjamin L. Russell 22 Jun '05

22 Jun '05

My apologies, but I forgot to mention my OS requirements for the potential Haskell version of Crystal Space 3D that I'm looking for in my previous post: * Mac OS X 10.2.8 Jaguar (or higher if necessary--I can upgrade) Also, I forgot to mention the URL for the example of PlaneShift (the fantasy MMORPG written using Crystal Space 3D) in my previous inquiry. It is as follows: * http://www.planeshift.it/main_01.html It even runs on Mac OS X 10.2.8, too. If anybody knows of any Haskell tools/libraries useful for writing something similar to PlaneShift using a Haskell version of something similar to Crystal Space 3D on Mac OS X 10.2.8 or higher, I'd greatly appreciate any information. Thanks again, Benjamin L. Russell

1 0

Re: [Haskell] Bignums in Haskell
by robert dockins 21 Jun '05

21 Jun '05

> Thank you for the prompt response. Do you have any insight as to why > the GMP library is used instead of another library for arbitrary > precision? Also, I understand that Haskell does not specify an > implementation for bignums, but why would the developers of GHC not > implement bignums directly instead of using an outside library? Unfortunately, I don't have the answers to those questions; I'm not really a GHC hacker. I would speculate however that the reasons are largely practical in nature: GMP already exists, is pretty dang fast, and is fairly portable. Robert Dockins

3 2

Haskell XML RPC
by Johannes Waldmann 21 Jun '05

21 Jun '05

Dear all, I am looking at the Haskell XML RPC library http://www.haskell.org/haxr/ First of all, this is a very nice thing to have, and installation is really easy, using Cabal and the packaged source archives. Some questions though: *) Of course I want to dervie XmlRpcType instances automatically. The examples suggest $(asXmlRpcStruct (reifyDecl Person)) but I cannot get this to compile (with ghc-6.4). It seems reifyDecl is gone, and reify has different type. I worked out this: helper name = asXmlRpcStruct ( ( reify name ) >>= ( \ (TyConI dec) -> return dec )) $(helper ''Person) Does xmlrpc.cabal should contain a build-dependency on template-haskell? (Otherwise I get linker errors.) *) what is the recommended representation that should be created for data T = A { .. } | B { .. } | ... i. e. discriminated unions? Certainly some solution can be coded, but ... *) what about the "Java side of things" - perhaps I want (need) to interface to a Java Client. If it's Haskell-to-Haskell, then both server and client of course can derive their XmlRpcType instances from identical data declaraions and everything is fine. For intergration with a different language, what do you recommend: Start from a Haskell data declaration, and derive a Java representation, directly or indirectly? Or start from some language independent data declaration, as it happens (I assume) for JAXB? Best regards, -- -- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 -- ---- http://www.imn.htwk-leipzig.de/~waldmann/ -------

2 1

Re: [Haskell] translation of "kind"
by Wolfgang Jeltsch 21 Jun '05

21 Jun '05

Am Montag, 20. Juni 2005 11:46 schrieben Sie: > Wolfgang Jeltsch wrote: > > can anybody tell me what the German translation of the word "kind" as > > used in type theory and especially in Haskell is? > > Even Peter Thiemann in "Grundlagen der funktionalen Programmierung" > (1994) did not translate "Kind", This is very bad IMO because of the existence of the German word "Kind" which you also mention below which means child. > although he used "geschönfinkelt" for "curry" (honoring logicians > Schönfinkel and Curry) This is crazy! Someone who doesn't know Schönfinkel (as I did so far) may think that "schönfinkeln" (which would be the infinitive) is a combination of "schön" (nice) and a previously unknown word "finkeln" which is extremely similar to... Hmm, Germans will know which word I think of. :-) :-) > I'ld prefer "der Kind" (and avoid situtations that allowed confusion > with "das Kind") > > Cheers Christian Best wishes, Wolfgang

4 4