January 2005 - Haskell

RE: [Haskell] Typeable and Data instances for Double, FiniteMap, ...
by Simon Peyton-Jones 18 Jan '05

18 Jan '05

| I was playing around with "Scap you Boilerplate" and realised some missing instances of Typeable and | Data. Is there a particular reason why there is no Data Double instance? | Furthermore I was wondering why no instance for the collection types such as FiniteMap, Set and | HashTable is provided. At the end of the mail [1] there is my implementation of instances for at least | Double and FiniteMap. I've asked Ralf if he'll add them. | Apart from that I looked at the library source-code (GHC) and reallised that there is really much | documenting comments in, but which are not Haddock comments. Again I don't understand that. Is | the programmer supposed to look at the source-code rather the API documentation? It should be Haddock'd. We'd be delighted if anyone was willing to transfer code in comments to Haddock comments, where that is appropriate, and probably add new Haddock comments where necessary. Any volunteers? We'd give CVS access... Simon

1 0

signature of when, unless
by Frederik Eaton 18 Jan '05

18 Jan '05

Wouldn't it be more useful if the type was when :: Monad m => Bool -> m a -> m () not when :: Monad m => Bool -> m () -> m () ...? Frederik

2 1

ANN: Cabal 0.4
by Isaac Jones 17 Jan '05

17 Jan '05

The Haskell Cabal The Common Architecture for Building Applications and Libraries. http://www.haskell.org/cabal IMPORTANT INFORMATION: See both the README file and the changelog for important interface changes. DOWNLOAD: The Haskell Cabal has reached pre-release stage, with a 0.4 version The community should use this release to evaluate the interfaces and explore the concepts of these tools. Download the Cabal here (source and debian versions available): http://www.haskell.org/cabal/download.html BUGS: Please report bugs and wish-list items to libraries(a)haskell.org and Isaac Jones: ijones(a)syntaxpolice.org. ABOUT: The Haskell Cabal is meant to be a part of a larger infrastructure for distributing, organizing, and cataloging Haskell Libraries and Tools. It is an effort to provide a framework for developers to more effectively contribute their software to the Haskell community. Specifically, the Cabal describes what a Haskell package is, how these packages interact with the language, and what Haskell implementations must to do to support packages. The Cabal also specifies some infrastructure (code) that makes it easy for tool authors to build and distribute conforming packages. The Cabal is only one contribution to the larger goal. In particular, the Cabal says nothing about more global issues such as how authors decide where in the module name space their library should live; how users can find a package they want; how orphan packages find new owners; and so on. NOTES: You cannot currently execute the setup scripts with "./Setup.lhs" since Cabal Hugs support isn't ready-for-prime-time. You can compile it with ghc thusly: "ghc -package Cabal Setup.lhs -o setup" and then use the "setup" executable after that. This release is meant to provide the community with concrete information about how the interfaces are shaping up. This release does NOT fix the interfaces, we can't promise not to break anything that relies on these interfaces. We hope that Haskell authors will try to package their software using these tools, and let us know where they fall short. MORE INFORMATION: Please see the web site for the source code, interfaces, and especially the proposal, which will serve as documentation for this release: http://www.haskell.org/cabal/ ------------------------------------------------------------ -*-change-log-*- 0.4 Isaac Jones <ijones(a)syntaxpolice.org> Sun Jan 16 2005 * Much thanks to all the awesome fptools hackers who have been working hard to build the Haskell Cabal! * Interface Changes: ** WARNING: this is a pre-release and the interfaces are still likely to change until we reach a 1.0 release. ** Instead of Package.description, you should name your description files <something>.cabal. In particular, we suggest that you name it <packagename>.cabal, but this is not enforced (yet). Multiple .cabal files in the same directory is an error, at least for now. ** ./setup install --install-prefix is gone. Use ./setup copy --copy-prefix instead. ** The "Modules" field is gone. Use "hidden-modules", "exposed-modules", and "executable-modules". ** Build-depends is now a package-only field, and can't go into executable stanzas. Build-depends is a package-to-package relationship. ** Some new fields. Use the Source. * New Features ** Cabal is now included as a package in the CVS version of fptools. That means it'll be released as "-package Cabal" in future versions of the compilers, and if you are a bleeding-edge user, you can grab it from the CVS repository with the compilers. ** Hugs compatibility and NHC98 compatibility should both be improved. ** Hooks Interface / Autoconf compatibility: Most of the hooks interface is hidden for now, because it's not finalized. I have exposed only "defaultMainWithHooks" and "defaultUserHooks". This allows you to use a ./configure script to preprocess "foo.buildinfo", which gets merged with "foo.cabal". In future releases, we'll expose UserHooks, but we're definitely going to change the interface to those. The interface to the two functions I've exposed should stay the same, though. ** ./setup haddock is a baby feature which pre-processes the source code with hscpp and runs haddock on it. This is brand new and hardly tested, so you get to knock it around and see what you think. ** Some commands now actually implement verbosity. ** The preprocessors have been tested a bit more, and seem to work OK. Please give feedback if you use these. 0.3 Isaac Jones <ijones(a)syntaxpolice.org> Sun Jan 16 2005 * Unstable snapshot release * From now on, stable releases are even. 0.2 Isaac Jones <ijones(a)syntaxpolice.org> * Adds more HUGS support and preprocessor support.

