September 2003 - Haskell

Re: pretty newby
by Luc Taesch 24 Sep '03

24 Sep '03

Thanks. i understand that a2ps is rather for printing. What I had in mind what to pp my own programs, to clean the source layout, rather. The process i used in other context is to hack , without really taking care of the layout ( say getting distracted by) , and once i got a resonalble level of stability, i cleaned the program, using a pp; ideally in haskell, this would add the typing for me, also. ( still havent made my religion if that's cool to have the typing on top of the definition, or not, but at least for doc generation purpose, that's good.) feedback on that ? so the two gain i was expecting were : - cleaning the layout, after i removed all the debugging code - generating the type but i understood from Per from that the parser would not take care of the comments. ( not take care, or remove , btw ?). alos, Im surprised that this bland issue has not already been solved (PP lib paper looks dated 96). no offence intended, but aas im newbie, i wonder what am i missing ? what is different in the process of creation so that this need did not arised already? i should admint i'm puzzled, given the facilities at hand... > Alle 16:05, marted� 23 settembre 2003, Luc Taesch ha scritto: > > are there any facility to pretty print an haskell program ? > > If what you need is an external program and not a library, have a look > at GNU a2ps. > > Vincenzo > > _______________________________________________ > Haskell mailing list > Haskell(a)haskell.org > http://www.haskell.org/mailman/listinfo/haskell

8 7

From enumerators to cursors: turning the left fold inside out
by oleg＠pobox.com 24 Sep '03

24 Sep '03

