- Haskell - Haskell.org

RE: [Haskell] IO, exceptions and error handling
by Tim Docker 14 Jun '04

14 Jun '04

Keith Wansbrough wrote: > Read the paper _A Semantics for Imprecise Exceptions_. The > problem is that the evaluation order of Haskell would have to > be fixed for this not to lose referential transparency. What > is the value of > > catchExcept (show (makeExcept "E1" + makeExcept "E2")) > (\x -> x) > > ? Haskell wouldn't be "purely functional" any more. As Graham Klyne indicated in a previous mail, in practice there are two ways of dealing with errors in purely functional code: - capture possible errors in the result type. This will probably force the use of a monad, with the subsequent sequencing of operation and coding style. - throw an exception, and hence be unable to recover from errors outside the IO monad. Both of these approaches seem fairly "invasive" in their effect on the code. Are people using haskell for real world tasks happy with having to choose from these? The former is more general, but any function that needs to be able to fail or propagate failure will end up being a do {} block. Tim

2 1

Soft2004 workshop CFP
by Stefano Bistarelli 14 Jun '04

14 Jun '04

============================================================================ ======= 6th International Workshop on Soft Constraints and Preferences September 27th, 2004 Toronto, Canada Held in conjunction with 10th International Conference on Principles and Practice of Constraint Programming, CP2004 http://www.sci.unich.it/~bista/organizing/soft-2004/ ============================================================================ ======== Call for Paper ============================================================================ ======== Preferences are ubiquitous in real life: most problems are over-constrained and would not be solvable if we insist that all their requirements are strictly met. Moreover, many problems are more naturally described via preference rather than hard statements. Soft constraints are the way the constraint community has extended his classical framework to deal with the conceept of preferences. However, other frameworks for expressing preferences have been proposed in the last few years in AI or related disciplines, with different features and leading to different results. For example, both qualitative and quantitative preference frameworks are being studied and used to model and solve real-life probleems. This workshop would like to bring together researchers interested in all aspects of preferences and soft constraints, such as: - theoretical frameworks - problem modeling - solving algorithms - languages - preference aggregation - preference elicitation - multi-objective or qualitative optimization - combining/integrating different frameworks and algorithms - comparative studies - real-life applications Submissions This workshop is intended to build on the experience and success of the workshops on soft constraints that have been held at CP99, CP2000, CP2001, CP2002 and CP2003, and on the AAAI 2002 workshop on preferences in AI and CP. Its aim is to provide a forum where researchers currently working in the area of preferences or soft constraints can discuss their most recent ideas and developments and think together about the most promising new directions. Therefore we encourage the presentation of work in progress or on specialized aspects of soft constraints. Papers that bridge the gap between theory and practice are especially welcome. Prospective attendees can submit a paper, which can be up to 15 pages in length. We encourage authors to submit papers electronically in postscript or pdf format. Papers should be formatted using the Lecture Notes in Computer Science (LNCS) style. Please send your submissions by email to stefano.bistarelli(a)iit.cnr.it using the subject line Soft-2004 Workshop Submission. Although no agreement is yet in place, we will consider the publication of a selection of papers presented at this workshop in a special issue of a journal or in a volume of a serie. Important Dates The proposed schedule of important dates for the workshop is as follows: Paper Submission deadline June 26th Notification of acceptance July 24th Camera-ready version deadline August 14th Workshop Date September 27th Workshop Organizers: Stefano Bistarelli (Primary Contact) Dipartimento di Scienze Università degli studi "G. D'Annunzio" di Chieti-Pescara, Italy Email: bista(a)sci.unich.it Web: http://www.sci.unich.it/~bista/ and Istituto di Informatica e Telematica C.N.R. Pisa, Italy Email: stefano.bistarelli(a)iit.cnr.it and Francesca Rossi Dipartimento di Matematica Pura ed Applicata Universita' degli Studi di Padova, Italy Email: frossi(a)math.unipd.it Web: http://www.math.unipd.it/~frossi/ Program Committee: Stefano Bistarelli (University of Pescara, Italy --- C.N.R., Pisa, Italy) Simon De Givry (Institut National de La Recherche Agronomique, Castanet Tolosan Cedex, France) Boi Faltings (EPFL, Switzerland) Carmen Gervet (IC-Parc, Imperial College, UK) Ulrich Junker (ILOG, France) Javier Larrosa (Universitat Politècnica de Catalunya, UPC, Barcelona, Spain) Jimmy H. M. Lee (The Chinese University of Hong Kong, Hong Kong) Pedro Meseguer (IIIA-CSIC, Bellaterra, Spain) Barry O'Sullivan (University College Cork, Ireland) Francesca Rossi (University of Padova, Italy) Thomas Schiex (Institut National de La Recherche Agronomique, Castanet Tolosan Cedex, France) Toby Walsh (Cork Constraints Computation Centre, Ireland)

1 0