1 0

ICLP 2005: Call for Papers
by ICLP 2005 17 Jan '05

17 Jan '05

---------------------------------------- Apologies if you receive multiple copies ________________________________________ Call for Papers ------------------------------------------------------------ Twenty first International Conference on Logic Programming ICLP'05 2-5 October, 2004 Sitges (Barcelona) Spain Co-located with the International Conference on Principles and Practice of Constraint Programming (CP'05) ------------------------------------------------------------ http://www.iiia.csic.es/iclp2005/ The Conference -------------- The 21st International Conference on Logic Programming will be held near Barcelona (Spain) from October 2nd to October 5th, 2005. ICLP'05 will be colocated with the International Conference on Principles and Practice of Constraint Programming (CP'05). Conference scope ---------------- Since the first conference held in Marseilles in 1982, ICLP has been the premier international conference for presenting research in logic programming. Contributions (papers and posters) are sought in all areas of logic programming including but not restricted to: Theory Implementation Semantic Foundations Compilation Formalisms Memory Management Nonmonotonic Reasoning Virtual Machines Knowledge Representation Parallelism Environments Alternative Paradigms Program Analysis Constraint Logic Programming Program Transformation Abductive Logic Programming Validation and Verification Inductive Logic Programming Debugging, Profiling Answer Set Programming Language Issues Applications Concurrency Semantic Web Objects Software Engineering Coordination Web Tools Mobility Internet Agents Higher Order Artificial Intelligence Types Deductive Databases Modes Natural Language Programming Techniques Specific attention will be given to work providing novel integrations of these different areas, and to new applications of logic programming in general. Contributions on applications will be assessed with an emphasis on their impact and synergy with other areas, as opposed to technical maturity. Applications of logic programming to the Semantic Web are especially encouraged. The technical program will include several invited talks and advanced tutorials, in addition to the presentations of the accepted papers and posters. A special session on industrial applications of logic programming is also planned and several workshops will be held in parallel with the conference. For the first time, a doctoral student consortium will be organized as part of ICLP. Papers ------- Papers must describe original, previously unpublished research, and must not be simultaneously submitted for publication elsewhere. They must be written in English and not exceed 15 pages in Springer LNCS format. The authors are encouraged, although not obliged, to submit their papers already in Springer LNCS format. General information about the Springer LNCS series and the LNCS authors' instructions are available at the Springer LNCS/LNAI home page (http://www.springer.de/comp/lncs/index.html) Papers should express their contribution clearly, both in general and technical terms. It is essential to identify what was accomplished, describe its significance, and explain how the paper compares with and advances previous work. Authors should make every effort to make the technical content understandable to a broad audience. The primary means of submission will be electronic, in pdf format. If electronic submission is not possible, five hard copies should be sent to one of the program co-chairs. More information on the submission procedure will be available at http://www.utdallas.edu/ICLP05 Industrial Papers ----------------- A special session on industrial applications of logic programming is also planned during the conference. Papers accepted in this session will describe innovative applications of logic programming to industrial problems. The application's innovativeness and industrial impact will be the main criteria used for judging the paper. Papers accepted for this session will be published in the proceedings as shorter, (up to) 10 pages papers. Posters ------- Posters provide a forum for presenting work in an informal and interactive setting. They are ideal for discussing current work not yet ready for publication, for PhD thesis summaries and research project overviews. Accepted posters will also get a 10 minute slot for presentation during the conference. Extended abstract (2 pages) of each accepted poster will be published in the proceedings. Posters must be submitted electronically. More information on the submission procedure will be available at http://www.utdallas.edu/ICLP05 Doctoral Student Consortium --------------------------- The Doctoral Consortium will provide an opportunity for students pursuing their doctoral thesis in logic programming and related areas to explore their research interests under the guidance of a panel of distinguished experts in the field. The Doctoral Consortium will also offer invited speakers and discussion groups. The Consortium will allow participants to interact with established researchers and with other students, through presentations, question-answer sessions, panel discussions, and invited presentations. A separate call-for-participation will be issued for the doctoral consortium. About 6 to 8 students will be selected for the consortium. Selected students will also present their research in the poster session. The abstract of the poster will be published in the conference proceedings. Financial support for selected students may be available. Publication ----------- The proceedings of the conference will be published by Springer-Verlag in the LNCS series. The proceedings will include the accepted papers and the abstracts of accepted posters. Sponsoring and prizes --------------------- The conference is sponsored by the Association for Logic Programming. The ALP has funds to assist financially disadvantaged participants. The ALP is planning to sponsor two prizes for ICLP'05: for the best technical paper and for the best application paper. Important dates --------------- POSTERS PAPERS Abstract submission deadline: 30 April Submission deadline: 1 June 6 May Notification of authors: 1 July 24 June Camera-ready copy due: 15 July 15 July Organization ------------ Conference Co-Chairs: Pedro Meseguer (IIIA-CSIC, Spain) Javier Larrosa (Technical University of Catalonia, Spain) Program Co-Chairs: Maurizio Gabbrielli (University of Bologna, Italy) Gopal Gupta (University of Texas at Dallas, USA) Workshop Chair: Hai-Feng Guo (University of Nebraska at Omaha, USA) Doctoral Consortium Chair: Enrico Pontelli (New Mexico State University, USA) Publicity Chair: Felip Manya (IIIA-CSIC, Spain) Program Committee: Roberto Bagnara University of Parma, Italy Maurice Bruynooghe KU Leuven, Belgium Giorgio Delzanno University of Genova, Italy Stefan Decker Digital Enterprise Research Institute, Ireland Thom Fruehwirth University of Ulm, Germany Maurizio Gabbrielli University of Bologna, Italy (Program Co-Chair) Gopal Gupta University of Texas at Dallas, USA (Program Co-Chair) Patricia Hill University of Leeds, UK Joxan Jaffar University of Singapore, Singapore Bharat Jayaraman SUNY Buffalo, USA Javier Larrosa Technical University of Catalonia, Spain (Conference Co-Chair) Michael Leuschel University of Southampton, UK Massimo Marchiori University of Venice, Italy and W3C, MIT, USA Pedro Meseguer IIIA-CSIC, Spain (Conference Co-Chair) Juan J. Moreno Navarro Technical University of Madrid, Spain Gopalan Nadathur University of Minnesota, USA Illka Niemela Helsinki U. of Tech. Finland Catuscia Palamidessi INRIA, France Enrico Pontelli New Mexico State Univeristy, USA I.V. Ramakrishnan SUNY Stony Brook, USA Vitor Santos Costa Federal U. of Rio de Janeiro, Brazil Harald Sondergaard University of Melbourne, Australia Peter Stuckey University of Melbourne, Australia Frank Valencia University of Uppsala, Sweden Contact addresses ----------------- Conference Chairs: Pedro Meseguer Javier Larrosa IIIA-CSIC Dep. LSI, UPC Campus UAB Jordi Girona 1-3 08193 Bellaterra, Spain 08034 Barcelona, Spain Program Co-chairs: iclp05-chairs(a)cs.unibo.it Maurizio Gabbrielli Gopal Gupta Department of Computer Science Department of Computer Sciences MS EC31 University of Bologna The University of Texas at Dallas Mura A. Zamboni 7 2601 N. Floyd Rd 40127 Bologna, Italy Richardson, TX 78050, USA

