June 2004 - Haskell - Haskell.org

Initialisation without unsafePerformIO
by George Russell 07 Jun '04

07 Jun '04

What ideas do people have for getting rid of unsafePerformIO? The most common use of unsafePerformIO, for me at least, is initialisation. There *surely* must be a better way of doing this, but I haven't really seen much discussion of the topic. Here is my back-of-the-envelope suggestion for a new interface, can anyone do better? > type Dict > -- a collection of initialised data. > > register :: Typeable a => Dict -> a -> IO () > -- register a value of type (a) in the dictionary. Only one value of each > -- type is allowed in the dictionary; registering the same type twice will > -- cause an exception. > > defaultDict :: IO Dict > -- Each Haskell "main" program will have one of these. > > lookup :: Typeable a => Dict -> IO a > -- Get the value of (a) registered in the Dict, or raise an exception if it > -- isn't. Thus, libraries which rely on internal initialised state will also have to provide a function which initialises that state. I don't think this is very painful. IME it's often required anyway, if you want to provide the library with additional parameters. Also the library could catch the exception from (lookup) and give a helpful error message of the form "You forgot to run Gadgets.initialise". We can also provide additional dictionaries. > thisThreadDict :: IO Dict > > newEmptyDict :: IO Dict > > runWithDifferentDefaultDict :: Dict -> IO a -> IO a This would allow the programmer much more control over initialisation. For example, programs distributed over a large number of processors are no longer obliged to use a single global dictionary, which is effectively what is required now. (How else can you make sure that two processors do not try to evaluate the same unsafePerformIO value at once?) And runWithDifferentDefaultDict allows you to change the value returned by defaultDict during an action, meaning that programs can for example initialise the same library multiple times, which would be useful during debugging. Well it's a start I think. Can anyone do better?

7 9

MBR04 Extended deadline
by Lorenzo Magnani 06 Jun '04

06 Jun '04

