January 2005 - Haskell

ALC9
by Asian Logic Conference 2005 15 Jan '05

15 Jan '05

Apologies for multiple copies due to using different mailing lists THE 9th ASIAN LOGIC CONFERENCE August 16--19, 2005 Novosibirsk, Russia CALL FOR PAPERS 1. General information This conference is the ninth in the series of logic conferences, which is held once every three years and rotates among countries in the Asia-Pacific region with interests in the broad area of logic including theoretical computer science. In the past, there were eight meetings in Singapore (1981), Bangkok, Thailand (1984), Bejing, China (1987), Tokyo, Japan (1990), Singapore (1993), Bejing, China (1996), Hsi-Tou, Taiwan (1999), and Chongqing, China (2002). In 2005, the conference takes place in Novosibirsk at the Sobolev Institute of Mathematics SB RAS, August 16--19. The purpose of the conference is to facilitate interactions between researches interested in the mathematical logic, logic in computer science, and philosophical logics. It aims at promoting activities of mathematical logic in the Asia-Pacific so that logicians both from within Asia and elsewhere would get together and exchange information and ideas. Topics of interest include, but are not limited to, recursion theory, set theory, proof theory, model theory and universal algebra, non-classical logic, and logic in computer science. 2. Invited lecturers Up to now, the following specialists in logic accepted our invitation to give a plenary lecture at the conference (in alphabetical order): Pavel Alaev (Russia) Lev Beklemishev (Russia, Netherlands) Yurii Ershov (Russia) Su Gao (USA) Sanjay Jain (Singapore) Bakhadyr Khoussainov (New Zealand) Andrei Mantsivoda (Russia) Joe Miller (USA) Hiroakira Ono (Japan) Vladimir Rybakov (Russia, Great Britain) Masahiko Sato (Japan) Moshe Vardi (USA) Andrei Voronkov (Great Britain) Xishun Zhao (China) 3. Deadlines The deadline for submission of abstracts of contributed talks is February 28, 2005. Acceptance of your submission will be notified till March 31, 2005. The deadline for participants registration is April 15, 2005. 4. Submission and registration The preferable way of submitting your abstract and registering is via the conference information system at http://www.sbras.ru/ws/ALC-9/index.en.html (English version) or http://www.sbras.ru/ws/ALC-9/ (Russian version). If it is not available to submit your abstract in such a way, please send it by e-mail in the PDF format to alc9(a)math.nsc.ru or send a hard copy to The 9th Asian Logic Conference Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, 4 Acad. Koptyug avenue, 630090 Novosibirsk, Russia 5. International Programme Committee Professor Sergei Goncharov (chair) (Russia) Professor Chi Tat Chong (Singapore) Professor John Crossley (Australia) Professor De-Cheng Ding (China) Professor Rodney Downey (New Zealand) Professor Yurii Ershov (Russia) Professor Qi Feng (China) Professor Bakhadyr Khoussainov (New Zealand) Professor Larisa Maksimova (Russia) Professor Andrei Morozov (Russia) Professor Hiroakira Ono (Japan) Professor Dmitrii Pal'chunov (Russia) Professor Evgenii Palutin (Russia) Professor Shih Ping Tung (Taiwan, R.O.C.) Professor Mariko Yasugi (Japan) 6. Organising Committee Sergei Odintsov (co-chair) (Russia) Andrei Morozov (co-chair) (Russia) Stanislav Bereznyuk (Russia) Asylkhan Khisamiev (Russia) Nurlan Kogabaev (Russia) Aleksandr Kravchenko (Russia) Galina Morozova (Russia) Aleksei Stukachev (Russia) Nikita Vinokurov (Russia) Yang Yue (Singapore) 7. Contact information The 9th Asian Logic Conference Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, 4 Acad. Koptyug avenue, 630090 Novosibirsk, Russia tel. +7 3832 33 28 94 fax +7 3832 33 25 98 e-mail alc9(a)math.nsc.ru www http://www.sbras.ru/ws/ALC-9/index.en.html http://www.sbras.ru/ws/ALC-9/ On behalf of the Organising Committee, Sergei Odintsov Aleksandr Kravchenko

1 0