1 0

New PhD Positions Department of Computing Science, Chalmers University
by Philippas Tsigas 17 Jan '05

17 Jan '05

Please pass on to interested students. Apologies for multiple copies. --------------------------------------------------------------------- New PhD Positions (DEADLINE 15 February 2005! See "How to apply" below) Department of Computing Science, Chalmers University of Technology & Göteborg University Gothenburg, Sweden http://www.cs.chalmers.se/Cs/ The Department has about 80 researchers, half being faculty members and half PhD students. Our focus is on algorithms, bioinformatics, distributed systems and computing, functional programming, formal methods, interaction design, language technology, parallel and high performance computing, programming logic and type theory, but research is not restricted to these topics. For more information, see http://www.cs.chalmers.se/Cs/Research. PhD positions are for 5 years. There is no tuition fee. A PhD position is a regular job with social benefits; the salary amounts currently to about 20600 SEK per month in the first year (the exact amount depends on teaching duties, usually 20% of your time). Knowledge of Swedish is not a prerequisite for application. English is our working language for research. Both Swedish and English are used in undergraduate courses. Half of our researchers and PhD students are native Swedes; the rest come from more than 20 different countries. Applicants must have a very good undergraduate degree in Computing Science or in a related subject with a strong Computing Science component. They must also have a strong, documented interest in doing research. You may even apply if you have not yet completed your degree, but expect to do so by 1 September 2005. You are also invited to apply for our new International Master's Programme in Dependable Computer Systems, which can help you to obtain the necessary qualification, if you do not yet have it (see http://www.cs.chalmers.se/Cs/Education/dcs/) Applicants in the area of language-based and logic-based security are encouraged to apply to specially allocated positions. The School especially welcomes female applicants. How to apply (http://www.cs.chalmers.se/~tsigas/PhD/phd-05-en.thtml) ------------ To apply send us a letter containing the following documentation: 1. A letter of application, listing specific research interests 2. A curriculum vitae 3. Attested copies of undergraduate degrees and other certificates 4. Copies of relevant work, for example dissertations or articles, that you have authored i or co-authored 5. A description of: * Previous teaching experience, documented, if any * Previous PhD studies, also in other subjects * State financial support for these, if any * Previous work experience 6. Letters of recommendation from your teachers or employers *** You MUST include Letters of Recommendation: we typically get over 100 apps, and it is simply not feasible for us to request individual letters *** The job refrence number is: 6/2005. The last date for your full application to arrive is February 15, 2005 to: Registrator, Chalmers University of Technology, Se-412 96 Göteborg, Sweden. Phone: +4631 772 1000, fax: +4631 772 4922, email: registrator(a)adm.chalmers.se If you have financial support of your own (industry job, grant, etc.), please state this fact clearly. It will increase your chances to be accepted considerably, because you need not compete for the limited number of fully financed positions. A decision about the PhD positions will be taken before May 15, 2005.