EXTENDED DEADLINE - Deadline June 20, 2004 ****************************************************************** MODEL-BASED REASONING IN SCIENCE AND ENGINEERING ABDUCTION, VISUALIZATION, AND SIMULATION MBR'04 Pavia, Italy, December 16-18, 2004 Chair: Lorenzo Magnani ****************************************************************** Up-to date information on the conference will be found at http://www.unipv.it/webphilos_lab/courses/progra1.html ****************************************************************** GENERAL INFORMATION From Thursday 16 to Saturday 18 December 2004 (three days) the International Conference "MODEL-BASED REASONING IN SCIENCE AND ENGINEERING: ABDUCTION, VISUALIZATION, AND SIMULATION" will be held at the University of Pavia (near Milan, Italy). The conference continues the theme of the Conferences "Model-Based Reasoning in Scientific Discovery" MBR'98 and "Model-Based Reasoning: Scientific Discovery, Technological Innovation, and Values" MBR'01 The previous volumes derived from those conferences are: L. Magnani and N. J. Nersessian (eds.) (2002), Model-Based Reasoning. Science, Technology, Values, Kluwer Academic/Plenum Publishers, New York. http://www.wkap.nl/prod/b/0-306-47244-9 L. Magnani, N. J. Nersessian, and C. Pizzi (eds.) (2002), Logical and Computational Aspects of Model-Based Reasoning, Kluwer Academic, Dordrecht. http://www.wkap.nl/prod/b/1-4020-0791-4 L. Magnani, N. J. Nersessian, and P. Thagard (eds.) (1999), Model-Based Reasoning in Scientific Discovery, Kluwer Academic/Plenum Publishers, New York. http://www.wkap.nl/prod/b/0-306-46292-3 (Chinese edition, translated and edited by Q. Yu and T. Wang, China Science and Technology Press, Beijing, 2000). PROGRAM The conference will deal with the logical, epistemological, and cognitive aspects of modeling practices employed in science and engineering, including computational models of such practices. We solicit papers that examine the role of abduction, visualization, and simulation in model-based reasoning from philosophical, historical, sociological, psychological, or computational perspectives. RELEVANT RESEARCH AREAS We call for papers that cover topics pertaining to model-based reasoning in science and engineering from the following list: - abduction - visual, spatial, imagistic modeling and reasoning - simulative modeling - the role of diagrammatic representations - computational models of visual and simulative reasoning - causal and counterfactual reasoning in model construction - visual analogy - thought experimenting - logical analyses related to model-based reasoning - manipulative reasoning - distributed model-based reasoning - embodiment in model-based reasoning - model-based reasoning and technological innovation INVITES SPEAKERS WHO ALREADY ACCEPTED TO GIVE A PRESENTATION AT MBR'04 - Atocha Aliseda, Instituto de Investigaciones Filosoficas Universidad Nacional Autonoma de Mexico (UNAM), Mexico City, MEXICO - Lawrence W. Barsalou,Department of Psychology,Emory University Atlanta, GA, USA - Diderik Batens, Centre for Logic and Philosophy of Science, Universiteit Gent, Ghent, BELGIUM - Walter Carnielli, CLEHC State University of Campinas - UNICAMP, Campinas, SP, Brazil - Balakrishnan Chandrasekaran, Laboratory for Artificial Intelligence Research, Department of Computer and Information Sience, Columbus, OH, USA. - Kenneth D. Forbus, Walter P. Murphy Professor of Computer Science and Education, Northwestern University, Evanston, IL, USA - Dov Gabbay, Department of Computer Science, King's College, London, UK - David Gooding, Science Studies Centre, Department of Psychology University of Bath, Bath, UK - Mary Hegarty, Department of Psychology, University of California, Santa Barbara, CA, USA - Theo A.F. Kuipers, Dept. of Philosophy, University of Groningen, Groningen, NETHERLANDS - Michael Leyton, DIMACS, Busch Campus, Rutgers University, New Brunswick, NJ, USA - Li Ping, Department of Philosophy, Sun Yat-sen (Zhongshan) University, Guangzhou, P.R.CHINA - Lorenzo Magnani, Department of Philosophy, University of Pavia, Pavia, ITALY and Baruch College, The City University of New York, New York, USA - Nancy J. Nersessian, College of Computing, Georgia Institute of Technology, Atlanta, GA, USA - Claudio Pizzi, Department of Philosophy and Social Sciences, University of Siena, Siena, ITALY - Qiming Yu, Department of Philosophy, Central University for Nationalities, Bejing, P.R. CHINA - Friedrich Steinle, Max-Planck-Institut, Berlin, GERMANY - John Woods, Department of Philosophy, University of British Columbia, Vancouver and Department of Computer Science, King's College, London, UK - Andrea Woody, Department of Philosophy, University of Washington Seattle, WA, USA SUBMISSIONS OF PAPERS All submitted papers will be carefully refereed. The precise format of the conference will be fixed after we have an idea of the number of accepted papers. We expect approximately 40 contributed presentations some of 40 and others of 20 minutes. There will be several invited papers of 1 hour. A selected subset will be invited for inclusion (subject to additional refereeing) in a book which will constitute an advanced handbook for researchers in this area. The book will be published by an international publishing house. Moreover another selected subset will be invited for inclusion (subject to additional refereeing) in special issues of suitable international journals. Authors must submit an electronic version - formatted in Microsoft Word or RTF, PS or PDF ( in this last case two cases please include source - DOC, TEX, etc., file) - of an extended abstract (total word count aproximately 1000-1200). The file must also contain a 300 WORD abstract that will be used for the conference web site/booklet. Not later than June 20, 2004 Please send electronically the extended abstract to the Prof. Magnani at the address lmagnani(a)unipv.it A RIGID LAW ON PRIVACY IN ITALY DOES NOT FAVOR MORE COMFORTABLE COMPUTATIONAL METHODS OF PAYMENTS (CONFERENCE AND ACCOMMODATION FEES), SORRY. PLEASE FOLLOW THE INSTRUCTIONS INDICATED BELOW. REGISTRATION AND FURTHER INFORMATION PLEASE REGISTER by email lorenzo.magnani(a)unipv.it, fax or air mail by sending the PROGRAM CHAIR Lorenzo Magnani first and last name, function, institution, full address, phone, fax and email. For information about paper submission and the program that is not available on the web site, please contact the program chair. Registration Fees: Before October 15, 2004: Standard: Euro 180,00 (to participate in all the activities of the Conference Social Dinner included) Phd Students: Euro 120,00 Students (Undergraduates): Free After October 15, 2004: Standard: Euro 240,00 (to participate in all the activities of the Conference Social Dinner Included) Phd Students: Euro 160,00 Students (Undergraduates): Free One day only: Euro 100,00 No refunds will be granted after November 1st Terms & Conditions: an administration fee of Euro 75,00 will be charged for cancellations confirmed in writing by December 1st. We regret that no refund can be made after that date, for whatever reason,although substitutions will be acceptable if notified in writing before the event. METHOD OF PAYMENT: SWIFT TRANSFER Bank (Swift) Transfer to BANCA REGIONALE EUROPEA S.p.A BRANCH PAVIA - Sede SWIFT BREUITM2 301 Bank Code 06906.11301 CIN V Acc. n. 43008 COMITATO CONVEGNI E. W. I. C. IBAN: IT32V0690611301000000043008. Please indicate CONVEGNO INTERNAZIONALE MBR04 Please ask your BANK to clearly indicate in the order of payment your first and last NAME. In case of problems please contact Elena Gandini Local Organizer elena(a)acrossevents.com) If you prefer, you can mail an international check to CONVEGNO INTERNAZIONALE E-CAP2004_ITALY, Dipartimento di Filosofia, Piazza Botta 6, 27100 Pavia, Italy . ACCOMMODATION To book a reservation please fill and fax to +39-0382-23215 the ACCOMMODATION FORM you will find in the Conference Web Site http://www.unipv.it/webphilos_lab/courses/progra1.html (to dr. Elena Gandini Local Organizer). POSSIBLY BEFORE NOVEMBER 10, 2003. For information please email Elena Gandini, Local Organizer elena(a)acrossevents.com. Please do not send email messages containing your credit card data. All accommodation is hotel-based with en-suite facilities (the prices are per room per day). Hotel Moderno ****Euro 103,00 (single b&b) Euro138,00 (double b&b) Hotel Ariston *** Euro 80,00(single) Euro 110,00 (double), Breakfast Euro 10,00 Hotel Excelsior *** Euro 50,00(single) Euro 73,00(double) Euro 62,00(D/S) breakfast Euro 6,00 Hotel Ritz*** Euro 65,00 (single b&b) Euro 87,00 (double b&b) Hotel Excelsior (from the station walk east) Hotel Moderno (from the station walk north) Hotel Ritz (San Genesio-PV); an Hotel bus service is available. To reach Hotel Ariston take the bus n. 3 or taxi. If the Hotels above will be completely booked other Hotels are available, in this last case please email dr. Elena Gandini Local Organizer e-mail: elena(a)acrossevents.com PENALTY In case of no show the Hotels will charged you their own penalty. For further information, please contact our local organiser Elena Gandini elena(a)acrossevents.com. IMPORTANT DATES Submission deadline..................... June 20, 2004 Notification of acceptance..............Sept 15, 2004 Conference............................. Dec 16-18, 2004 Final papers......................due.. February 15, 2005 PROGRAM CHAIR Lorenzo MAGNANI Department of Philosophy and Computational Philosophy Laboratory University of Pavia, Piazza Botta 6, 27100 Pavia, Italy Office: +39-0382-506283, Home: +39-0383-371067 Fax: +39-0382-23215 & Weissman Distinguished Visiting Professor Department of Philosophy, Baruch College, 1 Bernard Baruch Way, New York , NY 10010 Office: +646-312-4367, Fax: +646- 312-4361, Home: 646-432-9309 Email: lmagnani(a)unipv.it PROGRAM COMMITTEE - Atocha Aliseda, Instituto de Investigaciones Filosoficas Universidad Nacional Autonoma de Mexico (UNAM), Mexico City, MEXICO - Diderik Batens, Centre for Logic and Philosophy of Science, Universiteit Gent, Ghent, Belgium - Walter Carnielli,Centre for Logic, Epistemology and the History of Science - CLEHC State University of Campinas - UNICAMP, Campinas, SP, Brazil - Simon Colton, Department of Computing, Imperial College London 180 Queens Gate, London SW7 2BZ, United Kingdom - Roberto Cordeschi, Department of Communication Sciences, University of Salerno, Salerno , ITALY - Kenneth D. Forbus, Walter P. Murphy Professor of Computer Science and Education, Northwestern University, 1890 Maple Avenue, Evanston, IL, 60201, USA - Dov Gabbay, Department of Computer Science, King's College, London, UK - Ronald N. Giere, Department of Philosophy, 831 Heller Hall University of Minnesota, Minneapolis, MN USA 55455 - David Gooding, Science Studies Centre, Department of Psychology University of Bath, Bath BA2 7AY, UK - Elke Kurz-Milcke, College of Computing, Georgia Institute of Technology 801 Atlantic Dr. NW, Atlanta, GA 30332-0280, USA - Michael Leyton, Center for Discrete Mathematics & Theoretical Computer Science (DIMACS), Busch Campus, Rutgers University, New Brunswick, NJ 08854. USA - Lorenzo Magnani, Department of Philosophy, University of Pavia, Pavia, ITALY and Baruch College, The City University of New York, New York, USA - Nancy J. Nersessian, College of Computing, Georgia Institute of Technology, Atlanta, GA, USA - Wendy C. Newstetter, Director of Learning Sciences Research Wallace H. Coulter Dept. of Biomedical Engineering, Georgia Institute of Technology/Emory University school of Medicine, Atlanta, GA, USA - Claudio Pizzi, Department of Philosophy and Social Sciences, University of Siena, Siena, ITALY -.Stefanelli Mario, Dipartimento di Informatica e Sistemistica, Università di Pavia, Pavia, ITALY - Ryan D. Tweney, Professor of Psychology, Bowling Green State University Bowling Green, OH 43403, USA - Riccardo Viale, Fondazione Rosselli,Via San Quintino, 18/c, 10121 Torino, Italy - John Woods, Department of Philosophy, University of British Columbia, Vancouver and Department of Computer Science, King's College, London, UK - Andrea Woody, Department of Philosophy, University of Washington Box 353350, 345 Savery Hall, University of Washington, Seattle, WA 98195 - Xiang Chen, Department of Philosophy, California Lutheran University Thousand Oaks, CA 91360 LOCAL ORGANIZER dr. Elena Gandini Across Events s.r.l. Via A. Moro, 12 27021 Bereguardo (PV) Italy mobile +39 349 55 41 915 e-mail: elena(a)acrossevents.com www.acrossevents.com LOCAL ORGANIZING COMMITTEE Elena Gandini (elena(a)acrossevents.com) Riccardo Dossena (riki.dox(a)libero.it) Lorenzo Magnani (lmagnani(a)unipv.it) (Department of Philosophy, University of Pavia, Pavia, Italy) Stefanelli Mario (mstefa(a)aim.unipv.it) Matteo Piazza (pimat(a)yahoo.com) (Dipartimento di Informatica e Sistemistica, Università di Pavia, Pavia, Italy) CONFERENCE SITE: Collegio Ghislieri, Piazza Ghislieri, 27100 PAVIA, Italy, phone +39 0382 37861. http://www.ghislieri.it/ The Conference is sponsored by UNIVERSITY OF PAVIA, ITALY UNIVERSITY OF SIENA, ITALY MIUR (Ministero dell'Università e della Ricerca Scientifica e Tecnologica), ITALY CARIPLO (Cassa di Risparmio delle Provincie Lombarde) HOW TO REACH PAVIA LINATE Airport: www.sea-aeroportimilano.it/linate People arriving by plane at LINATE should take the bus to the CENTRAL STATION of Milan (cf. below from this Station to Pavia). In LINATE it could be convenient to take a Taxi because the airport is close to the center of Milan. Moreover,the bus company SGEA ( www.sgea.it ) offers six runs from LINATE to Pavia at 9.00, 10.00, 12.00 AM and 2.00, 5.00, 8.30 PM. The last stop is Pavia, near the station (see again our updated web page for possible alterations of this time-table) (from Pavia to LINATE six runs at 5.00, 7.30, 10.00 AM, 1.00, 4.00, 6.00 PM) (one hour trip; _13,00 return ticket, _8,00 one way ticket). In Pavia there is only one station. The easiest way to reach the center of the town is to get off at the station and than take the bus n. 3. MALPENSA 2000 (Terminal 1) and OLD MALPENSA (Terminal 2) Airport: www.sea-aeroportimilano.it/malpensa (usually people arrive to Malpensa 2000 and not to OLD MALPENSA): People arriving by plane at MALPENSA 2000 (also called MALPENSA 2000 Terminal 1) or at "old" MALPENSA (now called MALPENSA NORTH but also called Malpensa 2000 Terminal 2) should take the bus to the CENTRAL STATION of Milan. There is also a bus AND A shuttle TRAIN (Malpensa Express) from Malpensa 2000 to the NORTH STATION (Piazzale Cadorna) of Milan, in this case from NORTH Station you will have to take the underground MM2 (green line) to the Central Raylway Station: trains to Pavia leave from Central station. Moreover, the bus company SGEA offers various runs from MALPENSA 2000 to Pavia at 9.00, 11:00 AM, 1:30 3:00, 5:00, 7:00, 9:30, PM (from Pavia to MALPENSA 2000 and to OLD MALPENSA various runs at 7.00, 9:00, 11:00 AM, 1:00, 3:15, 5:00, 7:00 PM) (one hour and half trip; _18,00 retourn ticket, _12,00 one way ticket). The last stop is Pavia, near the rail station. In Pavia there is only one rail station. The easiest way to reach the center of the town is to get off at the station and than take the bus n. 3. There are trains from MILAN (Central Raylway Station) to PAVIA and vice versa about every an hour www.trenitalia.it (routes: MILAN-GENOVA; MILAN-VENTIMIGLIA; MILAN-LA SPEZIA; MILAN-SAVONA; MILAN-SESTRI LEVANTE; MILAN-IMPERIA; MILAN-ALBENGA; Pavia is the first stop only if the train is not slow, that is, if it is not, in ITALIAN, "L", locale). (see again our updated web page for possible alterations of this time-table)