There are two basic approaches of accessing a collection, be it a file, a database, or a generating function. One approach relies on enumerators (aka folds); the other is based on lazy lists (aka cursors, streams). Given a stream, we can always construct the corresponding enumerator. It's perhaps less appreciated that given a left fold enumerator, we can always construct the corresponding stream [1]: we can mechanically invert an enumerator inside out. It has been argued [2] that the enumerator approach is superior, especially from the point of view of managing scarce resources such as database connections. When we design the interface to a collection, it seems a good idea to choose enumerator as a primitive. We can always obtain a stream if we really need it. The mechanical inversion procedure presented in [2] had a catch: it relies on shift/reset (or call/cc plus a mutable cell, which is the same thing). How can we do such an inversion in Haskell? Well, we can introduce a right fold enumerator, which is more amenable to such transformation. Or we can use a continuation monad and emulate shift/reset. The present article demonstrates a third approach: a half-baked, non-recursive left-fold. We argue that such a left fold is the best interface for a collection. Indeed, given the half-baked left-fold we can: - instantiate it into the ordinary left fold - instantiate in into a stream If we turn two enumerators into streams, we can *safely* interleave these streams. The rest of the article demonstrates the inversion procedure. We use a file as a sample "collection", a collection of characters. Haskell provides a stream interface to that collection: hGetChar. We implement a left fold enumerator. We then show how to turn that enumerator back to a stream: how to implement a function mygetchar only in terms of the left fold enumerator. The approach is general and uses no monadic heavy lifting. The following code is Haskell98. No unsafe operations are used. > import IO The desired left-fold enumerator over a file: > hfold_left:: FileName -> Title > -> Iteratee seed > -> seed -- the initial seed > -> IO seed > type FileName = String > type Title = String -- just an identifying string for debug printing > type Iteratee seed = seed -> Char -> Either seed seed The function (seed -> Char -> Either seed seed) is an iteratee: it takes the current seed and the current character and returns a new seed. To be more precise, if it returns Right seed', the iteration continues with seed' as the new seed. If the iteratee returns Left seed'', the enumerator immediately stops further iterations, frees all the resources, and returns seed'' as the final result. So our left fold enumerator supports premature termination of iterations, a quite useful feature. As me mentioned above, we actually need a half-baked, non-recursive enumerator hfold_left' > make_hfold_left' filename title = do > h <- openFile filename ReadMode > let hfold_left' self iteratee seed = do > mc <- try $ hGetChar h > case mc of > Left exc -> hClose h >> return seed > Right c -> do > putStrLn $ " reading from " ++ title ++ ". Got " ++ (show c) > case iteratee seed c of > Left seed -> hClose h >> return seed > Right seed -> self iteratee seed > return hfold_left' We can easily obtain the desired hfold_left as an instantiation of hfold_left': > hfold_left filename title iteratee seed = do > hfold_left' <- make_hfold_left' filename title > let g = hfold_left' g > hfold_left' g iteratee seed We should note that the Handle is an internal resource and is never leaked. The statement putStrLn $ " reading from " ++ title ... is for debugging. We want to be sure that we don't read from a stream too much. This will be important for interleaving. Let us create a test file > tf = "/tmp/a" > make_test_file fname = do > h <- openFile fname WriteMode > mapM_ ((hPutStr h) . show) [0..9] > putStrLn $ "Wrote " ++ fname > hClose h and test our left fold enumerator > test_read fname n = do > (count,acc) <- hfold_left fname "handle" reader (0,[]) > putStrLn $ "Have read: " ++ (show acc) > where reader (count,acc) c = > let count' = count + 1 > acc' = c:acc > in (if count' >= n then Left else Right) (count',acc') The first test checks the premature termination. We read only five characters, and then terminate the iteration and dispose of its resources, including the (invisible) handle. *Main> test_read tf 5 reading from handle. Got '0' reading from handle. Got '1' reading from handle. Got '2' reading from handle. Got '3' reading from handle. Got '4' Have read: "43210" The following tests the exhaustive iteration. *Main> test_read tf 20 reading from handle. Got '0' reading from handle. Got '1' reading from handle. Got '2' reading from handle. Got '3' reading from handle. Got '4' reading from handle. Got '5' reading from handle. Got '6' reading from handle. Got '7' reading from handle. Got '8' reading from handle. Got '9' Have read: "9876543210" Let us suppose that make_hfold_left' is the only way to access files. Can we recover ordinary i/o streams from it? The answer is yes. We can get the familiar open, getchar and eof functions from the half-baked enumerator. Furthermore, the derivation of these functions is *independent* of the precise nature of the enumerator. We will never need (nor be given) access to the handle. > data MyStream = MyNil (Maybe Char) | MyCons Char (IO MyStream) > > myopen:: FileName -> Title -> IO MyStream > > myopen filename title = do > hfold_left' <- make_hfold_left' filename title > let k fn (MyNil Nothing) = return $ MyNil Nothing > k fn (MyNil (Just c)) > = return $ MyCons c (hfold_left' k fn (MyNil Nothing)) > hfold_left' k (\_ c -> Right $ MyNil $ Just c) (MyNil Nothing) > mygetchar:: MyStream -> IO (Char,MyStream) > mygetchar (MyCons c k) = k >>= (return . ((,) c)) > > myiseof:: MyStream -> Bool > myiseof (MyNil Nothing) = True > myiseof _ = False We can now test reading from two streams with interleaving: > test_interleave fname = do > stream1 <- myopen fname "stream1" > stream2 <- myopen fname "stream2" > > putStrLn "\nReading 2 chars from one stream" > (c1,stream1) <- mygetchar stream1 > (c2,stream1) <- mygetchar stream1 > putStrLn $ "Read: " ++ (show [c1,c2]) > > putStrLn "\nReading 3 chars from the second stream" > (c1,stream2) <- mygetchar stream2 > (c2,stream2) <- mygetchar stream2 > (c3,stream2) <- mygetchar stream2 > putStrLn $ "Read: " ++ (show [c1,c2,c3]) > > putStrLn "\nReading again 2 chars from the first stream" > (c1,stream1) <- mygetchar stream1 > (c2,stream1) <- mygetchar stream1 > putStrLn $ "Read: " ++ (show [c1,c2]) *Main> test_interleave tf reading from stream1. Got '0' reading from stream2. Got '0' Reading 2 chars from one stream reading from stream1. Got '1' reading from stream1. Got '2' Read: "01" Reading 3 chars from the second stream reading from stream2. Got '1' reading from stream2. Got '2' reading from stream2. Got '3' Read: "012" Reading again 2 chars from the first stream reading from stream1. Got '3' reading from stream1. Got '4' Read: "23" Note that we read ahead by exactly one character. If we want to detect EOF, that is inevitable (we need to attempt reading if we want to detect EOF). We should point out the relationship between hfold_left, hfold_left' and myopen: hfold_left is the fixpoint of hfold_left'. OTH, myopen captures the continuation of hfold_left' in an IO action. This relationship once again illustrates that call/cc and Y are indeed two sides of the same coin [3]. [1] General ways to traverse collections http://pobox.com/~oleg/ftp/Scheme/enumerators-callcc.html [2] An argument against cursors http://srfi.schemers.org/srfi-44/mail-archive/maillist.html [3] Self-application as the fixpoint of call/cc http://google.com/groups?selm=7eb8ac3e.0309182239.5a64b3b1%40posting.google…