1 0

Rebindable syntax for monads and arrows
by Amr A Sabry 17 Jan '05

17 Jan '05

Greetings all, This message is a sort of a poll to find out how much interest the community has in an implementation of rebindable syntax for monads and arrows. You can send your answers directly to me (sabry ... indiana edu) and I will summarize to the list if appropriate. An example using monads ----------------------- The type Vec below is almost a monad: - the operations vreturn and @>>= are almost of the right type (they have an additional constraint FinSet a =>) - the operations vreturn and @>>= satisfy the monad laws class Eq a => FinSet a where enumerate :: [a] newtype Vec a = Vec (a -> Float) unV (Vec f) = f vreturn :: FinSet a => a -> Vec a vreturn a = Vec (\ b -> if a==b then 1 else 0) (@>>=) :: FinSet a => Vec a -> (a -> Vec b) -> Vec b (Vec va) @>>= f = Vec (\ b -> sum [ (va a) * (unV (f a) b) | a <- enumerate]) Because of the additional type constraint (FinSet a =>) we cannot make the type Vec an instance of the class Monad, and hence we cannot use the do-notation to express our computations. ----------------------------------------------------------------------------- Question I ----------------------------------------------------------------------------- Do you have other examples, where you wished you could define instances of the class Monad with operations whose types are more constrained than required? Or more generally do you feel that allowing such a behavior is worthwhile? ----------------------------------------------------------------------------- Question II ----------------------------------------------------------------------------- Arguably the do-notation for monadic computations is nice but the overhead of writing using explicit combinators is not that bad. The situation for arrows is quite different: the syntactic sugar for arrows is almost essential and it often expands into something you _do_not_want_to_write_ So, do you have examples, where you wished you could define instances of the class Arrow with operations whose types are more constrained than required? ----------------------------------------------------------------------------- Thanks for your feedback. Amr Sabry (based on discussions with Peter Gammie, Ross Patterson, Simon Peyton Jones, and Josef Svenningsson)