Re: [Haskell] IO question
by b.i.mills＠massey.ac.nz 12 Jun '04

12 Jun '04

While what I want to say has implicitly been said I'd just like to suggest that there is a simple way to put the whole matter less cryptically. The "obvious" question that just about anyone starting with the IO monad asks is how can I write (IO a -> a)? The "simple" answer is, you don't have to because you can use (>>=) with something (a -> b) to write (IO a -> IO b). That is, if you are dealing with an IO operation, you must always think in terms of the complete read-modify-write sequence. <personal> This requires you to think explicitly about the temporal nature of your code, but I see the strength of the IO monad as being exactly that, it forces you to be explicit. For me writing (IO a -> a) is logically non-sensical, you have just broken the semantics of IO, that's all. I know what (IO a -> a) is, because I know that the Haskell language is not the whole universe. But, it is like *(int *)(&x) in C, the meaning depends on the implimentation of the language, outside the semantics of the language per se. </personal> Regards, Bruce.

1 0

Errata to the Revised Haskell 98 Report
by Simon Peyton-Jones 11 Jun '04

11 Jun '04

Gentle Haskellers It's pleasing that there have been so few bug reports about the Revised Haskell 98 report, which was published in January 2003. But there have been some: see http://research.microsoft.com/~simonpj/haskell98-revised/haskell98-revis ed-bugs.html and every now and again another one comes up. Malcolm Wallace has kindly agreed to take over custody of this errata list. There's no current plan to do more than keep a list of errors, but if any genuine ambiguities are found, he'll start a discussion to try to nail them down. Thanks Malcolm! Simon

1 0

IO question
by Tom Hofte 11 Jun '04

11 Jun '04

Hi, I have an question about the IO monad I want to have a function that unpack an IO. I should have the type: IO a -> a. Is this possible? Kind regards Tom Hofte

6 6

topology in Haskell
by Martin Escardo 11 Jun '04

11 Jun '04

Dear Haskell-list members, This is to advertise the monograph Synthetic topology of data types and classical spaces, to appear in ENTCS 87, 150pp, three parts, 6+5+2 chapters. http://www.cs.bham.ac.uk/~mhe/papers/entcs87.pdf (or .dvi or .ps) Chapter 3 develops topology in Haskell, without assuming any previous knowledge of topology. Notions of topology such as space, continuous map, open set, closed set, discrete space, Hausdorff space, compact space are defined directly in the programming language. Theorems in topology are proved by writing programs. The development here is purely operational. This gives some surprising results, e.g. that the type ((Int->Bool)->Int) has decidable equality (for total elements). Chapter 12 has more sophisticated computational applications, which invoke classical topology with the aid of denotational semantics. We apply the Tychonoff theorem of classical topology to show that a certain (we hope surprising) Haskell program has the correct termination properties. Martin Escardo

2 2

Implicit parameters
by Per Larsson 09 Jun '04

09 Jun '04

When using implicit parameters I have noticed (at least for me) a rather puzzling behaviour with GHC and Hugs. Given the declarations data Env = Env {numlines :: Int, numcols :: Int} initEnv = Env {numlines = 0, numcols = 1} withEnv :: ((?env :: Env) => IO a) -> IO a withEnv io = let ?env = initEnv in io I can write code like: main = withEnv (do let lines = numlines ?env putStrLn ("Initial number of lines is " ++ (show lines))) which works as expected, but the version below main = withEnv $ do let lines = numlines ?env putStrLn ("Initial number of lines is " ++ (show lines)) is not accepted by either GHC or Hugs! Is this a bug or have stumbled into a context where it actually matters if you use '$' or explicit grouping with parentheses? Per Larsson

2 1

Re: how to write a list builder? fixpoint?
by oleg＠pobox.com 08 Jun '04

08 Jun '04

> 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"? Yes, in the format very close to desired. > {-# OPTIONS -fglasgow-exts #-} > {-# OPTIONS -fallow-undecidable-instances #-} > > module Foo where > > class BuildList a r | r-> a where > build' :: [a] -> a -> r > > instance BuildList a [a] where > build' l x = reverse$ x:l > > instance BuildList a r => BuildList a (a->r) where > build' l x y = build'(x:l) y That's it. It works both on GHC and Hugs. *Foo> build' [] True :: [Bool] [True] *Foo> build' [] True False :: [Bool] [True,False] *Foo> build' [] True False False :: [Bool] [True,False,False] *Foo> build' [] 'a' 'b' 'c' 'd' 'e' :: [Char] "abcde" *Foo> build' [] (1::Int) :: [Int] [1] *Foo> build' [] (1::Int) (2::Int) :: [Int] [1,2] *Foo> build' [] (1::Int) (2::Int) (3::Int) :: [Int] [1,2,3] Note that the type annotation [Bool] etc. at the end is required: it is the delimiter of the list. Who would have thought that the type annotation can play the role of Nil...

2 5

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