- Haskell - Haskell.org

Monadic pretty-printing
by Tomasz Zielonka 25 Sep '04

25 Sep '04

Hello! In my master's thesis I am dealing with a complicated case of pretty printing / unparsing. There are side effects, context dependency, unparsing to two different languages (two SQL dialects). To manage this complexity, I use a couple of ,,design patterns''. One of them is about giving a monadic interface to pretty printing library, to allow mixing it easily with various effects (IO, Reader, Cont). After some fiddling with a hand written pretty-printing monad, I realized that I can just use a Writer monad. HughesPJ.Doc can be trivially made an instance of Monoid - AFAIK all the needed laws hold. The only problem is to decide which one of document composition operators should be used as mappend. In my case I want <+> by default, but I arranged things so that I can have several different versions of Doc (newtyped). As I needed many other pretty-printing combinators beside <+>/mappend, I created a library of monadic pretty-printing combinators for separating (eg. with commas), vertical composition, nesting, putting in parentheses, <> composition, etc. In some cases it was necessary to use MonadWriter's "censor" method, but nothing more. I think it is quite elegant. The code written using this technique is also quite clear. Perhaps it would be worse, if it wasn't possible to choose a composition operator for Monoid doing the proper thing in 90% of cases. Below is a fragment of code that handles expression unparsing. unparse (Expr_BinaryOp op e1 e2) = parens $ do unparse e1 unparse op unparse e2 unparse (Expr_UnaryOp UnaryOp_Not (Expr_IsNull e)) = parens $ do unparse e kw IS kw NOT kw NULL unparse (Expr_UnaryOp op e) = parens $ do unparse op unparse e unparse (Expr_Constant cons) = do unparse cons unparse (Expr_In e inSpec) = parens $ do unparse e kw IN oneline (unparse inSpec) unparse (Expr_Between e1 e2 e3) = parens $ do unparse e1 kw BETWEEN unparse e2 kw AND unparse e3 unparse (Expr_Cast e datatype) = do kw CAST `catThen` parens (do unparse e kw AS unparse datatype) unparse (Expr_IsNull e) = parens $ do unparse e kw IS kw NULL ... As you can see, sometimes there is a need to use a different composition operator (catThen). I think that this technique, simple as it is, can be very useful for more complicated programs, especially if pretty-printing has to be interleaved with some computational effects. It also helps to achieve good modularity, by "dispatching on the monad type", which helps me to handle two different dialects of SQL with quite good code reuse. But getting to the point... I wonder if such a pattern was used or proposed before. I tried to find some mention of it, but with no luck (or luck :). Most examples of Writer monad use are about logging, etc. If there are no protests, I am going to claim I was the first to use such a technique. It may help me to rescue my poor master's thesis ;) Best regards, Tom -- .signature: Too many levels of symbolic links

1 0

The 29th Penn Linguistics Colloquium: Call for Papers
by Sandhya Sundaresan 25 Sep '04

25 Sep '04

The 29th Penn Linguistics Colloquium: Call for Papers The 29th Annual Penn Linguistics Colloquium will take place FEBRUARY 25-27, 2005 at the University of Pennsylvania campus in Philadelphia. INVITED SPEAKER: Mark Baker (Rutgers University): Gerund constructions within a universal theory of categories. *************************************************************************** WORKSHOP (New!): Anthony Kroch et al. (University of Pennsylvania): Syntactically annotated corpora: What, Why and How? *************************************************************************** SUBMISSIONS: Papers on any topic in linguistics and associated fields are welcome. Speakers will have 20 minutes for their presentations and 5 minutes for discussion and questions. Please limit abstracts to one page, single- or double-spaced, in 11-pt. font. An additional page may be used for references and tables. Do not include your name or affiliation within the abstract. To facilitate the review process, please submit your abstract as a .pdf file. If you cannot create .pdf files, you may submit a .doc, .rtf, or .txt file, and we will convert it for you. However, since phonetic fonts are not likely to output correctly, we ask that you set up a legend using standard ASCII characters. An online abstract submission form will soon be available at the PLC website, http://www.ling.upenn.edu/Events/PLC/ IMPORTANT DATES: Abstract submissions due: November 8, 2004. Notification of acceptance/rejection: January 17, 2005. PROCEEDINGS: Conference proceedings will be published as a volume of the Penn Working Papers in Linguistics. Speakers will be invited to provide camera-ready copies of their papers after the Colloquium. FOR MORE INFORMATION: Email plc29(a)ling.upenn.edu Visit http://www.ling.upenn.edu/Events/PLC/ Penn Linguistics Colloquium Department of Linguistics 619 Williams Hall University of Pennsylvania Philadelphia, PA 19104-6305 This event is supported by funding from GSAC, the Graduate Student Association Council of the University of Pennsylvania. Best, the PLC 29 Committee