1 0

Foclasa: Call for Papers
by Jean-Marie JACQUET 06 Jun '04

06 Jun '04

[ Our apologies for multiple copies. ] ====================================================================== 3nd International Workshop on Foundations of Coordination Languages and Software Architectures (Foclasa 2004) August 30, 2004, London, United Kingdom Workshop affiliated to CONCUR'2004, August 30 - September 3 2004. WITH DEADLINE EXTENSIONS ====================================================================== SCOPE AND TOPICS Modern information systems rely more and more on combining concurrent, distributed, mobile and heterogenous components. This move from old systems, typically conceived in isolation, induces the need for new languages and software architectures. In particular, coordination languages have been proposed to cleanly separate computational aspects and communication. On the other hand, software architects face the problem of specifying and reasoning on non-functional requirements. All these issues are widely perceived as fundamental to improve software productivity, enhance maintainability, advocate modularity, promote reusability, and lead to systems more tractable and more amenable to verification and global analysis. The aim of the workshop is to bring together researchers working on the foundations of component-based computing, coordination, and software architectures. Topics of interest include (but are not limited to): o Theoretical models for coordination (component composition, concurrency, dynamic aspects of coordination, semantics, expressiveness); o Specification, refinement, and analysis of software archi- tectures (patterns and styles, verification of functional and non-functional properties); o Coordination, architectural, and interface description languages (implementation, interoperability, heterogeneity); o Agent-oriented languages (formal models for interacting agents); o Dynamic software architectures (mobile agents, configuration, reconfiguration); o Modeling of information systems (groupware, internet and the web, workflow management, CSCW and multimedia applications) o Coordination patterns (mobile computing, internet computing); o Tools and environments for the development of coordinated applications o Methodologies for validating and certifying software compositions SUBMISSION GUIDELINES Papers describing original work are solicited as contributions to Foclasa. Submitted papers should be limited to 6 000 words, preferrably formatted according to the Electronical Notes in Theoretical Computer Science. They should be emailed as PostScript (PS) or Portable Document Format (PDF) files to jmj(a)info.fundp.ac.be. PUBLICATION Following the previous edition, the proceedings will be published as a volume of the Electronical Notes in Theoretical Computer Science. IMPORTANT DATES: o June 7, 2004: Abstract Submission deadline. o June 13, 2004: Full Paper Submission deadline. o July 15, 2004: Notification of acceptance. o August 15, 2004: Final version. o August 30, 2004: Meeting Date. LOCATION The workshop will be held in London in August 30 2004. It is a satellite workshop of CONCUR 2004. For venue and registration, see the CONCUR web page at http://www.doc.ic.ac.uk/concur2004/. WORKSHOP ORGANIZERS o Antonio Brogi (University of Pisa, Italy) o Jean-Marie Jacquet (University of Namur, Belgium) o Ernesto Pimentel (University of Malaga, Spain) PROGRAMME COMITTEE (provisional): o Farhad Arbab (CWI, The Netherlands) o Antonio Brogi (University of Pisa, Italy) - Co-chair o Manfred Broy (University of Munich, Germany) o Jean-Marie Jacquet (University of Namur, Belgium) - Co-chair o Joost Kok (University of Leiden, The Netherlands) o Antonia Lopes (University of Lisbon, Portugal) o Ronaldo Menezes (Florida Institute of Technology, USA) o Amy Murphy (University of Rochester, USA) o Ernesto Pimentel (University of Malaga, Spain) - Co-chair o Sebastian Uchitel (Imperial College, United Kingdom) o Mirko Viroli (University of Bologna, Italy) o Jan Vitek (Purdue University, USA)