2 1

pretty newby
by Luc Taesch 23 Sep '03

23 Sep '03

are there any facility to pretty print an haskell program ? im aware of HPJ combinators library, but i was looking for a command line utility, rather.. am i missing an entry in HPJ ? thanks Luc

4 3

Canonic labeling of graphs
by JP Bernardy 23 Sep '03

23 Sep '03

Hello all, As an exercise, I've implemented an algorithm for canonic relabeling of graphs. (Two graphs are isomorphic iff they have the same canonic labelling) The method used is stolen from Brendan McKay, "Practical graph isomorphism". http://cs.anu.edu.au/~bdm/nauty/PGI/ In the hope that it is useful to anyone, I attach the code (for GHC 6). Any remark is welcome. Cheers! --JP. __________________________________ Do you Yahoo!? Yahoo! SiteBuilder - Free, easy-to-use web site design software http://sitebuilder.yahoo.com

1 0

Re: Polymorphic Recursion / Rank-2 Confusion
by oleg＠pobox.com 23 Sep '03

23 Sep '03

Dominic Steinitz wrote: > My motivation in using this type was to see if, for example, I could > restrict addition of a vector to another vector to vectors of the same > length. This would be helpful in the crypto library where I end up having to > either define new length Words all the time or using lists and losing the > capability of ensuring I am manipulating lists of the same length. Perhaps you might find the following http://pobox.com/~oleg/ftp/Haskell/number-parameterized-types.html relevant to your task. The page demonstrates bitvectors of a statically-checked width. An attempt to AND or OR two bitvectors of different widths results in a type error. The width can be specified in _decimal_ rather than in binary, which makes types smaller and far easier to read. Type error messages also become more comprehensible. To implement just the width-checking, we need only Haskell 98. Incidentally, the approach can be easily extended to arbitrary bases, e.g., base64. Therefore, we can define numerals over a field Z^{*}_p whose modulus p is statically known and statically checked. It would be a type error to add or multiply two numerals with different moduli. With base64-bigits, we need only 86 bigits for a 512-bit modulus. Eighty-six terms make a type expression a bit long, but still manageable; whereas binary types such as Zero and One would make the approach unfeasible.

1 0

Polymorphic Recursion / Rank-2 Confusion
by Dominic Steinitz 22 Sep '03

22 Sep '03

Can anyone tell me why the following doesn't work (and what I have to do to fix it)? I thought by specifying the type of coalw as rank-2 would allow it to be used both at a and (a,b). Dominic. Reading file "Test.hs":tten Type checking ERROR "Test.hs":18 - Inferred type is not general enough *** Expression : \(w1,w2) -> coalw w1 ++ coalw w2 *** Expected type : a -> [b] *** Inferred type : (a,b) -> [c] data Vector_ v w = Zero v | Even (Vector_ v (w,w)) | Odd (Vector_ (v,w) (w,w)) deriving Show vzero = Zero () vone = Odd (Zero ((),'a')) vtwo = Even (Odd (Zero ((),('a','b')))) vthree = Odd (Odd (Zero (((),'a'),('b','c')))) vfour = Even (Even (Odd (Zero ((),(('a','b'),('c','d')))))) coal_ :: (forall a b. a -> [b]) -> (forall c d. c -> [d]) -> Vector_ v w -> [w] coal_ coalv coalw (Zero v) = coalv v coal_ coalv coalw (Even v) = coal_ coalv (\(w1,w2) -> (coalw w1) ++ (coalw w2)) v coal_ coalv coalw (Odd v) = coal_ (\(v,w) -> (coalv v) ++ (coalw w)) (\(w1,w2) -> (coalw w1) ++ (coalw w2)) v