1 0

RTA'05: 2nd Call for Papers
by Ralf Treinen 24 Sep '04

24 Sep '04

****************************** * * * RTA'05 CALL FOR PAPERS * * * ****************************** http://www-i2.informatik.rwth-aachen.de/RTA05/ April 19--21, 2005 Nara, Japan The 16th Int. Conf. on Rewriting Techniques and Applications (RTA'05) will collocate with the 7th International Conference on Typed Lambda Calculi and Applications (TLCA'05) as part of the Federated Conference on Rewriting, Deduction and Programming (RDP'05). IMPORTANT DATES: Nov 12, 2004: Deadline for electronic submission of title and abstract Nov 19, 2004: Deadline for electronic submission of papers Jan 14, 2005: Notification of acceptance of papers Feb 4, 2005: Deadline for final versions of accepted papers Apr 19-21, 2005: Conference The deadlines are strict. RTA is the major forum for the presentation of research on all aspects of rewriting. Typical areas of interest include (but are not limited to): * APPLICATIONS: case studies; rule-based (functional and logic) programming; symbolic and algebraic computation; theorem proving; system synthesis and verification; proof checking. * FOUNDATIONS: matching and unification; narrowing; completion techniques; strategies; constraint solving; explicit substitutions; tree automata. * FRAMEWORKS: string, term, and graph rewriting; lambda-calculus and higher-order rewriting; proof nets; constrained rewriting/deduction; categorical and infinitary rewriting. * IMPLEMENTATION: compilation techniques; parallel execution; rewriting tools. * SEMANTICS: equational logic; rewriting logic. INVITED TALKS will be given at RTA'05 by: * Amy Felty (Ottawa) * Yoshihito Toyama (Sendai) * Philip Wadler (Edinburgh) BEST PAPER AWARDS AND TRAVEL GRANTS: An award of 100,000 Yen will be given to the best paper or papers as decided by the PC. A limited number of student travel grants is available. Preference will be given to students whose papers are accepted at RTA and who do not have alternative funding. Students applying for travel support should indicate this by sending an e-mail to the PC chair (giesl(a)informatik.rwth-aachen.de) together with their submission. RTA'04 PROGRAM COMMITTEE: * Franz Baader (Dresden) * Mariangiola Dezani (Torino) * Juergen Giesl (Aachen, Chair) * Bernhard Gramlich (Vienna) * Florent Jacquemard (Cachan) * Claude Kirchner (Nancy) * Pierre Lescanne (Lyon) * Aart Middeldorp (Innsbruck) * Hitoshi Ohsaki (Amagasaki) * Vincent van Oostrom (Utrecht) * Christine Paulin-Mohring (Orsay) * Frank Pfenning (Pittsburgh) * Femke van Raamsdonk (Amsterdam) * Mark-Oliver Stehr (Urbana) * Rakesh Verma (Houston) * Andrei Voronkov (Manchester) RTA'05 SUBMISSIONS: Submissions must be original and not submitted for publication elsewhere. Submission categories include regular research papers and system descriptions. Also problem sets and submissions describing interesting applications of rewriting techniques will be very welcome. The page limit is 15 pages (10 pages for system descriptions). As usual, accepted papers will appear in the Springer-Verlag Lecture Notes in Computer Science series. More information about paper submission is available at the RTA'05 web page. http://www-i2.informatik.rwth-aachen.de/RTA05/ LOCATION, TRAVEL, ACCOMMODATION, AND REGISTRATION The conference takes place in Nara park, which is one of the most important cultural sights of Japan with some of the oldest and most impressive temples and shrines. Airfares from Europe or the US to Japan are not expensive in mid-April and the conference will offer reasonably priced accommodation and low registration fees. RTA'05 PROGRAM CHAIR: Juergen Giesl LuFG Informatik II RWTH Aachen Ahornstr. 55 52074 Aachen Germany giesl(a)informatik.rwth-aachen.de RTA'05 CONFERENCE CHAIR: Hitoshi Ohsaki AIST Japan ohsaki(a)ni.aist.go.jp

