December 2005 - Haskell

ANNOUNCE: Lambda Shell 0.1
by Robert Dockins 20 Dec '05

20 Dec '05

Fellow Haskellers, I am pleased to announce the first alpha release of Lambda Shell, a shell environment for evaluating terms of the pure, untyped lambda calculus. The Lambda Shell -==================- == What is it? It is a feature-rich shell environment and command-line tool for evaluating terms of the pure, untyped lambda calculus. The Lambda Shell builds on the shell creation framework Shellac, and showcases most of Shellac's features. Features: -- evaluate lambda terms directly from the shell prompt using normal or applicative order. In normal order, one can evaluate to normal form, head normal form, or weak head normal form. -- define aliases for lambda terms using a top level, non-recursive 'let' construct. -- Show traces of term evaluation, or dump the trace to a file -- Count the number of reductions when evaluating terms -- test two lambda terms for confluence (that is; if two terms, when evaluated to normal form, are alpha equivalent) -- programs can be entered from the command line (using the -e option) or piped into stdin (using the -s option) An example session: ------------------------------- $ labmdaShell The Lambda Shell, version 0.1 Copyright 2005, Robert Dockins The Lambda Shell comes with ABSOLUTELY NO WARRANTY; for details type ':nowarranty'. This is free software, and you are welcome to redistribute it under certain conditions; type ':gpl' for details > (\x y. x) (\a. a) (\b. b) \a. a > :load prelude.lam > :show four four = succ three > four \f. \x. f (f (f (f x))) > mul two three \f. \x. f (f (f (f (f (f x))))) > let x = plus six two > x == eight equal > x == nine not equal > :hnf using reduction strategy: head normal form > :showCount show count on > let l = insertSort (cons two (cons three (cons one nil))) > index zero l one 463 reductions > index one l two 2135 reductions > index two l three 5720 reductions > :quit $ ----------------------------------------------- == Why do I care? Because you are a lambda calculus nut, and you just can't get enough. Or, the lambda shell could be a worthwhile teaching tool. The command line features (especially confluence testing) could lend themselves to automatic grading. Also, the lambda shell is a good example of how to write a shell using Shellac. == How is it licensed? The Lambda Shell is licensed under the GNU GPL version 2. See the LICENSE file for details. == How can I get it? darcs get http://www.eecs.tufts.edu/~rdocki01/lambda/ All feedback, suggestions, patches and bug reports are welcome, Robert Dockins

2 1

A simple server (or how to do io).
by Pupeno 20 Dec '05

20 Dec '05