[Fwd: 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

PerCom 2005: Call for Participation
by Mainak Chatterjee 14 Jan '05

14 Jan '05

---------------------------------------------------------- *** OUR SINCERE APOLOGIES IF YOU RECEIVE MULTIPLE COPIES*** ***OF THIS ANNOUNCEMENT*** ----------------------------------------------------------- P E R C O M 2 0 0 5 http://www.percom.org Sheraton Kauai Resort, Kauai, Hawaii March 8-12, 2005 ************************************************** Advance Program and Call for Participation ************************************************** --------------------------------------------------------- IEEE International Conference on Pervasive Computing and Communications (PerCom) Sponsored by The IEEE Computer Society, The University of Texas at Arlington, and the IEEE Technical Committee on Computer Communications. Cosponsored by the IEEE Technical Committee on Parallel Processing and the IEEE Technical Committee on Distributed Processing Industry Sponsors : NOKIA Corporation and IBM Research --------------------------------------------------------- IEEE PerCom 2005 will be the third annual conference on the emerging area of pervasive computing and communications aimed at providing an exciting platform and paradigm for all the time, everywhere services. PerCom 2005 will provide a high profile, leading edge forum for researchers and engineers alike to present their latest research in the field of pervasive computing and communications. ---------------------------------------------------------- Main Features ---------------- *** 31 Full Papers and 8 Concise Contributions *** *** 2 Keynote speeches *** *** 2 Panels *** *** 7 Workshops *** *** Demonstrations *** ---------------------------------------------------------- ADVANCE PROGRAM -------------------------------------------------------- Tuesday March 8, 2005 8:30 am to 5 pm 3 WORKSHOPS --------- - Pervasive Computing and Communications Security (PerSec '05) http://www.list.gmu.edu/persec - Middleware Support for Pervasive Computing(PerWare '05) http://ciae.cs.uiuc.edu/perware/ - Sensor Networks and Systems for Pervasive Computing (PerSeNS '05) http://www.ing.unipi.it/persens2005 6:00 to 8:00 PM IBM Session and Dinner for Students ---------------------------------------------------------- Conference Program Wednesday March 9, 2005 8:00am - 6:00pm Registration 9:15 - 9:30 am Opening Remarks 9:30 - 10:30am Keynote Lecture * Pervasive Sensing and Computing Srikanta (Sri) P. Kumar, DARPA 10:30 - 11:00 Coffee/Tea break 11:00 - 12:30 Parallel Sessions Session 1: Applications and Programmability *Olympus: A High-level Programming Model for Pervasive Computing Environment Shiva Chetan, Anand Ranganathan, Jalal Al Muhtadi, Roy Campbell, M. Dennis Mickunas University of Illinois at Urbana-Champaign *Efficient Browsing of Web Search Results on Mobile Devices Based on Block Importance Model Xing Xie, Ruihua Song, Ji-Rong Wen, Wei-Ying Ma Microsoft Research Asia Gengxin Miao Tsinghua University *EZCab: A Cab Booking Application Using Short-Range Wireless Communications Peng Zhou University of Maryland, College Park, Tamer Nadeem, Porlin Kang, Cristian Borcea, Liviu Iftode Rutgers University Session 2: Sensor Networks *Selection and Navigation of Mobile Sensor Nodes Using a Sensor Network Atul Verma, Hemjit Sawant, Jidong Tan Michigan Technological University *Dynamic Coverage Maintenance Algorithms for Sensor Networks with Limited Mobility Archana Sekhar McKinsey & Company Mumbai, India B.S. Manoj, C. Siva Ram Murthy Indian Institute of Technology Madras, India *TinyLIME: Bridging Mobile and Sensor Networks through Middleware Carlo Curino, Matteo Giani, Marco Giorgetta, Alessandro Giusti, Gian Pietro Picco Politecnico di Milano, Italy Amy L. Murphy University of Lugano, Switzerland 12:30 - 2:00 pm Lunch 2:00 - 3:30 pm Parallel Sessions Session 3: Location Management *A Bayesian Sampling Approach to In-door Localization of Wireless Device Using Received Signal Strength Indication Vinay Seshadri, Manfred Huber, Gergely Zaruba The University of Texas at Arlington *Adaptive Temporal Radio Maps for Indoor Location Estimation Jie Yin, Qiang Yang, Lionel Ni Hong Kong University of Science and Technology *Reducing Calibration Effort for Location Estimation Using Unlabeled Samples Xiaoyong Chai, Qiang Yang Hong Kong University of Science and Technology Session 4: Energy Efficiency *Distributed Low-Overhead Energy-efficient routing for sensory networks via topology management and path diversity Athanassios Boulis National ICT Australia *A new energy efficient protocol for minimizing multi-hop latency in wireless sensor networks M. Dhanaraj, B.S. Manoj, C.Siva Ram Murthy Indian Institute of Technology, Madras, India *Performance and energy efficiency of block ciphers in personal digital assistants Creighton Hager, Thomas Martin, Scott Midkiff, Jung Min Park Virginia Polytechnic Institute and State University 3:30 - 4:00 Coffee/Tea Break 4:30 - 7:30 pm Demonstrations and Reception Thursday March 10, 2005 8:30am-12:00 Registration 9:00 - 10:00am Keynote Lecture 2 *Beyond Global Communications: The Active World Roy Campbell University of Illinois at Urbana-Champaign 10:00 - 10:30am Best Paper *Sizzle: A Standards-based End-to-End Security Architecture for the Embedded Internet Vipul Gupta, Matthew Millard, Stephen Fung, Yu Zhu, Nils Gura, Hans Eberle, and Sheueling Chang Sun Microsystems Laboratories 10:30 - 11:00 Coffee/Tea break 11:00 - 12:30 Parallel Sessions Session 5: Pervasive Devices *Using Symbiotic Displays to View Sensitive Information in Public Stefan Berger, Rick Kjeldsen, Claudio Pinhanez, Mark Podlaseck, Chandra Narayanaswami, Mandayam Raghunath IBM Research, T.J. Watson *A Study on Users' Preference on Interruption When Using Wearable Computers and Head Mounted Displays Marcus Nilsson, Mikael Drugge, Urban Liljedahl, Kare Synnes, Peter Parnes Lulea University of Technology *Unleashing the power of wearable devices in a SIP infrastructure Arup Acharya, Stefan Berger, Chandra Narayanaswami IBM T.J. Watson Research Center Session 6: Wireless Networks *V3: A Vehicle-to-vehicle live streaming architecture Meng Guo, Mostafa Ammar, Ellen Zegura Georgia Institute of Technology *SIP-based Mobility Architecture for Next Generation Wireless Networks Nilanjan Banerjee, Sajal Das University of Texas at Arlington Arup Acharya IBM T.J. Watson Research Center *The Problem of Bluetooth Pollution and Accelerating Connectivity in Bluetooth Ad Hoc Network Somil Asthana State University of New York Dimitris N. Kalofonos Nokia Research Center 12:30 - 2:00 pm Lunch 2:00 - 3:30 pm Parallel Sessions Session 7: Service Discovery *A Location Model for Pervasive Computing Environments Ichiro Satoh National Institute of Informatics *Expose or Not? A Progressive Exposure Approach for Service Discovery in Pervasive Computing Environments Feng Zhu, Wei Zhu, Matt Mutka Michigan State University Lionel Ni Hong Kong University of Science and Technology *Scalable Service Discovery for MANET Francoise Sailhan, Valerie Issarny Inria-Rocquencourt Session 8: Security *Secure Routing and Intrusion Detection in Ad Hoc Networks Anand Patwardhan, Jim Parker, Anupam Joshi University of Maryland, Baltimore County (UMBC) Michaela Iorga, Tom Karygiannis National Institute of Standards and Technology (NIST) *Secure Context-sensitive Authorization Kazuhiro Minami, David Kotz Dartmouth College *Exploiting Information Relationships for Access Control Urs Hengartner, Peter Steenkiste Carnegie Mellon University 3:30 - 4:00 pm Coffee/Tea Break 4;00 - 5:30 Pm *Panel1: Trustworthiness in Pervasive and Ubiquitous Environment Moderator: Taieb Znati, University of Pittsburgh 6:30 - 10:00 pm Conference Banquet Friday March 11, 2005 9:00 10:30am Parallel Sessions (Concise Contributions) Session 9: Information Sharing & Applications *Policy-Driven Data Dissemination for Context-Aware Applications Guanling Chen, David Kotz Dartmouth College *Anonymous Content Sharing in Ad Hoc Networks Seung-Seok Kang, Matt W. Mutka, Li Xiao Michigan State University *Traditional Systems can Work Well for Pervasive Applications: A Case Study: Plan 9 from Bell Labs becomes ubiquitous Francisco Ballesteros, Gorka Guardiola, Enrique Soriano, Katia Leal Universidad Rey Juan Carlos *Applying a Disciplined Approach to the Development of a Context-Aware Communication Application Ted McFadden, Karen Henricksen, Jadwiga Indulska, Peter Mascaro The University of Queensland Session 10: Middleware Services and Platforms *Gaia Microserver: An Extendable Mobile Middleware Platform Ellick Chan, Jim Bresler, Jalal Al-Muhtadi, Roy Campbell University of Illinois at Urbana-Champaign *Constraining Event Flow for Regulation in Pervasive Systems Prashant S. Kumar, Qiang Zeng, Gurdip Singh Kansas State University *System Level Energy Optimization for Location Aware Computing Hariharan Sankaran, Srinivas Katkoori, Umadevi Kailasam University of South Florida *Energy Analysis of Public-Key Cryptography on Small Wireless Devices Arvinderpal S. Wander, Nils Gura, Hans Eberle, Vipul Gupta, Sheueling Chang Shantz Sun Microsystems Laboratories 10:30 - 11:00am Coffee/Tea Break 11:00 - 12:30pm Parallel Sessions Session 11: Context & System Support *Efficiently Managing Context Information for Large-scale Matthias Grossmann, Martin Bauer, Nicola Honle, Uwe-Philipp Kappeler, Daniela Nicklas, Thomas Schwarz University of Stuttgart *PICASSO: Pervasive Information Chronicling, Access, Search and Sharing for Organizations Sinem Guven Columbia University Mark Podlaseck, Gopal Pingali IBM T. J. Watson Research Center *Managing Adaptive Versatile Environments Michael Youngblood, Diane Cook, Larry Holder The University of Texas at Arlington Session 12: Mobile Services and Protocols *Affinity-Based Power Saving MAC Protocol in Ad Hoc Network Jung Hyon Jun, Saewoong Bahk Seoul National University *A dynamic lightweight Architecture for Ad hoc Infrastructures Andreas Frei, Gustavo Alonso Swiss Federal Institute of Technology Zurich *Accessing Ubiquitous Services Using Smart Phones Nishkam Ravi, Peter Stern, Niket Desai, Liviu Iftode Rutgers University 12:30 - 2:00pm Lunch 2:00 - 3:30pm Panel 2: On the Challenges and Opportunities of Pervasive and Ubiquitous Computing in Health Care Moderator: Taieb Znati, University of Pittsburgh 3:30 - 4:00Pm Coffee/Tea Break ---------------------------------------------------------------- Saturday March 12, 2005 8:30 am to 5 pm 4 WORKSHOPS - Context Modeling and Reasoning (CoMoRea '05) http://nexus.informatik.uni-stuttgart.de/COMOREA/ - Mobile Peer-to-Peer Computing (MP2P '05) http://www.comp.polyu.edu.hk/~mp2p2004 - Pervasive Wireless Networking (PWN '05) http://www.eecs.orst.edu/~benl/PWN05 - Pervasive eLearning (PerEL '05) http://wwwra.informatik.uni-rostock.de/perel2005 ---------------------------------------------------------- %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% IMPORTANT DATES: Early Registration : February 15, 2005 Conference: March 8-12, 2004 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% ------------------------------------------------

1 0

ANNOUNCE: Generic Haskell 1.42 (Coral)
by Andres Loeh 14 Jan '05

14 Jan '05

Generic Haskell version 1.42 (Coral) ==================================== We are happy to announce the third release of Generic Haskell, an extension of Haskell that facilitates generic programming. Generic Haskell includes the following features: * type-indexed values -- generic functions that can be instantiated on all Haskell data types. * type-indexed types -- types which are indexed over the type constructors underlying Haskell datatypes. The Generic Haskell compiler takes Generic Haskell source and produces Haskell code. Changes since 1.23 (Beryl) -------------------------- * Dependency-style Generic Haskell [1] is supported, i.e., generic functions can be written in a simpler and more natural style. In particular, type signatures of generic functions have become simpler -- there is no need to define kind-indexed types any longer. * Local redefinition, generic abstraction, and default cases are now implemented as described in "Exploring Generic Haskell" [2]. Download -------- The Generic Haskell compiler is available in source and binary distributions. Binaries for Linux, Windows, and MacOSX are available. These are available from: http://www.generic-haskell.org/compiler.html The documentation is also available separately from that page. For more general information, point your browser to: http://www.generic-haskell.org Why Generic Haskell? -------------------- Software development often consists of designing datatypes, around which functionality is added. Some functionality is datatype specific, whereas other functionality is defined on almost all datatypes in such a way that it depends only on the structure of the datatype. A function that works on many datatypes in this way is called a generic function. Examples of generic functionality include editing, pretty-printing or storing a value in a database, and comparing two values for equality. Since datatypes often change and new datatypes are introduced, we have developed Generic Haskell, an extension of the functional programming language Haskell that supports generic definitions, to save the programmer from (re)writing instances of generic functions. The original design of Generic Haskell is based on work by Ralf Hinze. Pleasant programming, The Generic Haskell Team at Utrecht University info(a)generic-haskell.org [1] A. Loeh, D. Clarke, and J. Jeuring. Dependency-style Generic Haskell. In O. Shivers, editor, Proceedings of the International Conference on Functional Programming, ICFP'03, pages 141--152. ACM Press, August 2003. [2] A. Loeh. Exploring Generic Haskell. PhD thesis, Utrecht University, September 2004.

1 0

SCP special issue on Foundations of AOP --- Last CFC + Deadline extension
by Ralf Laemmel 13 Jan '05

13 Jan '05

Special Issue on Foundations of Aspect-Oriented Programming Science of Computer Programming Last Call For Contributions [ Please note the new deadline: 1 March 2005. This deadline caters for synchronisation with the FOAL 2005 workshop. See text below. ] Guest Editors: Pascal Fradet and Ralf Lämmel http://www.cs.vu.nl/faop-scp/ Call for contributions Modularity concepts support the separation of concerns, and hence they are crucial for mastering the complexity of software. In recent years, the modularity concept of aspects has been introduced. Aspects facilitate the modularisation of crosscutting concerns. The corresponding paradigm, aspect-oriented programming (AOP), is part of a larger effort -- Aspect-Oriented Software Development (AOSD). Clearly, AOP and AOSD have attracted a great deal of interest: various AOP tools are being developed and AOP is now successfully used in real-world applications. However, a widely shared criticism of AOP is that it still lacks firm foundations. For instance, the untamed form of AOP that we see today is often criticised for defeating encapsulation and preventing local reasoning. Likewise, the interference of multiple aspects is considered a serious risk of current AOP techniques. This special issue is dedicated to the foundations of aspect-oriented programming including formal methods, tools, languages and calculi. The special issue goes along with the successful series of FOAL workshops (Foundations of Aspect Oriented Languages). Extended versions of FOAL 2002--2005 papers are particularly welcome. However, submission to the special issue is completely open. The special issue will be published in the journal Science of Computer Programming, which implies excellent visibility and high quality standards. The guest editors solicit high-quality contributions that address the foundations of AOP, and that improve the state of the art of developing, understanding, controlling and reasoning about aspect-oriented programs. Work on modularity concepts other than aspects is also solicited provided that such work is clearly related to AOP. For instance, fundamental contributions to reflection are likely to be relevant for the foundations of AOP. Specific topics of interest include, but are not limited to: * Reasoning about aspect-oriented programs. * Semantics of aspects and weaving. * Formal aspect languages or calculi. * Formal properties of aspects, advice, and join-point models. * Type systems for aspect-oriented languages. * Verification and static analysis of aspect-oriented programs. * Theory of aspect composition and aspect interactions. * Aspect-oriented programming pearls. Deadline for submissions: *1 March 2005* Author's notification: 1 July 2005 Special issue's publication: Winter 2005/2006 Special issue's web site: http://www.cs.vu.nl/faop-scp/ The submissions should be sent in PDF or Postscript to the guest editors via email: Pascal.Fradet(a)inria.fr, Ralf.Laemmel(a)cwi.nl. Authors who want to discuss potential submissions are encouraged to contact the guest editors. For details about the policy of the Science of Computer Programming journal, and the requirements for prospective authors see a recent issue of the journal and check the journal's web site http://www.elsevier.com/locate/scico/.

1 0

haskell.sty for literate source?
by Ketil Malde 13 Jan '05

13 Jan '05

Hi, For those of us (I know at least one more) who like to write LaTeX-based literate programs, I've recently been hacking a bit on Andrew Cooke's haskell.sty file. If anybody else is interested in a revised version, or has modifications of their own, please drop me a mail. (I can also make it available on the web, if there's any interest.) -kzm -- If I haven't seen further, it is by standing in the footprints of giants

1 1

[bctcs05-info] BCTCS 2005 call for participation
by Graham Hutton 13 Jan '05

13 Jan '05

Dear all, The registration deadline for the British Colloquium for Theoretical Computer Science (BCTCS) is just a few weeks away (7 Feb.) Apart from being encouraged to register yourself, please pass this message on to your colleagues and students, and encourage them to register too! Two dozen free places for UK-based PhD students are available. Best wishes, Graham Hutton (organiser) +--------------------------------------------------------------------+ 21st British Colloquium for Theoretical Computer Science BCTCS 2005 22-24 March 2005 University of Nottingham, UK http://www.cs.nott.ac.uk/~gmh/bctcs05.html The purpose of BCTCS is to provide a forum for researchers in theoretical computer science to meet, present research findings, and discuss developments in the field. It also aims to provide an environment for PhD students to gain experience in presenting their work, and benefit from contact with established researchers. SCOPE The scope includes all aspects of theoretical computer science, such as algorithms, complexity, semantics, formal methods, concurrency, types, languages and logics. Computer scientists, mathematicians and researchers from outside of the UK are all welcome to attend. PROGRAMME The programme will consist of 2.5 days of invited talks, tutorials, and contributed talks. The invited speakers are as follows: Games for Algorithmic Problem Solving Prof Roland Backhouse, University of Nottingham The Soft Machines: Computing with the Code of Life Prof Alan Gibbons, King's College London Dr Martyn Amos, University of Exeter Samoa: Formal Tools for Securing Web Services Dr Andrew Gordon, Microsoft Research, Cambridge Number Systems and Data Structures Dr Ralf Hinze, University of Bonn Dependently Typed Programming: An Epigram Induction Dr Conor McBride, University of Nottingham Succinctness Prof Rajeev Raman, University of Leicester LOCATION The colloquium will be held on the Jubilee Campus of the University of Nottingham, which has won many awards for its design and environmental features. Nottingham is centrally located in the UK, and is easily reachable by road, rail and air (Nottingham East Midlands Airport.) REGISTRATION The deadline for registration and submission of proposed talks is 7 February 2005. The registration fee is 275 UK pounds, including accomodation and all meals. Two dozen free registrations for UK-based PhD students are available. Registration is now open. SPONSORS The colloquium is sponsored by EPSRC and LMS. FURTHER DETAILS Google search - BCTCS 2005 Web page - http://www.cs.nott.ac.uk/~gmh/bctcs05.html +--------------------------------------------------------------------+ _______________________________________________ bctcs05-info mailing list bctcs05-info(a)cs.nott.ac.uk http://www.cs.nott.ac.uk/mailman/listinfo/bctcs05-info This message has been scanned but we cannot guarantee that it and any attachments are free from viruses or other damaging content: you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation.

1 0

ICAPS 2005 Workshop Program - New deadline
by ICAPS'05 13 Jan '05

13 Jan '05

[Apologies if you get multiple copies of this call] ====================================================================== ICAPS 2005 Workshop Program Call for workshop papers ------------------------------------------------------ **** New deadline for papers: February 21st. ***** For further information, calls for participation, and links to each of the workshop websites, see http://icaps05.icaps-conference.org/

1 0

[ICCIMA/ICSE05] CFP: International Conference on Computational Intelligence and Multimedia Applications 2005
by ICCIMA'05 12 Jan '05

12 Jan '05

We apologize if this is a duplicate email. This list is used solely for ICCIMA/ICSE. International Conference on Computational Intelligence and Multimedia Applications, August 16-18, 2005 University of Nevada, Las Vegas, USA (<http://www.iccima.org/>www.iccima.org) F I R S T C A L L F O R P A P E R S The International Conference on Computational Intelligence and Multimedia Applications will be held at the University of Nevada, Las Vegas, USA on August 16-18, 2005. The conference will provide an international forum for discussion on issues in the areas of Computational Intelligence and Multimedia for scientists, engineers, researchers and practitioners. ICCIMA05 is organized jointly with International Conference on Systems Engineering (ICSE'05: <http://www.icseng.info/>www.icseng.info) and the registered participants of ICCIMA05 will be able to attend ICSEng05. The conference will include sessions on theory, implementation and applications, as well as the non-technical areas of challenges in education and technology transfer to industry. There will be both oral and poster sessions. Accepted full papers will be included in the proceedings to be published by IEEE CS Press. Selected papers will be published in "International Journal on Computational Intelligence and Applications" published by World Scientific Publishing Company Press. Several well-known keynote speakers will address the conference. Conference Topics Include (but not limited to): Artificial Intelligence Artificial Neural Networks Pattern Recognition Fuzzy Systems Genetic Algorithms Hybrid Systems Intelligent Control Intelligent Databases Knowledge-based Engineering Learning Algorithms Memory, Storage and Retrieval Multimedia Systems Formal Models for Multimedia Interactive Multimedia Multimedia and Virtual Reality Multimedia and Telecommunications Multimedia Information Retrieval Multimedia and Security Multimedia Hardware Multimedia and Algorithms Special Sessions, Pre-Conference Workshops and Tutorial: Proposals for special sessions, pre-conference workshops and tutorials relevant to the conference topics are invited. The deadline for submitting the proposal is Feb 15, 2005. Special Poster Session: ICCIMA'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. Invited Sessions Keynote speakers (key industrialists, chief research scientists and leading academics) will be addressing the main issues of the conference. Important Dates: Submission of papers received latest on: March 10, 2005 Submission of Papers Papers in English reporting original and unpublished research results and experience are solicited. Electronic submission of papers via www.iccima.org. Visit the web page for more information. Page Limits Papers for refereeing should be double-spaced and must include an abstract of 100-150 words with up to six keywords. Selected papers will have a limit of 6 pages in the proceedings to be published by IEEE. Evaluation Process All submissions will be refereed based on the following criteria by two reviewers with appropriate background. originality significance contribution to the area of research technical quality relevance to ICCIMA 2005 topics clarity of presentation Referees report will be provided to all authors. Check List Prospective authors should check that the following items are attached and guidelines followed while submitting the papers for refereeing purpose. * The paper and its title page should not contain the name(s) of the author(s), or their affiliation * The paper should have attached a covering page containing the following information -title of the paper -author name(s), title, affiliation, mail and e-mail addresses, phone and fax numbers -Conference topic area -up to six keywords * The name, e-mail, phone, fax and postal address of the contact person should be attached to the submission. Contact Information: ICCIMA' 05 Secretariat Department of Electrical and Computer Engineering University of Nevada, Las Vegas 4505 Maryland Parkway, Box 454026 Las Vegas, NV 89154-4026 USA Phone: +1 702 895 4184 Fax: +1 702 895 1115 email: secretary(a)iccima.org URL: http://www.iccima.org/ _______________________________________________ Conf mailing list Conf(a)Mail.Egr.UNLV.EDU http://Mail.Egr.UNLV.EDU/mailman/listinfo/conf

1 0

Context of a pattern variable
by Tomasz Zielonka 12 Jan '05

12 Jan '05

Hello! I have an idea for a funny extension to pattern matching in Haskell. I wonder if it was proposed before, and most importantly, if it would be seen as useful. Currently, pattern variables get only the values of the corresponding subterms of a matched term. What if we could mark a pattern variable to match not the corresponding subterm, but *the rest* of the term, as a "context" function. Such a function would wrap its argument with *the rest*. It would allow to easily exchange some deep part of a data structure. The extension introduces a new syntax for patterns, similar to the as-pattern - @. In the following examples, I'll use @> for this. The syntax case expr of (... (ctx @> pat) ...) -> expr2 ... would mean that if the pattern succeeds, then in expr2 ctx is bound to the function: (\x -> (... (x) ...)) This is very informal, but I'm sure you understand. Note that the dots stand for corresponding, but different things in "case" and in the lambda (pattern vs value). Here are some simple examples how Haskell code could be rewritten using the proposed extension: before: case t of (x, y, z) -> (x, y, z+1) after: case t of (_, _, ctx @> z) -> ctx z before: case t of (x, y, (a, Just z)) -> (x, y, (a, z)) after: case t of (x, y, (a, ctx @> Just z)) -> ctx z Note that in the above example ctx is a polymorphic function. I am not sure this extension would be so useful, that is, if its usefulness would outweigh the cost of implementation. However, it seems to me that the implementation would be quite a simple code transformation, that wouldn't even require to look up datatype definitions. It is probably possible to hack a working proof of concept eg. in Template Haskell. BTW, I already see some problems with this syntax. For example, this code case t of (x, y, (a, ctx @> Just z)) -> ctx z wouldn't be equivalent to this one case t of (x, y, v) -> case v of ctx @> Just z -> ctx z I would love to hear you opinions. Maybe you can think of some really convincing (or unconvincing) code examples? Best regards, Tomasz

6 12