1 0

Call for AAMAS 2005 Conference Tutorial Proposals
by Matthias Klusch 23 Sep '04

23 Sep '04

++ Apologies for multiple copies due to cross-posting ++ ----------------------------------------------------- CALL FOR TUTORIAL PROPOSALS Fourth International Joint Conference on AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS (AAMAS 2005) ----------------------------------------------------- Utrecht University, Utrecht (The Netherlands) July 25-29, 2005 http://www.aamas2005.nl/ INTRODUCTION ************ The AAMAS-2005 Organising Committee invites proposals for the Tutorial Program, to be held immediately before to the technical conference (July, 25-26). Tutorials should serve one or more of the following objectives: * Introduce novices to major topics of AAMAS research. * Provide instruction in established practices and methodologies. * Survey a mature area of AAMAS research and/or practice. * Motivate and explain an AAMAS topic of emerging importance. * Introduce expert non-specialists to an AAMAS subarea. * Survey an area of agent research especially relevant for people from industry REQUIREMENTS FOR SUBMISSIONS **************************** Proposals should be from two to four pages in length, and should contain the following information: * A brief description of the tutorial, suitable for inclusion in the conference registration brochure. * A detailed outline of the tutorial, including preferred length (1/2 or 1 day). * Characterization of the potential target audience for the tutorial, including prerequisite knowledge. * A description of why the tutorial topic would be of interest to a substantial part of the AAMAS audience. * A brief resume of the presenter(s), which should include name, postal address, phone and fax numbers, e-mail address, background in the tutorial area, any available example of work in the area (ideally, a published tutorial-level article on the subject), evidence of teaching experience (including references that address the proposer's presentation ability), and evidence of scholarship in the area. * The name and E-mail address of the corresponding presenter. The corresponding presenter should be available for E-mail correspondence during the evaluation process, in the case clarifications and discussions on the scope and content of the proposal are needed. The evaluation of the proposal will take into account its general interest for AAMAS attendees (e.g., a tutorial on object-oriented inheritance will be hardly accepted), the quality of the proposal (e.g., a tutorial that simply lists a set of concepts without any apparent rationale behind them will be judged badly) as well as the expertise and efficacy of the presenters. We emphasize that the primary criteria for evaluation will be whether a proposal is interesting, well-structured, and motivated, rather than the perceived experience/standing of the proposer. Those submitting a proposal should keep in mind that tutorials are intended to provide an overview of the field; they should present reasonably well established information in a balanced way. Tutorials should not be used to advocate a single avenue of research, nor should they promote a product. All proposals should be submitted by electronic mail to the Tutorial Chair, Onn Shehory (onn(a)il.ibm.com) in plain ASCII text, no later than ** December 20, 2004 **. The committee's decision will be notified no later than ** January 10, 2005**. The selection of the tutorials to be included in the final AAMAS program will be based upon a number of factors, including: the scientific/technical interest of the topics, the quality of the proposal, the need to avoid strictly overlapping tutorials, and the unavoidable need to limit the overall number of selected tutorials. RESPONSIBILITIES OF AAMAS AND OF TUTORIAL ORGANIZERS **************************************************** For all accepted proposals, AAMAS will be responsible for: * Providing logistic support and a meeting place for the tutorial. * Together with the organizers, determining the tutorial date and time. * Duplicating tutorial material and distributing them to the participants. Tutorial organizers will be responsible for the following: * Providing AAMAS with a legible PDF copy of their tutorial notes in due time. * Presenting the tutorial at AAMAS-05 AAMAS reserves the right to cancel any tutorial if the above responsibilities are not fulfilled, if deadlines are missed or if too few attendees register for the tutorial to support the costs of running the tutorial. IMPORTANT DATES *************** December 20, 2004 Proposal Submission Deadline January 10, 2005 Acceptance Notification April 10, 2005 Deadline for submitting tutorial materials July 25 - 26, 2005 AAMAS-05 Tutorials Proposals and inquiries should be sent by email (in ASCII) to the tutorials chair: Onn Shehory onn(a)il.ibm.com ------------------------------------------------------------------------------

1 0

Announce: Pesco.Cmdline v1.0
by Sven Moritz Hallberg 23 Sep '04

23 Sep '04