1 0

Lists as Arrows
by David Sankel 06 Jun '04

06 Jun '04

Hello, Forgive me, I have but a fuzzy idea of what Arrows are. I was thinking it might be possible to make lists arrows instead of monads. This would allow (++) to be one of those special arrow computations. It would have some quite nice properties. For example (++ [a]) could be a O(1) operation instead of a O(n). Also, the trivial implementation of a queue would be O(1) for push and pop operations instead of the more complicated amortized O(1) implementation. Am I missing the point or is what I said above a possibility? David J. Sankel

1 0

Invitation to IPSI-2004 VENICE and IPSI-2004 PRAGUE, vip/ba
by IPSI-2004 04 Jun '04

04 Jun '04

Dear Potential Speaker: This is an invitation for you to attend two IPSI BgD multidisciplinary and interdisciplinary conferences, one in Venice, and one in Prague, as follows: IPSI-2004 VENICE Venice, Italy (arrival: 10.11.2004. departure: 14.11.2004.) Deadlines: 15 June 2004 (abstract) + 1 August 2004 (full paper). IPSI-2004 PRAGUE Prague, Czeck Republic (arrival: 11.12.2004. departure: 14.12.2004.). Deadlines: 15 July 2004 (abstract) + 1 September 2004 (full papers) If you like to obtain more information on both conferences, please reply to this email. All IPSI BgD conferences are non-profit! They bring together the elite of the world science (so far, 7 times a Nobel Laureate was talking at the opening ceremony), and they take place in the leading hotels of the world. Topics of interest include, but are not limited to: Internet, Computer Science and Engineering, Management and Business Administration, Education, e-Medicine, Electrical Engineering, Bioengineering, Environment Protection, and e-Economy. Sincerely Yours, Prof. V. Milutinovic, Chairman PS - If you plan to submit an abstract/paper, let us know immediately. If you are not able to attend now, but you like to be informed about the future IPSI BgD conferences, please let us know. If you do not like to receive future invitations, let us know, as well!