Hello, I have written a simple Daytime sever using network-alt[1] (I am sorry if this is off topic, is it ?) The server is: server port = do runStreamServer (nullStreamServer {handlerSS = sendDaytime, servSS = port}) sendDaytime = handlerWithHandle $ \hs sa -> do putStrLn (show sa) hSetBuffering hs LineBuffering time <- Time.getClockTime hPutStrLn hs (show time) hClose hs It works, but I have the following problems: When I run server "10013" from ghci, the prompt returns immediately and if I do a query to that port I don't get anything, until I go and press enter on ghci and the daytime is sent to the client. Like if the prompt was blocking all IO or something like that. The other problem is that I tried to make a program, so I made DaytimeServer.hs: main = do server "10013" I compile it and run it. It returns immediately and the server of course, is not running. I think what I am missing is that server, after running runStreamServer should block and be able to reply to all the queries (in the final version I'll also have runDgramServer as well) and be able to receive a signal, upon which it should close the socket and finish. How can do that ? Any help will be appreciated. Thank you. -- Pupeno <pupeno(a)pupeno.com> (http://pupeno.com) [1] http://www.cs.helsinki.fi/u/ekarttun/network-alt/ I am currently using the select mode.

2 2

ANNOUNCE: Shellac 0.1
by Robert Dockins 20 Dec '05

20 Dec '05

Fellow Haskellers, I am pleased to announce the first alpha release of Shellac, a shell building library. == What is it? Shellac is a framework for building read-eval-print style shells. Shells are created by declaratively defining a set of shell commands and an evaluation function. Shellac builds on the Haskell readline bindings found in the standard libraries. These bindings reflect the low-level nature of readline and are not very Haskellish. This library attempts to allow users to write shells in at a high-level and still enjoy the advanced features readline provides, like command completion, command history and user-defineable keybindings. == Why do I care? Shellac takes care of much the muckety-muck of writing robust, feature-full shells so you don't have to. == How is it licensed? Shellac is avaliable under a BSD3 license. See the LICENSE file for details. Be aware, however, that the GNU readline library itself is licensed under the GPL. This library will only be useful to you if your project is GPL compatible. == How can I get it? darcs get http://www.eecs.tufts.edu/~rdocki01/shell/ Feedback, suggestions, patches and bug reports are all welcome, Robert Dockins

1 0

New HWN editor sought
by John Goerzen 20 Dec '05

20 Dec '05

Hello everyone, Thanks for the support and encouragement for Haskell Weekly News. However, it's become apparent that HWN is something that I don't really have time for right now. So, I'd like to solicit anybody that would like to take over as HWN editor/maintainer. The job basically requires reading mailing lists and writing summaries of what you see. If nobody steps up, HWN will go on hiatus for an indefinite amount of time. -- John

1 0

TFP2006: Second Call for Papers
by Henrik Nilsson 19 Dec '05

19 Dec '05

Dear Colleague, Please find enclosed the second call for papers for Trends in Functional Programming (TFP) 2006. My apologies for duplicate copies. Best regards, /Henrik -- Henrik Nilsson School of Computer Science and Information Technology The University of Nottingham nhn(a)cs.nott.ac.uk This message has been checked for viruses but the contents of an attachment may still contain software viruses, which could damage your computer system: you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation. TFP 2006 Seventh Symposium on Trends in Functional Programming Nottingham, UK, 19 - 21 April, 2006 http://www.cs.nott.ac.uk/~nhn/TFP2006 Co-located with Types 2006 and Spring School on Datatype-Generic Programming CALL FOR PAPERS The Symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming languages, focusing on providing a broad view of current and future trends in Functional Programming. It aspires to be a lively environment for presenting the latest research results through acceptance by extended abstracts. A formal post-symposium refereeing process then selects the best papers presented at the symposium for publication in a high-profile volume. TFP 2006 is going to be held in Nottingham, UK, 19 - 21 April. Note that this is significantly earlier in the year than past TFPs that generally were held in August - September. TFP 2006 is co-located with Types 2006 (18 - 21 April). The TFP symposium is the successor to the successful series of Scottish Functional Programming Workshops. Previous TFP symposia were held in Edinburgh, Scotland in 2003, in Munich, Germany in 2004, and in Tallinn, Estonia in 2005 (co-located with ICFP and GPCE). For further general information about TFP, see http://www.tifp.org/. SCOPE OF THE SYMPOSIUM The Symposium recognises that new trends may arise through various routes. As part of the Symposium's focus on trends we therefore identify the following five categories of paper. High-quality papers are solicited in any of these categories: Research Papers: leading-edge, previously unpublished research work Position Papers: on what new trends should or should not be Project Papers: descriptions of recently started new projects Evaluation Papers: what lessons can be drawn from a finished project Overview Papers: summarising work with respect to a trendy subject Papers must be original, and not submitted for simultaneous publication in any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or more experience-oriented. Also applications of functional programming techniques to other languages may be considered. Papers on the following subject areas are particularly welcome: o dependently typed functional programming o validation and verification of functional programs o debugging for functional languages o functional programming and security o functional programming and mobility o functional programming and formally motivated computing o functional languages for telecommunications applications o functional languages for embedded systems o functional programming applied to global computing o functional GRIDs o functional languages for reasoning about imperative/object- oriented programs o interoperability with imperative programming languages o any new emerging trend in the functional programming area If you are in doubt on whether your paper is within the scope of TFP, please contact the TFP 2006 programme chair, Henrik Nilsson, nhn(a)cs.nott.ac.uk. BEST STUDENT PAPER AWARD TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. To acknowledge this, a prize for the best student paper is awarded each year. CO-LOCATION WITH TYPES 2006 AND DATATYPE-GENERIC PROGRAMMING 2006 TFP 2006 is co-located with Types 2006 (to be held 18 - 21 April). To take advantage of the synergies offered by these two complementary events, we will invite a number of joint keynote speakers, hold joint sessions on topics of mutual interest, such as dependently typed functional programming, and run common social events. The schedule will be arranged so that participants may freely move between parallel sessions of the two events. See http://www.cs.nott.ac.uk/types06/ for further details. TFP 2006 and Types 2006 are immediately followed by the Spring School on Datatype-Generic Programming 2006 (24 - 27 April), which should be of direct interest to many of the TFP and Types Participants. See http://www.cs.nott.ac.uk/ssdgp2006/ for further details. SUBMISSION AND LOCAL PROCEEDINGS Acceptance to the symposium is by extended abstracts of between 6 and 10 pages. Accepted abstracts are to be completed to full papers before the symposium for publication in the local symposium proceedings and on-line. Important dates: Deadline for abstract submission: 17 February, 2006 Notification of acceptance: 27 February, 2006 Registration deadline: 17 March, 2006 Camera-ready copy of full paper: 24 March, 2006 The submission must clearly indicate to which category it belongs: research, position, project, evaluation or overview paper. It should also indicate whether the main author or authors are research students. Abstracts and full papers must be written in English. Papers for the symposium proceedings must adhere to the formatting instructions provided on the TFP 2006 site. Papers must not exceed 16 pages; papers in some categories may comprise considerably fewer pages. The papers of the local proceedings will also be made available on-line under the following conditions, with which all authors are asked to agree: The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder. See the TFP 2006 website for further instructions to authors and details on how to submit. POST SYMPOSIUM REFEREEING AND PUBLICATION In addition to the local symposium proceedings, we intend to continue the TFP tradition of publishing a high-quality subset of contributions in the Intellect series on Trends in Functional Programming (see http://www.intellectbooks.co.uk/series.php?series=1) All TFP authors will be invited to submit revised papers after the symposium. These will will be refereed to normal conference standards, and a subset of the best papers over all categories will be selected for publication. Papers will be judged on their contribution to the research area, with appropriate criteria applied to each category of paper. Papers submitted for publication by Intellect must follow formatting and any other instructions provided by the Programme Chair. For TFP 2005, in order to enhance the quality of student submissions, a process where student papers were given extra feedback was tried out. A similar process might be put in place for this TFP, contingent on the outcome of that trial. ORGANISATION Symposium Chair: Marko van Eekelen, Radboud University Nijmegen, NL Programme Chair: Henrik Nilsson, University of Nottingham, UK Treasurer: Greg Michaelson, Heriot-Watt University, UK Local Arrangements: Joel Wright, University of Nottingham, UK PROGRAMME COMMITTEE: o Kenichi Asai, Ochanomizu University o Gilles Barthes, INRIA, Sophia Antipolis o Olaf Chitil, University of Kent at Canterbury o Catherine Dubois, IIE, Evry o Marko van Eekelen, Radboud Universiteit Nijmegen o Jeremy Gibbons, Oxford University o Kevin Hammond, University of St Andrews o Zoltán Horváth, Eötvös Loránd University o Frank Huch, Christian-Albrechts-University of Kiel o Johan Jeuring, Universiteit Utrecht o Greg Michaelson, Heriot-Watt University o Henrik Nilsson, University of Nottingham o Ricardo Peña, Universidad Complutense de Madrid o Morten Rhiger, Roskilde University o Colin Runciman, University of York o Carsten Schürmann, IT University of Copenhagen o Zhong Shao, Yale University o Phil Trinder, Heriot-Watt University SPONSORS We are actively looking for additional TFP sponsors, who may help to subsidise attendance by research students, for example. If you or your organisation might be willing to sponsor TFP, or if you know someone who might be willing to do so, please do not hesitate to contact the Symposium chair: Marko van Eekelen. Your students will be grateful!

1 0

CFP: International Workshop on Hybrid Logic 2005 (HyLo 2006)
by Carlos Areces 19 Dec '05

19 Dec '05

******************************************************************* FIRST CALL FOR PAPERS International Workshop on Hybrid Logic 2006 (HyLo 2006) Affiliated with LICS 2006 August 11, 2006, Seattle, USA ******************************************************************* AIMS AND SCOPE: Hybrid logic is a branch of modal logic in which it is possible to directly refer to worlds/times/states or whatever the elements of the (Kripke) model are meant to represent. Although they date back to the late 1960s, and have been sporadically investigated ever since, it is only in the 1990s that work on them really got into its stride. It is easy to justify interest in hybrid logic on applied grounds, because of the usefulness of the additional expressive power. For example, when reasoning about time one often wants to build up a series of assertions about what happens at a particular instant,and standard modal formalisms do not allow this. What is less obvious is that the route hybrid logic takes to overcome this problem (the basic mechanism being to add nominals --- atomic symbols true at a unique point --- together with extra modalities to exploit them) often actually improves the behavior of the underlying modal formalism. For example, it becomes far simpler to formulate modal tableau, resolution, and natural deduction in hybrid logic, and completeness and interpolation results can be proved of a generality that is not available in orthodox modal logic. Hybrid logic is now a mature field, therefore a theme of special interest at this HyLo workshop will be the combination of hybrid logic with other logics, the basic methodological question being "what is the best way of hybridizing a given logic?" However, submissions in all areas of hybrid logic are welcome. The workshop HyLo 2006 is likely to be relevant to a wide range of people, including those interested in description logic, feature logic, applied modal logics, temporal logic, and labelled deduction. The workshop continues a series of previous workshops on hybrid logic, for example the LICS-affiliated HyLo 2002 (http://floc02.diku.dk/HYLO) which was held as part of FLoC 2002, Copenhagen, Denmark. If you are unsure whether your work is of relevance to the workshop, please do not hesitate to contact the workshop organizers for more information. Contact details are given below. For more general background on hybrid logic, and many of the key papers, see the Hybrid Logics homepage (http://hylo.loria.fr/) PROGRAM COMMITTEE: Carlos Areces (INRIA Lorraine, France) Patrick Blackburn (INRIA Lorraine, France) Thomas Bolander (Technical University of Denmark) Torben Braüner (Roskilde University, Denmark) --- Chair Valeria de Paiva (PARC, USA) Melvin Fitting (Lehman College, New York, USA) Balder ten Cate (University of Amsterdam, The Netherlands) Jørgen Villadsen (Roskilde University, Denmark) SUBMISSIONS: We invite the contribution of papers reporting new work from researchers interested in hybrid logic. Details about the submission procedure will be announced in the second call for papers (note that the dates below are tentative). The workshop proceedings have been accepted for publication in ENTCS (http://www.elsevier.com/locate/entcs/) A preliminary version of the proceedings will also be distributed at the workshop. One author for each accepted paper must attend the workshop in order to present the paper. IMPORTANT DATES (TENTATIVE): Deadline for submissions: May 26, 2006 Notification of acceptance: June 23, 2006 Deadline for final versions: July 21, 2006 CONTACT DETAILS: See the workshop homepage (http://hylomol.ruc.dk/HyLo2006) for further information. Please send all correspondence regarding the workshop to the organizers: Patrick Blackburn http://www.loria.fr/~blackbur/ Thomas Bolander http://www.imm.dtu.dk/~tb/ Torben Braüner --- Chair http://www.ruc.dk/~torben/ Valeria de Paiva http://www.cs.bham.ac.uk/~vdp/ Jørgen Villadsen http://www.ruc.dk/~jv/

1 0

Using MonadError within other Monads
by Karl Grapone 18 Dec '05

18 Dec '05

Hi, I'm having trouble making use of MonadError within another Monad, in this case IO. I've blundered around for a while, trying various combinations of things, but I don't think I've fully cottoned-on to nesting of monads. Following is some code which does not compile, but hopefully shows you what my intentions are. I'd appreciate it if someone could show me how to use the nested monads in this situation. Thanks. module Test where import Control.Monad.Error import Data.Char import System.IO instance Error Int where noMsg = 1 strMsg = length f :: IO (Either String String) f = do n <- readLn if n == 2 then return $ throwError "I don't like strings with 2 characters." else do s <- mapErrs2 (g n) putStrLn s g :: Int -> IO (Either String String) g 0 = throwError "I won't do zero length strings." g 1 = do c <- getChar c' <- mapErrs (h c) return [c'] g n = do c <- getChar cs <- g (n-1) c' <- mapErrs (h c) return (c':cs) h :: Char -> Either Int Char h c | isUpper c = throwError 200 | otherwise = return $ toUpper c mapErrs :: Either Int Char -> Either String Char mapErrs (Right c) = Right c mapErrs (Left 200) = Left "The String contained uppercase characters." mapErrs (Left i) = Left ("Unrecognised failure in h, code = " ++ (show i)) mapErrs2 :: Either String String -> Either String String mapErrs2 (Right s) = Right s mapErrs2 (Left e) = Left ("g Error: " ++ e)

1 0

AMAST06 CFP (Feb closing date)
by Michael Johnson 18 Dec '05

18 Dec '05

CALL FOR PAPERS 11th International Conference on Algebraic Methodology and Software Technology, AMAST '06 colocated with MPC '06 Kuressaare, Estonia, 5-8 July 2006 http://cs.ioc.ee/mpc-amast06/amast/ Background The major goal of the AMAST conferences is to promote research that may lead to the setting of software technology on a firm, mathematical basis. This goal is advanced by a large international cooperation with contributions from both academia and industry. The virtues of a software technology developed on a mathematical basis have been envisioned as being capable of providing software that is (a) correct, and the correctness can be proved mathematically, (b) safe, so that it can be used in the implementation of critical systems, (c) portable, i.e., independent of computing platforms and language generations, and (d) evolutionary, i.e., it is self-adaptable and evolves with the problem domain. The previous conferences were held in Iowa City, Iowa, USA (1989, 1991 and 2000), Twente, The Netherlands (1993), Montreal, Canada (1995), Munich, Germany (1996), Sydney, Australia (1997), Manaus, Amazonia, Brazil (1998), Reunion Island, France (2002) and Stirling, UK (2004, colocated with MPC' 04). The 2006 conference will be held at Kuressaare, Estonia, colocated with MPC '06. The conference series has become widely known for disseminating academic and industrial achievements within the broad AMAST areas of interest. Through these meetings AMAST has attracted an international following among researchers and practitioners interested in software technology, programming methodology and their algebraic and logical foundations. Important dates * Submission of abstracts: 27 January 2006 * Submission of full papers: 3 February 2006 * Notification of authors: 17 March 2006 * Camera-ready version: 14 April 2006 Topics Topics of interest include, but are not limited to, the following: SOFTWARE TECHNOLOGY: * systems software technology * application software technology * concurrent and reactive systems * formal methods in industrial software development * formal techniques for software requirements, design * evolutionary software/adaptive systems PROGRAMMING METHODOLOGY: * logic programming, functional programming, object paradigms * constraint programming and concurrency * program verification and transformation * programming calculi * specification languages and tools * formal specification and development case studies ALGEBRAIC AND LOGICAL FOUNDATIONS: * logic, category theory, relation algebra, computational algebra * algebraic foundations for languages and systems, coinduction * theorem proving and logical frameworks for reasoning * logics of programs * algebra and coalgebra SYSTEMS AND TOOLS (for system demonstrations or ordinary papers): * software development environments * support for correct software development * system support for reuse * tools for prototyping * component based software development tools * validation and verification * computer algebra systems * theorem proving systems Submission Two kinds of submissions are solicited for this conference: technical papers and system demonstrations. Papers may report academic or industrial progress, and papers which deal with both are especially well-regarded. Submission is in two stages. Abstracts (plain text) must be submitted by 27 January 2006. Full papers (pdf) adhering to the llncs style and not longer than 15 pages (6 pages for system demonstrations) must be submitted by 3 February 2006. The web-based submission system will open in early January 2006. Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Accepted papers must be presented at the conference by one of the authors. All papers will be refereed by the programme committee, and will be judged based on their significance, technical merit, and relevance to the conference. Publication As in the past the proceedings of AMAST '06 will be published in the Lecture Notes in Computer Science series of Springer-Verlag. In the past the best papers from AMAST have been published in a special issue of the journal Theoretical Computer Science and it is expected that this practice will be continued for AMAST '06. Programme Committee Chairs Michael Johnson, Macquarie University (co-chair) Varmo Vene, University of Tartu (co-chair) AMAST steering committee Egidio Astesiano, Universita degli Studi di Genova Robert Berwick, MIT Zohar Manna, Stanford University Michael Mislove, Tulane University Anton Nijholt, University of Twente Maurice Nivat, Universite Paris 7 Charles Rattray, University of Stirling Teodor Rus, University of Iowa Giuseppe Scollo, Universita degli Studi di Verona Michael Sintzoff, Universite Catholique de Louvain Jeannette Wing, Carnegie Mellon University Martin Wirsing, Ludwig-Maximilians-Universitaet Muenchen Michael Johnson, Macquarie University (chair) Venue Kuressaare (pop. 16000) is the main town on Saaremaa, the second-largest island of the Baltic Sea. Kuressaare is a charming seaside resort on the shores of the Gulf of Riga highly popular with Estonians as well as visitors to Estonia. The scientific sessions of MPC/AMAST 2006 will take place at Saaremaa Spa Hotel Meri, one among the several new spa hotels in the town. The social events will involve a number of sites, including the 14th-century episcopal castle. Accommodation will be at Saaremaa Spa Hotels Meri and Ruutli. To get to Kuressaare and away, one must pass through Tallinn (pop. 402000), Estonia's capital city. Tallinn is famous for its picturesque medieval Old Town, inscribed on UNESCO's World Heritage List. Local organizers MPC/AMAST 2006 is organized by Institute of Cybernetics, a research institute of Tallinn Univ. of Technology. The local organizers are Tarmo Uustalu (chair), Monika Perkmann, Juhan Ernits, Ando Saabas, Olha Shkaravska, Kristi Uustalu. Contact email addresses: mike(at)ics.mq.edu.au, varmo(at)cs.ut.ee.

1 0

Auxilliary files in Cabal distributions
by Paul Johnson 17 Dec '05

17 Dec '05

I want to build a distribution .tgz file using Cabal, and it includes all the files required for the build just fine and creates a tar file with the necessary files. But there doesn't seem to be a way to put in the README or LICENSE or other similar files. Could this be added? Or have I missed something. Paul.

1 0

ESSLLI 2006: List of Courses
by Carlos Areces 16 Dec '05

16 Dec '05

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 18th European Summer School in Logic, Language and Information ESSLLI 2006 31 July - 11 August, 2006, Malaga, Spain http://esslli2006.lcc.uma.es %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% LIST OF ACCEPTED COURSES AND PRELIMINARY PROGRAMM ------------------------------------------------- The European Summer School in Logic, Language and Information (ESSLLI) is organized every year by the Association for Logic, Language and Information (FoLLI, http://www.folli.org) in different sites around Europe. The main focus of ESSLLI is on the interface between linguistics, logic and computation. ESSLLI offers foundational, introductory and advanced courses, as well as workshops, covering a wide variety of topics within the three areas of interest: Language and Computation, Language and Logic, and Logic and Computation. Previous summer schools have been highly successful, attracting up to 500 students from Europe and elsewhere. The school has developed into an important meeting place and forum for discussion for students and researchers interested in the interdisciplinary study of Logic, Language and Information. LIST OF ACCEPTED COURSES AND PRELIMINARY PROGRAM: Language and Computation: ~~~~~~~~~~~~~~~~~~~~~~~~ Week 1 * Resource-Scarce Language Engineering, by Edward Garrett (Workshop) * Introduction to Corpus Resources, Annotation and Access, by Sabine Schulte im Walde and Heike Zinsmeister (Foundational Course) * Introduction to Symbolic and Statistical NLP in Scheme, by Damir Cavar (Introductory Course) * Data-Driven Methods for Acquiring Linguistic Information, by Timothy Baldwin and Aline Villavicencio (Introductory Course) * An Empirical View on Semantic Roles Within and Across Languages, by Katrin Erk and Sebastian Pado (Introductory Course) * Treebank-Based Acquisition of LFG, HPSG and CCG Resources, by Josef van Genabith, Julia Hockenmaier and Yusuke Miyao (Advanced Course) * Semantic Domains in Natural Language Processing, by Alfio Gliozzo and Carlo Strapparava (Advanced Course) Week 2 * Modelling Coherence for Generation and Dialogue Systems, by Rodger Kibble, Paul Piwek and Ielka van der Sluis (Workshop) * Computational Morphology, by Kemal Oflazer (Foundational Course) * Counting Words: An Introduction to Lexical Statistics, by Marco Baroni and Stefan Evert (Introductory Course) * Computational Semantics: Linking Language Processing to Applications, by Ann Copestake and Dan Flickinger (Introductory Course) * Word Sense Disambiguation, by Rada Mihalcea (Introductory Course) * Implementing Argument Alternations, by Miriam Butt and Tracy Holloway King (Advanced Course) * Argument Structure, by Markus Egg and Valia Kordoni (Advanced Course) * Probabilistic Methods in Computational Psycholinguistics, by Roger Levy (Advanced Course) * Machine Learning and Dialogue, by James Henderson and Oliver Lemon (Advanced Course) Logic and Computation: ~~~~~~~~~~~~~~~~~~~~~~ Week 1 * Proof Theory and Deep Inference, by Alessio Guglielmi (Foundational Course) * Introduction to Automated Reasoning, by Hans De Nivelle and Peter Baumgartner (Foundational Course) * Specifying and Proving in Maude, by Manuel Clavel and Narciso Marti-Oliet (Introductory Course) * Modal Logics for Multi-Agent Systems, by Valentin Goranko and Wojciech Jamroga (Introductory Course) * Expressiveness of Temporal Logics, by François Laroussinie and Nicolas Markey (Introductory Course) * The Modal Mu-Calculus, by Yde Venema (Introductory Course) * Logics for Quantum Information Flow, by Alexandru Baltag and Sonja Smets (Advanced Course) * Approximate Reasoning for the Semantic Web, by Pascal Hitzler, Frank van Harmelen and Holger Wache (Advanced Course) * Coalgebras, Modal Logic, Stone Duality, by Alexander Kurz (Advanced Course) Week 2 * Workshop on Logics for Resource Bounded Agents, by Natasha Alechina and Thomas Ågotnes (Workshp) * Rationality and Knowledge, by Sergei Artemov and Rohit Parikh (Workshop) * Verification of Infinite State Systems, by Angelo Montanari and Gabriele Puppis (Introductory Course) * Proof Nets and the Identity of Proofs, by Lutz Strassburger (Introductory Course) * Semantics of Higher-Order Logic, by Chad Brown and Chris Benzmueller (Advanced Course) * Logical and Meta-Logical Frameworks, by Carsten Schuermann (Advanced Course) * Logic and Computation in Finitely Presentable Infinite Structures, by Valentin Goranko and Sasha Rubin (Advanced Course) Language and Logic: ~~~~~~~~~~~~~~~~~~ Week 1 * Formal Ontologies for Communicating Agents, by Roberta Ferrario and Nicola Guarino (Workshop) * On Logic and Language, by Raffaella Bernardi and Patrick Blackburn (Foundational Course) * Natural Language Quantifiers, by Nouwen, Rick (Introductory Course) * Working with Discourse Representation Theory, by Patrick Blackburn and Johan Bos (Introductory Course) * Mereology for Linguists, by Christopher Piñón (Introductory Course) * From Syntactic Structures to Logical Semantics, by Christian Retoré and Alexandre Dikovsky (Advanced Course) * Temporal Anaphora in Tenseless Languages, by Maria Bittner (Advanced Course) * Linear Logic, Linguistic Resource Sensitivity and Resumption, by Ash Asudeh (Advanced Course) Week 2 * Ambiguity in Anaphora, by Ron Artstein and Massimo Poesio (Workshop) * Concord Phenomena and the Syntax Semantics Interface, by Paul Dekker and Hedde Zeijlstra (Workshop) * Parsing, by Eric de la Clergerie (Foundational Course) * Proofs, Evidence, Knowledge, by Sergei Artemov (Introductory Course) * Signalling Games and Pragmatics, by Anton Benz (Introductory Course) * Higher Order Grammar, by Carl Pollard (Introductory Course) * Anaphora resolution: Theory and Practice, by Annie Zaenen (Advanced Course) * Applications and Extensions of Dynamic Semantics, by Nicholas Asher (Advanced Course) PROGRAM COMMITTEE: Chair: Carlos Areces INRIA Lorraine. 615, rue du Jardin Botanique 54602 Villers les Nancy Cedex, France phone : +33 (0)3 83 58 17 90 fax : +33 (0)3 83 41 30 79 e-mail : carlos.areces (at) loria.fr www : http://www.loria.fr/~areces Local co-chair: Manuel Diaz Area Specialists: Larry Moss and Gerhard Jaeger (Logic and Language) Valeria de Paiva and Juan Jose Moreno Navarro (Logic and Computation) Philip Miller and Anette Frank (Language and Computation) ORGANIZING COMMITTEE: Ernesto Pimentel (chair) FURTHER INFORMATION: To obtain further information, visit the ESSLLI site at http://esslli2006.lcc.uma.es/. For this year's summer school, please see the web site at http://www.macs.hw.ac.uk/esslli05.

1 0