Hi all, let me announce the availability of: Pesco.Cmdline - a command line parser /= GNU getopt This is a useful one-file module that I wrote over the course of one week last month. It has some nifty features. I think it's more convenient for every-day use than System.GetOpt. The module and associated documentation is available from (many thanks to Shae Erisson for the webspace): http://www.scannedinavian.org/~pesco/ The v1.0 distribution tarball is under the link named [dist]. See the nearby [man] link for reference documentation. Nota bene: The module is a literate program (using the wonderful lhs2TeX - thanks to Andres Loeh for his help) and comes with a complete set of manpages (Yes, real Unix manpages! You haven't seen that for a Haskell module, have you?). See the [doc] link for a PDF rendition of the module itself, [man] for the hypertext manpages, and [ref] for the manpages in PDF (formatted for printing as an A5 booklet - Try it, it's fun!). Obviously, any feedback is greatly appreciated. Viel Spasz am Geraet, Sven Moritz "pesco" Hallberg. PS: As far as I know, my website is not displayed in MSIE. I consider that a feature, not a bug. ;)

1 0

CfP: 2nd International Conference on Security in Pervasive Computing, SPC2005
by Dieter Hutter 23 Sep '04

23 Sep '04

Call for Papers --------------- 2nd International Conference on Security in Pervasive Computing, SPC2005 April 6-8, 2005 Boppard, Germany http://www.spc-conf.org Deadline: October 15, 2004 The ongoing shrinking of computing facilities to small and mobile devices like handhelds, portables or even wearable computers will enhance an ubiquitous information processing. The basic paradigm of such a pervasive computing is the combination of strongly decentralized and distributed computing with the help of diversified devices allowing for spontaneous connectivity. Computers will become invisible to the users awareness and exchange of information between devices will effectively defy users control. The objective of this conference is to develop new security concepts for complex application scenarios based on systems like handhelds, phones, smartcards, RF-chips and smart labels hand in hand with the emerging technology of ubiquitous and pervasive computing. Particular topics include but are not limited to methods and technologies concerning: · the identification of risks, · the definition of security policies, and · the development of security and privacy measures especially cryptographic protocols related to the specific aspects of ubiquitous and pervasive computing like mobility, location based services, ad-hoc networking, resource allocation/restriction, invisibility and secure hardware/software platforms. Important Dates: Submission of papers: October 15, 2004 Notification: December 15, 2004 Camera ready copy: January 15, 2005 Conference: April, 6 - 8, 2005 Submissions: We welcome the submission of papers from the full spectrum of issues associated with security in pervasive computing. Submitted papers must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with proceedings. The accepted papers will be published in the Springer Lecture Notes Series on Computer Science (LNCS). Papers should be at most 15 pages total (Springer LNCS style). The paper should start with the title, names of authors and an abstract. All papers must be submitted electronically. Details will be published on the web page of the conference http://www.spc-conf.org Location: The conference will be held at an old former monastery in Boppard, Germany. Boppard is a nice small town located in the rhine valley about one hour away from Frankfurt airport. Organisation: The conference will be organised jointly by - Federal Office for Information Security (BSI) - German Research Center for Artificial Intelligence (DFKI) Program Committee: N. Asokan (Nokia Research), FI Michael Beigl (University of Karlsruhe), DE Sonja Buchegger (EPFL), CH Dieter Hutter (DFKI) (co program chair), DE Ari Juels (RSA Laboratories), US Paul Karger (IBM Watson Research), US Dennis Kügler (BSI), DE Catherine Meadows (Naval Research Lab), US Takashi Moriyasu (Hitachi Ltd), JP Günter Müller (University of Freiburg), DE Panos Papadimitratos (Cornell University), US Joachim Posegga (University of Hamburg), DE Yves Roudier (Institute EURECOM), FR Frank Stajano (University of Cambridge), GB Andrei Serjantov (The Free Haven Project), GB Werner Stephan (DFKI), DE Seiji Tomita (NTT Information Platform Laboratories), JP Markus Ullmann (BSI) (co program chair), DE

1 0

Call for AAMAS 2005 Conference Workshop Proposals
by Matthias Klusch 22 Sep '04

22 Sep '04

++ Apologies for multiple copies due to cross-posting ++ ----------------------------------------------------- CALL FOR WORKSHOP PROPOSALS Fourth International Joint Conference on AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS (AAMAS 2005) ----------------------------------------------------- Utrecht University, Utrecht (The Netherlands) July 25-29, 2005 http://www.aamas2005.nl/ INTRODUCTION ************ The AAMAS-2005 Organising Committee invites proposals for the Workshop Program, to be held immediately before to the technical conferente (July, 25-26). The main goal of the AAMAS-2005 workshops is to stimulate and facilitate an active exchange, interaction and comparison of approaches, methods, and ideas about specific (both theoretical and applicative) topics on the Agents and Multi-Agent Systems domain. Workshops should be organized so that an informal and participated discussion among attendees is guaranteed. Members from all areas of the AAMAS community are invited to submit workshop proposals for review. Workshops on new emerging topics or specific relevant aspects of consolidated ones are particularly encouraged. Workshops can vary in length, but most will last a full day. Workshop organizers and attendees must register for their workshop and possibly for the main AAMAS conference. REQUIREMENTS FOR SUBMISSIONS **************************** Proposals for workshops should be from two to four pages in length, and should contain the following information: * A brief technical description of the workshop, specifying the workshop goals and the technical issues that will be its focus. * A brief discussion of why and to whom the workshop is of interest. * A list of related workshops held within the last two years, if any, and their relation to the proposed workshop. * If applicable, detailed information about previous editions of the same workshop (e.g., number of submissions, number of attendees). * A preliminary call for participation/papers. * The names, postal addresses, phone numbers, and email addresses of the proposed workshop organizing committee. This committee should consist of three or four people knowledgeable about the technical issues to be addressed. These people cannot all work at the same institution. * The name of the primary contact for the organizing committee; an email address of this person should be given. * A description of the qualifications of the individual committee members with respect to organizing scientific events, including a list of workshops previously arranged by any members of the proposed organizing committee, if any. All proposals should be submitted by electronic mail to the Workshop Chair, Rino Falcone (r.falcone(a)istc.cnr.it) in plain ASCII text, no later than ** December 20, 2004 **. The committee's decision will be notified no later than ** January 10, 2005**. The selection of the workshops to be included in the final AAMAS program will be based upon a number of factors, including: the scientific/technical interest of the topics, the quality of the proposal, the need to avoid strictly overlapping workshops, and the unavoidable need to limit the overall number of selected workshops. RESPONSIBILITIES OF AAMAS AND OF WORKSHOP ORGANIZERS **************************************************** For all accepted proposals, AAMAS will be responsible for: * Providing logistic support and a meeting place for the workshop. * Together with the organizers, determining the workshop date and time. * Duplicating working notes and distributing them to the participants. Workshop organizers will be responsible for the following: * Setting up a Web site for the workshop according to the template that will be distributed upon acceptance. * Advertising the workshop and issuing a call for participation/papers. * Collecting submissions, notifying acceptances in due time, and ensuring a transparent and fair selection process. All workshop organizers commit themselves to adopt the same deadlines for submissions and notifications of acceptance, i.e., - March 14, 2005 submission of contributions to workshops - April 18 2005, notifications * Making the PDF of the whole workshop notes available to the workshop chair in due time (approx. 7 weeks before the conference). * Ensuring that the workshop organizers and the participants get registered to the workshop and are invited to register to the main conference. AAMAS reserves the right to cancel any workshop if the above responsibilities are not fulfilled or if too few attendees register for the workshop. AAMAS encourages the production of publications based on the workshop, and leave this upon the workshop organizers. IMPORTANT DATES for Workshops ***************************** December 20, 2004 Proposal Submission Deadline January 10, 2005 Acceptance Notification March 14, 2005 Deadline for submitting of contributions to workshops April 18, 2005 Acceptance Notifications of contributions to workshops July 25 - 26, 2005 AAMAS-05 Workshops Please send proposals (in ASCII) and inquiries via email to: Rino Falcone r.falcone(a)istc.cnr.it ------------------------------------------------------------------------------

1 0

optimisation of State monad
by Georg Martius 21 Sep '04

21 Sep '04

Hi folks, I have two questions to tail recursion, optimisation(ghc) and the State monad. Sorry about bothering you with efficiency issues, but they become crusual to me since my programm needs more memory than I have :-( I compiled the following small examples with ghc -O6 -Wall -prof -auto-all -o test Test.hs (ghc 6.2.1) and ran them with ./test +RTS -K64M -sstderr > data Foo = Foo { foo :: !Integer , bar :: Double > } deriving Show > type Transformation a = a -> a > > addX :: Integer -> Transformation Foo > addX x f = f { foo = (foo f) + x } >t1 :: Integer -> Transformation Foo > t1 x = (addX x . addX (-x)) >iterR :: [Integer] -> Transformation Foo > iterR list f = foldr t1 f list > iterL :: [Integer] -> Transformation Foo > iterL list f = foldl (\ f' i -> t1 i f') f listiterR (take 100000 (repeat 1)) (Foo 0 0.0) 16,151,796 bytes copied during GC 11,546,120 bytes maximum residency (5 sample(s)) Productivity 20.3% of total user, 19.7% of total elapsed > iterL (take 100000 (repeat 1)) (Foo 0 0.0) 3,020 bytes copied during GC 25,904 bytes maximum residency (1 sample(s)) Productivity 100.0% of total user, 80.0% of total elapsed Okay, foldl is tail recursive and foldr not. Fine! Now one weird thing: If I define t1 as: > t1' :: Integer -> Transformation Foo > t1' x f = let newfoo = foldr addX f (take 10 $ repeat x) > in newfoo {foo = foo f - foo newfoo} > iterR (take 100000 (repeat 1)) (Foo 0 0.0) 22,476 bytes copied during GC 2,113,876 bytes maximum residency (3 sample(s)) Productivity 60.0% of total user, 59.0% of total elapsed Why is the compiler able to optimise the call of t1' and not the one of t1? My second question belongs to the State monad: > withFoo :: Foo -> State Foo (a) -> Foo > withFoo state monad = execState monad state >addXM :: Integer -> State Foo () > addXM x = modify (\ f -> f { foo = (foo f) + x }) >iterM :: [Integer] -> State Foo () > iterM list = sequence_ $ map t1M list >t1M :: Integer -> State Foo () > t1M x = do addXM x > addXM (-x) > withFoo (Foo 0 0.0) $ do iterM (take 100000 (repeat 1)) 48,989,348 bytes copied during GC 14,037,156 bytes maximum residency (7 sample(s)) Productivity 15.5% of total user, 14.7% of total elapsed and if I define t1M as: t1M' :: Integer -> State Foo () t1M' x = do old <- get sequence_ $ map addXM (take 10 $ repeat x) modify (\ f -> f {foo = foo f - foo old}) then the memory consumption is awfully high: > withFoo (Foo 0 0.0) $ do iterM (take 100000 (repeat 1)) 172,468,996 bytes copied during GC 48,522,520 bytes maximum residency (10 sample(s)) Productivity 2.6% of total user, 2.5% of total elapsed Is there a way to optimise the State monad version? Any help would be appreciated. Georg

1 0

Re: Help with installing greencard-3.01
by Ryo Furue 21 Sep '04

21 Sep '04

Hello all, If you have already received this, I appologize. I had sent it to haskell(a)haskell.org before I subscribed to this mailing list. Then I got an automatic reply, saying my posting was waiting for the moderator's approval since it was posted from a non-subscribed address. Immediatedly after receiving this automatic reply did I subscribed, but I still don't see my posting. So I assume that the moderator is on vacation :-) and post this again. Cheers, Ryo ============================== Hello all, I'm new to this mailing list and not quite sure if this is an appropriate place to ask this. If not, I'd appreciate it if you could direct me to a more suitable place. I compiled from source and installed GHC 6.2.1 on my Debian GNU/Linux box. That went flawlessly. Now I'm trying to install greencard-3.01. The installation phase goes wrong: >>>> begin quote >>>>>>>>>>>>>>>>>>>>>> make[1]: Entering directory `/home/amakihi/furue/tmp/greencard-3.01/lib' cpp -x c -DINSTALLING -DLIBDIR=\"/usr/local/lib/greencard-3.01\" -DPACKAGE=\"greencard\" -DPACKAGE_DEPS=' "base"' -DLIBRARY=\"HSgreencard\" package.conf.in \ | sed -e 's/^#.*$//g' -e 's/""//g' -e 's/, ]/ ]/g' \ | ghc-pkg --force --update-package Reading package info from stdin... Fail: Couldn't parse package configuration. make[1]: *** [install-pkg] Error 1 <<<<< end quote <<<<<<<<<< Could someone know what is wrong? I grabbed the result of the "cpp ... | sed ... " pipe and separately fed ghc-pkg with it, and I got the same error. I'm attaching the result of the pipe at the end of this message. Also, I found that GHC_OPTS = -cpp -fglasgow-exts -fno-prune-tydecls in greencard-3.01/lib/Makefile causes error with ghc 6.2.1, which says '-fno-prune-tydecls' is an invalid argument. I removed this option and the compilation of greencard went well. But, is this really OK? Thank you, Ryo ====================== [Result of the "cpp ... | sed ... " pipe] Package { name = "greencard" , auto = True, import_dirs = [ "/usr/local/lib/greencard-3.01" "/imports" ], source_dirs = [], library_dirs = [ "/usr/local/lib/greencard-3.01" ], hs_libraries = [ "HSgreencard" ], extra_libraries = [], include_dirs = [], c_includes = [], package_deps = [ "base" ], extra_ghc_opts = [], extra_cc_opts = [], extra_ld_opts = [] }

1 0

[PAPP 2005] First Call for Papers
by Frederic Loulergue 20 Sep '04

20 Sep '04

PAPP 2005 - Second International Workshop on Practical Aspects of High-level Parallel Programming http://papp2005.free.fr part of The International Conference on Computational Science May 22-25, 2005, Atlanta, USA AIMS AND SCOPE Computational Science applications are more and more complex to develop and require more and more computing power. Parallel and grid computing are solutions to the increasing need for computing power. High level languages offer a high degree of abstraction which ease the development of complex systems. Being based on formal semantics, it is even possible to certify the correctness of critical parts of the applications. Algorithmic skeletons, parallel extensions of functional languages, such as Haskell and ML, or parallel logic and constraint programming, parallel execution of declarative programs such SQL queries, etc. have produced methods and tools that improve the price/performance ratio of parallel software, and broaden the range of target applications. The PAPP workshop focuses on practical aspects of high-level parallel programming: design, implementation and optimization of high-level programming languages and tools (performance predictors working on high-level parallel/grid source code, visualisations of abstract behaviour, automatic hotspot detectors, high-level GRID resource managers, compilers, automatic generators, etc.), applications in all fields of computational science, benchmarks and experiments. Research on high-level grid programming is particularly relevant. 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: * high-level models (CGM, BSP, MPM, LogP, etc.) and tools for parallel and grid computing * high-level parallel languages design, implementation and optimisation * 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 * applications in all fields of high-performance computing (using high-level tools) * benchmarks, 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 two referees. The accepted papers will be published in the Springer-Verlag LNCS series, as part of the ICCS proceedings. Papers (PDF file) should be sent together with a short abstract in plain text to loulergue at univ-paris12.fr with subject "[PAPP2005 Workshop] Submission" no later than 7 november 2004. We invite you to submit a full paper of 8 pages (A4), describing new and original results. The submitted paper must be formatted according to the rule of Lecture Notes in Computer Science (LNCS). Submission implies the willingness of at least one of the authors to register and present the paper. An early email with your intention to submit a paper would be greatly appreciated (especially if you have doubts about the relevance of your paper). Accepted papers should be presented at the workshop and extended and revised versions will be published in a special issue of an international journal, provided revisions suggested by the referees are made (more details at http://papp2005.free.fr) IMPORTANT DATES 7 November 2004 Full paper due 22 December 2004 Referee reports and unofficial notification January 2005 Notification Februray 2005 Camera-ready paper due May 2005 Journal version due June 2005 Referee reports July-October 2005 Revision of papers, final notification November 2005 Final paper due PROGRAMME COMMITTEE Marco Aldinucci (CNR/Univ. of Pisa, Italy) Rob Bisseling (Univ. of Utrecht, The Netherlands) Frank Dehne (Griffith Univ., Australia) Alexandros Gerbessiotis (NJIT, USA) Stephen Gilmore (Univ. of Edinburgh, UK) Clemens Grelck (Univ. of Luebeck, Germany) Sergei Gorlatch (Univ. of Muenster, Germany) Isabelle Guérin-Lassous (INRIA, France) Zhenjiang Hu (Univ. of Tokyo, Japan) Frederic Loulergue (Univ. Paris Val de Marne, France) Fethi A. Rabhi (Univ. of New South Wales, Australia) Casiano Rodríguez León (Univ. La Laguna, Spain) CHAIR AND ORGANIZER Dr. Frederic LOULERGUE Laboratory of Algorithms, Complexity and Logic (LACL) University of Paris Val de Marne 61, avenue du General de Gaulle F-94010 CRETEIL - FRANCE

1 0