1 0

TLCA 05 Call for Papers
by Hasegawa Masahito 04 Jun '04

04 Jun '04

TLCA'05 CALL FOR PAPERS Seventh International Conference on Typed Lambda Calculi and Applications (TLCA '05) Nara, Japan 21-23 April 2005 (Colocated with RTA as RDP '05) http://www.kurims.kyoto-u.ac.jp/rdp05/tlca/ The TLCA series of conferences serves as a forum for presenting original research results that are broadly relevant to the theory and applications of typed lambda calculi and related systems. The following list of topics is non-exhaustive: * Typed and untyped lambda-calculi as models of computation. * Proof-theory: Natural deduction, sequent calculi, cut elimination and normalization. Propositions as types, linear logic and proof nets. * Types: Subtypes, dependent types, type inference, polymorphism, types for security. * Semantics: Denotational semantics, game semantics, realizability, categorical models. * Programming languages: Foundations of functional and object-oriented programming, proof search, logic programming, type checking. * Implementation: Abstract machines, parallel execution, optimal reduction, program optimization. * Computer-aided reasoning. The programme of TLCA'05 will consist of three invited talks and about 25 papers selected from original contributions. Accepted papers will be published as a volume of Springer Lecture Notes in Computer Science series. [http://www.springer.de/comp/lncs/index.html] Submissions: ------------ The submitted papers should describe original work and should allow the Programme Committee to assess the merits of the contribution: in particular references and comparisons with related work should be included. Submission of material already published or submitted to other conferences with published proceedings is not allowed. Papers should not exceed 15 pages in Springer LNCS format. An abstract (ASCII text) of no more than 150 words should be sent separately at least a week before the paper submission deadline. All submissions should be sent by e-mail to tlca05(a)mimuw.edu.pl Important dates: ---------------- Authors are required to submit a paper title and a short abstract at least a weak before the paper submission deadline. All deadlines below are at 24:00 Central European time (GMT+1). Titles and abstracts due: October 25, 2004 Paper submission deadline: November 2, 2004 Notification: December 22, 2004 Final versions due: January 31, 2005 Accepted papers should be prepared according to Springer LNCS guidelines as described in http://www.springer.de/comp/lncs/authors.html. Final versions must include all source files. Further information is available from the conference web page http://www.kurims.kyoto-u.ac.jp/rdp05/tlca/ Inquiries concerning submissions and programme should be addressed to tlca05(a)mimuw.edu.pl. Inquiries concerning the conference organization and participation should be sent to tlca05org(a)kurims.kyoto-u.ac.jp TLCA Steering Committee: ------------------------ Samson. Abramsky, Oxford, chair Henk Barendregt, Nijmegen Mariangiola Dezani-Ciancaglini, Turin Roger Hindley, Swansea Martin Hofmann, Munich TLCA 05 Programme Committee: ---------------------------- Thorsten Altenkirch, University of Nottingham Stefano Berardi, University of Turin Adriana Compagnoni, Stevens Institute of Technology, Hoboken Herman Geuvers, Nijmegen University Andy Gordon, Microsoft Research, Cambridge Fritz Henglein, Copenhagen University Martin Hofmann, LMU Munich Assaf J. Kfoury, Boston University Atsushi Ohori, JAIST, Tatsunokuchi Laurent Regnier, IML Marseille Pawel Urzyczyn, Warsaw University, chair Marek Zaionc, Jagiellonian University, Cracow TLCA 05 Organizing Committee: ----------------------------- Masahito Hasegawa, Kyoto, chair Ryu Hasegawa, Tokyo Mitsu Okada, Keio Masahiko Sato, Kyoto Masako Takahashi, ICU ------------------------------------------------------------------------------

1 0

Re: [Haskell] Initialisation without unsafePerformIO
by George Russell 03 Jun '04

03 Jun '04

Chung-chieh Shan wrote (snipped): > The enabling technique behind our solution is to propagate values > via types (literally), with the help of polymorphic recursion and > higher-ranked polymorphism. The technique essentially emulates > local type-class instance declarations. Configuration parameters > are propagated throughout the code implicitly as part of type > inference rather than explicitly by the programmer. Crikey! You represent configuration values which are integers by encoding them as a type with constructors data Zero data Twice s data Succ s data Pred s and you encode general values which are instances of Storable by casting their binary representation (pinned by a StablePtr) into bytes and then encoding the result as integers. My mind boggles. It would be nice if your paper included an appendix containing a main program which, say, used a graphics library including configuration parameters in your style. (Say, default font (string), font size (integer) and mouse handedness (bool).)

1 0

RE: [Haskell] Idea for the Haskell Store
by Simon Peyton-Jones 03 Jun '04

03 Jun '04

Good idea! At least, good idea if anyone wants to organise it. I'm optimistic that copyright issues could be worked out, but it needs an animating spirit to decide what should be available, line up POD services, decide pricing etc. Any volunteers? Simon | -----Original Message----- | From: haskell-bounces(a)haskell.org [mailto:haskell-bounces@haskell.org] On Behalf Of John Meacham | Sent: 02 June 2004 17:15 | To: haskell(a)haskell.org | Subject: [Haskell] Idea for the Haskell Store | | There are a lot of very good books and papers out there on haskell or | related topics which are no longer in print or not convieniently available in | paper form to people without university access. | | I was thinking it would be very very cool if we could sign up with one | of the POD (Print on demand) services to offer useful books and | collections of papers printed on demand for haskell enthusiasts. A | print on demand publisher works just like amazon or any other online | bookseller, but actually prints out the books as needed so can deal | just as effectivly with small orders as big ones, modern technology has | made the cost comparable to traditional mass-produced books and an order | of magnitude better quality and cost over getting the stuff printed and | bound at kinkos or similar. | | some things which I would LOVE to see offered would be stuff like | | http://www.cs.chalmers.se/~boquist/phd/index.html | peyton jones's thesis on GHC optimization | http://www.cs.chalmers.se/Cs/Research/Logic/book/ | http://research.microsoft.com/Users/simonpj/Papers/pj-lester-book/ | various collections of papers by author phillip wadler, simon peyton | jones, simon marlow, etc.. or based on topics like 'the monad papers' | or 'generic haskell anthology' or 'a tale of ten pretty printers' | | any other ideas? | | There will probably be some copyright issues to work out, but anything | would be great. It could be done non-profit or having the profit flow | back to the authors or into the maintenence of the haskell site or other | worthy haskell projects (or decided on a book-by-book basis I imagine) | | John | | -- | John Meacham - ⑆repetae.net⑆john⑈ | _______________________________________________ | Haskell mailing list | Haskell(a)haskell.org | http://www.haskell.org/mailman/listinfo/haskell

2 1

Idea for the Haskell Store
by John Meacham 02 Jun '04

02 Jun '04

There are a lot of very good books and papers out there on haskell or related topics which are no longer in print or not convieniently available in paper form to people without university access. I was thinking it would be very very cool if we could sign up with one of the POD (Print on demand) services to offer useful books and collections of papers printed on demand for haskell enthusiasts. A print on demand publisher works just like amazon or any other online bookseller, but actually prints out the books as needed so can deal just as effectivly with small orders as big ones, modern technology has made the cost comparable to traditional mass-produced books and an order of magnitude better quality and cost over getting the stuff printed and bound at kinkos or similar. some things which I would LOVE to see offered would be stuff like http://www.cs.chalmers.se/~boquist/phd/index.html peyton jones's thesis on GHC optimization http://www.cs.chalmers.se/Cs/Research/Logic/book/ http://research.microsoft.com/Users/simonpj/Papers/pj-lester-book/ various collections of papers by author phillip wadler, simon peyton jones, simon marlow, etc.. or based on topics like 'the monad papers' or 'generic haskell anthology' or 'a tale of ten pretty printers' any other ideas? There will probably be some copyright issues to work out, but anything would be great. It could be done non-profit or having the profit flow back to the authors or into the maintenence of the haskell site or other worthy haskell projects (or decided on a book-by-book basis I imagine) John -- John Meacham - ⑆repetae.net⑆john⑈

1 0

how to write a list builder? fixpoint?
by Ben.Yu＠combined.com 01 Jun '04

01 Jun '04

Hi, just curious. When building a list, normally I do [a,b,c,d]. Is it possible to write a function to build a list [a]? so that I can write [a,b,c,d] as "getBuilt $ build a b c d"? looks like build will have to be of type ListBuilder, where ListBuilder a = a -> ListBuilder a. Is it a fix point? Ben. This message is intended only for the addressee and may contain information that is confidential or privileged. Unauthorized use is strictly prohibited and may be unlawful. If you are not the intended recipient, or the person responsible for delivering to the intended recipient, you should not read, copy, disclose or otherwise use this message, except for the purpose of delivery to the addressee. If you have received this email in error, please delete and advise us immediately.

1 0