4 8

Research Positions at the Technical University of Valencia
by Jose Hernandez-Orallo 22 Sep '03

22 Sep '03

Invitation for Applications Department of Computer Science – ELP group Technical University of Valencia (Spain) TWO research positions are available in the STREAM Project (Formal Software Tools: A Multi-paradigm approach) led by Maria Alpuente. The positions are for one year starting January 2004. Salary: 1400 euros per month (net income). An extra initial amount of 1800 euros for travelling and settling. Our department (http://www.dsic.upv.es) is ranked as the third best computing department in Spain. The Technical University of Valencia (http://www.upv.es) is also ranked as the third best Technical University in the country. Valencia is a lively city on the Mediterranean Sea. It has a population of about one million people and there is a great variety of cultural, artistic, scientific and tourist facilities. Accommodation and the cost of living are not high. The ideal candidates should hold a relevant degree in computer science or related disciplines, with high gpa (grade point average). A background in software development in advanced program environments is also recommended. A basic knowledge of declarative programming as well as a great interest in this particular area will be valued. Fluent English, Spanish, Italian or French required. We especially encourage women to apply. It may be possible to combine these positions with PhD studies in Valencia. Continued financial support after the first year period is expected to be available. The duties and activities to be performed include some of the research areas related to the project: * Multi-paradigm declarative programming. * Program analysis, specification, verification, debugging, learning, certification and transformation. * Data mining, decision support systems. * Advanced programming environments, component technologies. Other research activities and further information from the ELP group can be found at (http://www.dsic.upv.es/users/elp/elp.html) Please contact jorallo(a)dsic.upv.es or mramirez(a)dsic.upv.es before October 8, 2003 if you are interested. Use the subject reference “ELP Research Positions” and include a letter of application, curriculum vitae showing your degree qualifications, two references, and any other relevant documentation to support your candidacy for the position.

1 0

RE: echoing of getChar, getLine, getContents
by Simon Marlow 22 Sep '03

22 Sep '03

> The report states about getChar, getLine, and getContents: > > "By default, these input functions echo to standard output." > > In version 1.3 of the report, it used to continue > "Functions in the I/O library provide full control over echoing." > > Apparently, this has been removed and the I/O library contains > neither facilities to control echoing nor a specification of what the > h-cousins hGetChar, hGetLine, and hGetContents are supposed to do wrt > echoing. Can I rely on them not to echo their inputs? Clearly the report is vague here, so I'll just comment on what GHC does. By default, input from a terminal will echo. The following functions are provided by System.IO (GHC only, not Hugs or NHC), and control terminal echoing: hSetEcho :: Handle -> Bool -> IO () hGetEcho :: Handle -> IO Bool Input from a non-terminal will not echo. GHC's IO library never does any actual echoing itself, it simply gives hints to the OS's terminal API to turn echoing on or off. Cheers, Simon

1 0

Fw: cannot find -lreadline
by Luc Taesch 22 Sep '03

22 Sep '03

sorry, repost. ----- Original Message ----- From: "Luc Taesch" <list(a)taesch.com> To: <glasgow-haskell-users-request(a)haskell.org> Sent: Tuesday, September 16, 2003 8:06 AM Subject: cannot find -lreadline > > > when compiling HaXML with 6.01 on mandrake, I got > /usr/bin/ld: cannot find -lreadline, as detailled hereafter. > > also , when I installed the rpm I also got a message on readline missing, despite it is installed. > > is anybody aware of this issue ? any variable to set ? on mandrale, readline is on /lib/libreadline.so.4.3. what about redhat ? > > thanks , Luc > > > [test@localhost HaXml-1.09]$ rpm -ql readline > /lib/libhistory.so.4 > /lib/libhistory.so.4.1 > /lib/libhistory.so.4.2 > /lib/libhistory.so.4.3 > /lib/libreadline.so.4 > /lib/libreadline.so.4.1 > /lib/libreadline.so.4.2 > /lib/libreadline.so.4.3 > [test@localhost HaXml-1.09]$ > > nstance.hs, ../Text/XML/HaXml/DtdToHaskell/Instance.o ) > Skipping Main ( DtdToHaskell.hs, ./DtdToHaskell.o ) > Linking ... > /usr/bin/ld: cannot find -lreadline > collect2: ld returned 1 exit status > make[1]: *** [../../DtdToHaskell] Error 1 > make[1]: Leaving directory `/home/test/Documents/test/HaXml-1.09/obj/ghc' > make: *** [tools-ghc] Error 2 > >

2 1

E-Cap2004_Italy Call for papers
by Lorenzo Magnani 22 Sep '03

22 Sep '03

CALL FOR PAPERS ********************************************************************** COMPUTING AND PHILOSOPHY E-CAP2004_ITALY Pavia, Italy, Collegio Ghislieri, June 3-5, 2004 ********************************************************************** Up-to date information on the conference will be found at http://www.unipv.it/webphilos_lab/courses/progra2.html ********************************************************************** ALSO NEW !! Conference MODEL-BASED REASONING IN SCIENCE AND ENGINEERING Pavia, December 2004 http://www.unipv.it/webphilos_lab/courses/progra1.html ********************************************************************** GENERAL INFORMATION From Thursday 3 to Saturday 5 June 2004 (three days) the International European Conference ``COMPUTING AND PHILOSOPHY'' will be held at the University of Pavia (near Milan, Italy). GENERAL INFORMATION The Computational Philosophy Laboratory and the Department of Philosophy of the University of Pavia will be hosting the European Computing and Philosophy (CAP) conference from the 3rd to the 5th of June. PROGRAM The conference will deal with all aspects of the "computational turn" that is occurring within the discipline of Philosophy. The Programme Committee are particularly interested in submissions in Cognitive Science, Epistemology and Metaphysics. RELEVANT RESEARCH AREAS We call for papers that cover topics pertaining to computing and philosophy from the following list: * Cognitive Science, Epistemology, and Metaphysics * Abductive reasoning, Scientific discovery, Creative processes * Internal and External Representations in Cognitive Science * Simulation, Embodiment, and Distributed Reasoning in Computational Models of Cognitive * Problem of Consciousness in PhilosophyI * New Models of Logic Software * Computer-based Learning and Teaching Strategies and Resources * Ethics * The Impact of Distance Learning on the Teaching of Philosophy * The Role of Computers as Tools for Philosophical Research SUBMISSIONS OF PAPERS The deadline for submission is 19th December 2003 - though late submissions will be considered. Papers submitted for contributed sessions or poster presentations must not exceed a total word count of 3500 words. Papers must be accompanied by a word count and an abstract of not more than 500 words (to be included in the conference program booklet). Authors may submit only one paper and should submit it in either RTF or PDF format by using the MANAGEMENT SYSTEM (in http://www.unipv.it/cap2004) The MANAGEMENT SYSTEM (Registration, Accommodation, Submissions, Participants and Reviewers) in http://www.unipv.it/cap2004 Conference Email Address: infoCAP04(a)unipv.it in case of problem with the above address please use lmagnani(a)unipv.it or lmagnani(a)cc.gatech.edu or elena(a)acrossevents.com REGISTRATION AND FURTHER INFORMATION (to register please use the Management System, in http://www.unipv.it/cap2004 Registration Fees: Before 15 April 2004: Standard: ? 150,00 (to participate in all the activities of the Conference Reception Included) Phd Students: ? 90,00 Students: Free After 15 April 2004: Standard: ? 180,00 (to participate in all the activities of the Conference Reception Included) Phd Students: ? 110,00 Students: Free One day only: ? 80,00 No refunds will be granted after May 12th, 2004 Terms & Conditions: an administration fee of ? 75,00 will be charged for cancellations confirmed in writing by 12th May. 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. ACCOMMODATION (to book a reservation please use the Management System, in http://www.unipv.it/webphilos_lab/courses/progra2.html) All accomodation is hotel-based with en-suite facilities. Hotel Moderno **** EURO 100,00 (single b&b) EURO 135,00 (double b&b) Hotel Ariston *** EURO 80,00 (single b&b) EURO 110,00 (double b&b) Hotel Excelsior *** EURO 50,00 (single) EURO 73,00 (double) EURO 62,00 (D/S) breakfast EURO 6,00 A very limited number of less expensive rooms is available in the several Colleges (some of them historical) of the ancient University of Pavia. IMPORTANT DATES Submission deadline...........................19 December 2003 Notification of acceptance................... 19 March 2004 Conference................................... 3-5 June 2004 Final papers............................due.. 15 July 2004 PROGRAM CHAIR Lorenzo MAGNANI Professor of Logic and Epistemology 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, lmagnani(a)cc.gatech.edu PROGRAM COMMITTEE (provisional, TO BE UPDATED) - Atocha Aliseda, Instituto de Investigaciones Filosoficas Universidad Nacional Autonoma de Mexico (UNAM), Mexico City, MEXICO e-mail: atocha(a)minerva.filosoficas.unam.mx - Diderik Batens, Centre for Logic and Philosophy of Science, Universiteit Gent, Ghent, Belgium e-mail: Diderik.Batens(a)rug.ac.be - Robert Cavalier, Department of Philosophy, Carnegie Mellon, Pittsburgh, PA, USA e-mail: rc2z(a)andrew.cmu.edu - Simon Colton, Department of Computing, Imperial College London, London, UK e-mail: sgc(a)doc.ic.ac.uk - Roberto Cordeschi, Department of Philosophy, University of Salerno, Salerno , ITALY e-mail: cordeschi(a)caspur.it - Chris Dobbyn, Faculty of Maths and Computing,The Open University,Walton Hall, Milton Keynes MK7 6AA e-mail: c.h.dobbyn(a)open.ac.uk - Roy Dyckhoff, School of Computer Science,University of St Andrews,North Haugh, St Andrews,Fife, KY16 9SS, Scotland e-mail: rd(a)dcs.st-and.ac.uk - Luciano Floridi, Wolfson College, University of Oxford, Oxford, UK and University of Bari,Bari, ITALY e-mail: luciano.floridi(a)philosophy.oxford.ac.uk - Theo Kuypers, Dept. of Philosophy, University of Groningen, Groningen, The Netherlands e-mail: T.A.F.Kuipers(a)philos.rug.nl - Lorenzo Magnani, Department of Philosophy, University of Pavia, Pavia, ITALY and Baruch College, The City University of New York, New York, USA e-mail: lmagnani(a)unipv.it, lmagnani(a)cc.gatech.edu - Nancy J. Nersessian, College of Computing, Georgia Institute of Technology, Atlanta, GA, USA e-mail: nancyn(a)cc.gatech.edu - Claudio Pizzi, Department of Philosophy and Social Sciences, University of Siena, Siena, ITALY e-mail: pizzic@unisi.it,claudiopizzi@everyday.com - Susan Stuart, Humanities Advanced Technology and Information Institute, University of Glasgow, Glasgow, UK e-mail: S.Stuart(a)philosophy.arts.gla.ac.uk - Guglielmo Tamburrini, Department of Philosophy, University of Pisa, Pisa, ITALY e-mail: gugt(a)inwind.it - Riccardo Viale, Fondazione Rosselli,Via San Quintino, 18/c, 10121 Torino, Italy e-mail: riccardo.viale(a)fondazionerosselli.it 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) Alberto Gatti (gatti_alberto(a)hotmail.com) Riccardo Dossena (riki.dox@libero.it),Lorenzo Magnani (lmagnani(a)cc.gatech.edu) Matteo Piazza (pimat(a)yahoo.com) (Department of Philosophy, University of Pavia, Pavia, Italy) IMPORTANT ADDRESSES 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 Email: lmagnani(a)unipv.it also Department of Philosophy, Baruch College, The City University of New York 1 Bernard Baruch Way, New York , NY 10010 Office: +646-312-4364 Fax: +646- 312-4361 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 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 and OLD MALPENSA Airports: 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) For any further information do not hesitate to contact our local organizer, Elena Gandini at elena(a)acrossevents.com

1 0