4 4

[ICCIMA/ICSE05] CfP: Int. Conf. on Systems Engineering'05 - August 16-18, 2005
by ICSEng'05 16 Jan '05

16 Jan '05

We apologize if this is a duplicate email. EIGHTEENTH INTERNATIONAL CONFERENCE ON SYSTEMS ENGINEERING (ICSEng05) LAS VEGAS, USA, AUGUST 16-18, 2005 (<http://www.icseng.org/>http://www.icseng.info) This series of International Conferences is jointly organized on a rotational basis among three institutions, University of Nevada, Las Vegas, USA, Technical University of Wroclaw, Poland, and Coventry University, UK. In August 2005, the 18th International Conference will be held in Las Vegas, NV, at the University of Nevada, Las Vegas, USA. The Proceedings of the conference will be published by IEEE CS. ICSEng05 is organized jointly with the International Conference on Computational Intelligence and Multimedia Applications (ICCIMA'05: <http://www.iccima.org/>www.iccima.org) and the registered participants of ICSEng05 will be able to attend ICCIMA05. Scope of Conference: The Conference will cover the general area of Systems Engineering, with particular emphasis being placed on applications. It is expected to include sessions on the following themes: Avionics Computer Algorithms, Databases, Parallel and Distributed Systems, Networks Digital systems, architecture Control Theory, System Identification and Adaptive Control, Nonlinear Controls Data Fusion Engineered Systems for Nuclear Waste Management Environmental Systems and Energy Systems Expert Systems and Artificial Intelligence Finance Engineering Geographic Information Systems Global Position Systems Information Theory and Communication Systems Neural Network and Applications Requirements Processes Risk Management Robotics and Industrial Automation Systems Engineering Metrics Systems Engineering Paradigms, Standards and Challenges System Architecture Standards and Testing Signal Processing Systems Engineering Education Transportation Systems Submissions: We invite you to submit a one page abstract for the purpose of reviewing by March 10, 2005. Accepted authors will be invited to submit a full paper (6 pages maximum limit) for presentation. All abstracts are to be submitted in PDF, postscript or MS word version electronically. For more information on submissions refer to: <http://www.ee.unlv.edu/~selvaraj/icse05/submission/>http://www.ee.unlv.edu/~selvaraj/icse05/submission/. Please follow the ICSEng'05 guidelines for more information on submission. Submission implies the willingness of at least one of the authors to register and present the paper. All abstracts will be peer reviewed by two independent referees of the International Program Committee of ICSEng'05. Special Session proposals are solicited from those who are interested in organizing a session dealing with a specific area of the conference. Special Session organizers will be members of the Program Committee and will be responsible for advertising, collecting and reviewing technical papers. Due date for submission of Special Session proposals: February 15, 2005. Special Poster Session: ICSEng'05 will include a special poster session devoted to recent work and work-in-progress. Abstracts are solicited for this session (2 page limit) in camera ready form, and may be submitted up to 30 days before the conference date. They will not be refereed and will not be included in the proceedings, but will be distributed to attendees upon arrival. Students are especially encouraged to submit abstracts for this session. Important Dates: Abstracts due: March 10, 2005 Proposals for special sessions due: February 15, 2005 Steering Committee Prof. W. R. Wells (Chair), UNLV, USA Prof. H. Selvaraj, UNLV, USA Prof. Z. Bubnicki, Technical Uni. of Wroclaw, Poland Prof. A. Grzech, Technical Uni. of Wroclaw, Poland Prof. D. J. G. James, Coventry University, UK Prof. K. J Burnham, Coventry University, UK General Chair: Prof. H. Selvaraj, UNLV, USA Program Committee Prof. A. K. Datta, UNLV, USA Prof. A. V. Balakrishnan, UCLA, USA Prof. W. N. Burkov, Russian Acad. of Sciences, Russia Dr. H. S. Cho, Korean AIST, Korea Prof. T. F. Gonzalez, Uni. of California, Santa Barbara, USA Prof. G. Guardabassi, Politecnico di Milano, Italy Prof. A. Gunasekaran, Uni. Of Massachusetts, USA Prof. H. Migliore, PSU, USA Prof. L. Hsu, Uni. Federal do Rio de Janeiro, Brazil Prof. L. Jozwiak, Eindhoven Uni. of Tech, Holland Prof. T. Luba, Warsaw Uni. of Technology, Poland Prof. V. Muthukumar, UNLV, USA Prof. S. Nambisan, UNLV, USA Dr. M. Rawski, Warsaw Uni. of Tech., Poland Prof. H. Selvaraj, UNLV, USA Prof. S. Singh, UNLV, USA Prof. H. Sorenson, UC San Diego, USA Dr. S. Stubberud, The Boeing Company, USA Prof. M. Sugisaka, Oita University, Japan Prof. M. Thoma, Universitat Hanover, Germany Prof. R. Vallee, LUniversite Paris-Nord, France Dr. L. Wang, Harbin U. of Tech., China Prof. W. R. Wells, UNLV, USA Organizing Committee Chair: Prof. V. Muthukumar, UNLV, USA Contact: Conference Secretary, ICSE-2005 Howard R. Hughes College of Engineering University of Nevada, Las Vegas, Las Vegas, NV 89154-4005 Phone: (702) 895 4184 FAX: (702) 895 1115 email: secretary(a)icseng.info URL: <http://www.icseng.org/>http://www.icseng.<http://www.icseng.org/>info<http://www.icseng.org/>/ _______________________________________________ Conf mailing list Conf(a)Mail.Egr.UNLV.EDU http://Mail.Egr.UNLV.EDU/mailman/listinfo/conf

1 0

Help on Arrows
by Georg Martius 16 Jan '05

16 Jan '05

Hi folks, I would like to use Arrows, but I just can't figure out how to actually use them. I looked at various documentations including the API doc [1], the Wiki [2], [3], and some random pages on the net but didn't find a single simple example that tells me how to apply an Arrow to a value. Assume I have the extremly simple arrow such as: > MyAdd1A :: (Arrow a, Num b) => a b b > MyAdd1A = arr (\ x -> x + 1 ) I am probably totally wrong, buy I look for something like evaluateArrow with the type: > evaluateArrow :: (Arrow a) => a b c -> b -> c to use it like: > main = do let x = evaluateArrow $ MyAdd1A 1 > print x Please enlighten me! Georg [1] http://www.haskell.org/ghc/docs/latest/html/libraries/base/Control.Arrow.ht… [2] http://haskell.org/hawiki/UnderstandingArrows [3] http://www.haskell.org/arrows/ -- ---- Georg Martius, Tel: (+49 34297) 89434 ---- ------- http://www.flexman.homeip.net ---------

2 1

CFP - SBLP 2005 - 9th Brazilian Symposium on Programming Languages
by Francisco Heron de Carvalho Junior 15 Jan '05

15 Jan '05

[[ Apologies for multiple copies of this message ]] CALL FOR PAPERS SBLP 2005 - 9th Brazilian Symposium on Programming Languages Departamento de Sistemas Computacionais Universidade de Pernambuco Recife, PE, Brazil - May 23-25, 2005 http://www.upe.poli.br/dsc/sblp2005 Selected papers from the proceedings will appear in a Special Issue of the Journal of Universal Computer Science - JUCS. Only accepted contributions written in English are eligible to be published in the JUCS. (www.jucs.org <http://www.jucs.org>) Scope The Brazilian Symposium on Programming Languages (SBLP), sponsored by the Brazilian Computer Society (SBC), is a forum where researchers, educators, and practitioners can present and discuss the fundamental principles and innovations in the design, analysis and implementation of programming languages and systems. We invite authors to contribute to SBLP 2005 with the following kinds of submissions: * Technical research papers introducing original research results on topics such as (but not limited to): programming language design and implementation, formal semantics of programming languages, domain-specific programming languages, programming languages for mobile, WWW, and network computing, script languages, new programming models, theoretical foundations of programming languages and teaching programming languages. * Tutorial proposals on subjects related to programming languages, APIs, tools, environments or theories, at graduate level. Important Dates * Deadline for submissions: February 28th, 2005 * Notification of acceptance: March 31th, 2005 * Camera-ready version: April 11th, 2005 Submission Guidelines Contributions can be written in Portuguese or English. Papers should have at most 14 pages. All accepted papers will be published in the conference proceedings. Tutorial submissions may be in the form of a proposal. The final version of a selected tutorial should contain at most 30 pages and will be published in separate proceedings. Talks must be in the language of submission. Please check the symposium web site (http://www.upe.poli.br/dsc/sblp2005) for more information about submissions guidelines and procedures. Program Committee * Adriana Compagnoni, Stevens Institute of Technology (USA) * Alberto Pardo, Univ. de La Republica (Uruguay) * Alex Garcia, IME (Brazil) * Alfio Martini (PUC-RS) * Andre Santos, UFPE (Brazil) * Barrett Bryant, Univ. of Alabama (USA) * Carlos Camarao, UFMG (Brazil) * Cecilia Rubira, Unicamp (Brazil) * Christiano Braga, UFF (Brazil) * David Naumann, Stevens Tech (USA) * Edil Fernandes, UFRJ (Brazil) * Edward Hermann Haeusler, PUC-Rio (Brazil) * Francisco Heron de Carvalho Jr., UPE (Brazil) * Gabriel Baum, Univ. Nacional de La Plata (Argentina) * Guy Cousineau, Univ. Paris 7 (France) * Hermano Moura, UFPE (Brazil) * Isabel Cafezeiro, UFF (Brazil) * Johan Jeuring, Utrecht Univ. (Netherlands) * John Hughes, Chalmers Univ. of Technology (Sweden) * Jose Guimaraes, UFSCAR (Brazil) * Jose Labra, Univ. of Oviedo (Spain) * Jose Luiz Fiadeiro, Univ. of Leicester (England) * Lucília Figueiredo, UFOP (Brazil) * Luiz Carlos Menezes, UFPE, (Brasil) * Luis Soares Barbosa, Universidade do Minho (Portugal) * Marco Tulio Valente, PUC-MG (Brazil) * Mariza Bigonha, UFMG (Brazil) * Martin Musicante, UFPR (Brazil) - *Chair* * Nick Benton, Microsoft Research (England) * Noemi Rodriguez, PUC-Rio (Brazil) * Paulo Blauth Menezes, UFRGS (Brazil) * Paulo Borba, UFPE (Brazil) * Peter Mosses, University of Wales Swansea (UK) * Peter Thiemann, Univ. Freiburg (Germany) * Rafael Dueire Lins, UFPE (Brazil) * Renato Cerqueira, PUC-Rio (Brazil) * Ricardo Massa Lima, UPE (Brazil) * Roberto Bigonha, UFMG (Brazil) * Roberto Ierusalimschy, PUC-Rio (Brazil) * Sergiu Dascalu, Univ. of Nevada, Reno (USA) * Simon Thompson, Univ. of Kent (England) * Uday Reddy, Univ. of Birmingham (England) Organizing Committee * Adriano Lorena Inácio de Oliveira, UPE * André Luís de Medeiros Santos, UFPE * Carlos Alexandre Mello, UPE * Francisco Heron de Carvalho Jr., UPE * Fernando Buarque de Lima Neto, UPE * Márcio Lopes Cornélio, UPE * Maria Lencastre, UPE * Ricardo Massa, UPE - *Chair* (ricardo(a)upe.poli.br) Symposium Location "Recife is one of the biggest cities in brazilian's northeast and it is one of the most important cities of Brazil. It is very important for the country history and it has many touristic attractions. The commercial center of Recife has a preserved architecture of the last century contrasting with modern buildings. All of this makes Recife one of the most attractive cities of Brazil" More Information For further information, visit the symposium web site at http://www.upe.poli.br/dsc/sblp2005/ or send e-mail to ricardo(a)upe.poli.br. --

1 0

ESSLLI'05 Student Session: 2nd Call for Papers
by Judit Gervain 15 Jan '05

15 Jan '05

Sorry about multiple postings of this message. ----------------------------------------------------------- 2nd Call for Papers: ESSLLI'05 Student Session We are pleased to announce the Student Session (StuS) of the 17th European Summer School in Logic, Language and Information (ESSLLI'05, 8-19 August, Edinburgh, http://www.macs.hw.ac.uk/esslli05/) We invite papers for oral and poster presentation from the areas of Logic, Language and Computation. The ESSLLI Student Session encourages submissions from students at any level, undergraduate, as well as postgraduate. This year, unlike in the past, papers can be submitted for oral OR poster presentation separately. Student authors are invited to submit a full paper, not to exceed 7 pages of length exclusive of references. Papers are to be submitted with clear indications of the selected modality of presentation, i.e. oral or poster. The submissions will be reviewed by the student session program committee and selected reviewers. The preferred formats of submissions are PostScript, PDF, or plain text, although other formats will also be accepted. The paper and a separate identification page must be sent electronically to: gervain(a)sissa.it. Deadline: 15th February 2005. For more information and the technical details of the submission, see: http://www.sissa.it/~gervain/StuS.html or write to: gervain(a)sissa.it ========================@======================== Judit Gervain office: via dell'Orologio 6., 2nd floor Trieste Italy postal address: SISSA CNS via Beirut 2-4 34014 Trieste Italy office tel: +39 040 37 87 613 mobile tel: +39 329 788 40 25 www.sissa.it/~gervain

1 0