From grust at in.tum.de Tue Jan 2 05:52:10 2007 From: grust at in.tum.de (Torsten Grust) Date: Tue, 2 Jan 2007 11:52:10 +0100 Subject: [TYPES/announce] PLAN-X 2007: Last Call for Participation Message-ID: Last Call for Participation P L A N - X 2 0 0 7 Programming Language Technologies for XML An ACM SIGPLAN Workshop collocated with POPL 2007 Nice, France -- January 20, 2007 www.plan-x-2007.org Please join us for PLAN-X 2007, the fifth workshop in the PLAN-X series, dedicated to the interaction and integration of programming language technology and the world of XML. The XML data model and its associated languages add interesting twists to programming language practice as well as theory. Just like its four predecessors, the PLAN-X 2007 workshop turns the spotlight on how programming language technology can embrace and explain streaming XML transformations, types for XPath and XML updates, web service contracts, tree patterns in XQuery, LINQ and XML Schema, and more. PLAN-X 2007 will feature eight talks, four system demonstrations, extensive opportunity for discussion, and a keynote address by Christoph Koch (U Saarland, Germany). PLAN-X 2007 will be held in the Plaza Hotel (Nice, France) all-day on Saturday, January 20, 2007, just after and collocated with POPL 2007, the ACM SIGPLAN - SIGACT Symposium on Principles of Programming Languages (January 17-19, 2007). -- PROGRAM (Saturday, January 20, 2007) 09:00--10:00 Welcome Invited Talk by Christoph Koch (U Saarland, Germany) XPath Leashed 10:00--10:30 Coffee break 10:30--12:00 Session 1: Research Papers Streaming XML Transformations Using Term Rewriting (Alain Frisch, Keisuke Nakano) How to Recognise Different Kinds of Tree Patterns From Quite a Long Way Away (Jan Hidders, Philippe Michiels, Jerome Simeon, Roel Vercammen) Lux: A Lightweight, Statically Typed XML Update Language (James Cheney) 12:00--01:30 Workshop lunch (provided) 01:30--03:10 Session 2: Research Papers and Demo Presentations A Theory of Contracts for Web Services (Giuseppe Castagna, Nils Gesbert, Luca Padovani) XML Transformation Language Based on Monadic Second Order Logic (Kazuhiro Inaba, Haruo Hosoya) Demo: MTran: An XML Transformation Language Bases on Monadic Second Order Logic (Kazuhiro Inaba, Haruo Hosoya) Demo: XCentric: A Logic-Programming Language for XML Processing (Jorge Coelho, M?rio Florido) Demo: LINQ to XSD (Ralf L?mmel) Demo: GeLaBa: A Framework to Define Classes of XML Documents and to Automatically Derive Specialized Infrastructures (Benoit Pin, Georges Andr? Silber) 03:10--04:00 Interactive Demos and Coffee break 04:00--05:30 Session 3: Research Papers XPath Typing Using a Modal Logic with Converse for Finite Trees (Pierre Geneves, Nabil Layaida, Alan Schmitt) Deciding Equivalence of Top-Down XML Transformations in Polynomial Time (Sebastian Maneth, Helmut Seidl) A Logic Your Typechecker Can Count On: Unordered Tree Types in Practice (Nate Foster, Benjamin C. Pierce, Alan Schmitt) -- REGISTRATION PLAN-X 2007 is held in cooperation with POPL 2007. You can register for the workshop via the POPL 2007 registration process (online or offline). Please visit http://www.regmaster.com/conf/popl2007.html Registration rates are shown below. Note that you can upgrade an existing POPL 2007 registration to include PLAN-X 2007. Workshop-only registration is possible as well. ACM or SIGPLAN Member $89 Non-Member $99 Student $89 Your registration includes a copy of the PLAN-X 2007 informal proceedings, coffee breaks, and lunch. -- PLAN-X 2007 Workshop Chairs - General Chair - Program Chair Torsten Grust Giorgio Ghelli TU M?nchen U Pisa Munich, Germany Pisa, Italy grust at in.tum.de ghelli at di.unipi.it -- PLAN-X 2007 Program Committee - Michael Benedikt (Lucent, USA) - Daniela Florescu (Oracle, USA) - Alain Frisch (INRIA Rocquencourt, France) - Giorgio Ghelli, Chair (U Pisa, Italy) - Haruo Hosoya (U Tokyo, Japan) - Anders M?ller (U Aarhus, Denmark) - Mukund Raghavachari (IBM T.J. Watson Research Center, USA) - Alan Schmitt (INRIA Rh?ne-Alpes, France) - Sophie Tison (U Lille, France) - Philip Wadler (U Edinburgh, UK) From jonathan.cohen at anu.edu.au Thu Jan 4 06:26:57 2007 From: jonathan.cohen at anu.edu.au (Jon Cohen) Date: Thu, 4 Jan 2007 22:26:57 +1100 Subject: [TYPES/announce] USMC'07: Final call for talks and registration Message-ID: <57FC6FC3-34A2-41CC-86F3-1C71060CA147@anu.edu.au> FINAL CALL FOR TALKS AND REGISTRATION Universal Structures in Mathematics and Computing http://usmc07.rsise.anu.edu.au The Australian National University Canberra, Australia 5 - 7 February 2007 * Deadline for registration: 2nd February 2007 * Deadline for talk titles and abstracts submission: 19th January 2007 This workshop aims to bring together researchers working in category theory, universal algebra, logic and their applications to computer science in order to highlight recent advances in these fields and to facilitate dialogue between the different camps. Of particular interest is work which spans two or more of these areas. Keynote Speakers: * Brian Davey (La Trobe, Australia) * Rob Goldblatt (VUW, New Zealand) * Ross Street (Macquarie, Australia) * Glynn Winskel (Cambridge, UK) Please see the workshop website for futher details on registration, submission of talks, topics of interest and accommodation details. The workshop is sponsored by the Australian Mathematical Sciences Institute (AMSI) and National ICT Australia. From skalka at cs.uvm.edu Wed Jan 3 08:55:55 2007 From: skalka at cs.uvm.edu (Christian Skalka) Date: Wed, 03 Jan 2007 08:55:55 -0500 Subject: [TYPES/announce] PhD Position in Computer Science at UVM Message-ID: <004601c72f3e$e4b03720$2802a8c0@Pers> ================================= PhD POSITION IN COMPUTER SCIENCE FOUNDATIONS OF COMPUTER SECURITY The University of Vermont, USA ================================= Location: Department of Computer Science, The University of Vermont (UVM), Burlington, Vermont, USA. http://www.cs.uvm.edu http://www.uvm.edu http://www.ci.burlington.vt.us Description: We are seeking qualified applicants for doctoral research opportunities in the foundations of computer security. Our current research has two main thrusts. The first is type-and-effect analysis for enforcing temporal safety properties in software as a form of programming language based security. The second is the use of formalisms and programming logics to specify and implement distributed trust management (authorization) systems for applications such as web services. More information about these projects and associated publications is available online: http://www.cs.uvm.edu/~skalka/skalka-pubs/skalka-projects.html Research will be conducted in the context of larger projects being carried out by the Distributed Systems Group: http://www.cs.uvm.edu/research/distrsys This position is funded by a grant from the Department of Defense (DoD), Air Force Office of Scientific Research (AFOSR). Inquiries: Please direct questions to Christian Skalka, skalka at cs.uvm.edu, http://www.cs.uvm.edu/~skalka. To Apply: Information about the UVM Computer Science PhD Program, including information about applying, is available on the web: http://www.cs.uvm.edu/gradinfo/PhD-guide.shtml The deadline for applications to start in Fall 2007 is February 1, 2007. ============================== Christian Skalka Assistant Professor Department of Computer Science University of Vermont http://www.cs.uvm.edu/~skalka ============================== From Philippe.LAHIRE at unice.fr Wed Jan 3 13:03:44 2007 From: Philippe.LAHIRE at unice.fr (Philippe.LAHIRE@unice.fr) Date: Wed, 03 Jan 2007 19:03:44 +0100 Subject: [TYPES/announce] 29 days to go until TOOLS Europe submission deadline Message-ID: <459BF000.20005@unice.fr> ============================================================================ TOOLS EUROPE 2007 Objects, Models, Components, Patterns ETH Zurich, Switzerland 24-28 June 2007 http://tools.ethz.ch/ ============================================================================ Call for Papers TOOLS EUROPE 2007 will be devoted to the combination of technologies that have emerged as a result of object technology becoming "mainstream". Like its predecessors, TOOLS EUROPE 2007 combines an emphasis on quality with a strong practical focus. This is the 45th TOOLS conference. Started in 1989, TOOLS conferences, held in Europe, the USA, Australia, China and Eastern Europe, have played a major role in the development of object technology field; many of the seminal concepts were first presented at TOOLS. After an interruption of four years, the conference is now revived to reflect the maturing of the field and the new challenges ahead. Contributions are solicited on all aspects of object technology and neighbouring fields, in particular model-based development, component-based development, and patterns (design, analysis and other applications); more generally, any contribution addressing topics in advanced software technology fall within the scope of TOOLS. Reflecting the practical emphasis of TOOLS, contributions showcasing applications along with a sound conceptual contribution are particularly welcome. For a non-exclusive list of potential topic areas see the conference Web page. Submission Guidelines All contributions will be subject to a rigorous selection process by the international Program Committee, with a stress on originality, practicality and overall quality. Every paper will be reviewed by at least 4 committee members. The acceptance rate will be published in the conference proceedings; TOOLS is committed to a fair and extensive peer-review process establishing a high standard in the area of modern practices in software engineering. By submitting a paper to TOOLS, authors warrant that the work is original and that the paper or a similar contribution is neither published nor considered for publication elsewhere. Submissions should follow the publication format of the Journal of Object Technology (JOT). Papers should be limited in size to 20 single-spaced pages. Further details are available from the website. Important Dates Deadline for technical papers: February 1, 2007, midnight Zurich time Author notification: April 15, 2007 Camera-ready copy due: May 15, 2007 The proceedings will be published as a special issue of the Journal of Object Technology. TOOLS EUROPE will also include workshops and tutorials (June 24), a poster session, and a venture forum (June 28). See the corresponding calls for contributions. Chairpersons Conference chair: Bertrand Meyer Program chair: Jean Bezivin Publicity chairs: Philippe Lahire, Laurence Tratt Program committee Patrick Albert, Gustavo Alonso, Uwe Assman, Don Batory, Claude Baudoin, Bernhard Beckert, Jean-Pierre Briot, Stefano Ceri, Siobh?n Clarke, Pierre Cointe, Charles Consel, Bernard Coulette, Patrick Cousot, Krystof Czarnecki, Tharam Dillon, Klaus Dittrich, Gregor Engels, Jacky Estublier, Jose Fiadeiro, Judit Nyekyne Gaizler, Viktor Gergel, Carlo Ghezzi, Yossi Gil, Martin Gogolla, Jeff Gray, Rachid Guerraoui, Pedro Guerreiro, Alan Hartmann, Reiko Heckel, Connie Heitmeyer, Valerie Issarny, Gerti Kappel, Joseph Kiniry, Ivan Kurtev, Philippe Lahire, Ralf L?mmel, Gary Leavens, Rustan Leino, Mingshu Li, Tiziana Margaria, Erik Meijer, Silvio Meira, Christine Mingins, Peter M?ller, Elie Najm, Oscar Nierstrasz, Jonathan Ostroff, Richard Paige, Alfonso Pierantonio, Jaroslav Pokorny, Ralf Reussner, Richard Riehle, Nicolas Rouquette, Anthony Savidis, Doug Schmidt, Bran Selic, Richard Mark Soley, Clemens Szyperski, Dave Thomas, T.H. Tse, Antonio Vallecillo, Alan Cameron Wills, Amiram Yehudai From supratik at cc.usu.edu Thu Jan 4 18:49:15 2007 From: supratik at cc.usu.edu (supratik@cc.usu.edu) Date: Thu, 04 Jan 2007 16:49:15 -0700 Subject: [TYPES/announce] Call for Papers: AVIS 2007 Message-ID: <46119.1167954555@cc.usu.edu> An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070104/e58ac356/attachment.htm From Ricky.Robinson at nicta.com.au Thu Jan 4 20:40:15 2007 From: Ricky.Robinson at nicta.com.au (Ricky Robinson) Date: Fri, 5 Jan 2007 12:40:15 +1100 Subject: [TYPES/announce] DAIS 2007: Extended submission deadline Message-ID: <09D3F703EF3B0A4CBE28449EA9F3D32004B129C0@nicta-atp-mail.in.nicta.com.au> --------------------------------------------------------------------- Third CALL FOR PAPERS *EXTENDED SUBMISSION DEADLINE* DAIS 2007 7th IFIP International Conference on Distributed Applications and Interoperable Systems "Towards Sustainability" Paphos, Cyprus 6 - 8 June 2007 --------------------------------------------------------------------- Abstract submission: 15 January 2007 Paper submission: 22 January 2007 Work-in-progress papers: 2 February, 2007 Author notification: 7 March 2007 Camera-ready copy: 26 March 2007 --------------------------------------------------------------------- http://www.discotec07.cs.ucy.ac.cy --------------------------------------------------------------------- The 7th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS) is part of the federated conferences DisCoTec (Distributed Computing Techniques), together with the 9th International Conference on Coordination Models and Languages (COORDINATION) and the 9th IFIP International Conference on Formal Methods for Open Object-based Distributed Systems (FMOODS). It will be organised by the Department of Computer Science of the University of Cyprus. ABOUT THE CONFERENCE Distributed applications and interoperable systems have become an integral part of everyday living, part of the socio-economic ecosystem of our human environment. With such interdependence between society and software, distributed software applications must be sustainable and adaptable in the long term, despite the changes in our environment. What do we understand by sustainability in distributed applications and interoperable systems? How do we ensure our distributed applications can make local adaptation to specific circumstances of their deployment? How do we make our interoperable systems evolvable in the face of widespread change in their environment? How do we integrate distributed software within the wider fabric of computing within our modern world? How can distributed applications and interoperable systems capitalise and exploit future trends and the changing user demographic? The DAIS conference series addresses all aspects of distributed applications and interoperable systems: design, implementation, operation and maintenance. This time we particularly solicit papers that address sustainability issues. DAIS'07 is the 7th event in this successful international conference series, commencing in 1997. It will be a forum for researchers, vendors and users to come together to review, discuss and learn about the future of distributed applications and interoperable systems. DAIS is now an annual event. CONFERENCE THEMES DAIS'07 solicits high quality papers reporting research results and/or experience reports. All papers must be original, unpublished and not submitted simultaneously for publication elsewhere. DAIS'07 conference themes include: - innovative distributed applications in the areas of * enterprise computing * mobile, grid and peer-to-peer computing * context-aware, ubiquitous and pervasive computing - models and concepts supporting distributed applications in the areas of * sustainability * adaptability * evolution - middleware supporting distributed applications in the area of * autonomic applications and systems * context-aware, adaptive applications * reconfigurable and self-managing applications * quality of service-aware applications - evolution of application integration and interoperability in * enterprise-wide and inter-enterprise integration * semantic interoperability and semantic web services * service-oriented applications - software engineering of distributed applications * domain-specific modeling languages * model evolution * model-driven adaptation, testing and validation * re-engineering SUBMISSION GUIDELINES Submissions must be done electronically as postscript or PDF, using the Springer LNCS style. DAIS'07 seeks: - Full technical papers in no more than 14 pages, - Work-in-progress papers, describing on-going work and interim results, in no more than 6 pages. Both categories of papers will be reviewed thoroughly by the DAIS'07 Program Committee. Accepted papers will appear in the conference proceedings published by Springer Verlag in the LNCS series. More specific guidelines on the preparation of papers can be found on the conference website. IMPORTANT DATES Abstract submission January 15, 2007 Full paper submission: January 22, 2007 Work-in-progress papers: February 2, 2007 Notification of acceptance: March 7, 2007 Camera ready version: March 26, 2007 ORGANISERS General chair: George Angelos Papadopoulos, University of Cyprus, Cyprus Steering committee: Lea Kutvonen, University of Helsinki, Finland Hartmut Koenig, BTU Cottbus, Germany Kurt Geihs, University of Kassel, Germany Elie Najm, ENST, Paris, France PC Chairs: Jadwiga Indulska, University of Queensland, Australia Kerry Raymond, Queensland University of Technology, Australia Publicity chair: Ricky Robinson, National ICT Australia, Australia Program committee: N. Alonistioti, University of Athens, Greece D. Bakken, Washington State University, USA Y. Berbers, Katholieke Universiteit Leuven, Belgium A. Beugnard, ENST-Bretagne, France G. Blair, Lancaster University, UK I. Demeure, ENST, France C. Eckert, TU Darmstadt, Germany F. Eliassen, University of Oslo, Norway P. Felber, Universit? de Neuch?tel, Switzerland, K. Geihs, University of Kassel, Germany R. Gr?nmo, SINTEF ICT, Norway D. Hagimont, INP Toulouse, France S. Hallsteinsen, SINTEF ICT, Norway J. Indulska, University of Queensland, Australia H. Koenig, BTU Cottbus, Germany R. Kroeger, Univeristy of Applied Sciences, Wiesbaden, Germany L. Kutvonen, University of Helsinki, Finland W. Lamersdorf, University of Hamburg, Germany M. Lawley, Queensland University of Technology, Australia P. Linington, University of Kent, UK C. Linnhof-Popien, University of Munich, Germany K. Lund, Norwegian Defence Research Establishment (FFI), Norway R. Meier, Trinity College Dublin, Ireland L. Merakos, University of Athens, Greece A. Montresor, University of Trento, Italy E. Najm, ENST, France R. Oliveira, Universidade do Minho, Portugal A. Puder State University San Francisco, USA K. Raymond, Queensland University of Technology, Australia R. Robinson, National ICT Australia, Australia A. Schill, Technical University of Dresden, Germany T. Senivongse, Chulalongkorn University, Thailand K. Sere, ?bo Akademi University, Finland J. B. Stefani, INRIA, France E. Tanter, University of Chile, Chile K. Zielinski, AGH Univ. of Science and Technology, Poland -- Ricky Robinson, Ph.D. Researcher Queensland Laboratory National ICT Australia Limited PO Box 10161 Brisbane QLD 4000 Australia Tel. +61 7 3000 0514 Fax. +61 7 3000 0480 The imagination driving Australia's ICT future. To receive the latest NICTA information register at http://nicta.com.au/registration.cfm -------------------------------------------------------------------------- This email and any attachments may be confidential. They may contain legally privileged information or copyright material. You should not read, copy, use or disclose them without authorisation. If you are not an intended recipient, please contact us at once by return email and then delete both messages. We do not accept liability in connection with computer virus, data corruption, delay, interruption, unauthorised access or unauthorised amendment. This notice should not be removed. From djg at cs.washington.edu Sat Jan 6 12:37:49 2007 From: djg at cs.washington.edu (Dan Grossman) Date: Sat, 06 Jan 2007 09:37:49 -0800 Subject: [TYPES/announce] Call-for-contributions: PASTE 2007 Message-ID: <459FDE6D.4000703@cs.washington.edu> [Research using types for software engineering would certainly fall under the scope of PASTE.] Of particular note are the "group presentations" which are a novel feature being tried at PASTE for the first time. --Dan ======= PASTE 2007 Call for Contributions 7th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering June 13-14, 2007 (co-located with PLDI 2007, part of FCRC 2007) http://paste07.cs.washington.edu/ PASTE is soliciting research papers and research-group presentations, each described in more detail below. PASTE 2007 is the seventh workshop in a series that brings together the program analysis, software tools, and software engineering communities to focus on applications of program analysis techniques in software tools. PASTE 2007 will provide a forum for the presentation of exciting research, empirical results, and new directions in areas including (but not limited to): * program analysis for program understanding, debugging, testing, and reverse engineering * integration of program analysis into programming environments * user interfaces for software tools and software visualization * applications of program slicing, model checking, and other program analysis techniques * analysis of program execution or program evolution * integration of, or tradeoffs between, different analysis techniques * issues in scaling analyses and user interfaces to deal with large systems PASTE will be a true workshop, with research presentations, organized discussions, an opportunity for all attendees to make short presentations, and ample time for debate. Research papers: We are soliciting short (6-page limit) research papers that describe ongoing research or new results. Papers should be formatted using the ACM SIG templates, and, including figures and references, should not exceed the page limit. Accepted papers will be published by ACM. The program committee will select papers based on technical quality, relevance to the PASTE community, and ability to inspire new research. Research-Group Presentations: We are soliciting group presentations describing a body of work relevant to PASTE. Groups should submit an overview of a one-hour presentation; this overview should not exceed 2 pages. A group presentation may describe past (retrospective), present (ongoing), or future (agenda) work or a combination thereof. One model we encourage is a short introduction by a faculty member followed by 3-4 student presentations that reinforce a theme. Selected presentations will have the option of including a 2-page abstract in the published proceedings. The program committee will select presentations based on relevance, timeliness, and a coherent theme. The committee will prefer presentations that will spark discussion and be accessible to the entire PASTE community. Because these presentations are new, we encourage interested groups to send questions and ideas to the co-chairs. Important dates: Submission deadline: Wednesday February 7, 2007, 11:59PM Samoan Time (firm) Author notification: Saturday March 10, 2007 Camera-ready copy due: April 2, 2007 Workshop: June 13-14, 2007 Program committee: Manuvir Das (co-chair) Microsoft Center for Software Excellence Harald Gall University of Zurich Dan Grossman (co-chair) University of Washington Laurie Hendren McGill University Ranjit Jhala University of California, San Diego Ben Liblit University of Wisconsin-Madison Gail Murphy University of British Columbia Radu Rugina Cornell University From leavens at cs.iastate.edu Sun Jan 7 20:36:27 2007 From: leavens at cs.iastate.edu (Gary T. Leavens) Date: Sun, 7 Jan 2007 19:36:27 -0600 (CST) Subject: [TYPES/announce] CFP: Foundations of Aspect-Oriented Languages FOAL 2007 Message-ID: [FOAL is very interested in papers on types and semantics related to aspect-oriented languages. Please contribute!] Call For Papers FOAL: Foundations of Aspect-Oriented Languages 2007 A one day workshop affiliated with AOSD 2007 in Vancouver, British Columbia. Submission Deadline: 23:00 GMT, 10 January 2007 Notification of Acceptance: 2 February 2007 Final Versions of Papers Due: 1 March 2007 Workshop: 13 March 2007 Themes and Goals FOAL is a forum for research in foundations of aspect-oriented programming languages. Areas of interest include but are not limited to: * Semantics of aspect-oriented languages * Specification and verification for such languages * Type systems * Static analysis * Theory of testing * Theory of aspect composition * Theory of aspect translation (compilation) and rewriting The workshop aims to foster work in foundations, including formal studies, promote the exchange of ideas, and encourage workers in the semantics and formal methods communities to do research in the area of aspect-oriented programming languages. All theoretical and foundational studies of this topic are welcome. The goals of FOAL are to: * Make progress on the foundations of aspect-oriented programming languages. * Exchange ideas about semantics and formal methods for aspect-oriented programming languages. * Foster interest within the programming language theory and types communities in aspect-oriented programming languages. * Foster interest within the formal methods community in aspect-oriented programming and the problems of reasoning about aspect-oriented programs. Workshop Format The planned workshop format is primarily presentation of papers and group discussion. Talks will come in three categories: long (30 minutes plus 15 minutes of discussion), regular (20 minutes plus 5 minutes of discussion) and short (7 minutes plus 3 minutes of discussion). The short talks will allow for presentations of topics for which results are not yet available, perhaps for researchers who are seeking feedback on ideas or seek collaborations. We also plan to ensure sufficient time for discussion of each presentation by limiting the overall number of talks. Submissions Invitation to the workshop will be based on papers selected by the program committee; those wishing to attend but not having a paper to submit should contact the organizers directly to see if there is sufficient space in the workshop. FOAL solicits long, regular, and short papers on all areas of formal foundations of AOP languages. Submissions will be read by the program committee and designated reviewers. Papers will be selected for long, regular, and short presentation at the workshop based on their length, scientific merit, innovation, readability, and relevance. Papers previously published or already being reviewed by another conference are not eligible. Some papers may not be selected for presentation, and some may be selected for presentation in shorter talks than their paper length would otherwise command. We will limit the length of paper presentations and the number of papers presented to make sure that there is enough time for discussion. Papers presented at the workshop will be included in a technical report (from Iowa State University). Authors will retain their own copyright to the papers. Publication of papers at other venues will thus remain possible. We will also investigate having a special issue of a journal for revisions of selected papers after the workshop. Authors should note the following details: * Submissions are due no later than 23:00 GMT, 10 January 2007. (This is a firm deadline.) * Authors must indicate whether they wish to be considered for a long, regular, or short presentation. * Papers for long presentations must not exceed 10 pages in length; those for regular presentations must not exceed 7 pages in length, and those for short presentations must not exceed 3 pages in length. * Some papers may not be selected for presentation, and some may be selected for presentation in shorter talks than requested. * We encourage use of the ACM Conference format for submissions, as this will be required for accepted papers. You must add page numbers (which are not part of the standard format) to your submissions, to make adding comments easier. * Submissions are to be made to the following URL: http://continue.cs.brown.edu/servlets/foal07/continue.ss We will notify the corresponding author of papers that are selected for presentation at the workshop by 2 February 2007. Early registration for AOSD (you must register for AOSD to attend the workshop) is 9 February 2007. Final versions of papers for the proceedings will be due on 1 March 2007. Important Dates Submission Deadline: 23:00 GMT, 10 January 2007 Notification of Acceptance: 2 February 2007 Final Versions of Papers Due: 1 March 2007 Workshop: 13 March 2007 For more information, visit the FOAL Workshop home page (at http://www.cs.iastate.edu/FOAL). Gary T. Leavens Department of Computer Science, Iowa State University 229 Atanasoff Hall, Ames, Iowa 50011-1041 USA http://www.cs.iastate.edu/~leavens phone: +1-515-294-1580 From Sukyoung.Ryu at sun.com Tue Jan 9 11:51:30 2007 From: Sukyoung.Ryu at sun.com (Sukyoung Ryu) Date: Tue, 09 Jan 2007 11:51:30 -0500 Subject: [TYPES/announce] Announcement: A reference implementation of Fortress Message-ID: <15BAD214-C408-47CE-8A0E-A962DEC60DD8@sun.com> We'd like to announce availability of a preliminary, open source, interpreter implementing a small core of the Fortress programming language. This interpreter runs on the JVM. You can download the source code at: http://fortress.sunsource.net/ Our intention is to grow this implementation over time, with the help of university partners and other interested third parties. We expect that many parts of this interpreter will be used as components of a complete Fortress compiler, which is our long term goal. Fortress is a new programming language designed for high-performance computing (HPC) with high programmability. In order to explore breakaway approaches to improving programmability, the Fortress design has not been tied to legacy language syntax or semantics; all aspects of HPC language design have been rethought from the ground up. As a result, we are able to support features in Fortress such as transactions, specification of locality, and implicit parallel computation, as integral features built into the core of the language. Features such as the Fortress component system and test framework facilitate program assembly and testing, and enable powerful compiler optimizations across library boundaries. Even the syntax and type system of Fortress are custom-tailored to modern HPC programming, supporting mathematical notation and static checking of properties such as physical units and dimensions, static type checking of multidimensional arrays and matrices, and definitions of domain-specific language syntax in libraries. Moreover, Fortress has been designed with the intent that it be a "growable" language, gracefully supporting the addition of future language features. In fact, much of the Fortress language itself (even the definition of arrays and other basic types) is encoded in libraries atop a relatively small core language. For further information and downloads, please visit: http://fortress.sunsource.net/ Comments and feedback are welcome. ====================================================================== Programming Language Research Group, Sun Microsystems Laboratories From finco07 at cs.brown.edu Tue Jan 9 22:03:09 2007 From: finco07 at cs.brown.edu (FINCO 2007) Date: Tue, 9 Jan 2007 22:03:09 -0500 Subject: [TYPES/announce] CFP: Foundations of Interactive Computation In-Reply-To: References: Message-ID: call for papers FInCo 2007: FOUNDATIONS OF INTERACTIVE COMPUTATION satellite workshop of ETAPS 2007 Saturday 31 March 2007, Braga, Portugal http://www.cs.brown.edu/sites/finco07 ==================================================== The interaction paradigm provides a new conceptualization of compu- tational phenomena, placing the emphasis on interaction rather than on algorithms; concurrent, distributed, reactive, embedded, component- oriented, agent-oriented and service-oriented systems all exploit interaction as a fundamental paradigm. Contemporary approaches to Software Engineering, Artificial Intelligence, Programming Languages, and Networking are all part of this paradigm change. However, a satis- factory unified foundational framework for interactive computation is still lacking, analogous to the one that Turing Machines and lambda- calculus provide for algorithms. Following the success of FInCo 2005, this workshop provides an opportunity for researchers to meet and ex- change ideas, with the ultimate goal of providing a unified conceptual and formal framework for interactive computation. The following characteristics distinguish this new, interactive notion of computation: Computational Problem: The notion of a computational problem includes performing a task or providing a service, rather than being rest- ricted to algorithmically producing an answer to a question. Observable Behavior: A computing component is modeled in terms of its observable behavior, where later input values may depend on earlier output values and vice versa. Environments: The world, or environment of the computation is part of the model, dynamically supplying the computational system with the inputs, and consuming the output values from the system. Concurrency: Computation may be concurrent, where the computing agent computes in parallel with its environment, and with other agents in it. The claim that "interaction is more powerful than algorithms" is an open invitation to researchers to develop the tools and methods that can lend credence to this claim. Many models capturing different aspects of interaction have been introduced, including interaction automata and process algebras. It is now time for researchers involved in interactive systems to join their efforts and collaborate to develop a common frame- work that focuses on constructive models of computation that exploit interaction as a first-class concept. Accordingly, FInCo 2007 has the following goals: * Understand the fundamental issues underlying the interaction paradigm; * Establish a common language- and domain-independent framework for a theory of interactive computation; * Identify the interactive principles of effective and reliable engi- neering of software systems; * Map out the design space of models of interaction, towards accompli- shing above goals. WORKSHOP PANEL Title: Interactive Models for Software Engineering Moderator: Peter Wegner, Brown University, USA Description: Software & systems engineering of today is being affected by the growing importance of interaction. This panel considers the role of interaction in the theory and practice of computing, with a special focus on system design and development. PAPERS We solicit papers addressing one or more of the above goals. Submit papers by email to by Jan. 31, 2007, with a 12- page limit. Workshop proceedings will be published by ENTCS. Selected papers will be invited for journal publication. For a PDF copy of this announcement, and for further information, see our web site at http://www.cs.brown.edu/sites/finco07 IMPORTANT DATES Submission: Jan. 31, 2007 Notification: Feb. 28, 2007 Workshop: Mar. 31, 2007 ORGANIZERS Farhad Arbab, CWI and Leiden Univ., The Netherlands Dina Goldin, Brown Univ., USA (chair) PROGRAM COMMITTEE Gul Agha, UIUC, USA Luca de Alfaro, UC Santa Cruz, USA Luis Barbosa, Univ. do Minho, Portugal Antonio Brogi, Univ. di Pisa, Italy Jon Doyle, North Carolina State U., USA Giorgio Delzanno, Univ. di Genova, Italy Jos? Luiz Fiadeiro, Univ. of Leicester, UK Rob van Glabbeek, Univ. of New South Wales, Australia Kees van Hee, Technische Univ. Eindhoven, The Netherlands Orna Kupferman, Hebrew Univ., Israel R. Prescott Loui, Washington Univ. in St. Louis, USA Peter McBurney, Univ. of Liverpool, UK John-Jules Meyer, Utrecht Univ., the Netherlands Ugo Montanari, Univ. di Pisa, Italy Rocco De Nicola, Univ. degli Studi di Firenze, Italy Andrea Omicini, Univ. di Bologna - Cesena, Italy Catuscia Palamidessi, INRIA and LIX ?cole Polytechnique, France Jean-Eric Pin, Univ. Paris Denis Diderot and CNRS, France Vladimiro Sassone, Univ. of Sussex, UK Douglas C. Schmidt, Vanderbilt Univ., USA Carolyn Talcott, SRI Int'l, USA Bernhard Thalheim, Kiel Univ., Germany STEERING COMMITTEE Manfred Broy, TU M?nchen, Germany Dina Goldin, Brown Univ., USA Mirko Viroli, Univ. Bologna/Cesena, Italy Peter Wegner, Brown Univ., USA WEB SITE http://www.cs.brown.edu/sites/finco07 From streicher at mathematik.tu-darmstadt.de Thu Jan 11 05:54:54 2007 From: streicher at mathematik.tu-darmstadt.de (Thomas Streicher) Date: Thu, 11 Jan 2007 11:54:54 +0100 (CET) Subject: [TYPES/announce] Workshop announcement (Domains VIII) Message-ID: <200701111054.l0BAssE9017449@fb04209.mathematik.tu-darmstadt.de> This announcement is also attached as a pdf-file Announcement and Call for Abstracts Joint Workshop Domains VIII and Computability Over Continuous Data Types Novosibirsk, September 11 -- 15, 2007 The Workshop 'Domains' series is aimed at computer scientists and mathematicians alike who share an interest in the mathematical foundations of computation. It focusses on domain theory, its applications and related topics. It will be combined with topics based on the German--Russian project 'Computability Over Non-discrete Structures: Models, Semantics, Complexity' supported by Russian Foundation for Basic Research (RFBR) and Deutsche Forschungsgemeinschaft (DFG). Webpage: www.sbras.ru/ws/domains/ (Switch to English - upper right corner) email: domains at math.nsc.ru SCOPE Topics for this workshop include, but are not limited to domains and topology for semantics effective domains and spaces computation over continuous spaces program semantics models of sequential computation lambda calculus realizability proof mining constructive mathematics and its semantics computability theory computable models admissible sets LOCATION The Workshop will take place at the Sobolev Instituts of Mathematics of the Siberian Branch of the Russian Academy of Sciences located in Akademgorodok, which is formally a district of Novosibirsk. PARTICIPATION If you would like to participate in this workshop, please let us know your interest at an early stage. Please indicate whether you intend to give a talk: domains at math.nsc.ru SUBMISSION OF ABSTRACTS One page abstracts should be submitted to domains at math.nsc.ru Shortly after an abstract is submitted (usually a few weeks), the authors will be notified by the programme committee. Abstracts will be dealt with on a first come/first served basis. Submit as soon as possible. DEADLINE 15 May 2007\\[2mm] INVITED SPEAKERS will be announced later on. PROCEEDINGS Conference Proceedings will be published in a Journal. Submission for the Proceddings will be after the Workshop. They will be refereed according to the usual requirements of the Journal. ACCOMODATION All participants will be accommodated in the Hotel ``Zolotaya Dolina'' (Gold Valley) situated at walking distance from the Instituts of Mathematics. FEES There will be a registration fee of 85 Euros for covering expenses. For participants from Eastern Europa and the former Soviet Union we set the fee 300 Russian Roubles. PhD students do not pay a fee. If the fee is a problem, please contact the organizers for a possible arrangement in advance. VISAS AND REGISTRATION Most foreign participants will need a visa to enter Russia. We will inform you later about details. You also can find details at http://www.ict.nsc.ru/ws/ALC-9/visa.htm For obtaining a visa, one needs an official invitation issued by the local authorities at Novosibirsk. The processing of invitations takes about one month; in addition, please allow some time for sending it by mail!} DEADLINE for registration: 30 June, 2007 PROGRAMME COMMITTEE Yuri Ershov Sobolev Institute of Mathematics, Novosibirsk Sergei Goncharov Sobolev Institute of Mathematics, Novosibirsk Achim Jung University of Birmingham, Birmingham Klaus Keimel (Chair) Darmstadt Technical University, Darmstadt Ulrich Kohlenbach Darmstadt Technical University, Darmstadt Andrei Morozov (Co-Chair) Sobolev Institute of Mathematics, Novosibirsk Victor Selivanov Novosibirsk State Pedagogical University, Novosibirsk Dieter Spreen University of Siegen, Siegen WORKSHOP SECRETARY Alexei Stukachev (domains at math.nsc.ru) -------------- next part -------------- A non-text attachment was scrubbed... Name: announcement.pdf Type: application/octet-stream Size: 50821 bytes Desc: Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070111/08564d85/announcement.bin From dmitry.sustretov at loria.fr Fri Jan 12 08:32:08 2007 From: dmitry.sustretov at loria.fr (Dmitry Sustretov) Date: Fri, 12 Jan 2007 14:32:08 +0100 Subject: [TYPES/announce] ESSLLI 2007 Student Session Final Call For Papers Message-ID: [Our apologies for multiple postings of this announcement.] ESSLLI 2007 STUDENT SESSION FINAL CALL FOR PAPERS August 6-17 2007, Dublin, Ireland Deadline: February 11, 2007 http://www.loria.fr/~sustreto/stus07/ We are pleased to announce the Student Session of the 19th European Summer School in Logic, Language and Information, which will be held in Dublin, Ireland on August 6-17, 2007. We invite submission of papers in the areas of Logic, Language and Computation for presentation at the Student Session and for appearance in the proceedings. AIM Student Session exists to bring together young researchers to present and discuss their work in progress with a possibility to get feedback from senior researchers. SUBMISSION Only original publications are accepted, previous published works are not allowed. All authors of the paper must be students: undergraduate (before the completion of the Masters degree) or graduate (before the completion of the PhD degree). Papers can be submitted either for oral (20min talk+10 min discussion), or poster presentation. There are three subject areas: Logic and Language (lola), Language and Computation (laco) and Logic and Computation (loco). The submissions should be sent by email before 11 February 2007 to dmitry.sustretov at loria.fr (the message should have subject "ESSLLI STUS submission") along with an identification file in plain text of the following format: Title: title of the submission First author: firstname lastname Affiliation: affiliation of the first author E-mail: e-mail of the first author ...... Last author: firstname lastname Affiliation: affiliation of the last author E-mail: e-mail of the last author Abstract: (5 lines) Subject area: Logic and Language or Language and Computation or Logic and Computation Modality: Poster or Oral The submission should be in one of the following formats: PostScript, PDF or RTF. (In case of acceptance, the final version of the paper will have to be submitted in LaTeX format.) The papers must use single column A4 size pages, 11pt or 12pt fonts, and standard margins, and may not exceed 7 pages of length exclusive of references. The paper and identification file should be named by the following convention: category-modality-last name(s) of author(s) (for example, "loco-oral-martin.pdf" and "loco-oral-martin.txt"). At least one of the authors of the paper must register as a participant of ESSLLI. Accepted papers will be published in the proceedings which will be available during ESSLLI. TIMELINE Submission deadline: February 11, 2007 Notification of authors: April 20, 2007 Full paper deadline: May 20, 2007 ESSLLI: August 6-17, 2007 PROGRAM COMMITTEE Chairs: Ville Nurmi, University of Helsinki Dmitry Sustretov, LORIA Area experts: Paul Buitelaar (Language & Computation) Valentin Goranko (Logic & Computation) Carl Pollard (Logic & Language) Co-chairs: Logic & Computation Bryan Renne, City University of New York Levan Uridia, University of Amsterdam Language & Computation Luciana Benotti, INRIA Lorraine Michael Kaisser, University of Edinburgh Logic & Language Jana H?ussler, University of Konstanz Miltiadis Kokkonidis, University of Oxford CONTACT The Student Session webpage is the place for relevant information. http://www.loria.fr/~sustreto/stus07/ Feel free to contact the chairs for any questions about the submissions or the Student Session in general. Ville Nurmi Phone: +358 9 191 51497 Fax: +358 9 191 51400 E-mail: ville.v.nurmi at helsinki.fi Dmitry Sustretov Phone: +33 3 83 59 20 35 Fax: +33 3 83 41 30 79 E-mail: dmitry.sustretov at loria.fr From aichernig at ist.tugraz.at Fri Jan 12 12:55:52 2007 From: aichernig at ist.tugraz.at (Bernhard K. Aichernig) Date: Fri, 12 Jan 2007 18:55:52 +0100 Subject: [TYPES/announce] ICTAC 2007: Call for Papers Message-ID: <1168624552.5024.188.camel@localhost.localdomain> Call for Papers ICTAC 2007 4th International Colloquium on Theoretical Aspects of Computing 26-28 September 2007, Macao SAR, China http://www.iist.unu.edu/ictac07 Important Dates: Paper submission: 20 April 2007, Notification of acceptance: 1 June 2007, Final copy for proceedings: 22 June 2007, ICTAC 2007: 26-28 September 2007. Associated Events: - School on Domain Modelling and the Duration Calculus, 17-21 September 2007, Shanghai - Festschrift Symposium dedicated to the 70th birthdays of Dines Bj?rner and Zhou Chaochen, 24-25 September 2007, Macao - Workshops, 22-23 September, 2007, Macao See Call for Workshop Proposals at conference URL! ICTAC is an International Colloquium on Theoretical Aspects of Computing founded by the International Institute for Software Technology of the United Nations University (UNU-IIST). The aim of the colloquium is to bring together practitioners and researchers from academia, industry and government to present research results, and exchange experience, ideas, and solutions for their problems in theoretical aspects of computing. Beyond these scholarly goals, another main purpose of the conference is to promote cooperation in research and education between participants and their institutions, from developing and industrial countries, as in the mandate of the United Nations University. The previous three ICTAC events were held in Guiyang, China (2004), Hanoi, Vietnam (2005), Tunis, Tunisia (2006). The topics of the conference include, but are not limited to: - automata theory and formal languages - principles and semantics of programming languages - logics and their applications - software architectures and their description languages - software specification, refinement, and verification - model checking and theorem proving - formal techniques in software testing - models of object and component systems - coordination and feature interaction - integration of formal and engineering methods - service-oriented development - models of concurrency, security, and mobility - theory of parallel, distributed, and internet-based (grid) computing - real-time, embedded and hybrid systems - type and category theory in computer science - case studies - theories, tools and experiments of verified systems - integration of theories of system development and their tool support ICTAC 2007 will have a technical program for five days including a two-day festschrift symposium dedicated to the 70th birthdays of former UNU-IIST directors, Dines Bj?rner and Zhou Chaochen, and three days for a conference. There will also be a training school in the preceding week on topics of Domain Modelling and the Duration Calculus, to which Dines Bj?rner and Zhou Chaochen have made significant contribution. Paper Submissions: Submissions to the conference must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. Papers should be written in English and not exceed 15 pages in LNCS format (see http://www.springer.de/comp/lncs/authors.html for details). Proceedings of the previous editions of ICTAC were published by Springer in the LNCS series. We plan to do the same this year. Best papers will be selected from the accepted papers and their authors invited to submit an extended version of their work to a special issue of Formal Aspects of Computing. Submission Procedure: Further information and instruction about submission can be found at the conference website http://www.iist.unu.edu/ictac07. General Chairs: John Fitzgerald, Newcastle University, UK George Michael Reed, UNU-IIST, Macao Program Chairs: Cliff Jones, Newcastle University, UK Zhiming Liu, UNU-IIST, Macao Jim Woodcock, University of York, UK Organisation Co-Chairs: Chris George, UNU-IIST, Macao Workshop Chair: Dang Van Hung, UNU-IIST, Macao Publicity Chair: Bernhard K. Aichernig, TU Graz, Austria Sponsored by: UNU-IIST, Formal Methods Europe PC Members: M?che?l mac an Airchinnigh, IE Farhad.Arbab, NL Kamel Barkaoui, FR Jonathan P. Bowen, UK Andrew Butterfield, IE Ana Cavalcanti, UK Antonio Cerone, MO Jim Davies, UK David Deharbe, BR Jin Song Dong, SG Lindsay Groves, NZ Stefan Hallerstede, CH Michael Hansen, DK Ian Hayes, AU Dang Van Hung, MO Mathai Joseph, IN Joseph Kiniry, IE Peter Gorm Larsen,DK Xuandong Li, CN Shaoying Liu, JP Ali Mili, US Joe Morris, IE Leonor Prensa Nieto, FR Anders Ravn, DK Augusto Sampaio, BR Emil Sekerinski, CA Natarajan Shankar, US Ji Wang, CN Naijun Zhan, CN Invited Speakers: TBA -- Dr. Bernhard K. Aichernig, Assistant Professor, IST, TU Graz http://www.ist.tugraz.at/aichernig From bpientka at cs.mcgill.ca Mon Jan 15 21:08:05 2007 From: bpientka at cs.mcgill.ca (Brigitte Pientka) Date: Mon, 15 Jan 2007 21:08:05 -0500 (EST) Subject: [TYPES/announce] LFMTP'07: Call for papers Message-ID: ----------------------------------------------------------------------- International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'07) http://www.cs.mcgill.ca/~bpientka/lfmtp07 Affiliated with CADE-21 Bremen, Germany, 16 July, 2007 CALL FOR PAPERS Important Dates: Abstract Submission 7 May 2007 Submission deadline: 13 May 2007 Author Notification: 3 June 2007 Final Version: 17 June 2007 Workshop day 16 July ----------------------------------------------------------------------- LFMTP'07 continues the International workshop on Logical Frameworks and Meta-languages (LFM) and the MERLIN workshop on MEchanized Reasoning about Languages with variable BIndingIN). Logical frameworks and meta-languages form a common substrate for representing, implementing, and reasoning about a wide variety of deductive systems of interest in logic and computer science. Their design and implementation on the one hand and their applications in for example proof-carrying code have been the focus of considerable research over the last two decades. This workshop will bring together designers, implementors, and practitioners to discuss all aspects of logical frameworks. The broad subject areas of LFMTP'07 are * The automation and implementation of the meta-theory of programming languages and related calculi, particularly work which involves variable binding and fresh name generation. * The theoretical and practical issues concerning the encoding of variable binding and fresh name generation, especially the representation of, and reasoning about, datatypes defined from binding signatures. * Case studies of meta-programming, and the mechanization of the (meta)theory of descriptions of programming languages and other calculi. Papers focusing on logic translations and on experiences with encoding programming languages theory are particularly welcome. Topics include, but are not limited to * logical framework design * meta-theoretic analysis * applications and comparative studies * implementation techniques * efficient proof representation and validation * proof-generating decision procedures and theorem provers * proof-carrying code * substructural frameworks * semantic foundations * methods for reasoning about logics * formal digital libraries Invited Speaker: to be announced Program Committee: Andreas Abel (LMU Munich) Peter Dybjer (Chalmers University) Marino Miculan (University Udine) Dale Miller (INRIA Futurs) Brigitte Pientka (McGill University) Benjamin Pierce (University of Pennsylvania) Carsten Schuermann (IT University of Copenhagen, PC Chair) Christian Urban (TU Munich) Paper Submissions: Three categories of papers are solicited: * Category A: Detailed and technical accounts of new research: up to fifteen pages including bibliography. * Category B: Shorter accounts of work in progress and proposed further directions, including discussion papers: up to eight pages including bibliography and appendices. * Category C: System descriptions presenting an implemented tool and its novel features: up to six pages. A demonstration is expected to accompany the presentation. Submission is electronic in postscript or PDF format. Submitted papers must conform to the ENTCS style preferrably using LaTeX2e. For further information and submission instructions, see the LFMTP web page: http://www.cs.mcgill.ca/~bpientka/lfmtp07/index.html Proceedings are to be published as a volume in the Electronic Notes in Theoretical Computer Science (ENTCS) series and will be available to participants at the workshop. Authors of accepted papers are expected to present their paper at the workshop. Organizers: Brigitte Pientka Carsten Schuermann bpientka at cs.mcgill.ca carsten at itu.dk School of Computer Science Department of Theoretical Computer Science McGill University IT University of Copenhagen From andrei at cs.chalmers.se Tue Jan 16 04:16:40 2007 From: andrei at cs.chalmers.se (Andrei Sabelfeld) Date: Tue, 16 Jan 2007 10:16:40 +0100 (MET) Subject: [TYPES/announce] IEEE Computer Security Foundations Symposium 2007 - CFP Message-ID: <20070116091640.1734F31EC@zsh.cs.chalmers.se> A non-text attachment was scrubbed... Name: not available Type: text Size: 6753 bytes Desc: not available Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070116/48fed13b/attachment.txt From H.Geuvers at cs.ru.nl Tue Jan 16 10:06:07 2007 From: H.Geuvers at cs.ru.nl (Herman Geuvers) Date: Tue, 16 Jan 2007 16:06:07 +0100 Subject: [TYPES/announce] Call for Papers: RDP Workshop PATE Message-ID: <45ACE9DF.9090300@cs.ru.nl> ===================================================================== Call for Papers RDP Workshop PATE Proof Assistants and Types in Education June 25 2007 http://www.rdp07.org/pate.html ===================================================================== This workshop is supported by the EU Types Coordination Action. The purpose of the workshop is to bring together researchers and lecturers interested in applying type theory and proof assistants in teaching. Contributions are solicited in the following subject areas and related topics: - type theory as a language for (teaching) mathematics and programming; - computer assisted informal reasoning; - tools and languages for teaching math and logic; - experience in using proof assistants in class. Submissions and Publication ----------------------------- Authors are invited to submit a paper (max 15 pages) by e-mail to Pierre.Courtieu at cnam.fr by March 1, 2007. Preliminary proceedings will be available at the workshop. Submissions should be in PostScript or PDF format, using ENTCS style files. Important Dates ----------------- Submission deadline: April 1, 2007 Notification: May 15, 2007 Pre-proceedings version due: June 7, 2007 Workshop: June 25, 2007 Programme Committee -------------------- Pierre Courtieu CNAM Paris (Co-Chair) Herman Geuvers Nijmegen (Co-Chair) Hugo Herbelin INRIA Paris Adam Naumowicz Bialystok Claudio Sacerdoti Coen Bologna Pawel Urzyczyn Warsaw From pierre.courtieu at gmail.com Tue Jan 16 11:48:45 2007 From: pierre.courtieu at gmail.com (Pierre Courtieu) Date: Tue, 16 Jan 2007 17:48:45 +0100 Subject: [TYPES/announce] CFP RDP Workshop Proof Assistants and Types in Education Message-ID: <20070116174845.72b09ea5@centaur.cnam.fr> ===================================================================== Call for Papers RDP Workshop PATE Proof Assistants and Types in Education June 25 2007 http://www.rdp07.org/pate.html ===================================================================== This workshop is supported by the EU Types Coordination Action. The purpose of the workshop is to bring together researchers and lecturers interested in applying type theory and proof assistants in teaching. Contributions are solicited in the following subject areas and related topics: - type theory as a language for (teaching) mathematics and programming; - computer assisted informal reasoning; - tools and languages for teaching math and logic; - experience in using proof assistants in class. Submissions and Publication ----------------------------- Authors are invited to submit a paper (max 15 pages) by e-mail to Pierre.Courtieu at cnam.fr by March 1, 2007. Preliminary proceedings will be available at the workshop. Submissions should be in PostScript or PDF format, using ENTCS style files. Important Dates ----------------- Submission deadline: April 1, 2007 Notification: May 15, 2007 Pre-proceedings version due: June 7, 2007 Workshop: June 25, 2007 Programme Committee -------------------- Pierre Courtieu CNAM Paris (Co-Chair) Herman Geuvers Nijmegen (Co-Chair) Hugo Herbelin INRIA Paris Adam Naumowicz Bialystok Claudio Sacerdoti Coen Bologna Pawel Urzyczyn Warsaw From jbw at macs.hw.ac.uk Tue Jan 16 17:14:58 2007 From: jbw at macs.hw.ac.uk (Joe Wells) Date: Tue, 16 Jan 2007 22:14:58 +0000 Subject: [TYPES/announce] Research Job: Compositional Analysis for Mobility & Concurrency @ Heriot-Watt U., Scotland, UK Message-ID: <86k5zmvct9.fsf@macs.hw.ac.uk> Research Position ULTRA group (Useful Logics, Types, Rewriting, and their Automation) Computer Science Department School of Mathematical and Computer Sciences Heriot-Watt University Edinburgh, Scotland, UK The HTML version of this job posting can be found at: http://www.macs.hw.ac.uk/~jbw/position-ad.html Description of the Position A research position is available working on modular reasoning and compositional analysis for computer systems and software with special interest in mobility and concurrency. The position is working with Joe Wells[1] in the ULTRA (Useful Logics, Types, Rewriting, and their Automation) group[2] in the Computer Science Department[3] in the School of Mathematical and Computer Sciences[4] at Heriot-Watt University[5] in Edinburgh[6], the capital of Scotland[7]. The position involves collaboration with the EPSRC and NSF-funded Church Project[8] as well as various contacts in the European Global Computing community. The research will include collaboration on the Poly*[9] polymorphic retargetable type system for process and mobility calculi, but is not limited to that topic. It will be helpful if the researcher is competent in 1 or more of the following knowledge areas. * Formal calculi for reasoning about the meaning of computer systems (including computer programs), especially those dealing with aspects of (a) concurrency and (b) mobility, but also those dealing with aspects of (c) modules, linking, and loading, (d) resource usage, (e) components, (f) staged compilation, (g) classes and objects, etc. * Analysis of systems represented in formal calculi. * Constraint solving and unification. * Type systems, especially those with features similar to intersection and union types. * Programming languages good for use for any of the above. The duration of the position is 1.5 years, with possible further extension depending on performance, funding, and other circumstances. Applications to spend a shorter period (e.g., the sabbatical leave of an established academic) will be considered. The initial salary will be in the range from 22111 GBP to 32471 GBP per year, commensurate with qualifications and experience. The position is available immediately. It is preferred that before starting the researcher will have completed a Ph.D. in a relevant discipline in Computer Science. Very good Ph.D. students elsewhere who want to spend part of their studies visiting Heriot-Watt will be considered. Applicants from outside the European Economic Area (EEA) will be considered. The researcher will probably collaborate on 1 or more of the following activities. The specific activities will be matched to the strengths of the researcher. * Designing new type systems for compositional (modular) analysis of systems that may involve one or more aspects of mobility, concurrency, and modularity, as well as other features such as resource awareness, components, run-time code generation, objects, etc. * Designing analysis algorithms for the new type systems. * Designing theories (e.g., "calculi") for reasoning about the meaning of computer systems with some of the features mentioned above. * Making software systems incorporating the new type systems, algorithms, and calculi. * Writing scientific reports on the work done. References 1. http://www.macs.hw.ac.uk/~jbw/ 2. http://www.macs.hw.ac.uk/ultra/ 3. http://www.macs.hw.ac.uk/cs/ 4. http://www.macs.hw.ac.uk/ 5. http://www.hw.ac.uk/ 6. http://www.geo.ed.ac.uk/home/tour/edintour.html 7. http://www.geo.ed.ac.uk/home/scotland/scotland.html 8. http://www.church-project.org/ 9. http://www.macs.hw.ac.uk/DART/software/PolyStar/FAQ.html Contact Information Informal inquiries should be directed to Joe Wells at: Web: http://www.macs.hw.ac.uk/~jbw/ E-mail: jbw at macs.hw.ac.uk Fax: +44 131 451 3327 Formal applications should be directed to the Heriot-Watt Human Resources Office at: Web: http://www.hw.ac.uk/hr/ E-mail: hr at hw.ac.uk (responses will usually be by paper mail, telephone, or fax) Voice mail: +44 131 451 3475 (available at all times) Fax: +44 131 451 3475 Minicom: +44 131 451 8212 Post: Human Resources Office Heriot-Watt University EDINBURGH EH14 4AS GREAT BRITAIN Applying for the Position Please use the reference code 16/07/L to help prevent your application from getting mixed up. For documents sent by e-mail, please use a public and standard format. (The best formats are plain text and PDF, because some of our staff may have trouble with HTML or PostScript. Microsoft Word format is forbidden except where returning a form our human resources office has supplied in this format.) To formally apply for this position, please do as many as possible of the items in the following list by 2007-02-12. The first 2 items are absolutely necessary and the 3rd and 4th are quite important. If you expect trouble meeting the deadline, please ask Joe Wells what to do. * Cause 3 recommendation letters to be sent directly by their writers. Do not send the letters with your application. (If someone tells you the letters are not needed yet or that less than 3 are needed, this is a mistake. We want to see the letters before choosing who to interview.) * Send the following yourself: + your complete curriculum vitae, and + contact details for the 3 people writing your recommendation letters. * Get the Heriot-Watt Human Resources Office to send you an "application pack". (This contains an application form (available at http://www.hw.ac.uk/hr/htm/forms/Academic%20Application%20form.pdf), an equal opportunities monitoring form (available at http://www.hw.ac.uk/hr/htm/forms/Equal%20Opportunities%20Monitoring%20Form%20new%20Riccarton.doc), information for applicants with disabilities, and some additional information about Heriot-Watt and the position.) * Fill out and return by post the application form and the equal opportunities monitoring form. If your curriculum vitae is well constructed, then some information requested will be redundant, so just write "see c.v." in those blanks, but please return the application form anyway. Although the application form requests only the addresses of 2 references, please follow the instructions above instead and supply 3. * Optionally, also send either of the following: + a brief statement about why your research accomplishments and interests are a good match for the position, and + up to 3 relevant publications of yours. * It is helpful to inform Joe Wells that you are applying so that he knows to ask our human resources office for your application materials. It is helpful to send copies to Joe Wells of any electronic files you submit. * Anyone who might need a work permit if hired (usually someone who is not a citizen of an EEA country) should also do the following. In addition to possibly being e-mailed or faxed, each recommendation letter should also be sent by post on official-looking headed stationery paper and should include details on your whereabouts over the last two years. A work permit application also needs copies of any degree certificates, so it is a good idea to send those also at the same time as you send the rest of your application. Work permit applications can take quite some time for the UK's Home Office to process, so please avoid delays. For your information, it is helpful if the writers of reference letters provide details of: * the capacity in which they know the candidate, * the candidate's skills, abilities and performance in relation to the post applied for, * the candidate's employment record including details of the candidate's role and service dates, * their view of the candidate's suitability for the post as a whole, in light of the attached details and their knowledge of the candidate's experience and abilities, * any further relevant information which would assist us in making an appointment. From icfp.publicity at googlemail.com Wed Jan 17 17:03:31 2007 From: icfp.publicity at googlemail.com (Matthew Fluet (ICFP Publicity Chair)) Date: Wed, 17 Jan 2007 16:03:31 -0600 Subject: [TYPES/announce] ICFP07 Call for Papers Message-ID: <53ff55480701171403i3250b7c0lf6eebc403ab3b66e@mail.gmail.com> Call for Papers ICFP 2007: International Conference on Functional Programming Freiburg, Germany, 1-3 October 2007 ICFP 2007 seeks original papers on the art and science of functional programming. Submissions are invited on all topics from principles to practice, from foundations to features, from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects and concurrency. Particular topics of interest include * Applications and domain-specific languages: systems programming; scientific and numerical computing; symbolic computing; artificial intelligence; databases; graphical user interfaces; multimedia programming; scripting; system administration; distributed-systems and web programming; XML processing; security * Foundations: formal semantics; lambda calculus; type theory; monads; continuations; control; state; effects * Design: algorithms and data structures; modules; type systems; concurrency and distribution; components and composition; relations to object-oriented or logic programming * Implementation: abstract machines; compile-time and run-time optimization; just-in-time compilers; memory management; parallel hardware; interfaces to foreign functions, services, components or low-level machine resources * Transformation and analysis: abstract interpretation; partial evaluation; program transformation * Software-development techniques: design patterns; specification; verification; validation; debugging; test generation; tracing; profiling * Practice and experience: novel results drawn from experience in education or industry * Functional pearls: elegant, instructive examples of functional programming A functional pearl need not report original research results, but it must be instructive, elegant, and fun. ICFP 2007 also seeks Experience Reports. An Experience Report is a short paper (2-4 pages) which need not present novel results, but which should provide evidence that functional programming really works or should describe obstacles that prevented it from working. Detailed guidelines appear below. What's new this year? ~~~~~~~~~~~~~~~~~~~~~ Experienced ICFP authors may want to pay special attention to the points below, which are new this year. * Double-blind review * Author-date citations * Supplemental material in a separate document, not appended to the main text * Morning deadline (but equivalent to late afternoon or early evening in many time zones of interest) * Experience Reports Instructions for authors ~~~~~~~~~~~~~~~~~~~~~~~~ By 11:00 AM Friday, 6 April 2007, Samoan time, submit an abstract of at most 300 words and a full paper of at most 12 pages or an Experience Report of at most 4 pages. Submissions will be accepted electronically, at a URL to be named later. The deadline is set at Samoan time, so if your submission is in by 11:00 AM Friday according to your local time, wherever you are, the submission will be on time. The world clock at http://www.timeanddate.com/worldclock/fixedtime.html?month=4&day=6&year=2007&hour=11&min=0&sec=0&p1=282 can give you the equivalent in your local time, e.g., 3:00 PM Friday in Portland, 6:00 PM Friday in Boston, and midnight Friday in Freiburg. The deadline is firm. Your submission should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. Make the technical content understandable to a broad audience. Each submission must adhere to SIGPLAN's republication policy, which appears in full at http://www.acm.org/sigplan/republicationpolicy.htm. The policy means in part that your paper may not have already appeared in a journal, conference, or workshop with published proceedings; that you may not submit substantially the same work simultaneously to ICFP and to another venue; and that your submission must discuss any closely related material, including your own, that was previously accepted at a journal, conference, or workshop with or without published proceedings. Full details of the policy are available at the SIGPLAN site. If you are in any doubt about whether this policy applies to your paper, either consult the program chair in advance or notify the chair when you submit. To do otherwise risks summary rejection of your submission. If your submission is accepted, you must assign copyright to ACM. Proceedings will be published by the ACM Press. Double-blind review ~~~~~~~~~~~~~~~~~~~ To increase confidence in the fairness and objectivity of the reviewing process, reviewing will be double blind. Make it possible for reviewers to evaluate your paper without having to know who you are. It should suffice to omit your names from your submission and to avoid revealing your identity through citation; detailed guidelines are available at http://icfp07.eecs.harvard.edu/blind.html. Formatting ~~~~~~~~~~ Your submission must be printable on US Letter sized paper and be either PDF or PostScript that is interpretable by Ghostscript. If this requirement is a hardship, make contact with the program chair at least one week before the deadline. Your submission must be at most 12 pages (4 pages for an Experience Report), including bibliography and figures, in the standard ACM conference format: two columns, nine-point font on a ten-point baseline, with pages 20pc (3.33in) wide and 54pc (9in) tall, with a column gutter of 2pc (0.33in). (A suitable LaTeX class file is available from SIGPLAN; see http://www.acm.org/sigs/sigplan/authorInformation.htm. Categories, keywords, and so on are optional.) If you wish to supply material beyond the 12-page limit, up to and including a full technical report, you may attach a separate document to your submission, on the understanding that reviewers are not expected to read it. (As a particular example, if you feel that your submission should be supported by a lengthy technical report, do not cite such a technical report on the web, since doing so would reveal your identity. Please instead attach that report to your submission.) Detailed instructions for attaching supplementary documents will be available on the submission web site. The length limit is firm; submissions that do not meet these guidelines will not be considered. Citation ~~~~~~~~ We recommend (but do not require) that you put your citations into author-date form. This procedure makes your paper easier to review. For example, if you cite a result on testing as ``(Claessen and Hughes 2000)'', many reviewers will recognize the result instantly. On the other hand, if you cite it as ``[4]'', even the best-informed reviewer has to page through your paper to find the reference. By using author-date form, you enable a knowledgeable reviewer to focus on content, not arbitrary numbering of references. LaTeX users can simply use the natbib package along with the plainnat bibliography style. Author response ~~~~~~~~~~~~~~~ You will have a 48-hour period (11:00 23 May to 11:00 25 May 2007 Samoa time) to read and respond to reviews. Details of the author-response process will be available as it approaches. Special categories of papers ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In addition to research papers, ICFP solicits two kinds of papers that do not require original research contributions: functional pearls, which are full papers, and Experience Reports, which are limited to four pages. Authors submitting such papers may wish to consider the following advice. Functional pearls ~~~~~~~~~~~~~~~~~ To paraphrase both Jon Bentley and Richard Bird, the ideal pearl goes beyond solid engineering into the realm of insight and creativity. Just as a natural pearl grows from a grain of sand that has irritated an oyster, a topnotch functional pearl should grow from a real problem that has irritated a programmer. A pearl should be polished, elegant, instructive, and entertaining. Ideally it should teach important programming techniques and fundamental design principles. Past pearls have included instructive examples of program calculation or proof, nifty presentations of old or new data structures, and interesting applications and programming techniques. Papers submitted to ICFP as pearls often miss the mark, by being too trivial, too complicated, or somehow not quite the elegant solution one hopes for. The key to an accepted pearl is polishing. Your pearl is likely to be rejected if your readers get bored, if the material gets too complicated, if too much specialized knowledge is needed, or if the writing is distasteful. Richard Bird advises: * Throw away the rule book for writing research papers. * Get in quick; get out quick. * Be self-contained; don't go deep into related work, with lengthy references. * You are telling a story, so some element of surprise is welcome. * Above all, be engaging. * Give a talk on the pearl to non-specialists, your students, or your department. If you changed the order of presentation for the talk, consider using the new order in the next draft. * Put the pearl away for a while, then take it out and polish it again. Experience reports ~~~~~~~~~~~~~~~~~~ ICFP has long solicited submissions on the practice and experience of functional programming. But reports of experience are inherently different from research papers, and when judged by the criteria of scientific merit, novelty, or research contribution, they have not competed well against traditional ICFP submissions. Yet we believe that the functional- programming community would benefit from being able to draw on and cite the experience of others. For this reason, we have introduced the ICFP Experience Report. Unlike a normal ICFP paper, the purpose of an Experience Report is not to add to the body of knowledge of the functional-programming community. Rather, the purpose of an Experience Report is to help create a body of published, refereed, citable *evidence* that functional programming really works---or to describe obstacles that prevented it from working. An Experience Report is distinguished from a normal ICFP paper by its title, by its length, and by the criteria used to evaluate it. * Both in the proceedings and in any citations, the title of each accepted Experience Report must begin with the words "Experience Report", followed by a colon. * Experience Reports are limited in length: the suggested length is 2 pages and the maximum length is 4 pages. Each accepted Experience Report will be presented at the conference, but depending on the number of Experience Reports and regular papers accepted, authors of Experience Reports may be asked to give shorter talks. * Because the purpose of Experience Reports is to enable our community to accumulate a published, citable body of evidence about the efficacy of functional programming, an acceptable Experience Report need not present novel results or conclusions. It is sufficient if the Report states a clear thesis and provides supporting evidence. The thesis must be relevant to ICFP, but it need not be novel. The program committee will accept or reject Experience Reports based on whether they judge the evidence to be convincing. Anecdotal evidence will be acceptable provided it is well argued and the author explains what efforts were made to gather as much evidence as possible. The committee will be especially convinced by evidence that includes *comparisons* of situations before and after the introduction or discontinuation of functional programming. Evidence drawn from a single person's experience may be sufficient, but more weight will be given to evidence drawn from the experience of groups of people. Possible topics for an Experience Report include, but are not limited to * Insights gained from real-world projects using functional programming * Comparison of functional programming with conventional programming in the context of an industrial project or a university curriculum * Project-management, business, or legal issues encountered when using functional programming in a real-world project * Curricular issues encountered when using functional programming in education * Real-world constraints that created special challenges for an implementation of a functional language or for functional programming in general An Experience Report should be short and to the point: if functional programming worked for you in the same ways it has worked for others, you need only to summarize the results---the main part of your paper should discuss how well it worked and in what context. Most readers will not want to know all the details of your project and its implementation, but please characterize your project and its context well enough so that readers can judge to what degree your experience is relevant to their own projects. Be especially careful to highlight any unusual aspects of your project. Also keep in mind that specifics about your project are more valuable than generalities about functional programming; for example, it is more valuable to say that your team delivered its software a month ahead of schedule than it is to say that functional programming made your team more productive. If your paper not only describes experience but also presents new technical results, or if your experience refutes cherished beliefs of the functional-programming community, you may be better off submitting it as a full paper, which will be judged by the usual criteria of novelty, originality, and relevance. If you unsure in which category to submit, the program chair will be happy to help you decide. Other information ~~~~~~~~~~~~~~~~~ Conference Chair ~~~~~~~~~~~~~~~~ Ralf Hinze (Universit?t Bonn) Program Chair ~~~~~~~~~~~~~ Norman Ramsey Harvard University Cambridge, MA, 02148 USA Email: icfp07 at eecs.harvard.edu Phone: +1 617 496 8615 Mail sent to the address above is filtered for spam. If you send mail and do not receive a prompt response, particularly if the deadline is looming, feel free to telephone and reverse the charges. Program Committee ~~~~~~~~~~~~~~~~~ Nick Benton (Microsoft Research) Matthew Fluet (Toyota Technological Institute) Jeremy Gibbons (University of Oxford) Kevin Hammond (University of St Andrews) Bastiaan Heeren (Utrecht University) Graham Hutton (University of Nottingham) Mark P. Jones (Portland State University) Gabriele Keller (University of New South Wales) Fabrice Le Fessant (INRIA/LIX, France) Todd Millstein (UCLA) Mike Sperber (DeinProgramm) Christopher A. Stone (Harvey Mudd College) Andrew Tolmach (Portland State University and INRIA Rocquencourt) Janis Voigtl?nder (Technische Universit?t Dresden) Stephanie Weirich (University of Pennsylvania) Important Dates ~~~~~~~~~~~~~~~ Submission: 11:00 6 April 2007, Samoa time (AST) Author response: 11:00 23 May to 11:00 25 May 2007 (AST) Notification: 8 June 2007 Final papers due: 20 July 2007 ICFP 2007 Web Site ~~~~~~~~~~~~~~~~~~ http://www.informatik.uni-bonn.de/~ralf/icfp07.html Special Issue of JFP ~~~~~~~~~~~~~~~~~~~~ Authors of the best final papers, as determined by the program committee, will be invited to submit journal versions for a special issue of the Journal of Functional Programming. From phil at site.uottawa.ca Thu Jan 18 09:36:21 2007 From: phil at site.uottawa.ca (Phil Scott) Date: Thu, 18 Jan 2007 09:36:21 -0500 (EST) Subject: [TYPES/announce] Fields Workshop on Traced Monoidal Cats (Second Announcement) Message-ID: Dear Colleagues: We would like to announce the following: ============================================================== A Fields Institute Sponsored Workshop Recent advances in category theory and logic: Applications of traces to algebra, analysis and categorical logic University of Ottawa April 28-30, 2007 URL: http://aix1.uottawa.ca/~scpsg/Fields07/Fields07.traces.html +++++++++++++++++++++++++++++++++++++++++++++++ The abstract theory of traces has had a fundamental impact on a variety of fields within mathematics. These range from functional analysis and noncommutative geometry to topology and knot theory, and more recently to logic and theoretical computer science. The theory of traced monoidal categories, due to Joyal, Street and Verity, is an attempt to unify various notions of trace that occur in these diverse branches of mathematics. More recent developments include several theories of partial traces in monoidal categories. The Logic and Foundations of Computing Group at the University of Ottawa, with funding from the Fields Institute, is proud to host a workshop to explore these topics. The purpose of this workshop is to bring together researchers in these fields to look for common developments, models, and applications of trace theory. Among the applications are various notions of parametrized traces arising in operator algebras, in the theory of feedback and recursion in theoretical computer science, in braid closure in knot theory, and in dynamics of proofs as expressed by Linear Logic and the Geometry of Interaction. Some invited speakers include: Samson Abramsky (Oxford) Robin Cockett (Calgary) Andre Joyal (UQAM) Louis Kauffman (Illinois) Mathias Neufang (Carleton) Timothy Porter (Bangor) We will be announcing further speakers shortly. This is intended to be a workshop, with student participation in mind, including introductory lectures. We will have some funding for student travel and accommodation. Students interested in receiving financial aid should contact the organizers by January 30th. Anyone interested in attending or contributing a talk should contact us by the above date. We hope to see you there. The organizers: Phil Scott (phil at site.uottawa.ca) Rick Blute (rblute at uottawa.ca) Pieter Hofstra (hofstrap at cpsc.ucalgary.ca) From morazanm at shu.edu Sat Jan 20 08:34:48 2007 From: morazanm at shu.edu (Marco T Morazan) Date: Sat, 20 Jan 2007 08:34:48 -0500 Subject: [TYPES/announce] Final Call for Papers: TFP 2007, New York, USA Message-ID: CALL FOR PAPERS Trends in Functional Programming 2007 New York, USA April 2-4, 2007 http://cs.shu.edu/tfp2007/ NEW: Abstract submission is now opened! Link: http://cs.shu.edu/tfp2007/submissions.html NEW: Invited Talk: John McCarthy, Standford University 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 articles presented at the symposium for publication in a high-profile volume. TFP 2007 is co-hosted by Seton Hall University and The City College of New York (CCNY) and will be held in New York, USA, April 2-4, 2007 at the CCNY campus. SCOPE OF THE SYMPOSIUM The symposium recognizes that new trends may arise through various routes. As part of the Symposium's focus on trends we therefore identify the following five article categories. High-quality articles are solicited in any of these categories: Research Articles leading-edge, previously unpublished research work Position Articles on what new trends should or should not be Project Articles descriptions of recently started new projects Evaluation Articles what lessons can be drawn from a finished project Overview Articles summarizing work with respect to a trendy subject Articles must be original and not submitted for simultaneous publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or more experience-oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium. Articles on the following subject areas are particularly welcomed: 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 to Animate/Prototype/Implement Systems from Formal or Semi-Formal Specifications o Functional Languages for Telecommunications Applications o Functional Languages for Embedded Systems o Functional Programming Applied to Global Computing o Functional GRIDs o Functional Programming Ideas in Imperative or Object-Oriented Settings (and the converse) o Interoperability with Imperative Programming Languages o Novel Memory Management Techniques o Parallel/Concurrent Functional Languages o Program Transformation Techniques o Empirical Performance Studies o Abstract/Virtual Machines and Compilers for Functional Languages o New Implementation Strategies o any new emerging trend in the functional programming area If you are in doubt on whether your article is within the scope of TFP, please contact the TFP 2007 program chair, Marco T. Morazan, at tfp2007 at shu.edu. SUBMISSION AND DRAFT PROCEEDINGS Acceptance of articles for presentation at the symposium is based on the review of extended abstracts (6 to 10 pages in length) by the program committee. Accepted abstracts are to be completed to full papers before the symposium for publication in the draft proceedings and on-line. Further details can be found at the TFP 2007 website. POST-SYMPOSIUM REFEREEING AND PUBLICATION In addition to the draft 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. IMPORTANT DATES Abstract Submission: February 1, 2007 Notification of Acceptance: February 20, 2007 Registration Deadline: March 2, 2007 Camera Ready Full Paper Due: March 9, 2007 TFP Symposium: April 2-4, 2007 PROGRAMME COMMITTEE John Clements California Polytechnic State University, USA Marko van Eekelen Radboud Universiteit Nijmegen, The Netherlands Benjamin Goldberg New York University, USA Kevin Hammond University of St. Andrews, UK Patricia Johann Rutgers University, USA Hans-Wolfgang Loidl Ludwig-Maximilians Universit?t M?nchen, Germany Rita Loogen Philipps-Universit?t Marburg, Germany Greg Michaelson Heriot-Watt University, UK Marco T. Moraz?n (Chair) Seton Hall University, USA Henrik Nilsson University of Nottingham, UK Chris Okasaki United States Military Academy at West Point, USA Rex Page University of Oklahoma, USA Ricardo Pena Universidad Complutense de Madrid, Spain Benjamin C. Pierce University of Pennsylvania, USA John Reppy University of Chicago, USA Ulrik P. Schultz University of Southern Denmark, Denmark Clara Segura Universidad Complutense de Madrid, Spain Jocelyn S?rot Universit? Blaise Pascal, France Zhong Shao Yale University, USA Olin Shivers Georgia Institute of Technology, USA Phil Trinder Heriot-Watt University, UK David Walker Princeton University, USA ORGANIZATION Symposium Chair: Henrik Nilsson, University of Nottingham, UK Programme Chair: Marco T. Morazan, Seton Hall University, USA Treasurer: Greg Michaelson, Heriot-Watt University, UK Local Arrangements: Marco T. Morazan, Seton Hall University, USA ********************************************************************************** Prof. Marco T. Morazan Dept. of Mathematics and Computer Science Seton Hall University "On theories such as these we cannot rely. Proof we need. Proof!" -- Yoda, Jedi Master -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070120/fc5ce121/attachment.htm From Jeremy.Gibbons at comlab.ox.ac.uk Mon Jan 22 09:45:48 2007 From: Jeremy.Gibbons at comlab.ox.ac.uk (Jeremy Gibbons) Date: Mon, 22 Jan 2007 14:45:48 GMT Subject: [TYPES/announce] Call for participation and abstracts: BCTCS, Oxford, 2-5 Apr Message-ID: <200701221445.l0MEjmV7016612@softeng.comlab.ox.ac.uk> (apologies for any duplicate cross-postings you may receive) +--------------------------------------------------------------------+ 23rd British Colloquium for Theoretical Computer Science BCTCS 2007 2-5 April 2007 St Anne's College, Oxford http://cms.brookes.ac.uk/bctcs2007/ The purpose of BCTCS is to provide a forum in which researchers in theoretical computer science can meet, present research findings, and discuss developments in the field. It also aims to provide an environment in which PhD students can gain experience in presenting their work, and benefit from contact with established researchers. SCOPE All aspects of theoretical computer science, including automata theory, algorithms, complexity theory, semantics, formal methods, concurrency, types, languages and logics. Computer scientists and mathematicians are welcome to attend, as are participants from outside the UK. PROGRAMME The programme will consist of nearly 3 days worth of invited and contributed talks, beginning at 5.30pm on Monday 2nd April and concluding at 1pm on Thursday 5th April 2007. The abstracts of the talks will be published in the Bulletin of the European Association for Theoretical Computer Science (EATCS). The invited speakers are as follows: Dimitris Achlioptas, University of California, Santa Cruz, U.S.A. "Random Constraint Satisfaction Problems: from Physics to Algorithms" Steven Alpern, The London School of Economics and Political Science "Search Games and Utilitarian Postman Paths on Networks" Julian Bradfield, University of Edinburgh (BCS-FACS Lecturer in Formal Methods) Georg Gottlob, University of Oxford "Living with Computational Complexity" (This is Prof. Gottlob's inaugural lecture at Oxford University.) Bob Harper, Carnegie Mellon University, U.S.A. Richard Jozsa, University of Bristol Kristina Vuskovic, University of Leeds (LMS Lecturer in Discrete Mathematics) LOCATION The 2007 colloquium will be held at St Anne's College, Oxford, one of the colleges of the University of Oxford, and hosted by the computing departments of both Oxford Brookes and Oxford universities, Oxford itself is known as the "City of Dreaming Spires", and has been home to both royalty and scholars for over 800 years. REGISTRATION Registration for BCTCS2007 is open, via the web page. The deadline for registration and submission of abstracts for proposed talks is 16th February 2007. The registration fee is 340 UK pounds, including accommodation and meals, and the day rate is 145 UK pounds. A number of free registrations for UK-based PhD students are available. SPONSORS The colloquium is sponsored by EPSRC, BCS-FACS, and also the London Mathematical Society. FURTHER DETAILS Google search - BCTCS 2007 Web page - http://cms.brookes.ac.uk/bctcs2007/ +--------------------------------------------------------------------+ From afelty at site.uottawa.ca Tue Jan 23 11:50:20 2007 From: afelty at site.uottawa.ca (Amy Felty) Date: Tue, 23 Jan 2007 11:50:20 -0500 (EST) Subject: [TYPES/announce] CADE 2007 2nd Call for Papers Message-ID: UPDATE: invited speakers, affiliated workshops, travel grants, submissions open Deadline for abstract submission: February 16! 2nd Call for Papers CADE-21 21st International Conference on Automated Deduction International University Bremen, Germany July 17-20, 2007 (workshops July 15-16) http://www.cadeconference.org/meetings/cade21 CALL FOR PAPERS CADE is the major forum for the presentation of research in all aspects of automated deduction. - Logics of interest include propositional, first-order, equational, higher-order, classical, intuitionistic, constructive, modal, temporal, many-valued, substructural, description, and meta-logics, logical frameworks, type theory and set theory. - Methods of interest include resolution, tableaux, term rewriting, induction, unification, constraint solving, SAT solving, decision procedures, saturation, model generation, model checking, natural deduction, sequent calculi, proof planning, proof presentation, proof checking, and explanation. - Applications of interest include hardware and software development, systems analysis and verification, deductive databases, functional and logic programming, computer mathematics, natural language processing, computational linguistics, robotics, planning, knowledge representation, and other areas of AI. Invited speakers: Peter Baumgartner, NICTA and Australian National University Rustan Leino, Microsoft Research Colin Stirling, University of Edinburgh Ashish Tiwari, SRI International Affiliated workshops (July 15-16, 2007): ADDCT - Automated Deduction: Decidability, Complexity, Tractability CVF - Fourth International Workshop on Constraints in Formal Verification DISPROVING - Workshop on Disproving: Non-Theorems, Non-Validity, Non-Provability ESARLT - Empirically Successful Automated Reasoning in Large Theories ISABELLE-WS - Isabelle Workshop LFMTP - International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice VERIFY - 4th International Verification Workshop Woody Bledsoe student travel awards: Nominations must be made by June 1; details available at http://www.cadeconference.org/meetings/cade21/travelawards.html Paper submission: Submission is electronic in PostScript or PDF format via the EasyChair system. Submitted papers must conform to the Springer LNCS style, preferrably using LaTeX2e and the Springer llncs class files available at http://www.springer.com/lncs. Submissions can be full papers, for work on foundations, applications, or implementation techniques (15 pages), as well as system descriptions (5 pages), for describing publicly available systems. The proceedings will be published in the Springer LNCS series. Submissions are now open at http://www.easychair.org/CADE21/ Important dates: Submission of title and abstract: February 16, 2007 Submission papers: February 23, 2007 Notification of acceptance: April 16, 2007 Final version due: May 11, 2007 Workshops and tutorials: July 15-16, 2007 Conference: July 17-20, 2007 Conference Chair: Michael Kohlhase (IUB) Workshop and Tutorial Chair: Christoph Benzmueller (Cambridge) Program Chair: Frank Pfenning (CMU) From Giuseppe.Castagna at ens.fr Tue Jan 23 17:51:59 2007 From: Giuseppe.Castagna at ens.fr (Giuseppe Castagna) Date: Tue, 23 Jan 2007 23:51:59 +0100 Subject: [TYPES/announce] Position available at University Paris 7 Message-ID: <45B6918F.3080405@ens.fr> The laboratory PPS of University Paris 7 is looking for candidates for a one year position, available immediately, around the CDuce project. CDuce is a strongly typed functional programming language for XML (see http://www.cduce.org) whose design and run-time are directly based on its type systems. Its compiler is implemented in OCaml. According to the profile of the recruited person the position will focus more on the development environment (e.g.: libraries for web development or web services, Eclipse plugins, Windows port) or on the research aspects (e.g.: concurrency, typing, subtyping, distribution, verification) around CDuce. Candidates should be fluent in OCaml or in another functional language. Experience in Web development, environments for software development and/or XML would be useful as well. The annual gross salary will be around 28.000 Euros. If interested please send a mail to staff at cduce.org as soon as possible. Giuseppe Castagna From laurie at tratt.net Wed Jan 24 09:24:30 2007 From: laurie at tratt.net (Laurence Tratt) Date: Wed, 24 Jan 2007 14:24:30 +0000 Subject: [TYPES/announce] MODELS 2007 Call for Contributions Message-ID: <20070124142453.GA1629@phase.home.tratt.net> =========================================================================== MODELS 2007 -- First Call for Contributions ACM/IEEE 10th International Conference on Model-Driven Engineering Languages and Systems September 30 - October 5, 2007 Nashville (TN), USA http://www.modelsconference.org/ =========================================================================== The past decade has witnessed an explosion of interest in advanced techniques for expressing design intent at a higher level of abstraction than third-generation programming languages and keeping abstract models of complex software systems in sync with the underlying code. MODELS 2007 (formerly the UML series of conferences) is the premier conference in model-driven approaches to software development. Scientific papers: We invite scientific research papers describing innovative research on model-driven engineering and other aspects of modeling in the development process. Experience papers: We invite experience papers that focus on reporting project experience with model-driven engineering. Please visit the conference website http://www.modelsconference.org/ for more information. IMPORTANT DATES Experience and Scientific Papers deadlines: Abstracts: March 19, 2007 Submissions: April 2, 2007 Workshop Proposals deadline: April 2, 2007 Tutorial Proposals deadline: May 1, 2007 Doctoral and Educators Symposiums, Vendor Tools Exhibits, Academic Posters and Demos, and Panels deadline: May 1, 2007 Submission guidelines are available from the website. Authors of best papers from the conference will be invited to revise and submit extended versions of their papers for publication consideration in a special issue of Software and Systems Modeling (Springer). Proposals for advanced workshops, tutorials and posters are requested. From Jeremy.Gibbons at comlab.ox.ac.uk Thu Jan 25 02:40:18 2007 From: Jeremy.Gibbons at comlab.ox.ac.uk (Jeremy.Gibbons@comlab.ox.ac.uk) Date: Thu, 25 Jan 2007 07:40:18 GMT Subject: [TYPES/announce] IFM2007 Final call for contributions Message-ID: <200701250740.l0P7eIbZ023479@mercury.comlab.ox.ac.uk> ---------------------------------------------------------------------- IFM 2007 Sixth International Conference on Integrated Formal Methods 2nd - 6th July 2007, Oxford, UK http://www.ifm2007.org Final Call for Contributions Contributions to the technical programme of IFM 2007, including papers for the special session on Unifying Theories of Programming, and proposals for workshops and tutorials, are invited. The deadline for submission has been extended to 5th February 2007. See the calls at http://www.ifm2007.org Papers should not exceed 20 pages in length, and should be prepared in accordance with the publisher's guidelines; style files and templates are available at http://www.ifm2007.org/LNCS.html Both .doc and .pdf formats are acceptable. Electronic submission is possible via the conference website. Authors will be notified on or before March 15th. ---------------------------------------------------------------------- From phil at site.uottawa.ca Thu Jan 25 13:35:28 2007 From: phil at site.uottawa.ca (Phil Scott) Date: Thu, 25 Jan 2007 13:35:28 -0500 (EST) Subject: [TYPES/announce] Postdoctoral position at U. Ottawa Message-ID: Research Fellow/Postdoc position in Category Theory, Logic and Computation, University of Ottawa The Logic Group in the Department of Mathematics and Statistics at the University of Ottawa is looking to hire at least one research fellow/postdoc beginning in September, 2007. The positions are in any area of category theory, categorical logic, and related areas of theoretical computer science. Research fellows/postdocs will participate in the activities of the Logic and Foundations of Computation Group. This group includes faculty and students from several different Ottawa-area universities. In the Math Department, the Logic Group currently includes 4 faculty members (R. Blute, P. Hofstra, P.E. Parent and P. Scott), as well as a number of postdocs and graduate students. For more information about our team, see http://www.site.uottawa.ca/~phil/lfc/. The research fellowships/postdocs are initially for one year, with a possible renewal for a second year. Duties include research and the teaching of two one-semester mathematics courses. Potential applicants should contact one of us (preferably cc to all):: Richard Blute (rblute at uottawa.ca) Pieter Hofstra (phofstra at uottawa.ca) Paul-Eugene Parent (pparent at uottawa.ca) Philip Scott (phil at site.uottawa.ca) immediately by email to indicate their interest. They should then also send a curriculum vitae, a research plan, and arrange for three confidential letters of recommendation, with one addressing teaching, to be sent to Professor Victor Leblanc, Chairman, Department of Mathematics and Statistics, University of Ottawa, Ottawa, ON Canada, K1N 6N5. Applicants are also encouraged to include up to three copies of their most significant publications. Those who have already applied for a position will of course be considered and do not have to re-send an application, although it would be wise to send one of us an email. From Belaid.Benhamou at cmi.univ-mrs.fr Fri Jan 26 11:46:57 2007 From: Belaid.Benhamou at cmi.univ-mrs.fr (benhamou) Date: Fri, 26 Jan 2007 17:46:57 +0100 Subject: [TYPES/announce] Last CFP of TABLEAUX 2007 In-Reply-To: <458C0FEC.4030407@cmi.univ-mrs.fr> References: <200601291711.k0THB45e018819@birkhoff.cas.mcmaster.ca> <458C0FEC.4030407@cmi.univ-mrs.fr> Message-ID: <45BA3081.6040905@cmi.univ-mrs.fr> (We apologize for multiple copies of this Call) ======================================================================== %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% Call for Papers, Call for Tutorials and %% %% Call for Workshop Proposals %% %% %% %% TABLEAUX 2007 %% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% International Conference TABLEAUX 2007 Automated Reasoning with Analytic Tableaux and Related Methods Aix en Provence, France 3-6 July 2007 http://tableaux2007.univ-cezanne.fr/ IMPORTANT DATES Tutorial proposal submission deadline: January 10, 2007 (Now closed) Notification of acceptance of tutorials: January 20, 2007 Workshop proposal submission deadline: January 31, 2007 Notification of acceptance of workshops: February 15, 2007 Title and abstract submission deadline: February 2, 2007 Paper submission deadline: February 9, 2007 Notification of acceptance of papers: April 2, 2007 Final version of papers due: April 16, 2007 Conference: July 3-6, 2007 GENERAL INFORMATION This conference is the 16th in a series of international meetings on Automated Reasoning with Analytic Tableaux and Related Methods. In July 2007, the conference will be held in Aix en Provence, France. The conference proceedings will be published in LNAI series as in the previous editions of the conference. See http://tableaux2007.univ-cezanne.fr/ for more information on TABLEAUX 2007, and http://i12www.ira.uka.de/TABLEAUX for information about the TABLEAUX conference series. TOPICS Tableau methods are a convenient formalism for automating deduction in various non-standard logics as well as in classical logic. Areas of application include verification of software and computer systems, deductive databases, knowledge representation and its required inference engines, and system diagnosis. The conference brings together researchers interested in all aspects - theoretical foundations, implementation techniques, systems development and applications - of the mechanization of reasoning with tableaux and related methods. Topics of interest include (but are not restricted to): * analytic tableaux for various logics (theory and applications) * related techniques and concepts, e.g., model checking and BDDs * related methods (model elimination, sequent calculi, connection method, ...) * new calculi and methods for theorem proving in classical and non-classical logics (modal, description, intuitionistic, linear, temporal, many-valued...) * systems, tools, implementations and applications. TABLEAUX 2007 puts a special emphasis on applications. Papers describing applications of tableaux and related methods in areas such as, for example, hardware and software verification, knowledge engineering, semantic web, etc. are particularly invited. One or more tutorials and workshops will be part of the conference program. SUBMISSIONS The conference will include contributed papers, tutorials, system descriptions, position papers and invited lectures. Submissions are invited in four categories: A Research papers (reporting original theoretical and/or experimental research, up to 15 pages) B System descriptions (up to 5 pages) C Position papers and brief reports on work in progress D Tutorials in all areas of analytic tableaux and related methods from academic research to applications (proposals up to 5 pages) Submissions in categories A and B will be reviewed by peers, typically members of the program committee. They must be unpublished and not submitted for publication elsewhere. Accepted papers in these categories will be published in the conference proceedings . For category B submissions a working implementation must exist and be available to the referees. Submissions in category C will be reviewed by members of the program committee and a collection of the accepted papers in this category will be published as a Technical Report of the LSIS/Universit? Paul C?zanne. Tutorial submissions (Category D) may be at introductory, intermediate, or advanced levels. Novel topics and topics of broad interest are preferred. The submission should include the title, the author, the topic of the tutorial, its level, its relevance to conference topics, and a description of the interest and the scientific contents of the proposed tutorial. Tutorial proposals will be reviewed by members of the program committee. Authors of accepted papers are expected to present their work at the conference. CALL FOR WORKSHOP PROPOSALS TABLEAUX 2007 launches a Call for Workshop Proposal on specialised subjects in the range of the conference topics. We can accept up to 2 proposals. The proposals are reviewed by members of the PC committee. The purpose of a workshop is to offer an opportunity of presenting novel ideas, ongoing research, and to discuss the state of the art of an area in a less formal but more focused way than the conference itself. It is also a good opportunity for young researchers to present their own work and to obtain feedback. The format of a workshop is left to the organizers, but it is expected to contain significant time for discussion. The intended schedule is for one-day workshops. Further information and instructions about submissions will be available on the conference website at http://tableaux2007.univ-cezanne.fr/. PROGRAM COMMITTEE Nicola Olivetti, LSIS, Paul C?zanne University, Marseilles, France (Chair) Peter Baumgartner, Peter Baumgartner, NICTA, Canberra, Australia Bernhard Beckert, University of Koblenz-Landau, Germany Patrick Blackburn, INRIA Lorraine, France Marta Cialdea, University of Roma 3, Italy Roy Dyckhoff, University of St Andrews, Scotland Christian G. Ferm?ller, University of Wien, Austria Ulrich Furbach, University of Koblenz-Landau, Germany Didier Galmiche, LORIA, Henri Poincar? University, Nancy, France Martin Giese, RICAM, Austrian Academy of Sciences, Linz, Austria Rajeev P. Gor?, Australian National University, Canberra, Australia Jean Goubault-Larrecq, LSV, ENS Cachan, France Reiner H?hnle, University of Chalmers, Gothenburg, Sweden Ullrich Hustadt, University of Liverpool, UK Christoph Kreitz, University of Potsdam, Germany Carsten Lutz, University of Dresden, Germany Angelo Montanari, University of Udine, Italy Ugo Moscato, University of Milano-Bicocca, Italy Neil V. Murray, ILS Institute, University at Albany, USA Ilkka Niemel?, Helsinki University of Technology, Finland Lawrence C. Paulson, University of Cambridge, UK Camilla Schwind, LIF-CNRS, Marseille, France Viorica Sofronie-Stokkermans, Max-Planck-Institut f?r Informatik, Saarbr?cken, Germany (Workshop Chair) Arild Waaler, University of Oslo, Norway ORGANIZING COMMITTEE Conference chair: Nicola Olivetti, LSIS, Paul C?zanne University, Marseilles, France Publicity Chair: Bela?d Benhamou, LSIS, Universit? de Provence, Marseilles, France Local Organisers: Bela?d Benhamou, LSIS, University of Provence, Marseilles, France Djamal Habet, LSIS, Paul C?zanne University, Marseilles, France Philippe J?gou, LSIS, Paul C?zanne University, Marseilles, France Richard Ostrowski, LSIS, University of Provence, Marseilles, France Cyril Pain-Barre, LSIS, University of Mediterranean, Marseilles, France Odile Papini, LSIS, University of Toulon, France Nicolas Prcovic, LSIS, Paul C?zanne University, Marseilles, France Vincent Risch, LSIS, University of Mediterranean, Marseilles, France Pierre Siegel, LSIS, University of Provence, Marseilles, France Cyril Terrioux, LSIS, Paul C?zanne University, Marseilles, France Eric W?rbel, LSIS, University of Toulon, France ===================================================================================== Best regards Bela?d Benhamou (Publicity chair) Universit? de Provence Aix-Marseille I, CMI-LSIS, 39 Joliot-Curie 13453 Mareille cedex 13, France Tel: 0033491113622 Fax: 0033491113692 From nordio at dc.exa.unrc.edu.ar Fri Jan 26 14:08:09 2007 From: nordio at dc.exa.unrc.edu.ar (=?ISO-8859-1?Q?Mart=EDn_Nordio?=) Date: Fri, 26 Jan 2007 16:08:09 -0300 Subject: [TYPES/announce] LASER Summer School on Software Engineering Message-ID: <20070126190748.M34771@dc.exa.unrc.edu.ar> LASER Summer School on Software Engineering Applied Software Verification Practical advances towards a Grand Challenge September 9-15, 2007, Elba, Italy http://laser.inf.ethz.ch Application deadline: April 30, 2007 Goals The LASER school is intended both for researchers (including PhD students) and for professional software engineers and managers who want to benefit from the best in software technology advances. The focus of LASER is resolutely practical, although theory is welcome to establish solid foundations. The format of the school favors extensive interaction between participants and speakers. Topics and speakers The 2007 LASER school is part of the ongoing "Grand Challenge" on software verification, initiated by Tony Hoare. It has a special focus on tools for software verification. This means in particular that it has a highly practical character and will provide participants with a clear view of techologies and tools available today to verify software. The school brings together six speakers, each closely involved with tools for verification: * Thomas Ball, Microsoft Research * G?rard Berry, Esterel Technologies * Tony Hoare, Microsoft Research * Bertrand Meyer, ETH Zurich * Peter M?ller, ETH Zurich * Natarajan Shankar, SRI International How to apply? Use the online registration form available on the LASER website http://laser.inf.ethz.ch. Registration is open until 30 April 2007. The number of participants is strictly limited to ensure quality interaction with the lecturers and the rest of the audience. For more information, visit our website or contact the organizers at laser at se.inf.ethz.ch. Venue As in previous years, LASER is held in the magnificent setting of the Elba island off the coast of Tuscany, easily reachable by plane (Pisa) and train. Time is set aside to avoid the amenities of the 4-star Hotel del Golfo (private beach, tennis court etc.) as well as the natural and cultural riches of Elba, a history-laden jewel of the Mediterranean. -- Departamento de Computaci?n Universidad Nacional de R?o Cuarto From ruy at cin.ufpe.br Sat Jan 27 05:19:38 2007 From: ruy at cin.ufpe.br (ruy@cin.ufpe.br) Date: Sat, 27 Jan 2007 08:19:38 -0200 (BRST) Subject: [TYPES/announce] WoLLIC'2007 - CfP Message-ID: <4965.200.164.147.77.1169893178.squirrel@webmail.cin.ufpe.br> [** sincere apologies for duplicates **] Call for Papers 14th Workshop on Logic, Language, Information and Computation (WoLLIC'2007) Rio de Janeiro, Brazil July 2-5, 2007 WoLLIC is an annual international forum on inter-disciplinary research involving formal logic, computing and programming theory, and natural language and reasoning. Each meeting includes invited talks and tutorials as well as contributed papers. The Fourteenth WoLLIC will be held in Rio de Janeiro, Brazil, from July 2 to July 5, 2007, and sponsored by the Association for Symbolic Logic (ASL), the Interest Group in Pure and Applied Logics (IGPL), the European Association for Logic, Language and Information (FoLLI), the European Association for Theoretical Computer Science (EATCS), the Sociedade Brasileira de Computacao (SBC), and the Sociedade Brasileira de Logica (SBL). PAPER SUBMISSION Contributions are invited on all pertinent subjects, with particular interest in cross-disciplinary topics. Typical but not exclusive areas of interest are: foundations of computing and programming; novel computation models and paradigms; broad notions of proof and belief; formal methods in software and hardware development; logical approach to natural language and reasoning; logics of programs, actions and resources; foundational aspects of information organization, search, flow, sharing, and protection. Proposed contributions should be in English, and consist of a scholarly exposition accessible to the non-specialist, including motivation, background, and comparison with related works. They must not exceed 10 pages (in font 10 or higher), with up to 5 additional pages for references and technical appendices. The paper's main results must not be published or submitted for publication in refereed venues, including journals and other scientific meetings. It is expected that each accepted paper be presented at the meeting by one of its authors. Papers must be submitted electronically at www.cin.ufpe.br/~wollic/wollic2007/instructions.html A title and single-paragraph abstract should be submitted by February 23, and the full paper by March 2 (firm date). Notifications are expected by April 13, and final papers for the proceedings will be due by April 27 (firm date). PROCEEDINGS Proceedings, including both invited and contributed papers, will be published in advance of the meeting. Publication venue: Springer's Lecture Notes in Computer Science. INVITED SPEAKERS: Veronique Cortier (LORIA Nancy) Martin Escardo (Birmingham) Georg Gottlob (Oxford) Achim Jung (Birmingham) Louis Kauffman (U Illinois Chicago) Sam Lomonaco (U Maryland Baltimore) Paulo Oliva (London/QM) John Reif (Duke) Yde Venema (Amsterdam) STUDENT GRANTS ASL sponsorship of WoLLIC'2007 will permit ASL student members to apply for a modest travel grant (deadline: April 1, 2007). See www.aslonline.org/studenttravelawards.html for details. IMPORTANT DATES February 23, 2007: Paper title and abstract deadline March 2, 2007: Full paper deadline (firm) April 12, 2007: Author notification April 26, 2007: Final version deadline (firm) PROGRAM COMMITTEE Samson Abramsky (U Oxford) Michael Benedikt (Bell Labs) Lars Birkedal (ITU Copenhagen) Andreas Blass (U Michigan) Thierry Coquand (Chalmers U, Goteborg) Jan van Eijck (CWI, Amsterdam) Marcelo Finger (U Sao Paulo) Rob Goldblatt (Victoria U, Wellington) Yuri Gurevich (Microsoft Redmond) Hermann Haeusler (PUC Rio) Masami Hagiya (Tokyo U) Joseph Halpern (Cornell U) John Harrison (Intel UK) Wilfrid Hodges (U London/QM) Phokion Kolaitis (IBM Almaden Research Center) Marta Kwiatkowska (U Birmingham) Daniel Leivant (Indiana U) (Chair) Maurizio Lenzerini (U Rome) Jean-Yves Marion (LORIA Nancy) Dale Miller (Polytechnique Paris) John Mitchell (Stanford U) Lawrence Moss (Indiana U) Peter O'Hearn (U London/QM) Prakash Panangaden (McGill, Montreal) Christine Paulin-Mohring (Paris-Sud, Orsay) Alexander Razborov (Steklov, Moscow) Helmut Schwichtenberg (Munich U) Jouko Vaananen (U Helsinki) ORGANISING COMMITTEE Marcelo da Silva Correa (U Fed Fluminense) Renata P. de Freitas (U Fed Fluminense) Ana Teresa Martins (U Fed Ceara') Anjolina de Oliveira (U Fed Pernambuco) Ruy de Queiroz (U Fed Pernambuco, co-chair) Petrucio Viana (U Fed Fluminense, co-chair) WEB PAGE www.cin.ufpe.br/~wollic/wollic2007 --- From miculan at dimi.uniud.it Mon Jan 29 04:44:35 2007 From: miculan at dimi.uniud.it (Marino Miculan) Date: Mon, 29 Jan 2007 10:44:35 +0100 Subject: [TYPES/announce] TYPES 2007 Announce Message-ID: <1B66E747-9C85-4887-BED3-82494E27F53D@dimi.uniud.it> TYPES 2007 Main Conference of the Types Project Cividale, Italy, May 2-5, 2007 http://www.dimi.uniud.it/types07/ This is the latest meeting in a series that started 1992, the last conference was in April 2005 in Nottingham. The topic of the meeting is formal reasoning and computer programming based on Type Theory: languages and computerised tools for reasoning, and applications in several domains such as analysis of programming languages, certified software, formalisation of mathematics and mathematics education. The conference is organized by the Department of Mathematics and Computer Science of the University of Udine, and takes place in Cividale del Friuli, a medieval town near Udine, Italy. For more information and registration, see: http://www.dimi.uniud.it/types07/ Early registration deadline is *** March 31, 2007 ***. At the registration you will be able to propose your talk and abstract. We will try to accomodate as much as possible the talks which fit into the scope of the TYPES project. There will also be invited lectures. A number of block reservations for the participants of TYPES 2007 have been made at some hotels in Cividale. However, most are only held until *** February 28, 2007 *** (and some until the early registration deadline), so it is highly advisable to make your reservation as soon as possible. See site for details. Please direct all emails related to TYPES 2007 to types07 at dimi.uniud.it The Organisation Comittee Marino Miculan, Ivan Scagnetto, Furio Honsell. From finco07 at cs.brown.edu Mon Jan 29 14:45:30 2007 From: finco07 at cs.brown.edu (FINCO 2007) Date: Mon, 29 Jan 2007 14:45:30 -0500 Subject: [TYPES/announce] final CFP: Foundations of Interactive Computation Message-ID: final call for papers FInCo 2007: FOUNDATIONS OF INTERACTIVE COMPUTATION satellite workshop of ETAPS 2007 Saturday 31 March 2007, Braga, Portugal http://www.cs.brown.edu/sites/finco07 ==================================================== The interaction paradigm provides a new conceptualization of compu- tational phenomena, placing the emphasis on interaction rather than on algorithms; concurrent, distributed, reactive, embedded, component- oriented, agent-oriented and service-oriented systems all exploit interaction as a fundamental paradigm. Contemporary approaches to Software Engineering, Artificial Intelligence, Programming Languages, and Networking are all part of this paradigm change. However, a satis- factory unified foundational framework for interactive computation is still lacking, analogous to the one that Turing Machines and lambda- calculus provide for algorithms. Following the success of FInCo 2005, this workshop provides an opportunity for researchers to meet and ex- change ideas, with the ultimate goal of providing a unified conceptual and formal framework for interactive computation. The following characteristics distinguish this new, interactive notion of computation: Computational Problem: The notion of a computational problem includes performing a task or providing a service, rather than being rest- ricted to algorithmically producing an answer to a question. Observable Behavior: A computing component is modeled in terms of its observable behavior, where later input values may depend on earlier output values and vice versa. Environments: The world, or environment of the computation is part of the model, dynamically supplying the computational system with the inputs, and consuming the output values from the system. Concurrency: Computation may be concurrent, where the computing agent computes in parallel with its environment, and with other agents in it. The claim that "interaction is more powerful than algorithms" is an open invitation to researchers to develop the tools and methods that can lend credence to this claim. Many models capturing different aspects of interaction have been introduced, including interaction automata and process algebras. It is now time for researchers involved in interactive systems to join their efforts and collaborate to develop a common frame- work that focuses on constructive models of computation that exploit interaction as a first-class concept. Accordingly, FInCo 2007 has the following goals: * Understand the fundamental issues underlying the interaction paradigm; * Establish a common language- and domain-independent framework for a theory of interactive computation; * Identify the interactive principles of effective and reliable engi- neering of software systems; * Map out the design space of models of interaction, towards accompli- shing above goals. WORKSHOP PANEL Title: Interactive Models for Software Engineering Moderator: Peter Wegner, Brown University, USA Description: Software & systems engineering of today is being affected by the growing importance of interaction. This panel considers the role of interaction in the theory and practice of computing, with a special focus on system design and development. PAPERS We solicit papers addressing one or more of the above goals. Submit papers by email to by Jan. 31, 2007, with a 12- page limit. Workshop proceedings will be published by ENTCS. Selected papers will be invited for journal publication. For a PDF copy of this announcement, and for further information, see our web site at http://www.cs.brown.edu/sites/finco07 IMPORTANT DATES Submission: Jan. 31, 2007 Notification: Feb. 28, 2007 Workshop: Mar. 31, 2007 ORGANIZERS Farhad Arbab, CWI and Leiden Univ., The Netherlands Dina Goldin, Brown Univ., USA (chair) PROGRAM COMMITTEE Gul Agha, UIUC, USA Luca de Alfaro, UC Santa Cruz, USA Luis Barbosa, Univ. do Minho, Portugal Antonio Brogi, Univ. di Pisa, Italy Jon Doyle, North Carolina State U., USA Giorgio Delzanno, Univ. di Genova, Italy Jos? Luiz Fiadeiro, Univ. of Leicester, UK Rob van Glabbeek, National ICT, Australia Kees van Hee, Technische Univ. Eindhoven, The Netherlands Orna Kupferman, Hebrew Univ., Israel R. Prescott Loui, Washington Univ. in St. Louis, USA Peter McBurney, Univ. of Liverpool, UK John-Jules Meyer, Utrecht Univ., the Netherlands Ugo Montanari, Univ. di Pisa, Italy Rocco De Nicola, Univ. degli Studi di Firenze, Italy Andrea Omicini, Univ. di Bologna - Cesena, Italy Catuscia Palamidessi, INRIA and LIX ?cole Polytechnique, France Jean-Eric Pin, Univ. Paris Denis Diderot and CNRS, France Vladimiro Sassone, Univ. of Southhampton, UK Douglas C. Schmidt, Vanderbilt Univ., USA Carolyn Talcott, SRI Int'l, USA Bernhard Thalheim, Kiel Univ., Germany STEERING COMMITTEE Manfred Broy, TU M?nchen, Germany Dina Goldin, Brown Univ., USA Mirko Viroli, Univ. Bologna/Cesena, Italy Peter Wegner, Brown Univ., USA WEB SITE http://www.cs.brown.edu/sites/finco07 From vv at di.fc.ul.pt Tue Jan 30 10:39:44 2007 From: vv at di.fc.ul.pt (Vasco Vasconcelos) Date: Tue, 30 Jan 2007 15:39:44 +0000 Subject: [TYPES/announce] CONCUR 2007 Call for Papers Message-ID: <2857D278-05E9-40F4-B0BE-2E25C1C4541F@di.fc.ul.pt> CALL FOR PAPERS CONCUR'07 18th International Conference on Concurrency Theory September 4th - 7th, 2007 Lisbon, Portugal http://concur07.di.fc.ul.pt/ CONCUR 2007, the 18th International Conference on Concurrency Theory, will take place in Lisbon, Portugal, September 4 - 7, 2007. The purpose of the CONCUR conferences is to bring together researchers working on the theory of concurrency and its applications. Submissions are solicited in all areas of semantics, logics, and verification techniques for concurrent systems. The principal topics include (but are not limited to): * Basic models and logics of concurrent and distributed computation (such as process algebras, Petri nets, domain theoretic or game theoretic models, modal and temporal logics). * Specialized models or classes of systems (such as circuits, synchronous systems, real time and hybrid systems, stochastic systems, data bases, mobile and migrating systems, parametric protocols, biologically inspired systems). * Related verification techniques and tools (such as state-space exploration, model-checking, synthesis, abstraction, automated deduction, testing). * Related programming models (such as distributed, constraints or object oriented, graph rewriting, as well as associated type systems, static analyses, and abstract machines). Authors are invited to submit an extended abstract; submissions will be evaluated by the program committee for inclusion in the proceedings, which will be published by Springer-Verlag in the Lecture Notes in Computer Science series. Papers must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. Simultaneous submission to journals or other conferences with published proceedings is not allowed. Authors are required to submit a paper title and a short abstract before submitting the extended abstract. The short abstract should not exceed 200 words, and it should be entered in ASCII at the conference web electronic site. The extended abstract should not exceed 15 pages, and it should be formatted according to Springer-Verlag LNCS guidelines. If necessary, the extended abstract may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee. The link for submission will be accessible from the Concur 2007 web site. Invited Speakers ================ * Luca Aceto, Aalborg University, Denmark * Peter O'Hearn, Queen Mary University of London, UK * Fred B. Schneider, Cornell University, USA Invited Tutorials ================= * Vincent Danos, Universite Paris 7, France * Jose Fiadeiro, University of Leicester, UK Important Dates =============== Abstract Submission: April 2, 2006 Paper Submission: April 9, 2006 (STRICT) Notification: May 27, 2006 Final version due: June 9, 2006. Affiliated Workshops ==================== Seven workshops will be affiliated with CONCUR 2007: Expressiveness in Concurrency (EXPRESS), Applying Concurrency Research in Industry (IFIP WG 1.8), From Biology To Concurrency and back (FBTC), Foundations of Coordination Languages and Software Architectures (FOCLASA), Graph Transformations in Verification and Concurrency (GT-VC), Security Issues in Concurrency (SECCO), Verification and Analysis of Multi-threaded Java-like Programs (VAMP). Program Committee ================= Luca de Alfaro, University of California at Santa Cruz, USA Roberto Amadio, Universite Paris 7, France Jos Baeten, Eindhoven University of Technology, the Netherlands Bruno Blanchet, Ecole Normale Superieure de Paris, France Franck van Breugel, York University, Canada Luis Caires (co-chair), Universidade Nova de Lisboa, Portugal Luca Cardelli, Microsoft Research Cambridge, UK Wan Fokkink, Free University of Amsterdam, the Netherlands Daniel Hirschkoff, Ecole Normale Superieure de Lyon, France Radha Jagadeesan, DePaul University, USA Alan Jeffrey, Bell Labs, Alcatel-Lucent, USA Antonin Kucera, Masaryk University in Brno, Czech Republic Faron Moller, University of Wales Swansea, UK Ugo Montanari, University of Pisa, Italy Uwe Nestmann, Technical University of Berlin, Germany Mogens Nielsen, University of Aarhus, Denmark Catuscia Palamidessi, INRIA Futurs Saclay and LIX, France Davide Sangiorgi, Universita di Bologna, Italy Vladimiro Sassone, University of Southampton, UK Peter Van Roy, Catholic University of Louvain, Belgium Vasco T. Vasconcelos (co-chair), Universidade de Lisboa, Portugal Hagen Volzer, University of Lubeck, Germany Nobuko Yoshida, Imperial College London, UK CONCUR Steering Committee ========================= Roberto Amadio, Universite Paris 7, France Jos Baeten, Eindhoven University of Technology, the Netherlands Eike Best, University of Oldenburg University, Germany Kim Larsen, Aalborg University, Denmark Ugo Montanari, University of Pisa, Italy Scott Smolka, SUNY Stony Brook, USA CONCUR 2007 Organizing Committee ================================ Vasco T. Vasconcelos, Universidade de Lisboa, Portugal Luis Caires, Universidade Nova de Lisboa, Portugal Francisco Martins (workshops organisation), Universidade de Lisboa, Portugal Ant?nio Ravara (workshops organisation), Instituto Superior Tecnico, Portugal From morazanm at shu.edu Wed Jan 31 09:41:10 2007 From: morazanm at shu.edu (Marco T Morazan) Date: Wed, 31 Jan 2007 09:41:10 -0500 Subject: [TYPES/announce] TFP 2007 Submission Deadline is Tomorrow Message-ID: Dear Colleagues, This is a kind reminder that the deadline for extended abstract submissions to TFP 2007 is tomorrow, Feb. 1 at 11:59 EST. We are also pleased to announce that the TFP 2007 invited speaker is John McCarthy, Stanford University. For further details, please visit our website at: http://cs.shu.edu/tfp2007/ . The TFP 2007 program committee looks forward to receiving your submissions! Best wishes, Marco ********************************************************************************** Prof. Marco T. Morazan Dept. of Mathematics and Computer Science Seton Hall University "On theories such as these we cannot rely. Proof we need. Proof!" -- Yoda, Jedi Master -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070131/77fc9571/attachment.htm From morazanm at shu.edu Wed Jan 31 10:29:12 2007 From: morazanm at shu.edu (Marco T Morazan) Date: Wed, 31 Jan 2007 10:29:12 -0500 Subject: [TYPES/announce] Correction: TFP 2007 Submission Deadline is Tomorrow Message-ID: Dear Colleagues, Apologies in advance for the "p.m." ommission. This is a kind reminder that the deadline for extended abstract submissions to TFP 2007 is tomorrow, Feb. 1 at 11:59 p.m. EST. We are also pleased to announce that the TFP 2007 invited speaker is John McCarthy, Stanford University. For further details, please visit our website at: http://cs.shu.edu/tfp2007/ . The TFP 2007 program committee looks forward to receiving your submissions! Best wishes, Marco ********************************************************************************** Prof. Marco T. Morazan Dept. of Mathematics and Computer Science Seton Hall University "On theories such as these we cannot rely. Proof we need. Proof!" -- Yoda, Jedi Master -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070131/ab327a5d/attachment.htm From Philippe.LAHIRE at unice.fr Thu Feb 1 14:47:49 2007 From: Philippe.LAHIRE at unice.fr (Philippe.LAHIRE@unice.fr) Date: Thu, 01 Feb 2007 20:47:49 +0100 Subject: [TYPES/announce] TOOLS Europe 2007: Paper deadline extension Message-ID: <45C243E5.9080901@unice.fr> After several requests, the paper submission deadline for TOOLS Europe has been extended to Feb 15 (abstracts) and Feb 22 (full papers). These deadlines are firm, i.e. no additional extensions can be given. ============================================================================ TOOLS EUROPE 2007 Objects, Models, Components, Patterns ETH Zurich, Switzerland 24-28 June 2007 http://tools.ethz.ch/ ============================================================================ Call for Papers TOOLS EUROPE 2007 will be devoted to the combination of technologies that have emerged as a result of object technology becoming "mainstream". Like its predecessors, TOOLS EUROPE 2007 combines an emphasis on quality with a strong practical focus. This is the 45th TOOLS conference. Started in 1989, TOOLS conferences, held in Europe, the USA, Australia, China and Eastern Europe, have played a major role in the development of object technology field; many of the seminal concepts were first presented at TOOLS. After an interruption of four years, the conference is now revived to reflect the maturing of the field and the new challenges ahead. Contributions are solicited on all aspects of object technology and neighbouring fields, in particular model-based development, component-based development, and patterns (design, analysis and other applications); more generally, any contribution addressing topics in advanced software technology fall within the scope of TOOLS. Reflecting the practical emphasis of TOOLS, contributions showcasing applications along with a sound conceptual contribution are particularly welcome. For a non-exclusive list of potential topic areas see the conference Web page. Submission Guidelines All contributions will be subject to a rigorous selection process by the international Program Committee, with a stress on originality, practicality and overall quality. Every paper will be reviewed by at least 4 committee members. The acceptance rate will be published in the conference proceedings; TOOLS is committed to a fair and extensive peer-review process establishing a high standard in the area of modern practices in software engineering. By submitting a paper to TOOLS, authors warrant that the work is original and that the paper or a similar contribution is neither published nor considered for publication elsewhere. Submissions should follow the publication format of the Journal of Object Technology (JOT). Papers should be limited in size to 20 single-spaced pages. Further details are available from the website. Important Dates Deadline for technical paper abstracts: Feb 15, 2007 midnight Zurich time technical papers: Feb 22, 2007 midnight Zurich time Author notification: Apr 15, 2007 Camera-ready copy due: May 15, 2007 The proceedings will be published as a special issue of the Journal of Object Technology. TOOLS EUROPE will also include workshops and tutorials (June 24), a poster session, and a venture forum (June 28). See the corresponding calls for contributions. Chairpersons Conference chair: Bertrand Meyer Program chair: Jean Bezivin Publicity chairs: Philippe Lahire, Laurence Tratt Program committee Patrick Albert, Gustavo Alonso, Uwe Assman, Don Batory, Claude Baudoin, Bernhard Beckert, Jean-Pierre Briot, Stefano Ceri, Siobh?n Clarke, Pierre Cointe, Charles Consel, Bernard Coulette, Patrick Cousot, Krystof Czarnecki, Tharam Dillon, Klaus Dittrich, Gregor Engels, Jacky Estublier, Jose Fiadeiro, Judit Nyekyne Gaizler, Viktor Gergel, Carlo Ghezzi, Yossi Gil, Martin Gogolla, Jeff Gray, Rachid Guerraoui, Pedro Guerreiro, Alan Hartmann, Reiko Heckel, Connie Heitmeyer, Valerie Issarny, Gerti Kappel, Joseph Kiniry, Ivan Kurtev, Philippe Lahire, Ralf L?mmel, Gary Leavens, Rustan Leino, Mingshu Li, Tiziana Margaria, Erik Meijer, Silvio Meira, Christine Mingins, Peter M?ller, Elie Najm, Oscar Nierstrasz, Jonathan Ostroff, Richard Paige, Alfonso Pierantonio, Jaroslav Pokorny, Ralf Reussner, Richard Riehle, Nicolas Rouquette, Anthony Savidis, Doug Schmidt, Bran Selic, Richard Mark Soley, Clemens Szyperski, Dave Thomas, T.H. Tse, Antonio Vallecillo, Alan Cameron Wills, Amiram Yehudai From Pierre-Louis.Curien at pps.jussieu.fr Fri Feb 2 10:23:42 2007 From: Pierre-Louis.Curien at pps.jussieu.fr (Pierre-Louis Curien) Date: Fri, 2 Feb 2007 16:23:42 +0100 Subject: [TYPES/announce] 2 events related to JY Girard's 60th birthday Message-ID: <6086FA68-8E09-41C4-AC68-171AC4F1CEA5@pps.jussieu.fr> We are pleased to announce two special events that will be held in 2007, in Italy and France respectively, in honour of Jean-Yves Girard, who celebrates his 60th birthday this year: ************************* Workshop on Linear Logic, Ludics, Implicit Complexity and Operator Algebras. Dedicated to Jean-Yves Girard on his 60th birthday. University of Siena (Italy) at the Certosa di Pontignano, May 17-20, 2007. Organizing committee: Michele Abrusci (Roma III), Claudia Faggian (CNRS - Paris 7), Simone Martini (Bologna), Simona Ronchi Della Rocca (Torino), Aldo Ursini (Siena, chair) www.unisi.it/eventi/LOGIC ************************* and ************************* Journ?es Jean-Yves Girard Conference in honour of his 60th birthday Institut Henri Poincar?, Paris, September 10 and 11, 2007 Organizing committee: Michele Abrusci (Roma III) Pierre-Louis Curien (CNRS - Paris 7, chair), Martin Hyland (Cambridge), Giuseppe Longo (ENS, Paris), Mitsu Okada (Keio U., Tokyo), Phil Scott (Univ. of Ottawa), Jacqueline Vauzeilles (Paris 13, co-chair) http://www-lipn.univ-paris13.fr/jyg60 ************************* Both events will be an occasion to celebrate Jean-Yves Girard's deep achievements in Mathematics and in Computer Science, and the pervasive influence of his ideas in those disciplines and beyond. The Siena workshop also celebrates the 20th anniversary of the completion of his fundamental paper on Linear Logic. The aim is to gather people working in the many research streams originating from Girard's main achievements of the recent years. For each of the four main themes---Linear Logic (specifically, Proof Nets and Geometry of Interaction), Ludics, Implicit Complexity and Operator Algebras---there will be in-depth lectures (3 to 4 hours), with emphasis on the state of the art and prospects for future development. There will also be some time for 30- minute contributed papers and for discussion of general perspectives and philosophical foundations. This workshop has been organized to complement the celebration in Paris, which will take place immediately after Jean-Yves' birthday. Through our choice of invited speakers, we hope to illustrate the wide range of scientific interests of Jean-Yves Girard over thirty- five years, from the complexity of proofs to quantum mechanics, from system F to the geometry of computation, from denotational semantics to Von Neumann algebras. The two web sites will provide all details. Pierre-Louis Curien and Aldo Ursini From segura.eduardo at gmail.com Mon Feb 5 03:47:02 2007 From: segura.eduardo at gmail.com (eduardo segura) Date: Mon, 5 Feb 2007 00:47:02 -0800 Subject: [TYPES/announce] CFP: SPAC 07 - Software Patterns: Addressing Challenges In-Reply-To: References: Message-ID: My apologies for duplicates *The First IEEE International Workshop on **Software Patterns: Addressing Challenges **SPAC 2007 **Call for Papers* *Beijing, China, July 24-27, 2007 (in conjunction with COMPSAC 2007)* * * http://conferences.computer.org/compsac/2007/ (COMPSAC 2007 Link) http://conferences.computer.org/compsac/2007/workshops/SPAC (Workshop Link-1) http://www.engr.sjsu.edu/~fayad/workshops/COMPSAC07 (Workshop Link-2) http://www.vrlsoft.com/workshops/SPAC07 (WorkshopLink-3)* * *THEME OF THE WORKSHOP* As software increases in size and becomes more complex and costly, the need for techniques to ease software development is likewise increasing. Over the last decade, pattern community has evolved and received more interest in both academia and industry. Developing software using patterns holds the promise to reduce the cost and condensing the time of developing software systems, while simultaneously maintaining the quality of these systems. However, the potential of using patterns in developing systems is not fully realized and we need to address many challenges. For example, developing pattern repositories and catalogs, from which patterns can be retrieved and reused, still forms a challenge to software engineering, knowledge engineering and information systems communities. In addition, the need for (semi-) automated approaches for patterns mining and integration poses several open research questions to the software engineering community. Many think these challenges and others preclude the realization of the benefit of patterns as a reuse approach. This workshop aims at bringing together researchers and practitioners who are interested in resolving research challenges or who have practical experience with the different issues of patterns reuse and integration to discuss and advance the state-of-the-art and the state-of-the-practice in patterns reuse. Patterns have emerged as a promising reuse technique for both improving the quality and reducing the cost and time of software development. However, there is an immense belief that patterns have not fulfilled the expectations software developers wanted. Nevertheless, this belief does not rebuff the fact that patterns, as a concept, have the potential to play a key role in developing systems in the near future. This near future will never come unless there are serious attempts from both developers and researchers to investigate and provide creative solutions to current challenges that hinder utilizing patterns in practice. Among these challenges, this workshop focuses on investigating how to develop systems using patterns. We are sure that this topic will attract many developers and researchers in the field to participate in this workshop. *WORKSHOP CHALLENGES* The workshop will address software patterns challenges and debate several issues related to the following questions. We want researchers, framework developers, and application developers to discuss and debate the following questions related to: *I. **Pattern Creation and Development* a. Leaving experience claim on the side, can you show how to create and develop patterns? b. What are the bases of creating patterns? c. Are there guidelines, methodologies, and/or processes for pattern creations and developments? d. Would you show an example or two? *II. **Patterns Selection Process: * a. How does one select analysis and design patterns to build any system? b. What is the basis for selecting these patterns? c. If someone would like to build a system from patterns, how does she select patterns? d. What kind of patterns should one select to build a system from patterns? e. Is there a guideline for the selection process? *III. **Patterns Composition* a. How does one integrate the selected patterns to build any system? or How does one compose any system from patterns? b. What are the various claims related to patterns composition? Are they true? c. Are there guidelines or techniques for patterns composition? Would you illustrate how to use them? *IV. **System of Patterns and General Reuse* a. What do we mean when we say "systems of patterns"? b. Are the various claims related to building any system from patterns reasonable? c. How to develop pattern repositories and catalogs, from which patterns can be retrieved and reused? d. Are there automated approaches for patterns mining and integration? e. What other concepts will help build any system from patterns? . *V. **Impacts* a. What is the impact of software stability on the above issues? Check any of the following websites for all columns and accepted position papers: http://conferences.computer.org/compsac/2007/workshops/SPAC (Main Link) www.engr.sjsu.edu/~fayad//workshops/COMPSAC07 (Workshop Link 2) www.vrlsoft.com/workshops/SPAC07 (Workshop Link 3 -- Under Construction) *PAPER FORMAT AND SUBMISSIONS* Detailed instructions for electronic paper submission and review process can be found at http://www.compsac.org/. People interested in participating in the workshop are requested to submit a short position paper (*3-5 pages*) or regular workshop paper (limited to *6 pages*, double spaced, including figures) representing views and experiences relevant to the discussion topic. The title page should include a maximum 150-word abstract, five keywords, full mailing address, e-mail address, phone number, fax number, and a designated contact author. Papers will be selected depending on the originality, quality and relevance to the workshop. All submitted papers will be evaluated according to its originality, significance, correctness, presentation and relevance. Papers should be submitted electronically at: http://compsac.cs.iastate.edu/2007/SPAC/ . Please follow the instructions given by the web page. Camera Ready manuscripts must be submitted following IEEE conference proceedings style and guidelines. We encourage authors to present novel ideas, critique of existing work, and practical studies. Each accepted paper must be presented in person by the author or one of the authors. To foster lively discussions, each author is encouraged to present open questions and one or two main statements that will be discussed at the workshop. Submissions must be either MS-Word or RTF formats (please, DO NOT compress files). Depending on the number and spread of contributions, the scope may be narrowed to ensure effective communication and information sharing. Accepted position papers will be distributed to the participants before the workshop and made generally available through the WWW and FTP. Accepted papers will be published in the Workshop Proceedings of the 31st IEEE Computer Software and Applications Conference (COMPSAC 2007). At least one of the authors of each accepted paper must register as a full participant in the workshop to have the paper published in the COMPSAC 2007 Proceedings. The workshop selected best papers will be published in online Journal of International Journal Of Patterns (IJOP) ? *www.ijop.org* *WORKSHOP PARTICIPATION* Interested in participating in the workshop without submission are requested to fill out the participation form and e-mail to the co-chair Haitham Hamza , Eduardo Segura , or to the workshop chair M.E. Fayad . ------------------------------------------------- PARTICIPATION FORM: Name and Affiliation: Position: Address: E-mail: URL: Areas of interest: Why would you like to participate? ------------------------------------------------- Please note that registration is required in order to participate in the workshop. An early registration discount is available. An overhead projector and a flipchart will be available. For more information please visit any of the following websites: * * http://conferences.computer.org/compsac/2007/workshops/SPAC (Main Link) www.engr.sjsu.edu/~fayad//workshops/COMPSAC07 (Workshop Link 2) www.vrlsoft.com/workshops/SPAC07 (Workshop Link 3 -- Under Construction) You may also contact the organizers. *PROPOSED AGENDA* 1. Welcome and introduction of participants. The organizers will first give a short overview of any open issues and of the main arguments arising out of the position papers. (Estimated time: 20-30 minutes) 2. Selected authors (representing the main trends) will be given 20 minutes to explain how their position relates to other positions and what each sees as the three major issues. We expect about 5-10 position papers. (Estimated time: 120-130 minutes) 3. The organizers will propose an identification of the major issues, and the participants will then discuss and select what they think are the hottest issues to be examined. (Estimated time: 10-15 minutes) 4. The participants will work for 70-95 minutes in small groups, with a designated moderator in each group. The groups will each deal with two different hot issues identified and will produce a summary in the form of points and counterpoints, showing either how several views are irreducibly opposed or how they are complementary. The number of groups will depend on the number of participants and number of issues selected; ideally there should be 3-5 p people in each group. (Estimated time: 60-70 minutes) 5. Each group will be given 10-15 minutes to present its findings to the workshop. A closing discussion will follow. The workshop report will be written on the basis of these findings and will include an agenda for future exploration and cooperation; it will be made available through the WWW and FTP. (Estimated time: 50-60 minutes for five teams) (Total estimated time: 285-315 minutes, i.e. about five hours +/- 15 minutes; lunch and breaks are not included.) *IMPORTANT DATES* We will be updated based on acceptance process *Feb. 23, 2007*: Full paper and short paper due *Mar. 25, 2007*: Decision notification (electronic) *Apr. 30, 2007*: Camera-ready copy and author registration due *July 24-27, 2007**:* The workshop Date *ORGANIZERS* * * *Chair and Point of Contact:* *Dr.** M.E.** Fayad * Professor of Computer Engineering Computer Engineering Dept., College of Engineering San Jos? State University One Washington Square, San Jos?, CA 95192-0180 Ph: (408) 924-7364, Fax: (408) 924-4153 E-mail: m.fayad at sjsu.edu, me fayad at gmail.com http://www.engr.sjsu.edu/fayad *Co-Chairs:* Dr. H.S. Hamza (Co-Chair) Faculty of Computers and Informatics, Information Technology Department Cairo University, Orman, Giza 12613 - Egypt Ph: (02) 335-8355 (office) E-mail: hshamza at gmail.com * * Eduardo M. Segura vrlSoft, Inc. 2065 Martin Ave., Suite 103 Santa Clara, CA 95050-2707 Phone/Fax: (408) 654-8972 E-mail: esegura at vrlsoft.com, eduardo.segura at sjsu.edu http://www.vrlsoft.com *PROGRAM COMMITTEE* *Leonor Barroca **Open University, England* *Sjaak Brinkkemper Utrecht University, the Netherlands * *Chia-Chu Chiang University of Arkansas at Little Rock, USA* *Rogerio Atem de Carvalho CEFET Campos, Brazil* *Andrea D'Ambrogio University of Roma TorVergata, Italy* *Issam Wajih Damaj Dhofar University, Salalah - Sultanate of Oman * *Khalil DRIRA LAAS-CNRS, France* ** *Islam A. M. El-Maddah Ain Shams University, Egypt* *M.E. Fayad San Jose State University & vrlSoft, Inc., USA* *Joao M. Fernandes Universidade do Minho, Portugal* *IanGraham * *Trireme International Ltd, London, England* *Jiang Guo California State University Los Angeles, USA* *Wilhelm Hasselbring University of Oldenburg, Germany* *Tarek Helmy King Fahd Univ. of Petroleum and Minerals, Saudi Arabia* *H.S. Hamza Cairo University, Egypt* *Pilar Herrero Universidad Polit?cnica de Madrid , Spain.* *Hoda Hosny American University in Cairo, Egypt* *Pao-Ann Hsiung National Chung Cheng University, Chiayi, TAIWAN* *Ali Jaoua University of Qatar, Qatar* *Mohamed-Khireddine KHOLLADI University of Constantine, France* *Dae-Kyoo Kim Oakland University, MI, USA* *Seok-Won Lee The University of North Carolina at Charlotte, USA* *Jeff Lei University of Texas at Arlington, USA* *Ricardo J. Machado Universidade do Minho, Portugal* *Ahmed Mahdy Texas A&M University - Corpus Christi, USA* *Michael Oudshoorn ** Montana State University**, MT, USA* *Srini Ramaswamy University of Arkansas at Little Rock, USA* *Gustavo Rossi LIFIA, Facultad de Informatica, UNLP, Argentina* *Stuart Rubin SPAWAR, SSC-San Diego, USA* *Kannamma Sampath Coimbatore Institute of Technology, India* *Sanchez, Arturo University of North Florida, USA* *Kassem A. Saleh American University of Sharjah, UAE* *Arno Schmidmeier AspectSoft, Hersbruck, Germany * *E.M. Segura San Jose State University & vrlSoft, Inc., USA* *Manolis Tzagarakis Research Academic Technology Institute (RACTI), Greece* *Laurence** T. Yang St Francis Xavier University, Canada* *I-Ling Yen University of Texas at Dallas, USA* -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070205/7e4eaba9/attachment.htm From nielson at imm.dtu.dk Tue Feb 6 08:13:51 2007 From: nielson at imm.dtu.dk (Flemming Nielson) Date: Tue, 06 Feb 2007 14:13:51 +0100 Subject: [TYPES/announce] Attractive PhD-scholarships at DTU Message-ID: <6.2.1.2.2.20070206141311.027267d8@csimap.imm.dtu.dk> PLEASE POST: Attractive PhD-scholarships at DTU We are happy to announce two very attractive PhD-scholarhips at the Technical University of Denmark. They are tenable within the areas: 1. Aspects for security of citizens 2. Verification of cryptographic protocols 3. Information flow security for services 4. Model-based verification of service-oriented systems 5. Sessions for services The salary is at the level of assistant professor and the project are in cooperation with some leading European Universities. For further details: http://www2.imm.dtu.dk/~nielson/PhD07 Professor Flemming Nielson, (+45) 4525 3735, http://www.imm.dtu.dk/~nielson From Susanne.Graf at imag.fr Tue Feb 6 15:46:26 2007 From: Susanne.Graf at imag.fr (Susanne Graf) Date: Tue, 06 Feb 2007 21:46:26 +0100 Subject: [TYPES/announce] Call for Papers: SPIN 2007 with CAV in Berlin Message-ID: <45C8E922.1020105@imag.fr> ****************************************************************** * SPIN 2007 * * 14th International SPIN Workshop on Model Checking of Software * * July 1-3, 2007, Berlin, Germany * * (affiliated with CAV '2007) * * * * http://ls5-www.cs.uni-dortmund.de/~edelkamp/spin/ * ****************************************************************** Important Dates --------------- March 15, 2007 Submission deadline April 15, 2007 Notification of acceptance May 1, 2007 Camera ready copy for proceedings July 01-03, 2007 Workshop dates Objectives ---------- The 14th edition of the SPIN workshop series aims at bringing together practitioners and researchers interested in state space based techniques for the validation and analysis of software systems. The workshop focuses on techniques based on explicit representations of state spaces, as implemented in the SPIN model checker and other tools, or techniques based on combination of explicit with other representations. One of the main goals of the workshop is to encourage interactions and exchanges of ideas with all related areas in software engineering. The workshop will be held as a satellite event of CAV 2007, the 19th edition of the Computer Aided Verification conference. The first SPIN workshop was held in Montreal in 1995. Since 1996, SPIN workshops have been organized each year as a more or less closely affiliated event with bigger conferences. An overview of the previous SPIN workshops can be found at http://spinroot.com/spin/whatispin.html#D. Workshop Specific Topics ------------------------ We encourage submission of works which include but are not limited to the following topics: * Algorithms for state space based verification * Innovative implementation techniques * Tool descriptions (full paper, no tool demonstration) * Manual or automatic modeling of systems for state space tools * Manual or automatic derivation of properties that are to be checked of the systems * Techniques for alleviating state explosion * Techniques for dealing with infinite state spaces and infinite families of systems * Techniques for dealing with timed or probabilistic systems * Derivation of code, test cases, or other useful material from state spaces * Innovative or otherwise particularly significant case studies * Theoretical results on the limits and possibilities of state space methods * Unpublished, insightful surveys or historical accounts on topics of relevance to SPIN workshops * Directed model checking and accelerated error detection * Combinations of artificial intelligence techniques and model checking * Short tool presentations Solicited Contributions ----------------------- With the exception of survey and history papers, the papers should contain original work which has not been submitted or accepted for publication elsewhere. Submissions should adhere to the LNCS format. We solicit two kind of papers: * Technical Papers no longer than 18 pages. All accepted technical papers will be included in the proceedings. * Tool Presentations. This kind of submissions should consist of two parts. The first part is at most 5 page description of the tool. If accepted, this part will be published in the workshop proceedings. The second part should describe an informal plan for an oral presentation of the tool. This part will not be included in the proceedings. Submissions and Publication --------------------------- As in the previous years, also the proceedings of this edition of the workshop will appear in the Spriger-Verlag Lecture Notes in Computer Science (LNCS) series. Also, we intend to publish extended versions of the best papers in a special section of the International Journal on Software Tools for Technology Transfer (STTT). Organization ------------ Dragan Bosnacki (Eindhoven, Netherlands) Stefan Edelkamp (Dortmund, Germany) Program Committee Dragan Bosnacki (Eindhoven, Netherlands) (co-chair) Matthew Dwyer (U. Nebraska, USA) Stefan Edelkamp (Dortmund, Germany) (co-chair) Jaco Geldenhuys (Stellenbosch, South Africa) Patrice Godefroid (Microsoft, USA) Susanne Graf (Verimag, France) Alex Groce (NASA/JPL, USA) Joerg Hoffmann (DERI, Austria) Gerard Holzman (NASA/JPL, USA) Radu Iosif (Verimag, France) Marta Kwiatkowska (Birmingham, UK) Stefan Leue (Konstanz, Germany) Alberto Lluch Lafuente (Pisa, Italy) Pedro Merino (Malaga, Spain) Kedar Namjoshi (Bell Labs, USA) Corina Pasareanu (NASA Ames, USA) Doran Peled (Warwick, UK/Bar Ilan, Israel) Paul Pettersson (Malardalen, Sweden) Theo Ruys (Twente, Netherlands) Antti Valmari (Tempere, Finland) Willem Visser (SEVEN Networks, USA) Pierre Wolper (Liege, Belgium) Steering Committee Patrice Godefroid (Microsoft, USA) Susanne Graf (Verimag, France) Stefan Leue (U. Konstanz, Germany) Antti Valmari (Tempere, Finland) Moshe Vardi (Rice U., USA) Pierre Wolper (Liege, Belgium)(chair) Advisory Committee Gerard Holzmann (NASA JPL, USA) (chair) Amir Pnueli (Weizmann Inst., Israel) From pasalic at cs.rice.edu Wed Feb 7 16:23:03 2007 From: pasalic at cs.rice.edu (Emir Pasalic) Date: Wed, 7 Feb 2007 15:23:03 -0600 Subject: [TYPES/announce] GPCE'07: Calls for Tutorials/Workshops Message-ID: <0B985EDE-DDB3-49EA-9055-8E0120A8BCB0@cs.rice.edu> CALL FOR TUTORIAL PROPOSALS Sixth International Conference on Generative Programming and Component Engineering (GPCE'07) October 1-3, 2007 in Salzburg, Austria (co-located with ESWEEK'07). http://www.gpce.org/07 Important Dates * Submission deadline for tutorial proposals: Friday March 16th * Date for notification of acceptance: Monday April 9th Note that this call is for tutorial organizers; tutorial registration is with the conference registration. Overview Proposals for high-quality tutorials in all areas of generative programming and component-based development, from academic research to industrial applications, are solicited. Tutorial levels may be introductory, intermediate, or advanced. A tutorial's purpose is to give a deeper insight into an area than a conventional lecture. Tutorials extend over a half or a full day. This gives the speaker the possibility to select a proper length for their tutorial. The topic of a tutorial can come from a truly broad spectrum. Any interesting theme included but not restricted to the following topic list is welcome: * Generative programming * Reuse, meta-programming, partial evaluation, multi-stage and multi-level languages, step-wise refinement * Semantics, type systems, symbolic computation, linking and explicit substitution, in-lining and macros, templates, program transformation * Runtime code generation, compilation, active libraries, synthesis from specifications, development methods, generation of non-code artifacts, formal methods, reflection * Generative techniques for * Product lines and architectures * Embedded systems * Model-driven architecture * Component-based software engineering * Reuse, distributed platforms, distributed systems, evolution, analysis and design patterns, development methods, formal methods * Integration of generative and component-based approaches * Domain engineering and domain analysis * Domain-specific languages (DSLs) including visual and UML-based DSLs * Separation of concerns * Aspect-oriented programming and feature-oriented programming, * Intentional programming and multi-dimensional separation of concerns * Industrial applications However, you should keep in mind that a tutorial must be expected to attract a reasonable number of participants. This is most likely the case if the topic is new or relevant to a broad community. If you have deep experience in a GPCE topic area, from which others could benefit, please consider submitting a proposal. Submission Format, Recommendations, and Process For details on the submission format, recommendations for submissions, and an overview of the submission process, please see the complete GPCE'07 call for tutorial proposals at: http://www.gpce.org/07 Follow the "Tutorials" link in the left sidebar. Tutorial Chair Ulrik P. Schultz (University of Southern Denmark, Denmark) For additional information, clarification, or questions please feel free to contact the Tutorial Chair at tutorials07 at gpce.org CALL FOR WORKSHOP PROPOSALS Sixth International Conference on Generative Programming and Component Engineering (GPCE'07) October 1-3, 2007 in Salzburg, Austria (co-located with ESWEEK'07). http://www.gpce.org/07 Important Dates * Submission deadline for workshop proposals: Friday March 16th * Date for notification of acceptance: Monday April 9th Note that this call is for workshop organizers; a later call will occur for workshop contributions. Overview GPCE workshops provide intensive collaborative environments where generative and component technology researchers and practitioners meet to discuss and solve challenging problems facing the field. We encourage proposals for innovative, well-focused workshops on a broad spectrum of component engineering and generative programming topics. All topics related to the theme of the conference are potential candidates for workshops. Workshops typically fall into the following categories: * A workshop may address a specific sub-area of generative and component technology in depth. * A workshop may cover areas that cross the borders of several sub areas. Workshops that cross the borders of the formal and the applied areas is one example. * A workshop may also cross the border to other technologies or software engineering fields, e.g. development processes. * A workshop may focus on the application and deployment of generative and/or component technology in areas such as telecommunications, mobile computing or real-time systems. Workshops reporting on industrial experiences are particularly welcome. Workshop topics are by no means limited to the categories mentioned above. However, in each case, the proposed area is supposed to have enough impetus to yield new results that can be considered important and worth more detailed investigation. Submission Format, Recommendations, and Process For details on the submission format, recommendations for submissions, and an overview of the submission process, please see the complete GPCE'07 call for workshop proposals at: http://www.gpce.org/07 Follow the "Workshops" link in the left sidebar. Workshop Chair Ulrik P. Schultz (University of Southern Denmark, Denmark) For additional information, clarification, or questions please feel free to contact the Workshop Chair at workshops07 at gpce.org. From areces at loria.fr Thu Feb 8 11:23:34 2007 From: areces at loria.fr (Carlos Areces) Date: Thu, 08 Feb 2007 17:23:34 +0100 Subject: [TYPES/announce] CFP: International Workshop on Hybrid Logic 2007 (HyLo 2007) Message-ID: <45CB4E86.9050009@loria.fr> ******************************************************************* THIRD CALL FOR PAPERS International Workshop on Hybrid Logic 2007 (HyLo 2007) http://hylomol.ruc.dk/HyLo2007 6 - 10 August, 2007 organized as part of the European Summer School on Logic, Language and Information ESSLLI 2007 https://www.cs.tcd.ie/esslli2007 6 - 17 August, 2007 in Dublin ******************************************************************* ORGANIZERS: Torben Bra?ner (Roskilde University, Denmark, torben at ruc.dk) - Chair J?rgen Villadsen (Technical University of Denmark, jv at imm.dtu.dk) WORKSHOP PURPOSE: Hybrid logic is a branch of modal logic allowing direct reference to worlds/times/states. It is easy to justify interest in hybrid logic on the grounds of applications as the additional expressive power is very useful. In addition, hybrid-logical machinery improves the behaviour of the underlying modal formalism. For example, it becomes considerably simpler to formulate modal proof systems, and one can prove completeness and interpolation results of a generality that is not available in orthodox modal logic. The topic of the HyLo workshop of 2007 is not only standard hybrid-logical machinery like nominals, satisfaction operators, and the downarrow binder, but generally extensions of modal logic that increase its expressive power. The workshop HyLo 2007 will 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, most recently the LICS-affiliated HyLo 2006 (http://hylomol.ruc.dk/HyLo2006/). The workshop aims to provide a forum for advanced PhD students and researchers to present and discuss their work with colleagues and researchers who work in the broad subject areas represented at ESSLLI. For more general background on hybrid logic, and many of the key papers, see the Hybrid Logics homepage (http://hylo.loria.fr/). SUBMISSION DETAILS: We invite the contribution of papers reporting new work from researchers interested in hybrid logic. Papers should not exceed 10 pages including references. A paper must be submitted as a PDF file and the font size must be at least 10 pt when printed on A4 paper. It is recommended that the LaTeX "article" style is used. Please use the HyLo 2007 submission page (http://www.easychair.org/HyLo2007/), handled by the EasyChair conference system, to submit papers. The accepted papers will appear in the workshop proceedings published by ESSLLI. One author for each accepted paper must attend the workshop in order to present the paper. It is planned to publish revised versions of the accepted papers in a special issue of Journal of Logic, Language and Information. WORKSHOP FORMAT: The workshop is part of ESSLLI and is open to all ESSLLI participants. It will consist of five 90-minute sessions held over five consecutive days in the first week of ESSLLI. There will be 2 or 3 slots for paper presentation and discussion per session. On the first day the workshop organizers will give an introduction to the topic. INVITED SPEAKERS: Balder ten Cate (University of Amsterdam, The Netherlands) Ian Hodkinson (Imperial College, UK) PROGRAM COMMITTEE: Carlos Areces (INRIA Lorraine, France) Patrick Blackburn (INRIA Lorraine, France) Thomas Bolander (Technical University of Denmark) - Co-Chair Torben Bra?ner (Roskilde University, Denmark) - Chair Mai Gehrke (New Mexico State University, USA) Valeria de Paiva (PARC, USA) J?rgen Villadsen (Technical University of Denmark) IMPORTANT DATES: Deadline for submissions: March 8, 2007 Notification of acceptance: April 21, 2007 Preliminary programme: April 24, 2007 ESSLLI early registration: May 1, 2007 Deadline for final versions: May 17, 2007 Final programme: June 21, 2007 Workshop dates: 6 - 10 August, 2007 LOCAL ARRANGEMENTS: All workshop participants including the presenters will be required to register for ESSLLI. The registration fee for authors presenting a paper will correspond to the early student/workshop speaker registration fee. Moreover, a number of additional fee waiver grants will be made available by the ESSLLI local organizing committee on a competitive basis and workshop participants are eligible to apply for those. There will be no reimbursement for travel costs and accommodation. Workshop speakers who have difficulty in finding funding should contact the local organizing committee to ask for the possibilities for a grant. FURTHER INFORMATION: About the workshop: http://hylomol.ruc.dk/HyLo2007 About ESSLLI: https://www.cs.tcd.ie/esslli2007 From debbabi at ciise.concordia.ca Fri Feb 9 12:35:57 2007 From: debbabi at ciise.concordia.ca (Pr. Dr. M. Debbabi) Date: Fri, 09 Feb 2007 12:35:57 -0500 Subject: [TYPES/announce] Post-Doctoral Research Fellow in IT Security at CS, Concordia University, Montreal, Canada Message-ID: <45CCB0FD.3020807@ciise.concordia.ca> I am pleased to announce the opening of the following position at the Computer Security Laboratory: Position title: Post-Doctoral Research Fellow Organization: Computer Security Laboratory (CSL) Concordia Institute for Information Systems Engineering (CIISE) Concordia University, Montreal, Canada The Computer Security Laboratory of the Concordia Institute for Information Systems Engineering (CIISE) invites applications for a one-year post-doctoral position in computer security renewable up to two times, starting as soon as possible and subject to performance reviews. Applicants must have a Ph.D. or equivalent in Computer Science, Software Engineering, Electrical Engineering, Computer Engineering or a related field at the time of appointment, as well as a significant record of productivity in one or several of the following research areas: ? Software security hardening ? Security of open source software ? Automatic detection of security vulnerabilities ? Security testing ? Aspect-oriented programming ? Static analysis ? Model-checking The principal responsibility of the Post-Doctoral Research Fellow will be to carry out research activities at the Computer Security Laboratory and more specifically: ? Perform research on the fields of security hardening, vulnerability detection, security testing and aspect-oriented programming. ? Preparation and presentation of research results in the form of journal and conference publications. ? Assist in the supervision of graduate students. ? Participate in the management of CSL research projects according to the tasks assigned. Applicants should submit a curriculum vitae and a sample of relevant publications by e-mail and arrange for three (3) letters of recommendation to be sent by e-mail to: Dr. Mourad Debbabi Computer Security Laboratory (CSL) Concordia Institute for Information Systems Engineering (CIISE) Concordia University 1455 de Maisonneuve Boulevard West, EV-7.627 Montreal, QC Canada H3G 1M8 E-mail: debbabi at ciise.concordia.ca The Computer Security Laboratory is a center for innovative research in information systems security. It is supervised by five faculty members and is funded by several granting agencies in Canada and Quebec as well as industrial corporations and governmental organizations. It hosts a critical mass of professors and Ph.D./M.Sc. students working on several IT security research themes such as security hardening, security assessment, network security, cyber forensics, cryptography, multimedia security, privacy, etc. The Concordia Institute for Information Systems Engineering is an interdisciplinary fundamental research and R&D learning institute, housing state-of-the-art research in innovative applications of information systems to a wide range of areas, among them telecommunications, software development, electronics, multimedia, aerospace, and building and construction management. The Concordia Institute for Information Systems Engineering offers only graduate programs in information systems security and quality systems engineering. Concordia is a large, urban university, in Montreal, Quebec, Canada. It values inter-disciplinary approaches to learning, and is dedicated to offering the best possible scholarship, research and training for the real world. Concordia is more than 180 undergraduate programs that are divided into four Faculties: Arts and Science, Engineering and Computer Science, Fine Arts, and the John Molson School of Business. In addition, the School of Graduate Studies offers more than 70 programs leading to Masters and doctoral degrees, as well as a variety of graduate diplomas and certificates for professionals seeking to upgrade their knowledge and skills. Kind regards, MD. -- ________________________________________________________________ Dr. Mourad Debbabi, CU Research Chair Tier 1 in Information Systems Security, Full Professor & CIISE Associate Director, Computer Security Laboratory, Concordia Institute for Information Systems Engineering (CIISE), Concordia University, 1515, Ste Catherine West, EV-7-627, Montreal, Quebec, H3G 2W1, Canada. Phone: (514) 848-2424 Ext: 3166 Fax: (514) 848-3171 E-Mail: debbabi at ciise.concordia.ca Web: http://www.ciise.concordia.ca/~debbabi ________________________________________________________________ From michael.norrish at nicta.com.au Sun Feb 11 19:22:59 2007 From: michael.norrish at nicta.com.au (Michael Norrish) Date: Mon, 12 Feb 2007 11:22:59 +1100 Subject: [TYPES/announce] Workshop on Mechanizing Metatheory Message-ID: <45CFB363.5020408@nicta.com.au> 2nd Informal ACM SIGPLAN Workshop on Mechanizing Metatheory Freiburg, Germany Sponsored by ACM SIGPLAN Co-located with ICFP'07. http://www.cis.upenn.edu/~sweirich/wmm/ Important Dates * Submission deadline: 18 June 2007 * Author Notification: 16 July 2007 * Workshop: 4 October 2007 Workshop Description Researchers in programming languages have long felt the need for tools to help formalize and check their work. With advances in language technology demanding deep understanding of ever larger and more complex languages, this need has become urgent. There are a number of automated proof assistants being developed within the theorem proving community that seem ready or nearly ready to be applied in this domain--yet, despite numerous individual efforts in this direction, the use of proof assistants in programming language research is still not commonplace: the available tools are confusingly diverse, difficult to learn, inadequately documented, and lacking in specific library facilities required for work in programming languages. The goal of this workshop is to bring together researchers who have experience using automated proof assistants for programming language metatheory, and those who are interested in using tool support for formalizing their work. One starting point for discussion will be the obstacles that hinder mechanisation (whether they be pragmatic or technical), and what users and developers can do to overcome them. Format The workshop will consist of presentations by the participants, selected from submitted abstracts. It will focus on providing a fruitful environment for interaction and presentation of ongoing work. Participants are invited to submit working notes, source files, and abstracts for distribution to the attendees, but as the workshop has no formal proceedings, contributions may still be submitted for publication elsewhere. (See the SIGPLAN republication policy for more details.) Scope The scope of the workshop includes, but is not limited to: * Tool demonstrations: proof assistants, logical frameworks, visualizers, etc. * Libraries for programming language metatheory. * Formalization techniques, especially with respect to binding issues. * Analysis and comparison of solutions to the POPLmark challenge. * Examples of formalized programming language metatheory. * Proposals for new challenge problems that benchmark programming language work. Submission Guidelines Email submissions to michael.norrish AT nicta.com.au. Submissions should be no longer than one page and in PDF (preferably) or Postscript that is interpretable by Ghostscript and printable on US Letter or A4 sized paper. Conference Organization Program Committee + Karl Crary, Carnegie Mellon University + Gerwin Klein, National ICT Australia + Michael Norrish, National ICT Australia (chair) + Randy Pollack, Edinburgh University + Steve Zdancewic, University of Pennsylvania Workshop Organizers + Benjamin Pierce, University of Pennsylvania + Stephanie Weirich, University of Pennsylvania Previous Workshops * Portland, 2006 (Colocated with ICFP) From dmitry.sustretov at loria.fr Mon Feb 12 09:14:19 2007 From: dmitry.sustretov at loria.fr (Dmitry Sustretov) Date: Mon, 12 Feb 2007 15:14:19 +0100 Subject: [TYPES/announce] ESSLLI Student Session deadline extended Message-ID: [Our apologies for multiple postings of this announcement.] -------------------------------------- DEADLINE EXTENDED TO February 18, 2007 -------------------------------------- ESSLLI 2007 STUDENT SESSION August 6-17 2007, Dublin, Ireland Extended deadline: February 18, 2007 http://www.loria.fr/~sustreto/stus07/ We are pleased to announce the Student Session of the 19th European Summer School in Logic, Language and Information, which will be held in Dublin, Ireland on August 6-17, 2007. We invite submission of papers in the areas of Logic, Language and Computation for presentation at the Student Session and for appearance in the proceedings. AIM Student Session exists to bring together young researchers to present and discuss their work in progress with a possibility to get feedback from senior researchers. SUBMISSION Only original publications are accepted, previous published works are not allowed. All authors of the paper must be students: undergraduate (before the completion of the Masters degree) or graduate (before the completion of the PhD degree). Papers can be submitted either for oral (20min talk+10 min discussion), or poster presentation. There are three subject areas: Logic and Language (lola), Language and Computation (laco) and Logic and Computation (loco). The submissions must be anonymous, void of direct references to the authors. The submissions should be sent by email before 18 February 2007 to dmitry.sustretov at loria.fr (the message should have subject "ESSLLI STUS submission") along with an identification file in plain text of the following format: Title: title of the submission First author: firstname lastname Affiliation: affiliation of the first author E-mail: e-mail of the first author ...... Last author: firstname lastname Affiliation: affiliation of the last author E-mail: e-mail of the last author Abstract: (5 lines) Subject area: Logic and Language or Language and Computation or Logic and Computation Modality: Poster or Oral The submission should be in one of the following formats: PostScript, PDF or RTF. (In case of acceptance, the final version of the paper will have to be submitted in LaTeX format.) The papers must use single column A4 size pages, 11pt or 12pt fonts, and standard margins, and may not exceed 7 pages of length exclusive of references. The paper and identification file should be named by the following convention: category-modality-last name(s) of author(s) (for example, "loco-oral-martin.pdf" and "loco-oral-martin.txt"). At least one of the authors of the paper must register as a participant of ESSLLI. Accepted papers will be published in the proceedings which will be available during ESSLLI. TIMELINE EXTENDED SUBMISSION DEADLINE: February 18, 2007 Notification of authors: April 20, 2007 Full paper deadline: May 20, 2007 ESSLLI: August 6-17, 2007 PROGRAM COMMITTEE Chairs: Ville Nurmi, University of Helsinki Dmitry Sustretov, LORIA Area experts: Paul Buitelaar (Language & Computation) Valentin Goranko (Logic & Computation) Carl Pollard (Logic & Language) Co-chairs: Logic & Computation Bryan Renne, City University of New York Levan Uridia, University of Amsterdam Language & Computation Luciana Benotti, INRIA Lorraine Michael Kaisser, University of Edinburgh Logic & Language Jana H?ussler, University of Konstanz Miltiadis Kokkonidis, University of Oxford CONTACT The Student Session webpage is the place for relevant information. http://www.loria.fr/~sustreto/stus07/ Feel free to contact the chairs for any questions about the submissions or the Student Session in general. Ville Nurmi Phone: +358 9 191 51497 Fax: +358 9 191 51400 E-mail: ville.v.nurmi at helsinki.fi Dmitry Sustretov Phone: +33 3 83 59 20 35 Fax: +33 3 83 41 30 79 E-mail: dmitry.sustretov at loria.fr From Oege.de.Moor at comlab.ox.ac.uk Mon Feb 12 11:22:10 2007 From: Oege.de.Moor at comlab.ox.ac.uk (Oege.de.Moor@comlab.ox.ac.uk) Date: Mon, 12 Feb 2007 16:22:10 GMT Subject: [TYPES/announce] Positions at Oxford: refactoring tools Message-ID: <200702121622.l1CGMAXf028765@mercury.comlab.ox.ac.uk> A non-text attachment was scrubbed... Name: not available Type: text Size: 4082 bytes Desc: not available Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070212/d24e0c59/attachment.txt From rene.david at univ-savoie.fr Tue Feb 13 02:00:09 2007 From: rene.david at univ-savoie.fr (=?ISO-8859-1?Q?Ren=E9_David?=) Date: Tue, 13 Feb 2007 08:00:09 +0100 Subject: [TYPES/announce] Profesor position in math and computer science Message-ID: <45D161F9.9020400@univ-savoie.fr> A full professor position will be available at the University of Chambery for the next academic year (starting on September 1, 2007). It is not yet published officially but this will be done soon. The deadline to apply will probably be around the end of march. - The teaching assignments are : computer science for scientific students from L1 to M2 (in the new european terminology). - The research will be done in the Logic group of the laboratory of maths (Lama). The Lama (www.lama.univ-savoie.fr) is an UMR (university and cnrs) with 24 permanents. The Logic group has 2 full Professor, 4 "Maitre de conferences" and 1 Cnrs. Its traditionnal domain of research is Logic with particular emphasis on the applications to theoretical computer science. We also are interested more generally in discrete maths. To get this position, it is necessary to - speak french fluently. - have been accepted on the so-called "liste de qualification". Note that, if you have not yet applied to this list, this is too late for this year. The position is really open. This means that there is no local candidate and, a priori, no specific domain (inside Logic, theoretical computer science, discrete maths) that will have an advantage on the others. Of course, the candidate will have to show that his integration on our group is possible. If you are interested (or simply if this is something that you consider as possible for you), please contact me as soon as possible. Ren? David Coordinator of the Logic Group ********************************** email : rene.david at univ-savoie.fr www.lama.univ-savoie.fr/~david From mwh at cs.umd.edu Tue Feb 13 09:52:58 2007 From: mwh at cs.umd.edu (Michael Hicks) Date: Tue, 13 Feb 2007 09:52:58 -0500 Subject: [TYPES/announce] PLAS 2007: 2nd call for papers (publication options changed) Message-ID: -- Note to types readers: we encourage submissions to PLAS that aim to provide measures of security using types; e.g., by type checking, type-based analysis, type-based specification, etc. The publication options have changed since the last announcement. ACM SIGPLAN Workshop on Programming Languages and Analysis for Security San Diego, California, June 14, 2007 Sponsored by ACM SIGPLAN with support from IBM Research Co-located with PLDI'07 as part of FCRC. http://www.cs.umd.edu/~mwh/PLAS07/index.html Submission Deadline: April 1, 2007 Call For Papers PLAS aims to provide a forum for exploring and evaluating ideas on the use of PROGRAMMING LANGUAGE and PROGRAM ANALYSIS TECHNIQUES to improve the SECURITY of SOFTWARE SYSTEMS. Strongly encouraged are proposals of new, speculative ideas; evaluations of new or known techniques in practical settings; and discussions of emerging threats and important problems. The scope of PLAS includes, but is not limited to: * Language-based techniques for security * Verification of security properties in software * Automated introduction and/or verification of security enforcement mechanisms * Program analysis techniques for discovering security vulnerabilities * Compiler-based security mechanisms, such as host-based intrusion detection and in-line reference monitors * Specifying and enforcing security policies for information flow and access control * Model-driven approaches to security * Applications, examples, and implementations of these security techniques Important Dates Submissions due: April 1, 2007 Notification of acceptance: May 1, 2007 Final version due: May 21, 2007 Workshop meeting: June 14, 2007 Submission Guidelines We invite papers of two kinds: (1) Technical papers for long presentations during the workshop, and (2) papers for short presentations (10 minutes). Papers submitted for the long format should contain relatively mature content. Short format papers can also contain mature work, but may present more preliminary work, position statements, or work that is more exploratory in nature. Long papers will appear in a formal proceedings. Short papers fall into two categories: formal short papers to appear in the proceedings, and informal short papers that will not; authors choose the category at the time of submission. The idea is to allow prospective participants to talk about less mature work that is not yet ready for formal publication. Papers to appear in the proceedings must describe work unpublished in refereed venues, and not submitted for publication elsewhere (including journals and formal proceedings of conferences and workshops). See the SIGPLAN republication policy for more details http://www.acm.org/sigs/sigplan/republicationpolicy.htm. The proceedings will be made available to the participants at the workshop, and its papers will be available in the ACM Digital Library. A CD containing the proceedings will made available to the participants after the meeting (due to publication time constraints due to affiliation with FCRC). Informal short presentations will have their abstracts included in the final proceedings, and may include previously-published material (which should be cited in the submission). Informal short presentations are not precluded for future publication at other conference venues or journals. Authors must indicate that they do not intend their paper to appear in the proceedings by prepending "Informal Presentation:" to the title of the submitted paper. Submitted papers must be formatted according the ACM proceedings format: long submissions should not exceed 12 pages in this format; short submissions should not exceed 6 pages. These page limits include everything (i.e., they are the total length of the paper). Papers submitted for the long category may be accepted as short presentations at the program committee's discretion. Submissions should be in PDF (preferably) or Postscript that is interpretable by Ghostscript and printable on US Letter and A4 sized paper. Templates for SIGPLAN-approved LaTeX format can be found at http://www.acm.org/sigs/sigplan/authorInformation.htm. We recommend using this format, which improves greatly on the ACM LaTeX format. Program Committee Michael Hicks, University of Maryland, College Park (Chair) Martin Abadi, Microsoft Research and University of California, Santa Cruz Steve Chong, Cornell University Adriana Compagnoni, Stevens Institute of Technology Jeff Foster, University of Maryland, College Park K. Rustan M. Leino, Microsoft Research, Redmond Marco Pistoia, IBM T. J. Watson Research Center Andrei Sabelfeld, Chalmers University of Technology Dawn Xiaodong Song, Carnegie-Mellon University Eijiro Sumii, Tohoku University Jan Vitek, Purdue University David Walker, Princeton University Xialolan (Catherine) Zhang, IBM T. J. Watson Research Center From dreyer at tti-c.org Tue Feb 13 10:04:22 2007 From: dreyer at tti-c.org (Derek Dreyer) Date: Tue, 13 Feb 2007 09:04:22 -0600 Subject: [TYPES/announce] The 2007 ACM SIGPLAN Workshop on ML Message-ID: <7fa251b70702130704h121d96e5taa98d3baae49ad58@mail.gmail.com> Below is the CFP for the 2007 Workshop on ML. Note that this year, we are introducing a new paper category of "work-in-progress reports". These are intended as a way of informing others in the ML community about the status of ML-related research or implementation projects, as well as communicating insights gained from such projects that do not quite constitute a full research paper. See the CFP below for details. Derek Dreyer The 2007 ACM SIGPLAN Workshop on ML Friday, October 5, 2007 Freiburg, Germany To be held in conjunction with ICFP '07 http://research.microsoft.com/~crusso/ml2007/ CALL FOR PAPERS GOALS OF THE WORKSHOP: The ML family of programming languages, whose most popular dialects are Standard ML and Objective Caml, has inspired a tremendous amount of computer science research, both practical and theoretical. ML continues to be employed successfully in applications ranging from compilers and theorem provers to low-level systems software, web applications and video games. The Workshop on ML aims to bring together researchers, developers and users of ML to hear about and discuss the latest work on the design, semantics, implementation and application of ML and ML-like languages. Previous ML workshops have been held in Orlando, Florida (1994), Baltimore, Maryland (1998), Tallinn, Estonia (2005), and Portland, Oregon (2006). The 2007 Workshop on ML will be held in conjunction with the 12th ACM SIGPLAN International Conference on Functional Programming (ICFP 2007) in Freiburg, Germany on Friday, October 5, 2007. SUBMISSION GUIDELINES: This year, we are seeking paper submissions of two varieties: *research papers* and *work-in-progress reports*. *Research papers* must present original research that has not been published elsewhere. We welcome research papers on any ML-related topic, including (but not limited to): * applications * concurrent programming * formal semantics * language design * language formalization and mechanization * language implementation * programming environments * type systems *Work-in-progress reports* need not present original research. Rather, they are intended as a way of informing others in the ML community about the status of ML-related research or implementation projects, as well as communicating insights gained from such projects that do not quite constitute a full research paper. As such, we expect that work-in-progress reports will be shorter than research papers, and we will not judge them to the same standard. If you have any questions regarding the appropriate paper category for a potential submission or its overall suitability for the workshop, please contact the program chair. All paper submissions must be at most 12 pages total length in the standard ACM SIGPLAN two-column conference format. Authors of work-in-progress report submissions should designate their papers as such by including the words "work in progress" or "status report" in the title. Submissions authored by program committee members are permitted, with the usual stipulation that they will be judged to a higher standard. Accepted papers will be published by the ACM and will appear in the ACM Digital Library. Details of the submission process will be provided at a time closer to the submission deadline. IMPORTANT DATES: Submission deadline: Friday, June 15, 2007 Notification of acceptance: TBA Final revision due: TBA Workshop: Friday, October 5, 2007 WORKSHOP ORGANIZER: * Claudio Russo (Microsoft Research, Cambridge) PROGRAM CHAIR: * Derek Dreyer (Toyota Technological Institute at Chicago) PROGRAM COMMITTEE: * Lars Birkedal (IT University of Copenhagen) * Derek Dreyer (Toyota Technological Institute at Chicago) * Jacques Garrigue (Nagoya University) * Luc Maranget (INRIA Rocquencourt) * Greg Morrisett (Harvard University) * Atsushi Ohori (Tohoku University) * Peter Sestoft (IT University of Copenhagen) * Peter Sewell (University of Cambridge) * Mark Shinwell (CodeSourcery UK Ltd) * Don Syme (Microsoft Research, Cambridge) From gerardo at ifi.uio.no Tue Feb 13 11:14:28 2007 From: gerardo at ifi.uio.no (Gerardo Schneider) Date: Tue, 13 Feb 2007 17:14:28 +0100 Subject: [TYPES/announce] 2 PhD positions in Formal Methods at University of Oslo In-Reply-To: <44758C4B.5050006@ifi.uio.no> References: <44758C4B.5050006@ifi.uio.no> Message-ID: <45D1E3E4.1090604@ifi.uio.no> With apologies for multiple postings. ===================================================== University of Oslo: 2 PhD Positions in Formal Methods ===================================================== The Formal Methods group at the Department of Informatics, University of Oslo, has available 2 PhD positions. * The position is available from July 1, 2007, or as soon as possible after this date. * The applicants should preferably have completed a Master's degree (or similar) by the starting date. * The candidate should preferably have a background in formal methods, concurrency and distributed systems, real-time systems, probabilistic systems, or hybrid systems. * Applications must be received no later than April 20, 2007. The position is within the research project RHYTM "High-Level Formal Modeling and Analysis of Real-Time and Hybrid Systems," funded by the Research Council of Norway. The objective of RHYTM is to further develop the Real-Time Maude tool. Real-Time Maude extends the rewriting logic-based Maude system to support the formal specification and analysis of real-time systems. It has been used on a set of state-of-the-art applications, including: wireless sensor network and scheduling algorithms, and various network communication and cryptographic protocols. In the RHYTM project, we aim at extending Real-Time Maude's modeling analysis capabilities, and to apply Real-Time Maude to further advanced applications. The project also focuses on extending Real-Time Maude to hybrid and probabilistic systems. More information about Real-Time Maude can be found on the web page http://www.ifi.uio.no/RealTimeMaude. Job description --------------- The candidates are expected to work on extending Real-Time Maude tool with new analysis capabilities, such as e.g., metric temporal logic model checking analysis for object-based systems, integrating appropriate decision procedures, and narrowing analyses. In addition, the tool should be extended to support formal specification and analysis of hybrid and probabilistic systems. Finally, the new features should be validated by applying the tool on advanced state-of-the-art applications. Each position is for 3 years, and should lead to a PhD thesis at the University of Oslo. There may be opportunities for research stays abroad. The research group for formal methods ------------------------------------- The Formal Methods group at the Department of Informatics, University of Oslo, Norway, is working on tools and languages for object-oriented and component-based software development. Our current research focus includes * formal specification and analysis of real-time systems * object-orientation and open distributed systems * rewriting logic * specification and verification of OO-programs Our research combines theoretical foundations with the goal to develop practical tools and languages to capture software adaptability. The group's activities include both theoretical, foundational, and experimental work within formal methods, semantics, and language design. For more information, see the following web-page: http://www.ifi.uio.no/forskning/grupper/pma/index_e.html Terms of employment ------------------- The salary and terms at the University of Oslo are in accordance with Norwegian state regulations. Salary at government pay scale 42-47 (NOK 316.000 - 344.300; currently EUR 39.000 - 44.400 and USD 50.500 - 55.000), depending on relevant work experience. Full salary during illness is paid. Holidays according to the state regulations. Further details --------------- For further information on the position, please contact Associate professor Peter ?lveczky, email peterol AT ifi.uio.no, Professor Olaf Owe, email olaf AT ifi.uio.no, or Researcher Gerardo Schneider, email gerardo AT ifi.uio.no How to apply ------------ Applications must include complete information about education at both bachelor and master level, and documented scientific experience. All employees must satisfy the entrance requirements for the doctoral degree programme at the Faculty of Mathematics and Natural Sciences. Women are especially encouraged to apply. To apply, please send a statement of your interest, together with curriculum vitae, at least two academic references (name, email, and phone no), and possibly a list of publications to University of Oslo, Faculty of Mathematics and Natural Sciences att. Grete Andresen PO Box 1032 Blindern, N-0315 Oslo, NORWAY REF 07/2243 no later than April 20, 2007. Make sure that your application specifically mentions "REF 07/2243" Applications may also be submitted electronically to grete.andresen at matnat.uio.no In addition, an electronic copy of the application should be sent to Peter ?lveczky at e-mail peterol AT ifi.uio.no. -- Gerardo Schneider - Dept. of Informatics, Univ. of Oslo P.O Box 1080 Blindern, N-0316 Oslo, Norway Phone: +47 22 85 29 71, fax: +47 22 85 24 01 http://folk.uio.no/gerardo/ From ili at info.fundp.ac.be Wed Feb 14 01:47:53 2007 From: ili at info.fundp.ac.be (Isabelle Linden) Date: Wed, 14 Feb 2007 07:47:53 +0100 Subject: [TYPES/announce] MTCoord 2007 CFP Message-ID: <45D2B099.5010603@info.fundp.ac.be> [ Our apologies for multiple copies. ] ====================================================================== 3rd International Workshop on Methods and Tools for Coordinating Concurrent, Distributed and Mobile Systems (MTCoord'07) June 4, 2007, Paphos, Cyprus Workshop affiliated to Coordination 07, June 5-8 2007 ====================================================================== SCOPE Various classes of computational models, languages, and formalisms have emerged in the aim of providing high-level descriptions of concurrent, distributed, and mobile systems. Typical examples include so-called coordination languages and models (e.g. Gamma, Linda, Manifold, Reo, Klaim, Lime, ...), concurrent constraint languages (e.g. cc languages, Mozart, ...) and process algebras (e.g. CSP, CCS, pi-calculus, ...). These models are based on generative communication via a shared data space or on data communication through channels. In both cases, software components are typically conceived in isolation assuming that the required data will eventually be available. However, making a whole system out of these components and, in particular, ensuring that interactions occur properly is far from being obvious. The aim of the workshop is precisely to bring together researchers, working in different communities (coordination, constraints, process algebras), on methods and tools for the construction of concurrent, distributed and mobile systems. This year, the workshop will focus on model checking techniques and compositional and refinement-based methodologies. TOPICS OF INTEREST Special topics of interest are o Model checking techniques, in particular techniques for verifying coordinating properties (including distributed and probabilistic ones) o Compositional and refinement-based methodologies However, related topics are also invited such as o Design of high-level specifications, eg based on first-order, modal and temporal logics o Techniques for requirements capture and analysis o Theorem proving based methodologies o Debugging techniques o Abstract interpretation o Program analysis and transformation o Simulation and testing o Formal methods for security o Tools environments and architectures o Applications and case studies, in particular in web services and biology SUBMISSION GUIDELINES Papers describing original work are solicited as contributions to MTCoord'07. All papers must be unpublished and not submitted simultaneously for publication elsewhere. Submitted papers should be limited to 15 pages, preferrably formatted according to the Electronical Notes in Theoretical Computer Science. They should be submitted through the conference management system that will be available from the workshop web site. http://www.info.fundp.ac.be/MTCoord/ PUBLICATION The papers accepted for the symposium will be available at the workshop. Selected work will be published in a volume of the Electronical Notes in Theoretical Computer Science. IMPORTANT DATES o March 23, 2007: Abstract submission deadline. o March 30, 2007: Paper Submission deadline. o April 28, 2007: Notification of acceptance. o May 11, 2007 : Final version. o June 4, 2007 : Meeting Date. LOCATION The MTCoord'07 workshop will be held in Paphos, Cyprus in June 4 2007. It is a satellite workshop of Coordination'07. For venue and registration, see the DisCoTec'07 web page at http://www.discotec07.cs.ucy.ac.cy/index.htm WORKSHOP ORGANIZERS o Carolyn Talcott, SRI International, USA o Isabelle Linden, University of Namur, Belgium PROGRAMME COMITTEE o Marco Bernardo, Universit? degli Studi di Urbino "Carlo Bo", Urbino, Italy o Christel Baier, Technical University Dresden, Germany o Lubos Brim, Masaryk University, Czech Republic o Giorgio Delzanno, University of Genova, Italy o Wan Fokkink, CWI, The Netherlands o Jean-Marie Jacquet, University of Namur, Belgium o Gerald Luettgen, University of York, United Kingdom o Angelika Mader, University of Twente, The Netherlands o Kaisa Sere, Abo Akademi University, Finland -- --------------- Isabelle Linden, Teaching Coordinator Computer Science Dpt - University of Namur 21, rue Grandgagnage, B-5000 Namur - Belgium Tel : +32 (0)81 72 49 87 Fax : +32 (0)81 72 49 67 www.info.fundp.ac.be/~ili/ ---------------- From andrei at cs.chalmers.se Wed Feb 14 17:02:12 2007 From: andrei at cs.chalmers.se (Andrei Sabelfeld) Date: Wed, 14 Feb 2007 23:02:12 +0100 Subject: [TYPES/announce] MMM-ACNS-07 CFP Message-ID: <45D386E4.2060701@cs.chalmers.se> [Type-based security submissions are very welcome.] Call for Papers International Conference "Mathematical Methods, Models and Architectures for Computer Networks Security" (MMM-ACNS-07) September 13-15, 2007, St. Petersburg, Russia http://www.comsec.spb.ru/mmm-acns07/ Sponsors: 1. Office of Naval Research Global, USA 2. European Office of Aerospace Research and Development USAF, USA 3. Russian Foundation for Basic Research Organizers: * St. Petersburg Institute for Informatics and Automation of the Russian Academy of Sciences (SPIIRAS) * St. Petersburg Scientific Center of the Russian Academy of Sciences * Binghamton University (State University of New York) Title and scope: The First, Second and Third International Workshops "Mathematical Methods, Models and Architectures for Computer Networks Security" (MMM-ACNS-2001 (http://space.iias.spb.su/mmm2001/main.jsp), MMM-ACNS-2003 (http://space.iias.spb.su/mmm-acns03/index.jsp) and MMM-ACNS-2005 (http://space.iias.spb.su/mmm-acns05/index.jsp)) organized in 2001, 2003 and 2005 respectively by St. Petersburg Institute for Informatics and Automation, Binghamton University (SUNY) and supported by the European Office of Aerospace Research and Development USAF, Office of Naval Research Global, and Russian Foundation for Basic Research were very successful. These workshops demonstrated the high interest of the international scientific community to the theoretical aspects of the computer network and information security and the need for conducting of such workshops as on-going series. The proposed MMM-ACNS-2007 Conference is intended as a next step in this series and will be focused on theoretical problems in the area under consideration. Its objectives are to bring together leading researchers from academia and governmental organizations as well as practitioners in the area of computer networks and information security, facilitating personal interactions and discussions on various aspects of information technologies in conjunction with computer network and information security problems arising in large-scale computer networks engaged in information storing, transmitting, and processing. Topics of interest: Papers offering novel research contributions to the theoretical aspects of the computer network and information security are solicited for submission. Papers may present theory, technique, and applications on topics including but not restricted to: * Adaptive security * Authentication, Authorization and Access Control * Computer and network forensics * Covert channels * Data and application security * Data mining, machine learning, and bio-inspired approaches for security * Deception systems and honeypots * Denial-of-service attacks and countermeasures * Digital Rights Management * eCommerce, eBusiness and eGovernment Security * Firewall Technologies * Formal analysis of security properties * Information warfare * Internet and web security * Intrusion detection and prevention * Language-based security * Network survivability * New ideas and paradigms for security * Operating system security * Risk analysis and risk management * Security and Privacy in Pervasive and Ubiquitous Computing * Security for Grid Computing * Security of emerging technologies (sensor, wireless/mobile, peer-to-peer and overlay networks) * Security of autonomous agents and multi-agent systems * Security modeling and simulation * Security policies * Security protocols * Security verification * Software protection * Trust management * Viruses, worms, and other malicious code * Vulnerability assessment Submitting a paper The conference welcomes original papers from academic, government, and industry contributors on mathematical approaches and models, state-of-the-art techniques, and novel applications in the above proposed areas. All submissions will be subjected to a thorough review by at least three reviewers. Draft versions of original full papers up to 12 A4 pages in English using at least 11-point fonts with reasonable margins, including abstract (up to 300 words) and keywords (5 to 8), should be submitted by March 28, 2007 or sooner through the upload facilities at the Conference web site http://www.comsec.spb.ru/mmm-acns07/ . Only electronic submissions in PDF format will be considered. Authors must also indicate the conference track to which the paper is submitted. The Program Committee will make the final selection based on peer reviewers? evaluation. The primary focus is on high-quality original unpublished research, case studies and implementation experiences. Notification of acceptance/rejection will be disseminated by May 10, 2007. Camera-ready versions of accepted papers (see below) are due May 30, 2007. Proceedings Program Committee plans to publish the Conference Proceeding in Springer series "Lecture Notes in Computer Science" (LNCS). Instructions for authors will be provided at the MMM-ACNS-2007 web site (http://www.comsec.spb.ru/mmm-acns07/). Camera ready paper submission can be uploaded through the Conference web site at http://www.comsec.spb.ru/mmm-acns07/. Conference Languages The working language is English. Dates of meeting: Inclusive dates of MMM-ACNS-2007: September 12-16, 2007 (arrival and registration - on September 12, technical program - on September 13-15, departure - on September 16) Important dates For submission: Paper drafts: March 28, 2007 Acceptance/rejection notification: May 10, 2007 Camera ready papers: May 30, 2007 For registration: Early registration deadline: August 10, 2007 On site registration: September 12-15, 2007 Hotel reservation request: August 10, 2007 All materials concerning MMM-ACNS-2007 preparation, program, and other arrangements will be posted on a regularly updated web site http://www.comsec.spb.ru/mmm-acns07/. Conference Co-Chairmen Corresponding Member of the Russian Academy of Sciences, Prof. R.M. Yusupov, Director of the St. Petersburg Institute for Informatics and Automation of the Russian Academy of Sciences (SPIIRAS) Phone: 7-(812) 328-33-11 Fax: 7-(812) 328-44-50 E-mail: spiiran at mail.iias.spb.su Dr. Robert L. Herklotz, Program Manager: Software and Systems US Air Force Office of Scientific Research Phone: +1-(703) 696-6565, Fax: +1-(703) 696-8450 E-mail: robert.herklotz at afosr.af.mil Local contact person Irina Podnozova Phone 7-(812)-328-44-46 Fax: +7(812)-328-06-85 E-mail ipp at mail.iias.spb.su Local Organizing Committee Chairman R.M. Yusupov, Director of the St. Petersburg Institute for Informatics and Automation (SPIIRAS) Organizing Committee members: A.Tkatch (SPIIRAS, St. Petersburg, Vice Chairman) D.Bakuradze (SPIIRAS, St. Petersburg) V.Bogdanov (SPIIRAS, St. Petersburg) O.Chervatuk (SPIIRAS, St. Petersburg) V.Desnitsky (SPIIRAS, St. Petersburg) O.Karsaev (SPIIRAS, St. Petersburg) V.Konushy (SPIIRAS, St. Petersburg) E.Mankov (SPIIRAS, St. Petersburg) I.Podnozova (SPIIRAS, St. Petersburg) V.Samoilov (SPIIRAS, St. Petersburg) E.Sidelnikova (SPIIRAS, St. Petersburg) A.Tishkov (SPIIRAS, St. Petersburg) A.Ulanov (SPIIRAS, St. Petersburg) V.Vorontsov (SPIIRAS, St. Petersburg) Program Committee Co-Chairmen: Vladimir Gorodetsky (Russia) Igor Kotenko (Russia) Victor Skormin (USA) Program Committee members: Julien Bourgeois (France) David Chadwick (UK) Shiu-Kai Chin (USA) Howard Chivers (UK) Christian Collberg (USA) Dipankar Dasgupta (USA) Naranker Dulay (UK) Dieter Gollmann (Germany) Dimitris Gritzalis (Greece) Stefanos Gritzalis (Greece) Alexander Grusho (Russia) Ming-Yuh Huang (USA) Sushil Jajodia (USA) Angelos Keromytis (USA) Victor Korneev (Russia) Klaus-Peter Kossakowski (Germany) Christopher Kruegel (Austria) Antonio Lioy (Italy) Javier Lopez (Spain) Fabio Martinelli (Italy) Catherine Meadows (USA) Nasir Memon (USA) Ann Miller (USA) Nickolay Moldovian (Russia) Wojciech Molisz (Poland) David Nicol (USA) Yoram Ofek (Italy) Monika Oit (Estonia) Udo Prayer (Austria) Bart Preneel (Belgium) Roland Rieke (Germany) Andrei Sabelfeld (Sweden) Ravi Sandhu (USA) Anatol Slisenko (France) Igor Sokolov (Russia) Antonio Gomez Skarmeta (Spain) Michael Smirnov (Germany) Duglas Summerville (USA) Shambhu Upadhyaya (USA) Vijay Varadharajaran (Australia) Alfonso Valdes (USA) Valery Vasenin (Russia) Paulo Verissimo (Portugal) Diego Zamboni (Switzerland) Peter Zegzhda (Russia) Location of the Meeting, Accommodation, Cultural Program According to the preliminary agreement, the MMM-ACNS-07 Conference will take place in the historical building "Palace of Grand Prince Vladimir Romanov," now "House of Scientists," located in the heart of St. Petersburg, address: 26, Dvortsovaya emb., St. Petersburg, 191186, Russia. This venue allows the conference organizers to arrange for the Conference itself, as well as for the associated events (informal discussions, reception, breaks, etc.) All participants are expected to arrive to St. Petersburg directly. Conference organizers intend to arrange for transportation upon arrival and departure and to/from Conference venue/other hotel upon a separate request of participants. The following assistance in housing could be provided by local organizers. We intend to engage a Destination Management Company "Monomax" to assist participants in housing and cultural programs (http://monomax.ru/langeng). It is possible to make reservations at reasonable prices in hotels in the St. Petersburg downtown area from $120 per night (single room), and from $130 per night (double room). Also, reservations in better and more expensive hotels at $150 - $600 per night are available (hotels like Astoria, Europe, Radisson SAS, etc.). For students, the hostel from about $50 may be organized on special request. Visa Issues To come to Russia, all foreign participants will need an entering visa. As a host institution SPIIRAS will handle this issue through a formal invitation letter to every participant. To issue such a letter, we shall need the following details to include in the above letter for every individual: first name, middle name, surname, date of birth, citizenship, passport No., expiration date (as appear in a valid passport) and the city where the visa is applied in. In addition, each individual has to fax copy of the first page of his/her passport at +7(812)328-06-85 containing personal data and dates of the passport number and expiry date. Note that about one month is required only to arrange formal invitation in St. Petersburg. Time for invitation mailing to the addressee and for getting visa at local consulate has to be added to calculate the deadline to be met for receiving request for invitation letter by organizers. Contact us Program Committee Co-Chairman Prof. Igor Kotenko (MMM-ACNS-2007 PC Co-chairman) Head of Computer Security Research Group St. Petersburg Institute for Informatics and Automation of the Russian Academy of Sciences 39, 14th Liniya, St. Petersburg, 199178, Russia Telephone: +7-(812)-328-2642 Fax: +7-(812)-328-4450 E-mail: mmmacns at comsec.spb.ru Local contact person Irina Podnozova Phone: 7-(812)-328-4446 Fax: +7(812)-328-06-85 E-mail: ipp at mail.iias.spb.su From berghofe at in.tum.de Thu Feb 15 10:49:17 2007 From: berghofe at in.tum.de (Stefan Berghofer) Date: Thu, 15 Feb 2007 16:49:17 +0100 Subject: [TYPES/announce] Marktoberdorf Summer School 2007 on Formal Logical Methods for System Security and Correctness Message-ID: <45D480FD.9040701@in.tum.de> The 28th Marktoberdorf Summer School 2007 is ready for application up to now and at the latest until February, 28 2007. The "Marktoberdorf Summer School" is a two weeks' course for young computer scientists and mathematicians working in the field of formal software and systems development. The course aims at the dissemination of advanced scientific knowledge and the promotion of international contacts among scientists. Further information with lecturer's topics and the application form can be found under the web-page http://asimod.in.tum.de/ The Summer School topic will be Formal Logical Methods for System Security and Correctness The objective of the Summer School is to present the state of the art in the field of proof technology. The lecturers will show that methods of correct-by-construction program and synthesis allow a high level programming method more amenable to security and reliability analysis and guarantees. By (1) providing the necessary theoretical background and (2) presenting corresponding application oriented concepts, the objective is an in-depth presentation of such methods covering both theoretical foundations and industrial practice based on the promise of creating a secure-by-construction programming methodology. We assembled leading researchers in computer science and applied logics who have made significant advances in creating a formal logical basis for system security. Lecturers are Gilles Barthe Orna Grumberg Martin Hyland Tobias Nipkow Bob Constable John Harrison John Mitchell Helmut Schwichtenberg Javier Esparza Martin Hofmann Greg Morrisett Stan Wainer Especially invited to apply for participation are young researchers from countries like Albania, Algeria, Armenia, Azerbaijan, Belarus, Bulgaria, Croatia, Egypt, Georgia, Israel, Jordan, Kazakhstan, Kyrghyz Republi, Marocco, Mauritania, Moldova, Romania, Russian Federation, Tajikistan, the former Yugoslav Republic of Macedonia, Tunisia, Turkmenistan, Ukraine, Uzbekistan. -- Dr. Katharina Spies ** executive secretary -- Summer School Marktoberdorf ** asimod at in.tum.de | http://asimod.in.tum.de Technische Universitaet Muenchen Fakultaet fuer Informatik Tel.: ++49/89/289-17829 Boltzmannstr. 3 Fax: ++49/89/289-17307 D-85748 Garching (Muenchen) / Germany From bernhard at sussex.ac.uk Thu Feb 15 12:06:04 2007 From: bernhard at sussex.ac.uk (Bernhard Reus) Date: Thu, 15 Feb 2007 17:06:04 +0000 Subject: [TYPES/announce] Lectureship in Foundations at Sussex Message-ID: The Department of Informatics at the University of Sussex is seeking to appoint a Lecturer in Software Systems or _Foundations_ . Closing date is March 5th. Note that this post is for Software Systems OR Foundations, so strong candidates with interests in Type Theory, Program Logics or/and Semantics are very welcome to apply. More info at http://www.sussex.ac.uk/Units/staffing/personnl/vacs/ vac667_668.shtml . Best, Bernhard From moggi at disi.unige.it Fri Feb 16 11:25:50 2007 From: moggi at disi.unige.it (moggi@disi.unige.it) Date: Fri, 16 Feb 2007 17:25:50 +0100 (CET) Subject: [TYPES/announce] ICTCS'07 - call for papers Message-ID: <20070216162550.0244D406BC@mailstore.csita.unige.it> The 10th Italian Conference on Theoretical Computer Science (ICTCS'07) Rome, Italy, October 3-6, 2007 http://www.disp.uniroma2.it/ictcs07/ Preliminary Call for Papers The 10th Italian Conference on Theoretical Computer Science (ICTCS'07) will be held in Rome, Italy. Papers presenting original contributions in any area of theoretical computer science are being sought. Typical but not exclusive topics of interest include: Algebraic and categorical models; Algorithmic aspects of networks; Algorithmic game theory; Algorithms and data structures; Computability; Computational complexity; Computational biology; Computational geometry; Cryptography and security; Databases, semi-structured data and finite model theory; Emerging and non-standard models of compoutation; Experimental analysis of algorithms; formal languages and automata theory; Internet algorithmics; Logics, formal methods and model checking; Models of concurrent, distributed and mobile systems; Models of reactive, hybrid and stochastic systems; Parallel, distributed and external memory computing; Principles of programming languages; Program analysis and transformation; Quantum computing; Specification, refinement and verification Type systems and theory, typed calculi. Important Dates: Submission Deadline: 15 April 2007 Notification of Acceptance: 31 May 2007 Conference: 3-6 October 2007 Conference Web Page: http://www.disp.uniroma2.it/ictcs07/ Submissions: Authors should submit an extended abstract electronically, following the guidelines available on the ICTCS Web Page. The extended abstract should start with a title page consisting of the title of the paper; each author's name, affiliation, and email address; and a brief summary of the results to be presented. This should then be followed by a technical exposition of the main ideas and techniques used to achieve the results, including motivation and a clear comparison with related work. The full extended abstract should not exceed 12 single-spaced pages. If more details are needed to substantiate the main claims of the paper, the submission may include a clearly marked appendix that will be read at the discretion of the program committee. Submissions deviating significantly from these guidelines risk rejection without consideration of their merits. The proceedings of the conference will be published by World Scientific, and will be available for distribution at the conference. Program Committee: Marcella Anselmo (Salerno Univ., Italy), Alberto Bertoni (Milano Univ., Italy), Roberto Bruni (Pisa Univ., Italy), Nadia Busi (Bologna Univ., Italy) Ferruccio Damiani (Torino Univ., Italy), Paola Inverardi (L'Aquila Univ., Italy), Giuseppe F. Italiano (Roma "Tor Vergata" Univ., Italy, Co-Chair), Irit Katriel (Brown Univ., USA), Giovanni Manzini (Univ. Piemonte Orientale, Italy), Alberto Marchetti-Spaccamela (Roma "La Sapienza" Univ., Italy), Dimitrios Michail (MPI Saarbruecken, Germany), Eugenio Moggi (Genova Univ., Italy, Co-Chair), Alberto Momigliano (Edinburgh Univ., UK), Piotr Sankowski (Warsaw Univ., Poland), Roberto Segala (Verona Univ., Italy), Francesca Toni (Imperial College London, UK). Organizing Committee: Fabio Dellutri (Roma "Tor Vergata" Univ.), Luigi Laura (Roma "La Sapienza" Univ.), Michela Loja (Roma "Tor Vergata" Univ.), Maurizio Saltali (Roma "Tor Vergata" Univ.). From pschust at mathematik.uni-muenchen.de Fri Feb 16 13:48:29 2007 From: pschust at mathematik.uni-muenchen.de (Peter Schuster) Date: Fri, 16 Feb 2007 19:48:29 +0100 (CET) Subject: [TYPES/announce] [3WFTop]: Third Workshop on Formal Topology, Second Announcement Message-ID: 3WFTop Second Announcement THIRD WORKSHOP ON FORMAL TOPOLOGY (3WFTop) Padua (Italy) 7-8 May 2007 tutorials (Dept. of Math.) 9-12 May 2007 workshop (Accademia Galileiana) 13 May 2007 social excursion (for those who stay) See the web site http://www.3wftop.math.unipd.it/ for news on: - submission of papers (deadline March 15) - registration (early registration before March 31; note that there are some grants for students and young researchers) - program (preliminary version) - accommodation - social program (see also a photographic tour of Padua) A copy of the the first announcement follows: This is the third of a series of successful meetings on the development of Formal Topology and its connections with related approaches. The first two have been held in Padua, 1997, and Venice, 2002. For more information on 3WFTop see http://www.3wftop.math.unipd.it/ What is formal topology When topology is developed in a strictly constructive way, for instance over Martin-Loef's type theory, points cannot be given primitively and the pointfree approach is fundamental. This is the reason why it is called formal. Formal topology has now become an important tool in constructive mathematics. More on formal topology: http://www.3wftop.math.unipd.it/formal-topology.html Invited speakers Invited speakers include Andre' Joyal, Per Martin-Loef and many other prominent scholars: http://www.3wftop.math.unipd.it/invited-speakers.html Tutorials Before the workshop, two days of extensive and coordinated tutorials are planned, given by Bernhard Banaschewski and other pioneers: http://www.3wftop.math.unipd.it/tutorials.html Contacts If you wish to be kept updated with information about 3WFTop, please send an e-mail to: fortop at math.lmu.de with KEEP ME UPDATED in the subject. The Scientific Committee Thierry Coquand Giovanni Sambin Peter Schuster From maribel.fernandez at kcl.ac.uk Sat Feb 17 05:20:12 2007 From: maribel.fernandez at kcl.ac.uk (Maribel Fernandez) Date: Sat, 17 Feb 2007 10:20:12 +0000 Subject: [TYPES/announce] Call for Papers SecReT 2007 Message-ID: <45D6D6DC.4080509@kcl.ac.uk> SecReT 2007 2nd International Workshop on Security and Rewriting Techniques http://www.rdp07.org/secret.html June 29, 2007 Paris, France A satellite event of RDP 2007 ====================================================================== TOPICS OF INTEREST The aim of this workshop is to bring together rewriting researchers and security experts, in order to foster their interaction and develop future collaborations in this area, to provide a forum for presenting new ideas and work in progress, and to enable newcomers to learn about current activities in this area. The workshop focuses on the use of rewriting techniques in all aspects of security. Specific topics include: authentication, encryption, access control and authorization, protocol verification, specification of policies, intrusion detection, integrity of information, control of information leakage, control of distributed and mobile code, etc. IMPORTANT DATES * Submissions: Monday, April 23 * Notification: Monday, May 21 * Final version due: Friday, June 8 SUBMISSION GUIDELINES Authors are invited to submit a paper (max. 10 pages) in PDF/PostScript format by e-mail by April 23, 2007. Instructions will be published on the workshop webpage http://www.rdp07.org/secret.html Preliminary proceedings will be available at the workshop. After the workshop authors will be invited to submit a full paper of their presentation. We plan to publish the accepted contributions in DMTCS. INVITED SPEAKER * Thomas Genet (Rennes, France) PROGRAM COMMITTEE * V?ronique Cortier (Nancy, France) * Maribel Fern?ndez (London, UK) * Paliath Narendran (Albany, NY, USA) * Monica Nesi (L'Aquila, Italy), co-chair * Tobias Nipkow (M?nchen, Germany) * Hitoshi Ohsaki (Osaka, Japan) * Graham Steel (Edinburgh, UK) * Mark-Oliver Stehr (Stanford, CA, USA) * Ralf Treinen (Cachan, France), co-chair * Luca Vigan? (Verona, Italy) From aserebre at win.tue.nl Mon Feb 19 14:56:49 2007 From: aserebre at win.tue.nl (A Serebrenik) Date: Mon, 19 Feb 2007 20:56:49 +0100 (CET) Subject: [TYPES/announce] Call for papers - Workshop on Termination (WST 2007) - Paris Message-ID: Call for Papers Ninth International Workshop on Termination (WST 2007) Paris, France, June 29, 2007 Affiliated with RDP 2007 Termination is a fundamental topic in computer science. Though termination of processes is often a strict requirement, it may be hard to establish. Classical results state the undecidability of various termination problems, so research focuses on automated methods that prove termination or non-termination in practical cases. The topic is challenging both in theory (mathematical logic, proof theory) and practice (software development, formal methods), and many interesting ramifications are yet to be explored. The 9th International Workshop on Termination will delve into all aspects of termination. It will continue the sequence of successful workshops held in St. Andrews (1993), La Bresse (1995), Ede (1997), Dagstuhl (1999), Utrecht (2001), Valencia (2003), Aachen (2004), and Seattle (2006). We hope to attain the same friendly atmosphere as those past workshops. The intent is to bring together, in an informal setting, researchers interested in various aspects of termination, whether this interest be practical or theoretical, primary or derived. The workshop is hoped to provide a ground for cross-fertilisation of ideas from term rewriting and from programming. Contributions from the imperative, object-oriented, constraint, functional, and logic programming communities, and papers investigating new applications of termination are particularly welcome. Paper Submissions: Extended abstracts in the prescribed format, not exceeding 4 pages, should be submitted electronically through EasyChair's WST 2007 submission site http://www.easychair.org/WST2007/. A common workshop style file will be made available on the WST'2007 web site. Papers should be submitted in PostScript or PDF format. We expect proceedings to be made available through the Computing Research Repository, CoRR. The Termination Competition: The competition will run again in 2007, and entries are strongly encouraged. Detailed instructions for submission of problems and programs will be made available at the competition website http://www.lri.fr/~marche/termination-competition/2007/ Program Committee Nachum Dershowitz (Tel Aviv, Israel) Daniel De Schreye (Leuven, Belgium) Samir Genaim (Madrid, Spain) Juergen Giesl (Aachen, Germany) Isabelle Gnaedig (Nancy, France) Dieter Hofbauer (Kassel, Germany), co-chair Aart Middeldorp (Innsbruck, Austria) Etienne Payet (La Reunion, France) Alexander Serebrenik (Eindhoven, The Netherlands), co-chair Termination Competition Committee Claude Marche (Paris, France) Johannes Waldmann (Leipzig, Germany) Hans Zantema (Eindhoven, The Netherlands) Workshop Themes (non-exhaustive list) Termination of programs Termination of rewriting Normalization of lambda calculi Implementation of termination methods Challenging termination problems and proofs Application of termination methods, e.g. to program transformation and compilation Comparison and classification of termination methods Non-termination detection Termination methods for theorem provers Termination in distributed systems Termination proof methods for liveness and fairness Derivational complexity Well-quasi-orderings and ordinal notations Important Dates: Deadline for electronic submission of papers : April 8, 2007 Notification of acceptance : May 6, 2007 Deadline for final versions : May 27, 2007 Competition Deadlines: Submission of public problems : May 1, 2007 Registration of termination tools : May 21, 2007 Submission of secret problems : June 1, 2007 Submission of termination tools : June 1, 2007 Start of competition : June 4, 2007 Workshop Venue and Related Events: WST 2007 is part of the Federated Conference on Rewriting, Deduction, and Programming 2007. Co-located events include RTA'07, HOR'07, PATE'07, RULE'07, SecReT'07, UNIF'07, WFLP'07, and WRS'07. These colloquia will run from June 25 to June 29, 2007, in Paris (France). For details see the RDP website at http://www.rdp07.org/. Web Sites WST 2007: http://www.rdp07.org/wst.html Termination Competition: http://www.lri.fr/~marche/termination-competition/2007/ RDP 2007: http://www.rdp07.org/ From fairouz at macs.hw.ac.uk Mon Feb 19 18:18:52 2007 From: fairouz at macs.hw.ac.uk (Fairouz Kamareddine) Date: Mon, 19 Feb 2007 23:18:52 +0000 (GMT) Subject: [TYPES/announce] MKM 2007 paper submission deadline approaching Message-ID: MKM 2007 Sixth International Conference on MATHEMATICAL KNOWLEDGE MANAGEMENT http://www.cs.bham.ac.uk/~mmk/events/MKM07/ 27--30 June 2007 RISC -- Hagenberg -- Austria FINAL CALL FOR PAPERS Mathematical Knowledge Management is an innovative field in the intersection of mathematics and computer science. Its development is driven on the one hand by the new technological possibilities which computer science, the internet, and intelligent knowledge processing offer, and on the other hand by the need for new techniques for managing the rapidly growing volume of mathematical knowledge. The conference is concerned with all aspects of mathematical knowledge management. A (non-exclusive) list of important areas of current interest includes: Representation of mathematical knowledge Repositories of formalized mathematics Diagrammatic representations Mathematical search and retrieval Deduction systems Math assistants, tutoring and assessment systems Mathematical OCR Inference of semantics for semi-formalized mathematics Digital libraries Authoring languages and tools MathML, OpenMath, and other mathematical content standards Web presentation of mathematics Data mining, discovery, theory exploration Computer Algebra Systems Collaboration tools for mathematics INVITED SPEAKERS * Neil J. A. Sloane, AT&T Shannon Labs, Florham Park, New Jersey, USA: The On-Line Encyclopedia of Integer Sequences * Peter Murray-Rust, University of Cambridge, Department of Chemistry, Cambridge, UK: TBA The programme will be arranged that all attendees of MKM can also attend the talks by the invited speakers of Calculemus: * Thomas Hales, University of Pittsburgh * John Harrison, Intel Inc. * Peter Paule, RISC-Linz SUBMISSION The deadline for submissions of titles and abstracts is 1 March 2007, for that of full papers is 4 March 2007. [Deadline extended!] Submitted papers should not exceed 15 pages, must be original and not submitted for publication. Submission is via EasyChair. All papers submitted to the Conference will be reviewed. For submission details see http://www.cs.bham.ac.uk/~mmk/events/MKM07/submission.php. PROCEEDINGS We we will publish the proceedings in the Springer-Verlag series Lecture Notes in Artificial Intelligence (LNAI). Authors of accepted papers are expected to present their work at the conference. IMPORTANT DATES (note the extended deadline) 1 March 2007: Deadline for electronic submissions of title and abstract 4 March 2007: Deadline for electronic submissions of full papers 2 April 2007: Notification of acceptance/rejection 13 April 2007: Camera ready copies due 27-30 June 2007: Conference at RISC, Hagenberg, Austria CONFERENCE CHAIR Wolfgang Windsteiger PROGRAMME CO-CHAIRS Manfred Kerber Robert Miner LOCAL ORGANIZER Laura Kovacs PROGRAM COMMITTEE: Andrea Asperti University of Bologna, Italy Laurent Bernardin Maplesoft, Canada Jonathan Borwein Dalhousie University, Canada Thierry Bouche Universite de Grenoble I, France Bruno Buchberger Johannes Kepler University, Linz, Austria Paul Cairns University College London, England Olga Caprotti University of Helsinki, Finland Bruce Char Drexel University, Philadelphia, USA Simon Colton Imperial College, London, England Mike Dewar Numerical Algorithms Group, England William Farmer McMaster University, Canada Herman Geuvers Radboud University Nijmegen, The Netherlands Tetsuo Ida University of Tsukuba, Japan Mateja Jamnik University of Cambridge, England Fairouz Kamareddine Heriot-Watt University, Scotland Manfred Kerber University of Birmingham, England (co-chair) Michael Kohlhase International University Bremen, Germany Paul Libbrecht DFKI Saarbruecken, Germany Robert Miner Design Science, USA (co-chair) Bengt Nordstrom Chalmers University of Technology, Sweden Ross Reedstrom Rice University, USA Eugenio Rocha Universidade de Aveiro, Portugal Alan Sexton University of Birmingham, England Andrzej Trybulec University of Bialystok, Poland Stephen Watt University Western Ontario, Canada Abdou Youssef George Washington University, USA RELATED LINKS http://www.mkm-ig.org http://www.risc.uni-linz.ac.at/about/conferences/Calculemus2007/ WORKSHOPS The Mathematical User-Interfaces Workshop 2007 (MathUI07) takes place in conjunction with MKM 2007. For details see: http://www.activemath.org/~paul/MathUI07/ Further workshops are in discussion. If you want to organize one, contact the co-chairs at mkm07 at cs.bham.ac.uk as soon as possible. -------------------------------------------------------------------------------- From Alessandro.Facchini at unil.ch Tue Feb 20 09:59:29 2007 From: Alessandro.Facchini at unil.ch (Alessandro Facchini) Date: Tue, 20 Feb 2007 15:59:29 +0100 Subject: [TYPES/announce] CSL07 (11-15 September, 2007, Lausanne): Call for papers Message-ID: <45db0cd1.12c.39a4.1477033674@unil.ch> ********* Call for Papers ************** CSL 07 11-15 September, 2007 Lausanne (CH) Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL). The conference is intended for computer scientists whose research activities involve logic, as well as for logicians working on issues significant for computer science. CSL'07, the 16th annual EACSL conference will be organized in Lausanne by the Western Swiss Center for Logic, History and Philosophy of Sciences, and the University of Lausanne. The Ackermann Award for 2007 is sponsored by Logitech and will be presented to the recipients at CSL'07. A joint session with GAMES 07, the annual meeting of the European Network will take place on 11 September, 2007. http://www.unil.ch/csl07/ Topics of interest include: - automated deduction and interactive theorem proving, - constructive mathematics and type theory, - equational logic and term rewriting, - automata and games, - modal and temporal logics, - model checking, - logical aspects of computational complexity, - finite model theory, - computational proof theory, - logic programming and constraints, - lambda calculus and combinatory logic, - categorical logic and topological semantics, - domain theory, - database theory, - specification, extraction and transformation of programs, - logical foundations of programming paradigms, - verification and program analysis, - linear logic, - higher-order logic, - nonmonotonic reasoning, - logics and type systems for biology. Proceedings will be published in the LNCS series. Each paper accepted by the Programme Committee must be presented at the conference by one of the authors, and final copy be prepared according to Springer's guidelines. Submitted papers must be in Springer's LNCS style and of no more than 15 pages, presenting work not previously published. They must not be submitted concurrently to another conference with refereed proceedings. Any closely related work submitted to a conference or journal before April 2, 2007 must be reported to the PC chairs. Papers authored or coauthored by members of the Programme Committee are not allowed. Submitted papers must be in English and provide sufficient detail to allow the Programme Committee to assess the merits of the paper. Full proofs may appear in a technical appendix which will be read at the reviewer's discretion. The title page must contain: title and author(s), physical and e-mail addresses, identification of the corresponding author, an abstract of no more than, 200 words, and a list of keywords. The submission deadline is in two stages. Titles and abstracts must be submitted by 02 April, 2007 and full papers by 09 April, 2007. Notifications of acceptance will be sent by 21 May, 2007, and final versions are due 18 June, 2007. Important Dates: Submission - title & abstract: 02 April, 2007 - full paper: 09 April, 2007 - Notification: 21 May, 2007 - Final papers: 18 June, 2007 Invited Speakers: -Samson Abramsky (Oxford) -Luca de Alfaro (Santa Cruz) -Arnold Beckmann (Swansea) -Anuj Dawar (Cambridge) -Orna Kupferman (Jerusalem) -Helmut Seidl (Munich) Programme Committee: -Serge? Artemov (New-York) -Franz Baader (Dresden) -Lev Beklemishev (Moscow) -Andrei Bulatov (Burnaby) -Michel De Rougemont (Paris) -Jacques Duparc (co-Chair) (Lausanne) -Erich Gr?del (Aachen) -Thomas Henzinger (co-Chair) (Lausanne) -Michael Kaminski (Ha?fa) -Stephan Kreutzer (Berlin) -Benedikt Loewe (Amsterdam) -Rupak Majumdar (Los Angeles) -Paul-Andr? M?llies (Paris) -Joel Ouaknine (Oxford) -Jean-Eric Pin (Paris) -Nicole Schweikardt (Berlin) -Luc Segoufin (Orsay) -Thomas Strahm (Bern) -Ashish Tiwari (Menlo Park, CA) -Helmut Veith (Munich) -Igor Walukiewicz (Bordeaux) ***************************************************************** *** Alessandro Facchini Swiss Western Centre for Logic, History and Philosophy of Science, University of Lausanne +41 (0)21 692 3596 skype: ale_facchini ***************************************************************** *** (homepage) http://wwwpeople.unil.ch/alessandro.facchini/ *** http://www.unil.ch/lhps ***************************************************************** From lerner at cs.ucsd.edu Wed Feb 21 02:56:56 2007 From: lerner at cs.ucsd.edu (Sorin Lerner) Date: Tue, 20 Feb 2007 23:56:56 -0800 (PST) Subject: [TYPES/announce] POPL Call for Workshops and co-located event Proposals Message-ID: POPL 2008 - CALL FOR WORKSHOPS AND CO-LOCATED EVENT PROPOSALS POPL 2008, the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages 10-12 January 2008 San Francisco, California The 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2008) will be held in San Francisco, California from January 10 to January 12. POPL provides a forum for the discussion of fundamental principles and important innovations in the design, definition, analysis, transformation, implementation and verification of programming languages, programming systems, and programming abstractions. Both experimental and theoretical papers on principles and innovations are welcome, ranging from formal frameworks to reports on practical experiences. Proposals are invited for events to be co-located with POPL 2008, including workshops and conferences. Co-located events can either be sponsored directly by SIGPLAN or supported through in-cooperation status. ** Submission details ** Deadline for submission: Monday, March 19th, 2007 Notification of acceptance: Monday, April 16th, 2007 Prospective meeting organizers are invited to submit a completed meeting proposal form to the POPL 2008 workshop chair (Yitzhak Mandelbaum) by March 19th, 2007. Please note that this is a firm deadline. Organizers will be notified if their proposal is accepted by April 16th, 2007, and, if successful, are required to produce a final report after the workshop has taken place that is suitable for publication in SIGPLAN Notices. ** Selection committee ** The event proposals will be evaluated by a committee comprising the following members of the POPL 2008 organising committee, together with the members of the SIGPLAN executive committee. Yitzhak Mandelbaum AT&T Labs - Research Workshops chair George Necula UC Berkeley General chair Phil Wadler University of Edinburgh Program chair ** Further information ** For the full Call for Workshop and Co-located Event Proposals and all of the associated forms, visit the POPL 2008 website, or access them directly at: http://www.research.att.com/~yitzhak/workshops/popl08/call_for_events.html A copy of this announcement can be found at: http://www.research.att.com/~yitzhak/workshops/popl08/call_for_events.txt Any queries regarding POPL 2008 co-located event proposals should be addressed to the workshops chair (Yitzhak Mandelbaum), via email to popl08-workshops *at* research.att.com. From Stephan.Merz at loria.fr Wed Feb 21 08:36:26 2007 From: Stephan.Merz at loria.fr (Stephan Merz) Date: Wed, 21 Feb 2007 14:36:26 +0100 Subject: [TYPES/announce] post-doc position in Paris Message-ID: <45DC4ADA.4050703@loria.fr> Research team: Tools for Proofs, MSR-INRIA Joint Centre The Microsoft Research-INRIA Joint Centre is offering a 2-year position for a post-doctoral researcher to work on a proof development environment for TLA+ in the Tools for Proofs project-team (see http://www.msr-inria.inria.fr). Research Context TLA+ is a language for formal specifications and proofs designed by Leslie Lamport. It is based on first-order logic, set theory, temporal logic, and a module system. While the specification part of TLA+ has existed for several years, the proof language is more recent, and we want to develop tools for writing and checking proofs. Our development environment for TLA+ proofs will have the following structure: TLA+ source files will be translated to low-level proofs that will be checked by Isabelle. These will include calls to the Zenon automatic theorem prover to fill in the "trivial" details omitted from proofs at the TLA+ level. Within the Isabelle framework we will have an axiomatization of TLA+ (Isabelle/TLA+). Isabelle will provide high assurance by checking all the proofs provided by the user or by Zenon. As the user writes and modifies the TLA+ source code, a proof manager will keep track of which parts of the proofs need to be modified and re-checked by Isabelle. The proof manager will also support direct interaction from the user with Isabelle when needed. Description of the activity of the post-doc The task devoted to the post-doc will be to develop the tools that make up the TLA+ development environment: the translator to Isabelle, the Zenon-Isabelle interface, and the proof manager. He will also complete the development of the TLA+ theory in the Isabelle framework (Isabelle/TLA+), which is currently incomplete. Skills and profile of the candidate We are looking for a candidate with skills in some or all of the following subjects: parsing and compilation, logic and set theory, Isabelle, OCaml, Eclipse and Java. Moreover, the applicant must have a good command of the English language. Location The Microsoft Research-INRIA Joint Centre is located on the Campus of INRIA Futurs, in South part of Paris, near the Le-Guichet RER station. The Tools for Proofs project-team is composed of Damien Doligez, Leslie Lamport and Stephan Merz. Contact Candidates should send a resume to Damien Doligez -------------- next part -------------- A non-text attachment was scrubbed... Name: Stephan.Merz.vcf Type: text/x-vcard Size: 325 bytes Desc: not available Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070221/daddbee6/Stephan.Merz.bin From morazanm at shu.edu Wed Feb 21 23:41:52 2007 From: morazanm at shu.edu (Marco T Morazan) Date: Wed, 21 Feb 2007 23:41:52 -0500 Subject: [TYPES/announce] TFP 2007: Registration and Program Message-ID: Dear Colleagues, You may now resgister for TFP 2007! TFP 2007 will be held April 2-4, 2007 in New York City, USA. Our invited speaker is John McCarthy, Stanford University. Further details can be found at our homepage: http://cs.shu.edu/tfp2007/ . You may register at: http://cs.shu.edu/tfp2007/registration.html . The registration deadline is March 2, 2007 (11:59 p.m. EST). Accomodations information may be found at: http://cs.shu.edu/tfp2007/accomodations.html . We kindly remind you that the deadline to make a hotel reservation at the guaranteed rates offered to TFP 2007 participants is also quickly approaching. We are proud to announce our program of accepted talks: Unifying Hybrid Types and Contracts Jessica Gronski and Cormac Flanagan A Dual Semantics for the Data Description Calculus Yitzhak Mandelbaum, Kathleen Fisher, and David Walker A Metalanguage for Structural Operational Semantics Matthew Lakin and Andrew Pitts An Arrow Based Semantics for Interactive Applications Peter Achten, Marko van Eekelen, Maarten de Mol, and Rinus Plasmeijer Dependent Types: Easy as Pie Dimitrios Vytiniotis and Stephanie Weirich Constructing Correct Circuits -- Hardware Modelling with Dependent Types Edwin Brady, James McKinna, and Kevin Hammond Why Would Extensible Dependent Types Matter Pablo Nogueira and Bruno Oliveira Bytecode Verification for Haskell Robert Dockins and Samuel Z. Guyer UnreadTVar: Extending Haskell Software Transactional Memory for Performance Nehir Sonmez, Cristian Perfumo, Srdjan Stipic, Adrian Cristal, Osman S. Unsal, and Mateo Valero A New Functional Implementation of Grover's Fast Search Algorithm Justin Stallard and Murray Gross An Inference Algorithm for Guaranteeing Safe Destruction Manuel Montenegro, Ricardo Pe?a, and Clara Segura Hierarchical Master/Worker Skeletons Jost Berthold, Mischa Dieterle, Rita Loogen, and Steffen Priebe Property Directed Generation of First-Order Test Data Fredrik Lindblad Refactoring for Comprehension Gustavo Villavicencio Towards a Box Calculus for Hume Gudmund Grov and Greg Michaelson Scaled Regression: A Refinement of Primitive Recursion Daniel Leivant Equality-Based Uniqueness Typing Edsko de Vries, Rinus Plasmeijer, and David Abrahamson Lightweight Static Resources: Sexy Types for Embedded and Systems Programming Oleg Kiselyov and Chung-chieh Shan Space-Efficient Gradual Typing David Herman, Aaron Tomb, and Cormac Flanagan Use-Based Reference of Polymorphism Dave King and John Hannan Designing a Generic Graph Library Using ML Functors Sylvain Conchon, Jean-Christophe Filliatre, and Julien Signoles The SCIence Joint Research Activity Kevin Hammond, Dana Petcu, Phil Trinder, Abdallah Al Zain, Steve Linton, and Greg Michaelson Generic and Index Programming Jeremy Gibbons, Meng Wang, and Bruno C d. S. Oliveira The AHA Project Marko van Eekelen, Olha Shkaravska, Ron van Kesteren, Bart Jacobs, Sjaak Smetsers, and Erik Poll Studying Helium Program Bahaviour with the Neon Library Jurriaan Hage and Peter van Keeken Design and Implementation of JFP Hao Xu Hop Client-Side Compilation Florian Loitsch Adaptive High-Level Scheduling in a Generic Parallel Runtime Environment Jost Berthold, Abyd Al-Zain, and Hans-Wolfgang Loidl Bundles Pack Tighter than Lists Francisco Lopez-Fraguas, Juan Rodriguez-Hortala, and Jaime Sanchez-Hernandez Model-Based Testing of Thin-Client Web Applications and Navigation Input Pieter Koopman, Peter Achten, and Rinus Plasmeijer We look forward to seeing you at TFP 2007! Cheers, Marco ********************************************************************************** Prof. Marco T. Morazan Dept. of Mathematics and Computer Science Seton Hall University "On theories such as these we cannot rely. Proof we need. Proof!" -- Yoda, Jedi Master -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070221/a467b86e/attachment.htm From djg at cs.washington.edu Fri Feb 23 01:47:04 2007 From: djg at cs.washington.edu (Dan Grossman) Date: Thu, 22 Feb 2007 22:47:04 -0800 Subject: [TYPES/announce] Summer School on Language-Based Techniques for Integrating with the External World Message-ID: <45DE8DE8.5020705@cs.washington.edu> [Several of the speakers will present types-related topics.] A Summer School on Language-Based Techniques for Integrating with the External World will be held at the University of Oregon this July. This is now the 6th year of the summer school, with the topic varying each year, and we've gotten very positive feedback from students in past years. Attached is our flyer, which lists the topics and speakers, and the web page for the summer school is http://www.cs.uoregon.edu/research/summerschool/summer07/index.html -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: ad.txt Url: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070223/c6de53e7/ad.txt -------------- next part -------------- A non-text attachment was scrubbed... Name: ad.pdf Type: application/pdf Size: 63532 bytes Desc: not available Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070223/c6de53e7/ad.pdf From Daniel.Hirschkoff at ens-lyon.fr Fri Feb 23 03:39:16 2007 From: Daniel.Hirschkoff at ens-lyon.fr (Daniel.Hirschkoff@ens-lyon.fr) Date: Fri, 23 Feb 2007 09:39:16 +0100 Subject: [TYPES/announce] postdoc position available at ENS Lyon Message-ID: <17886.43060.19642.242523@gargle.gargle.HOWL> <> The Plume team of the Ecole Normale Superieure de Lyon (http://www.ens-lyon.fr/LIP/PLUME/plume.us.html) is offering a 12 month job to collaborate within the project MoDyFiable ("Modularite Dynamique Fiable"). The goal of this project is to provide a core programming model for dynamic modularity. By dynamic modularity, we refer to the ability in modern software to act on the structure of a system at runtime (deployment, dynamic update, code mobility, ..). In collaboration with INRIA project SARDES (Grenoble -- France), we are currently developing a process algebraic model where to represent and analyse such phenomena. Below is a succinct description of the main subjects related to this project. Central to our model is the mechanism of passivation, which allows one to transform a running computation unit into some passive entity, that can be modified, or shipped in a message. The interplay between passivation and other typical notions of distributed computation (such as logical vs. physical localities, distant communication, encapsulation, ..) raises important and interesting questions from several points of view: 1 - Programming language: implementation, high level constructs, type systems. Many design choices arise when trying to implement passivation in the setting of a distributed computation. We study these by defining and analysing abstract machines for the distributed execution of our process models. Additionally, we work on understanding how our core calculus can be extended in order to provide useful and expressive primitives to program dynamic modularity. We would also like to develop type systems for encapsulation or resource access control. 2 - Models: behavioural equivalences, semantic models. In presence of named localities and passivation, most of the behavioural laws that hold in usual process calculi fail. We are working on understanding what notion of behavioural equivalence is provided in a calculus with passivation, and what (coinductive) proof techniques can be defined to help establishing equivalences. There are many ways to include passivation in a core formal model for concurrent computation, and we lack means to compare these. General frameworks like Milner's Bigraphs should help us in relating various proposals and providing an abstract understanding of passivation. Alternatively, we would like to understand using category theory the properties we want to guarantee for the models we are currently developing. Relevant references to learn more about the models we study include the following: - Alan Schmitt, Jean-Bernard Stefani: The m-calculus: a higher-order distributed process calculus. POPL 2003: 50-61 - Philippe Bidinger, Alan Schmitt, Jean-Bernard Stefani: An Abstract Machine for the Kell Calculus. FMOODS 2005: 31-46 - Daniel Hirschkoff, Tom Hirschowitz, Damien Pous, Alan Schmitt, Jean-Bernard Stefani: Component-Oriented Programming with Sharing: Containment is Not Ownership. GPCE 2005: 389-404 More recent, unpublished, developments of our models are available upon request. More generally, interested candidates can get in contact with Daniel.Hirschkoff at ens-lyon.fr for further information. ** To apply ** The candidate should have a good knowledge of process algebras for concurrency (CCS, the pi-calculus). Further specialisation along one of the aforementioned research directions would be appreciated. A PhD is mandatory in order to apply. The job is available immediately (spring 2007), but can also start later in 2007 (until september 2007). The salary is 2150 euros per month "brut" (which includes social insurance -- take out something like 15-20% to obtain the actual income every month). Candidates should get in contact with Daniel.Hirschkoff at ens-lyon.fr. Please send a CV together with a description of your fields of expertise. From jas at di.uminho.pt Fri Feb 23 09:54:42 2007 From: jas at di.uminho.pt (=?ISO-8859-1?Q?Jo=E3o?= Saraiva) Date: Fri, 23 Feb 2007 14:54:42 +0000 Subject: [TYPES/announce] ETAPS 2007: Call for Participation Message-ID: <1172242482.3471.9.camel@p91.glmf.di.uminho.pt> ***************************************************************** *** *** *** ETAPS 2007 *** *** March 24 - April 1, 2007 *** *** Braga, Portugal *** *** *** *** http://www.di.uminho.pt/etaps07/ *** *** *** *** CALL FOR PARTICIPATION *** *** *** *** Normal Registration Deadline: 26th February, 2007 *** *** Students Grant Deadline : 26th February, 2007 *** *** *** ***************************************************************** The European Joint Conferences on Theory and Practice of Software (ETAPS) is the primary European forum for academic and industrial researchers working on topics related to Software Science. It is a confederation of five main conferences, several satellite workshops and other events. ETAPS 2007 is taking place in Braga, Portugal. Braga, capital of the Minho province, is an ancient city in the heart of the green and fertile region known as the Costa Verde. The region is known for its attractiveness in terms of climate, gastronomy, prices, and culture. Braga is known for its barroque churches and splendid 18th century houses. The old city is solemn and antique, but animated with commercial activity and academic life. ============================================================================ 5 Conferences - 18 Satellite Workshops - 3 Tutorials - Tool Demonstrations ============================================================================ ------------------------------------------------------------------------- Main Conferences ------------------------------------------------------------------------- CC 2007: International Conference on Compiler Construction http://cc2007.cs.brown.edu/ ESOP 2007: European Symposium on Programming http://rap.dsi.unifi.it/esop07/ FASE 2007: Fundamental Approaches to Software Engineering http://fase07.di.fc.ul.pt FOSSACS 2007: Foundations of Software Science and Computation Structures http://www2.in.tum.de/~seidl/fossacs07/ TACAS 2007: Tools and Algorithms for the Construction and Analysis of Systems http://www.doc.ic.ac.uk/tacas07/ ----------------------------------------------------------------------- Invited Speakers ----------------------------------------------------------------------- ETAPS 2007: Rance Cleaveland - University of Maryland, USA ETAPS 2007: Bertrand Meyer - ETH Z?rich, Switzerland CC 2007: Don Batory - University of Texas at Austin, USA ESOP 2007: Andrew Pitts - Cambridge University, UK FASE 2007: Jan Bosch - Nokia, Finland FOSSACS 2007: Radha Jagadeesan - DePaul University, USA TACAS 2007: K. Rustan M. Leino - Microsoft Research, USA Further invited speakers are giving talks in the satellite workshops. ----------------------------------------------------------------------- Satellite Workshops ----------------------------------------------------------------------- ACCAT: Applied and Computational Category Theory http://tfs.cs.tu-berlin.de/workshops/accat2007/ AVIS: Int. Workshop on Automated Verification of Infinite-State Systems http://chacs.nrl.navy.mil/AVIS07 Bytecode: Bytecode Semantics, Verification, Analysis and Transformation http://www.sci.univr.it/~spoto/Bytecode07/ COCV: Sixth Workshop on Compiler Optimization Meets Compiler Verification http://pes.cs.tu-berlin.de/cocv2007/ FESCA: Formal Foundations of Embedded Software and Component-Based Software Architectures http://palab.dcs.kcl.ac.uk/fesca/ FinCo: Foundations of Interactive Computation http://www.cs.brown.edu/sites/finco07/ GT-VMT: Int. Workshop on Graph Transformation and Visual Modeling Techniques http://www.cs.le.ac.uk/events/GTVMT07/ HAV: Heap Analysis and Verification http://www.cs.tau.ac.il/~msagiv/hav.html HFL: Hardware design using Functional Languages http://hfl07.hflworkshop.org/ LDTA: Seventh Workshop on Language Descriptions, Tools and Applications http://www.di.uminho.pt/ldta07 MBT: Third Workshop on Model Based Testing http://react.cs.uni-sb.de/mbt2007/ MOMPES: Model-based Methodologies for Pervasive and Embedded Software http://www.di.uminho.pt/mompes OpenCert: Foundations and Techniques for Open Source Software Certification http://opencert.iist.unu.edu/ QAPL: Fifth Workshop on Quantitative Aspects of Programming Languages http://www.cse.yorku.ca/qapl07 SC: Software Composition http://ssel.vub.ac.be/sc2007 SLA++P: Model-driven High-level Programming of Embedded Systems http://web.uni-bamberg.de/wiai/gdi/SLAP07/ TERMGRAPH: Fourth International Workshop on Computing with Terms and Graphs http://www.termgraph.org.uk WITS: Seventh Workshop on Issues in the Theory of Security http://www.dsi.unive.it/IFIPWG1_7/wits2007.html ----------------------------------------------------------------------- Tutorials ----------------------------------------------------------------------- Program Transformation with Stratego/XT Martin Bravenboer (Utrecht University) and Eelco Visser (Delft University of Technology) Beyond the Generators: Practical Techniques for Real-World Software Generation Anthony M. Sloane (Macquarie University) Mobility, Ubiquity, and Security Gilles Barthe (INRIA), David Pichardie (IRISA), David Aspinall (Univ. of Edinburgh), Peter M?ller (ETH Zurich), Lennart Beringer (LMU Munich) and Joe Kiniry (UC Dublin) ----------------------------------------------------------------------- Tool Demonstrations ----------------------------------------------------------------------- Demonstrations of tools presenting advances on the state of the art have been selected and are integrated in the programmes of the main conferences. ----------------------------------------------------------------------- Registration and Contact Details ----------------------------------------------------------------------- For online registration, please visit http://www.di.uminho.pt/etaps07/ and go to menu item "Registration". Contact details are available at the menu item "Contact us". In case of any questions not addressed on the web pages, please email etaps07 at di.uminho.pt. From carlos.martin at urv.cat Sun Feb 25 07:10:27 2007 From: carlos.martin at urv.cat (carlos.martin@urv.cat) Date: Sun, 25 Feb 2007 12:10:27 GMT Subject: [TYPES/announce] LATA 2007: call for participation Message-ID: 1st INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS LATA 2007 Tarragona, Spain, March 29 - April 4, 2007 http://grammars.grlmc.com/LATA2007/index.html PROGRAMME Thursday, March 29 8:00 ? 9:00 Registration 9:00 ? 9:15 Opening 9:15 ? 10:45 Tomas Masopust and Alexander Meduna - Descriptional Complexity of Grammars Regulated by Context Conditions Guangwu Liu, Carlos Martin-Vide, Arto Salomaa and Sheng Yu - State Complexity of Basic Operations Combined with Reversal Henning Fernau and Juergen Dassow - Comparison of Some Descriptional Complexities of 0L Systems Obtained by a Unifying Approach 10:45 ? 11:15 Coffee Break 11:15 ? 12:15 Vinay Choudhary, Anand Kumar Sinha and Somenath Biswas - Universality for Nondeterministic Logspace Hermann Gruber and Markus Holzer - Computational Complexity of NFA Minimization for Finite and Unary Languages 12:15 ? 12:30 Break 12:30 ? 14:00 Tutorial Volker Diekert - Equations: From Words to Graph Products (I) 14:00 ? 16:00 Lunch 16:00 ? 17:30 Grigoriy Povarov - Descriptive Complexity of the Hamming Neighborhood of a Regular Language Baptiste Blanpain, Jean-Marc Champarnaud and Jean-Philippe Dubernard - Geometrical Languages Olivier Bodini, Thomas Fernique and Eric Remila - A Characterization of Flip-accessibility for Rhombus Tilings of the Whole Plane 17:30 ? 18:00 Coffee Break 18:00 ? 19:30 Bernd Borchert and Klaus Reinhardt - Deterministically and Sudoku-deterministically Recognizable Picture Languages Ralf Stiebe - Slender Siromoney Matrix Languages Kazuya Ogasawara and Satoshi Kobayashi - Stochastically Approximating Tree Grammars by Regular Grammars and Its Application to Faster ncRNA Family Annotation Friday, March 30 8:45 ? 10:15 Andreas Maletti - Compositions of Extended Top-down Tree Transducers Ekaterina Komendantskaya - First-order Deduction in Neural Networks Pal Domosi - Automata Networks without any Letichevsky Criteria 10:15 ? 10:45 Coffee Break 10:45 ? 12:15 Henning Bordihn and Gyorgy Vaszil - On Leftmost Derivations in CD Grammar Systems Suna Bensch - An Approach to Parallel Mildly Context-sensitive Grammar Formalisms Yurii Rogozhin, Carlos Martin-Vide and Artiom Alhazov - Networks of Evolutionary Processors with Two Nodes Are Unpredictable 12:15 ? 12:30 Break 12:30 ? 14:00 Tutorial Volker Diekert - Equations: From Words to Graph Products (II) 14:00 ? 16:00 Lunch 16:00 ? 17:30 Victor Selivanov - Classifying Omega-regular Partitions Paolo Boldi, Violetta Lonati, Roberto Radicioni and Massimo Santini - The Number of Convex Permutominoes Pawel Baturo and Wojciech Rytter - Occurrence and Lexicographic Properties of Standard Sturmian Words 17:30 ? 18:00 Coffee Break 18:00 ? 19:00 Invited Talk Neil Immerman - Nested Words 19:30 Visit to the old city Monday, April 2 9:00 ? 10:30 Francine Blanchet-Sadri, Kevin Corcoran and Jenell Nyberg - Fine and Wilf's Periodicity Result on Partial Words and Consequences Costas Iliopoulos, Borivoj Melichar, Jan Supol and Inuka Jayasekera - Weighted Degenerated Approximate Pattern Matching Krystyna Stawikowska and Edward Ochmanski - On Star-free Trace Languages and their Lexicographic Representations 10:30 ? 11:00 Coffee Break 11:00 ? 12:30 Zoltan L. Nemeth - On the Regularity of Binoid Languages: A Comparative Approach Markus Lohrey and Benjamin Steinberg - The Submonoid and Rational Subset Membership Problems for Graph Groups Camilo Thorne - Categorial Module Grammars of Bounded Size Have Finite Bounded Density 12:30 ? 12:45 Break 12:45 ? 13:45 Tutorial Erich Graedel - Infinite Games (I) 13:45 ? 15:45 Lunch 15:45 ? 17:15 Mathieu Poudret, Jean-Paul Comet, Pascale Le Gall, Agn?s Arnould and Philippe Meseure - Topology-based Geometric Modelling for Biological Cellular Processes Farid Ablayev and Aida Gainutdinova - Classical Simulation Complexity of Quantum Branching Programs Martin Kochol, Nada Krivonakova, Silvia Smejova and Katarina Srankova - Reductions of Matrices Associated with Nowhere-zero Flows 17:15 ? 17:45 Coffee Break 17:45 ? 18:45 Juntae Yoon and Seonho Kim - Rule-based Word Spacing in Korean Based on Lexical Information Extracted from a Corpus Julien Bourdaillet and Jean-Gabriel Ganascia - Practical Block Sequence Alignment with Moves 18:45 ? 19:00 Break 19:00 ? 20:00 Invited Talk Helmut Juergensen - Synchronization Tuesday, April 3 9:00 ? 10:30 Pavlos Antoniou, Maxime Crochemore, Costas Iliopoulos and Pierre Peterlongo - Application of Suffix Trees for the Acquisition of Common Motifs with Gaps in a Set of Strings Frantisek Mraz, Friedrich Otto and Martin Platek - Free Word-order and Restarting Automata Martin Kutrib and Jens Reimann - Succinct Description of Regular Languages by Weak Restarting Automata 10:30 ? 11:00 Coffee Break 11:00 ? 12:30 Hartmut Messerschmidt and Friedrich Otto - On Determinism Versus Non-determinism for Restarting Automata Martin Kutrib and Andreas Malcher - Fast Reversible Language Recognition Using Cellular Automata Pietro Di Lena and Luciano Margara - Computational Complexity of Dynamical Systems: the Case of Cellular Automata 12:30 ? 12:45 Break 12:45 ? 13:45 Tutorial Erich Graedel - Infinite Games (II) 13:45 ? 15:45 Lunch 15:45 ? 17:15 Christos Nomikos and Panos Rondogiannis - Locally Stratified Boolean Grammars Alexander Okhotin - Unambiguous Boolean Grammars Yo-Sub Han and Derick Wood - Generalizations of One-deterministic Regular Languages 17:15 ? 17:45 Coffee Break 17:45 ? 18:45 Franz Baader, Jan Hladik and Rafael Penaloza - SI! Automata Can Show PSPACE Results for Description Logics Liviu P. Dinu, Radu Gramatovici and Florin Manea - On the Syllabification of Words via Go-through Automata 18:45 ? 19:00 Break 19:00 ? 20:00 Invited Talk Nissim Francez and Michael Kaminski - Extensions of Pregroup Grammars and Their Correlated Automata 20:30 Visit to the City Hall Wednesday, April 4 9:15 ? 10:45 Deian Tabakov and Moshe Vardi - Model Checking Buechi Specifications Benedikt Bollig and Dietrich Kuske - Muller Message-passing Automata and Logics Pavel Martjugin - A Series of Slowly Synchronizable Automata with a Zero State Over a Small Alphabet 10:45 ? 11:15 Coffee Break 11:15 ? 12:15 Gennaro Parlato, Salvatore La Torre, Margherita Napoli and Mimmo Parente - Verification of Succinct Hierarchical State Machines Miklos Kresz - Nondeterministic Soliton Automata with a Single External Vertex 12:15 ? 12:30 Break 12:30 ? 13:30 Tutorial Erich Graedel - Infinite Games (III) 13:30 Closing From Oege.de.Moor at comlab.ox.ac.uk Mon Feb 26 15:47:58 2007 From: Oege.de.Moor at comlab.ox.ac.uk (Oege.de.Moor@comlab.ox.ac.uk) Date: Mon, 26 Feb 2007 20:47:58 GMT Subject: [TYPES/announce] AOSD 2007: call for participation Message-ID: <200702262047.l1QKlwGA013333@mercury.comlab.ox.ac.uk> A non-text attachment was scrubbed... Name: not available Type: text Size: 5784 bytes Desc: not available Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070226/d9d9a448/attachment.txt From blanqui at loria.fr Tue Feb 27 12:25:15 2007 From: blanqui at loria.fr (Frederic Blanqui) Date: Tue, 27 Feb 2007 18:25:15 +0100 (CET) Subject: [TYPES/announce] TPR'07 first call for papers Message-ID: ================================================================ FIRST CALL FOR PAPERS TPR '07 International Workshop on Type theory, proof theory, and rewriting Paris, France, June 29th 2007 http://www.lix.polytechnique.fr/~dowek/tpr.html ================================================================ Type theory, proof theory, and rewriting Friday, June 29th, 2007, Paris TPR is a workshop to present on-going work on proof theory and type theory with an emphasis on the use of rewriting techniques in these areas. Topics include, but are not limited to, extensions of type theory with rewriting, deduction modulo and other extensions of predicate logic, the use of rewriting in logical frameworks and proof assistants, proof search methods using rewriting and related methods, proof search tools using rewriting, cut elimination, structural proof analysis... This workshop is supported by the Types project, a coordination action in EU's 6th framework programme. Types also organizes the HOR workshop, a few days before. Program Committee Fr?d?ric Blanqui (LORIA, France) Gilles Dowek (?cole polytechnique, France) Jim Lipton (Wesleyan University, United States and UPM, Spain) Sara Negri (Helsinki, Finland) Mitsu Okada (Keio University, Japan) Submissions Submissions should be sent to Gilles.Dowek AT polytechnique.edu before Friday, April 13th, 2007. Important Dates Deadline for submissions: Friday, April 13th, 2007. Workshop: Friday, June 29th, 2007. From eernst at daimi.au.dk Tue Feb 27 20:20:34 2007 From: eernst at daimi.au.dk (Erik Ernst) Date: Wed, 28 Feb 2007 02:20:34 +0100 Subject: [TYPES/announce] ECOOP 2007 - Call for Student Volunteers Message-ID: ++++++++++++++++++++++ Call for Student Volunteers +++++++++++++++++++++ +++++++++++++++++++++++++ Deadline: April 18th +++++++++++++++++++++++++ ECOOP 2007 is pleased to offer a number of opportunities for Student Volunteers, who are vital to the efficient operation and continued success of ECOOP each year. We strongly encourage students, all around the world, to become involved in the ECOOP Student Volunteer program. In return for helping keep ECOOP running smoothly, you are granted free registration to the conference and (duties, space, and specific requirements permitting) free access to ECOOP plenary sessions, tutorials, workshops, and demos. You should be in Berlin two days before the conference begins to help with preparations and with the conference take-down (Saturday, July 28 - Friday, August 3). Applications should be submitted by April 18, 2007. More information on student volunteering is available at 2007.ecoop.org. We look forward to receiving your application. Dirk Seifert sv at 2007.ecoop.org ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ +++ on behalf of Dirk Seifert, -- Erik Ernst eernst at daimi.au.dk Department of Computer Science, University of Aarhus IT-parken, Aabogade 34, DK-8200 Aarhus N, Denmark From morazanm at shu.edu Wed Feb 28 09:45:41 2007 From: morazanm at shu.edu (Marco T Morazan) Date: Wed, 28 Feb 2007 09:45:41 -0500 Subject: [TYPES/announce] TFP 2007: Last Call for Participation Message-ID: Dear Colleagues, The deadline to register for TFP 2007 is quickly approaching. You may register at: http://cs.shu.edu/tfp2007/registration.html . Also, please be advised that the deadline to make hotel reservations at the guaranteed rate for TFP 2007 participants is also quickly approaching. Hotel information can be found at: http://cs.shu.edu/tfp2007/accomodations.html . You may browse the program and schedule for TFP 2007 at: http://cs.shu.edu/tfp2007/schedule.html . We look forward to seeing you in NYC!!! Cheers, Marco ********************************************************************************** Prof. Marco T. Morazan Dept. of Mathematics and Computer Science Seton Hall University "On theories such as these we cannot rely. Proof we need. Proof!" -- Yoda, Jedi Master -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070228/cba34e3d/attachment.htm From joost.visser at di.uminho.pt Thu Mar 1 11:01:30 2007 From: joost.visser at di.uminho.pt (Joost Visser) Date: Thu, 1 Mar 2007 16:01:30 +0000 Subject: [TYPES/announce] GTTSE 2007: 2nd call for participation (02-07 July) (registration open) Message-ID: <170AA898-D84B-448D-A3B1-18EB8AE807A2@di.uminho.pt> GTTSE 2007, 02-07 July, 2007, Braga, Portugal 2nd International Summer School on Generative and Transformational Techniques in Software Engineering http://www.di.uminho.pt/GTTSE2007 ** Registration is now open ** SCOPE AND FORMAT The summer school brings together PhD students, lecturers, technology presenters, as well as other researchers and practitioners who are interested in the generation and the transformation of programs, data, models, meta-models, and documentation. This concerns many areas of software engineering: software reverse and re-engineering, model-driven approaches, automated software engineering, generic language technology, to name a few. These areas differ with regard to the specific sorts of meta-models (or grammars, schemas, formats etc.) that underlie the involved artifacts, and with regard to the specific techniques that are employed for the generation and the transformation of the artifacts. The tutorials are given by renowned representatives of complementary approaches and problem domains. Each tutorial combines foundations, methods, examples, and tool support. The program of the summer school also features invited technology presentations, which present setups for generative and transformational techniques. These presentations complement each other in terms of the chosen application domains, case studies, and the underlying concepts. The program of the school also features a participants workshop. All summer school material will be collected in proceedings that are handed out to the participants. Formal proceedings will be compiled after the summer school, where all contributions are subjected to additional reviewing. The formal proceedings of the first instance of the summer school (2005) were published as volume 4143 in the Lecture Notes in Computer Science series of Springer-Verlag. TUTORIALS * Krzysztof Czarnecki (University of Waterloo) Model Evolution * Jean-Marie Favre (University of Grenoble) Software Linguistics and Language Engineering * Stan Jarzabek (National University of Singapore) Software Reuse Beyond Components with XVCL * Oege de Moor (Oxford University) Code Queries with Datalog * Jos? Nuno Oliveira (University of Minho, Portugal) Data Transformation by Calculation * Markus Pueschel (Carnegie Mellon University) How to Write Fast Numerical Code * Walid Taha (Rice University) A Practical Guide to Building Staged Interpreters * Eelco Visser (Delft University of Technology, The Netherlands) Domain-Specific Language Engineering REGISTRATION Online registration for the summer school is now open. The registration form, as well as detailed information on conditions and fees, are available at: http://wiki.di.uminho.pt/twiki/bin/view/Events/GTTSE2007/Registration The number of participants is limited. Participants will be selected on the basis of the information they supply on their registration form. SUMMER SCHOOL CHAIRS * Ralf L?mmel (Program Chair), Microsoft Corp., Redmond, USA. * Jo?o Saraiva (Organizing Chair), Universidade do Minho, Braga, Portugal. * Joost Visser (Program Chair), Universidade do Minho, Braga, Portugal. ADDITIONAL INFORMATION For additional information on the program, venue, and other details of the summer school, please consult the web page: http://www.di.uminho.pt/GTTSE2007 For remaining questions please contact gttse2007 at di.uminho.pt. From Gregorio.Diaz at uclm.es Fri Mar 2 03:55:27 2007 From: Gregorio.Diaz at uclm.es (=?ISO-8859-1?Q?Gregorio_D=EDaz_Descalzo?=) Date: Fri, 02 Mar 2007 09:55:27 +0100 Subject: [TYPES/announce] CFP: Aspect-Oriented Techniques to E-Service Environments (AOTE-S) 2007 Message-ID: <45E7E67F.6070907@uclm.es> ********************CALL for Papers for AOTE-S07********************** Aspect-Oriented Techniques to E-Service Environments (AOTE-S) in cooperation with TaMoCo 2007 Techniques and Applications for Mobile Commerce University of Paisley, Glasgow, Scotland, United Kingdom 9th - 10th July 2007 URL: http://tamoco2007.paisley.ac.uk/symposium1.html Submission deadline 15.03.2007 Synopsis: The emerging technology of Electronic Services introduces the possibility of implementing electronic commerce and business in a loosely coupled manner. This way, new technologies and standards are being used in order to develop and provide new services to the customers. On the other hand, Aspect-Oriented Techniques provide support to encapsulate and modularize crosscutting concerns in our systems, which cannot be included normally in the logical code structure by functionality. Therefore, the loosely coupled environment provided for electronic services can be maintained and improved by using these techniques. Goals of the workshop: Accordingly, this workshop is intended to bring together e-services and aspect -oriented techniques approaches both from industry and academia. It is meant to provide an appropriate environment to discus about the benefits aspect-oriented techniques can provide in e -services systems and about problems and challenges that particularly arise during the practical combination of both fields. Topics: Research submissions on all topics related to applying aspect-oriented techniques on electronic services environments will be welcomed, including but not limited to those listed below: E-Services technology implementations and Aspect-Oriented Programming * Web Services * Grid Services * Service-Oriented Computing * Semantic Web * Security for E-Services * Middlewares for E-Services E-Services Application and Aspect Oriented Techniques * Mobile commerce * Business Processes Modeling * E-Learning * E-Goverment * Electronic Agreement and Contracts * Submission Instructions Submission: Authors are invited to submit original, previously unpublished research papers. Papers should be written in English and must not exceed 8 pages in the LNCS format. Please send the Word or PDF file of your submission to the contact person (see below). You should receive a confirmation of the paer reception. All submissions will be peer-reviewed by members of the international program -committee based on originality, significance, and clarity of presentation. Accepted papers will be included in the workshop and the conference proceedings. Authors of accepted papers are supposed to participate in the workshop as well as the conference. Key Note Speaker: Olaf Zimmermann IBM Research GmbH, Zurich Research Laboratory Olaf Zimmermann is a Research Staff Member and senior certified Executive IT Architect in the IBM Zurich Research Lab. Olaf has 17 years of IT industry experience. His research focuses on meet -in-the-middle service modeling techniques and the role of architectural decisions and model transformations during Service -Oriented Architecture (SOA) construction. Previously, Olaf was a solution architect, helping IBM clients designing enterprise-scale SOA/Web services and Java 2 Enterprise Edition (J2EE) solutions on numerous services projects. He also educated practitioners around the world on emerging middleware technologies. In the beginning of his career, Olaf worked as a scientific consultant in the IBM European Networking Center (ENC) in Heidelberg, Germany, focusing on industry-specific middleware frameworks for systems and network management. Olaf is a regular conference speaker and an author of the Springer text book Perspectives on Web Services. He contributed to several IBM Redbooks such as Web Services Wizardry with WebSphere Studio Application Developer. Olaf holds an honors degree in Computer Science from the Technical University in Braunschweig, Germany. ***************Important Dates**************** Submission of papers 15.03.2007 Notice of Acceptance: 15.04.2007 Submission of Camera ready version: 30.04.2007 Program Committee: * Marco Aiello (University of Trento, Italy) * Francisco Curbera (IBM Watson, USA) * Gregorio D=92az (University of Castilla La Mancha) * Schahram Dustdar (Technical University of Vienna) * Juan Hernandez (University of Extremadura, Spain) * Heiko Ludwig (IBM Watson Research Center) * Josef Noll (Telenor R&D, Norway) * Guadalupe Ortiz (University of Extremadura, Spain) * Dumitru Roman (DERI Innsbruck, Austria) * Olaf Zimmermann (IBM Zurich) * Christian Zirpins (University College London, England) Symposium Chair: Guadalupe Ortiz University of Extremadura, Spain Email: gobellot at unex.es Symposium Co-Chair: Gregorio Diaz University of Castilla La Mancha, Spain Email: Gregorio.Diaz at uclm.es Contact Guadalupe Ortiz Email: gobellot at unex.es ============================================================ To contribute to SEWORLD, send your submission to . http://www.cs.colorado.edu/serl/seworld provides more information on SEWORLD as well as a complete archive of messages posted to the list. To subscribe to SEWORLD, send the following (as the body of a message) to : subscribe seworld end To unsubscribe from SEWORLD, send the following (as the body of a message) to : unsubscribe seworld end ============================================================ -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070302/2be757b1/attachment.htm From dezani at di.unito.it Mon Mar 5 03:25:06 2007 From: dezani at di.unito.it (Mariangiola Dezani) Date: Mon, 5 Mar 2007 09:25:06 +0100 Subject: [TYPES/announce] DCM '07 Call for Papers Message-ID: <81339572-96FA-4D7A-AB5D-7D857293A082@di.unito.it> ======================================================================== == Call for Papers DCM 2007 Developments in Computational Models http://www.pps.jussieu.fr/~danos/dcm07/ Wroclaw, Poland Sunday, 15 July 2007 A satellite event of ICALP/LICS 2007 ======================================================================= Several new models of computation have emerged in the last few years, and many developments of traditional computational models have been proposed with the aim of taking into account the new demands of computer system users and the new capabilities of computation engines. A new computational model, or a new feature in a traditional one, usually is reflected in a new family of programming languages, and new paradigms of software development. The aim of this workshop is to bring together researchers who are currently developing new computational models or new features for traditional computational models, in order to foster their interaction, to provide a forum for presenting new ideas and work in progress, and to enable newcomers to learn about current activities in this area. DCM 2007 will be a one-day satellite event of ICALP/LICS 2007. Topics of interest include all abstract models of computation and their applications to the development of programming languages and systems: - quantum computation, including implementations and formal methods in quantum protocols; - probabilistic computation and verification in modelling situations; - chemical, biological and bio-inspired computation, including spatial models, self-assembly, growth models; - general concurrent models including the treatment of mobility, trust, and security; - information-theoretic ideas in computing. Submissions and Publication: Please submit an abstract (max. 5 pages) in PDF/PostScript format by e-mail to dezani at di.unito.it by 30 April, 2007. After the workshop authors will be invited to submit a full paper of their presentation. Accepted contributions will appear in a special issue of the ENTCS (Electronic Notes in Theoretical Computer Science). Selected papers will be considered for special issues of Information and Computation and the Springer Transactions on Computational and Systems Biology. Important Dates: - Submission Deadline for Abstracts: April 30 2007 - Notification: May 21 2007 - Pre-proceedings version due: June 11 2007 - Workshop: July 15 2007 Programme Committee: Jos Baeten (Eindhoven University of Technology) Michele Bugliesi (Universita Ca Foscari) Alessandra Carbone (Universite Pierre et Marie Curie) Vincent Danos (Universite Denis Diderot, CNRS) Mariangiola Dezani (Universita di Torino) James Faeder (Los Alamos National Laboratory) Jean-Louis Giavitto (Universite d'Evry, CNRS) Elham Kashefi (Oxford University) Ian Mackie (King's College) Pasquale Malacaria (Queen Mary University of London) Corrado Priami (Universita di Trento) Vladimiro Sassone (University of Southampton) Local Organizer: Marcin Bienkowski, University of Wroclaw (Poland) Contact: Vincent Danos Universit? Denis Diderot ?quipe Preuves, Programmes, Syst?mes e-mail: vincent.danos at gmail.com tel: +33 1 4427 9930, fax: +33 1 4427 8654 @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ Mariangiola Dezani-Ciancaglini Dipartimento di Informatica Universita' di Torino c.Svizzera 185, 10149 Torino (Italy) e-mail : dezani at di.unito.it phone: 39-011-6706732 fax : 39-011-751603 mobile: 39-320-4359903 (preferred) 39-348-2251592 http://www.di.unito.it/~dezani ********************************************************************** Unless unavoidable, no Word, Excel or PowerPoint attachments, please. See http://www.gnu.org/philosophy/no-word-attachments.html ********************************************************************** "L'ITALIA RIPUDIA LA GUERRA come strumento di offesa alla libert? degli altri popoli e come mezzo di risoluzione delle controversie internazionali." (Art. 11 della Costituzione della Repubblica Italiana) -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070305/91867346/attachment.htm From segura.eduardo at gmail.com Mon Mar 5 21:17:04 2007 From: segura.eduardo at gmail.com (E. Segura) Date: Mon, 5 Mar 2007 18:17:04 -0800 Subject: [TYPES/announce] CFP - Deadline Extension - SPAC 2007 Message-ID: -The paper submission deadline has been extended to March 18, 2007 -------------------------------------------- The First IEEE International Workshop on Software Patterns: Addressing Challenges ***SPAC 2007*** Call for Papers Beijing, China, July 24-27, 2007 (in conjunction with COMPSAC 2007) http://conferences.computer.org/compsac/2007/ (COMPSAC 2007 Link) http://conferences.computer.org/compsac/2007/workshops/SPAC (Workshop Link-1) http://www.engr.sjsu.edu/~fayad/workshops/COMPSAC07 (Workshop Link-2) http://www.vrlsoft.com/workshops/SPAC07 (WorkshopLink-3) -------------------------------------------- THEME OF THE WORKSHOP As software increases in size and becomes more complex and costly, the need for techniques to ease software development is likewise increasing. Over the last decade, pattern community has evolved and received more interest in both academia and industry. Developing software using patterns holds the promise to reduce the cost and condensing the time of developing software systems, while simultaneously maintaining the quality of these systems. However, the potential of using patterns in developing systems is not fully realized and we need to address many challenges. For example, developing pattern repositories and catalogs, from which patterns can be retrieved and reused, still forms a challenge to software engineering, knowledge engineering and information systems communities. In addition, the need for (semi-) automated approaches for patterns mining and integration poses several open research questions to the software engineering community. Many think these challenges and others preclude the realization of the benefit of patterns as a reuse approach. This workshop aims at bringing together researchers and practitioners who are interested in resolving research challenges or who have practical experience with the different issues of patterns reuse and integration to discuss and advance the state-of-the-art and the state-of-the-practice in patterns reuse. Patterns have emerged as a promising reuse technique for both improving the quality and reducing the cost and time of software development. However, there is an immense belief that patterns have not fulfilled the expectations software developers wanted. Nevertheless, this belief does not rebuff the fact that patterns, as a concept, have the potential to play a key role in developing systems in the near future. This near future will never come unless there are serious attempts from both developers and researchers to investigate and provide creative solutions to current challenges that hinder utilizing patterns in practice. Among these challenges, this workshop focuses on investigating how to develop systems using patterns. We are sure that this topic will attract many developers and researchers in the field to participate in this workshop. WORKSHOP CHALLENGES The workshop will address software patterns challenges and debate several issues related to the following questions. We want researchers, framework developers, and application developers to discuss and debate the following questions related to: I. Pattern Creation and Development a. Leaving experience claim on the side, can you show how to create and develop patterns? b. What are the bases of creating patterns? c. Are there guidelines, methodologies, and/or processes for pattern creations and developments? d. Would you show an example or two? II. Patterns Selection Process: a. How does one select analysis and design patterns to build any system? b. What is the basis for selecting these patterns? c. If someone would like to build a system from patterns, how does she select patterns? d. What kind of patterns should one select to build a system from patterns? e. Is there a guideline for the selection process? III. Patterns Composition a. How does one integrate the selected patterns to build any system? or How does one compose any system from patterns? b. What are the various claims related to patterns composition? Are they true? c. Are there guidelines or techniques for patterns composition? Would you illustrate how to use them? IV. System of Patterns and General Reuse a. What do we mean when we say "systems of patterns"? b. Are the various claims related to building any system from patterns reasonable? c. How to develop pattern repositories and catalogs, from which patterns can be retrieved and reused? d. Are there automated approaches for patterns mining and integration? e. What other concepts will help build any system from patterns? . V. Impacts a. What is the impact of software stability on the above issues? Check any of the following websites for all columns and accepted position papers: http://conferences.computer.org/compsac/2007/workshops/SPAC (Main Link) www.engr.sjsu.edu/~fayad//workshops/COMPSAC07 (Workshop Link 2) www.vrlsoft.com/workshops/SPAC07 (Workshop Link 3 -- Under Construction) PAPER FORMAT AND SUBMISSIONS Detailed instructions for electronic paper submission and review process can be found at http://www.compsac.org/. People interested in participating in the workshop are requested to submit a short position paper (3-5 pages) or regular workshop paper (limited to 6 pages, double spaced, including figures) representing views and experiences relevant to the discussion topic. The title page should include a maximum 150-word abstract, five keywords, full mailing address, e-mail address, phone number, fax number, and a designated contact author. Papers will be selected depending on the originality, quality and relevance to the workshop. All submitted papers will be evaluated according to its originality, significance, correctness, presentation and relevance. Papers should be submitted electronically at: http://compsac.cs.iastate.edu/2007/SPAC/ . Please follow the instructions given by the web page. Camera Ready manuscripts must be submitted following IEEE conference proceedings style and guidelines. We encourage authors to present novel ideas, critique of existing work, and practical studies. Each accepted paper must be presented in person by the author or one of the authors. To foster lively discussions, each author is encouraged to present open questions and one or two main statements that will be discussed at the workshop. Submissions must be either MS-Word or RTF formats (please, DO NOT compress files). Depending on the number and spread of contributions, the scope may be narrowed to ensure effective communication and information sharing. Accepted position papers will be distributed to the participants before the workshop and made generally available through the WWW and FTP. Accepted papers will be published in the Workshop Proceedings of the 31st IEEE Computer Software and Applications Conference (COMPSAC 2007). At least one of the authors of each accepted paper must register as a full participant in the workshop to have the paper published in the COMPSAC 2007 Proceedings. The workshop selected best papers will be published in online Journal of International Journal Of Patterns (IJOP) ? www.ijop.org WORKSHOP PARTICIPATION Interested in participating in the workshop without submission are requested to fill out the participation form and e-mail to the co-chair Haitham Hamza , Eduardo Segura , or to the workshop chair M.E. Fayad . ------------------------------------------------- PARTICIPATION FORM: Name and Affiliation: Position: Address: E-mail: URL: Areas of interest: Why would you like to participate? ------------------------------------------------- Please note that registration is required in order to participate in the workshop. An early registration discount is available. An overhead projector and a flipchart will be available. For more information please visit any of the following websites: http://conferences.computer.org/compsac/2007/workshops/SPAC (Main Link) www.engr.sjsu.edu/~fayad//workshops/COMPSAC07 (Workshop Link 2) www.vrlsoft.com/workshops/SPAC07 (Workshop Link 3 -- Under Construction) You may also contact the organizers. PROPOSED AGENDA 1. Welcome and introduction of participants. The organizers will first give a short overview of any open issues and of the main arguments arising out of the position papers. (Estimated time: 20-30 minutes) 2. Selected authors (representing the main trends) will be given 20 minutes to explain how their position relates to other positions and what each sees as the three major issues. We expect about 5-10 position papers. (Estimated time: 120-130 minutes) 3. The organizers will propose an identification of the major issues, and the participants will then discuss and select what they think are the hottest issues to be examined. (Estimated time: 10-15 minutes) 4. The participants will work for 70-95 minutes in small groups, with a designated moderator in each group. The groups will each deal with two different hot issues identified and will produce a summary in the form of points and counterpoints, showing either how several views are irreducibly opposed or how they are complementary. The number of groups will depend on the number of participants and number of issues selected; ideally there should be 3-5 p people in each group. (Estimated time: 60-70 minutes) 5. Each group will be given 10-15 minutes to present its findings to the workshop. A closing discussion will follow. The workshop report will be written on the basis of these findings and will include an agenda for future exploration and cooperation; it will be made available through the WWW and FTP. (Estimated time: 50-60 minutes for five teams) (Total estimated time: 285-315 minutes, i.e. about five hours +/- 15 minutes; lunch and breaks are not included.) IMPORTANT DATES We will be updated based on acceptance process Mar. 18, 2007: Full paper and short paper due Mar. 25, 2007: Decision notification (electronic) Apr. 30, 2007: Camera-ready copy and author registration due July 24-27, 2007: The workshop Date ORGANIZERS Chair and Point of Contact: Dr. M.E. Fayad Professor of Computer Engineering Computer Engineering Dept., College of Engineering San Jos? State University One Washington Square, San Jos?, CA 95192-0180 Ph: (408) 924-7364, Fax: (408) 924-4153 E-mail: m.fayad at sjsu.edu, me fayad at gmail.com http://www.engr.sjsu.edu/fayad Co-Chairs: Dr. H.S. Hamza (Co-Chair) Faculty of Computers and Informatics, Information Technology Department Cairo University, Orman, Giza 12613 - Egypt Ph: (02) 335-8355 (office) E-mail: hshamza at gmail.com Eduardo M. Segura vrlSoft, Inc. 2065 Martin Ave., Suite 103 Santa Clara, CA 95050-2707 Phone/Fax: (408) 654-8972 E-mail: esegura at vrlsoft.com, eduardo.segura at sjsu.edu http://www.vrlsoft.com PROGRAM COMMITTEE Leonor Barroca OpenUniversity, England Sjaak Brinkkemper UtrechtUniversity, theNetherlands Chia-Chu Chiang UniversityofArkansasatLittleRock, USA Rogerio Atem de Carvalho CEFETCampos, Brazil Andrea D'Ambrogio UniversityofRomaTorVergata, Italy Issam Wajih Damaj DhofarUniversity, Salalah-SultanateofOman Khalil DRIRA LAAS-CNRS, France Islam A. M. El-Maddah AinShamsUniversity, Egypt M.E. Fayad SanJoseStateUniversity&vrlSoft, Inc., USA Joao M. Fernandes UniversidadedoMinho, Portugal IanGraham TriremeInternationalLtd, London, England Jiang Guo CaliforniaStateUniversityLosAngeles, USA Wilhelm Hasselbring UniversityofOldenburg, Germany Tarek Helmy KingFahdUniv.ofPetroleumandMinerals, SaudiArabia H.S. Hamza CairoUniversity, Egypt Pilar Herrero UniversidadPolit?cnicadeMadrid, Spain. Hoda Hosny AmericanUniversityinCairo, Egypt Pao-Ann Hsiung NationalChungChengUniversity, Chiayi, TAIWAN Ali Jaoua UniversityofQatar, Qatar Mohamed-Khireddine KHOLLADI UniversityofConstantine, France Dae-Kyoo Kim OaklandUniversity, MI, USA Seok-Won Lee TheUniversityofNorthCarolinaatCharlotte, USA Jeff Lei UniversityofTexasatArlington, USA Ricardo J. Machado UniversidadedoMinho, Portugal Ahmed Mahdy TexasA&MUniversity-CorpusChristi, USA Michael Oudshoorn MontanaStateUniversity, MT, USA Srini Ramaswamy UniversityofArkansasatLittleRock, USA Gustavo Rossi LIFIA, FacultaddeInformatica, UNLP, Argentina Stuart Rubin SPAWAR, SSC-SanDiego, USA Kannamma Sampath CoimbatoreInstituteofTechnology, India Sanchez, Arturo UniversityofNorthFlorida, USA Kassem A. Saleh AmericanUniversityofSharjah, UAE Arno Schmidmeier AspectSoft, Hersbruck, Germany E.M. Segura SanJoseStateUniversity&vrlSoft, Inc., USA Manolis Tzagarakis ResearchAcademicTechnologyInstitute(RACTI), Greece Laurence T. Yang StFrancisXavierUniversity, Canada I-Ling Yen UniversityofTexasatDallas, USA From birkedal at itu.dk Wed Mar 7 14:31:08 2007 From: birkedal at itu.dk (Lars Birkedal) Date: Wed, 07 Mar 2007 20:31:08 +0100 Subject: [TYPES/announce] Assoc. Professorship Opening Message-ID: <82lki84zr7.fsf@itu.dk> Associate Professorship in Programming, Logic and Semantics at the IT University of Copenhagen, Denmark. The IT University of Copenhagen invites applications for a position as Associate Professor in the Programming, Logic, and Semantics Group. The position is available from August 2007. The Programming, Logic and Semantics (PLS) group at the IT University of Copenhagen conducts research in semantics of logics and programming languages; models for concurrent, mobile and distributed systems; logical frameworks, modular software verification; programming language implementation techniques; program analysis; and programming language technology for distributed and mobile applications, in particular for context-aware mobile computing. The successful candidate must document internationally recognized research in the research areas of the PLS group. Moreover, the applicant should be willing and able to teach in a wide variety of courses at all levels. Please see http://www1.itu.dk/sw58262.asp for the full official announcement. Application deadline is April 16, 2007. Best wishes, Lars Birkedal From wcook at cs.utexas.edu Fri Mar 9 18:36:56 2007 From: wcook at cs.utexas.edu (William Cook) Date: Fri, 9 Mar 2007 17:36:56 -0600 Subject: [TYPES/announce] CfP: Dynamic Languages Symposium 2007 Message-ID: <00c701c762a3$d3be3dc0$0501a8c0@weston> ************************************************************************ * * * Dynamic Languages Symposium 2007 * * at ooPSLA 2007 - http://www.oopsla.org * * * * Montreal, Quebec, Canada, October 22, 2007 * * * * http://www.swa.hpi.uni-potsdam.de/dls07/ * * * ************************************************************************ Important dates: **************** * Submission of papers: June 1, 2007 *hard deadline* * Author notification: June 30, 2007 * Final versions due: July 7, 2007 * DLS 2007: October 22, 2007 * OOPSLA 2007: October 21-25, 2007 Scope: ****** The Dynamic Languages Symposium (DLS) at OOPSLA 2007 in Montreal, Canada, is a forum for discussion of dynamic languages, their implementation and application. While mature dynamic languages including Smalltalk, Lisp, Scheme, Self, and Prolog continue to grow and inspire new converts, a new generation of dynamic scripting languages such as Python, Ruby, PHP, and JavaScript are successful in a wide range of applications. DLS provides a place for researchers and practitioners to come together and share their knowledge, experience, and ideas for future research and development. DLS 2007 invites high quality papers reporting original research, innovative contributions or experience related to dynamic languages, their implementation and application. Accepted Papers will be published in the OOPSLA conference companion and the ACM Digital Library. Areas of interest include but are not limited to: ************************************************* * Innovative language features and implementation techniques * Development and platform support, tools * Interesting applications * Domain-oriented programming * Very late binding, dynamic composition, and runtime adaptation * Reflection and meta-programming * Software evolution * Language symbiosis and multi-paradigm languages * Dynamic optimization * Hardware support * Experience reports and case studies * Educational approaches and perspectives * Object-oriented, aspect-oriented, and context-oriented programming Submissions and proceedings *************************** We invite original contributions that neither have been published previously nor are under review by other refereed events or publications. Research papers should describe work that advances the current state of the art. Experience papers should be of broad interest and should describe insights gained from substantive practical applications. The program committee will evaluate each contributed paper based on its relevance, significance, clarity, and originality. Papers are to be submitted electronically at http://www.dcl.hpi.uni-potsdam.de/dls2007/ in PDF format. Submissions must not exceed 12 pages and need to use the ACM format, templates for which can be found at http://www.acm.org/sigs/pubs/proceed/template.html. Program chairs: *************** * Pascal Costanza, Programming Technology Lab, Vrije Universiteit Brussel, Belgium * Robert Hirschfeld, Hasso-Plattner-Institut, University of Potsdam, Germany Program committee: ****************** * Gilad Bracha, Cadence Design Systems, USA * Johan Brichau, Universite Catholique de Louvain, Belgium * William Clinger, Northeastern University, USA * William Cook, University of Texas at Austin, USA * Pascal Costanza, Vrije Universiteit Brussel, Belgium * Stephane Ducasse, Universite de Savoie, France * Brian Foote, Industrial Logic, USA * Robert Hirschfeld, Hasso-Plattner-Institut Potsdam, Germany * Jeremy Hylton, Google, USA * Shriram Krishnamurthi, Brown University, USA * Michele Lanza, University of Lugano, Switzerland * Michael Leuschel, Universitaet Duesseldorf, Germany * Henry Lieberman, MIT Media Laboratory, USA * Martin von Loewis, Hasso-Plattner-Institut Potsdam, Germany * Philippe Mougin, OCTO Technology, France . Oscar Nierstrasz, University of Berne, Switzerland * Kent Pitman, PTC, USA * Ian Piumarta, Viewpoints Research Institute, USA * Nathanael Schaerli, Google, Switzerland * Anton van Straaten, AppSolutions.com, USA * Dave Thomas, Bedarra Research Labs, Canada * Dave Ungar, USA * Allen Wirfs-Brock, Microsoft, USA * Roel Wuyts, IMEC & Unversite Libre de Bruxelles, Belgium From Pierre-Louis.Curien at pps.jussieu.fr Sat Mar 10 05:49:45 2007 From: Pierre-Louis.Curien at pps.jussieu.fr (Pierre-Louis Curien) Date: Sat, 10 Mar 2007 11:49:45 +0100 Subject: [TYPES/announce] Position announcement in Paris 7 University In-Reply-To: <942C48DE-55E4-11DB-996C-000A95DC36FE@pps.jussieu.fr> References: <942C48DE-55E4-11DB-996C-000A95DC36FE@pps.jussieu.fr> Message-ID: Following a preannouncement posted last October, > A position of Maitre de Conferences (permanent position, more or less > equivalent to "associate professor", or "lecturer") > > ** in mathematics** > > is opened at Paris 7 University. > The hired candidate will work in the laboratory PPS (Preuves, > Programmes et Systemes), which spreads its interests on both sides of > the correspondence between proofs and programs, covering work on > language design and implementation, rewriting, semantics (and game > semantics in particular), categories, linear logic, realizability, > probabilistic and topological methods, etc... See > www.pps.jussieu.fr. > > Th deadline for application is ** March 31 (see more specific info in French below) **, > with decisions taken > around May 2007, and job starting in October 2007. The applicant must have gone through the qualification procedure (cf. preannouncement). > A certain fluency in French is required for the position. The teaching > will be in the mathematics department, so some experience in teaching > mathematics (rather than computer science) is welcome. Teaching is in > French. > > I invite candidates to contact me. > Best regards, > > Pierre=Louis Curien > > curien at pps.jussieu.fr > **** More practical info (in French) **** Ma?tres de conf?rences 25? section : Universit? Paris-VII : math?matiques des preuves et des programmes : 0648. POUR ACCEDER AU TEXTE INTEGRAL DU J.O. par internet : http://www.legifrance.gouv.fr Arr?t? du 16 f?vrier 2007 portant d?claration de vacance d'emplois de professeur des universit?s offerts ? la mutation, au d?tachement et, en application du 1? de l'article 46 du d?cret n? 84-431 du 6 juin 1984 modifi?, au recrutement (1re session 2007) NOR: MENH0700337A Arr?t? du 16 f?vrier 2007 portant d?claration de vacance d'emplois de ma?tre de conf?rences offerts ? la mutation, au d?tachement et, en application du 1? de l'article 26-I du d?cret n? 84-431 du 6 juin 1984 modifi?, au recrutement (1re session 2007) NOR: MENH0700341A Cl?ture des inscriptions dans l'application ANTARES : le 30 mars 2007 ? 16h heure de Paris (et non pas le 27 mars comme indiqu? par erreur aux articles 8 et 13 de l'arr?t? relatif aux professeurs) http://www.education.gouv.fr rubrique ? Concours, emplois, carri?res ? puis ? Personnel enseignant du sup?rieur et chercheurs ? puis ? les enseignants-chercheurs ? Le dossier papier devra ?tre envoy? au plus tard le 30 mars ? minuit (cachet de la poste faisant foi) au service du personnel de l'?tablissement affectataire de l'emploi. From keller at cse.unsw.edu.au Sun Mar 11 19:55:52 2007 From: keller at cse.unsw.edu.au (Gabriele Keller) Date: Mon, 12 Mar 2007 10:55:52 +1100 Subject: [TYPES/announce] Haskell Workshop Call for Papers Message-ID: <1173657352.13131.77.camel@localhost.localdomain> ACM SIGPLAN 2007 Haskell Workshop Call for Papers Freiburg, Germany 30 September, 2007 The Haskell Workshop 2007 will be part of the 2007 International Conference on Functional Programming (ICFP) as an associated, ACM SIGPLAN sponsored workshop. Previous Haskell Workshops have been held in La Jolla (1995), Amsterdam (1997), Paris (1999), Montreal (2000), Firenze (2001), Pittsburgh (2002), Uppsala (2003), Snowbird (2004), Tallinn (2005), and Portland, Oregon (2006) Topics The purpose of the Haskell Workshop is to discuss experience with Haskell, and possible future developments for the language. The scope of the workshop includes all aspects of the design, semantics, theory, application, implementation, and teaching of Haskell. Topics of interest include, but are not limited to, the following: * Language Design, with a focus on possible extensions and modifications of Haskell as well as critical discussions of the status quo; * Theory, in the form of a formal treatment of the semantics of the present language or future extensions, type systems, and foundations for program analysis and transformation; * Implementations, including program analysis and transformation, static and dynamic compilation for sequential, parallel, and distributed architectures, memory management as well as foreign function and component interfaces; * Tools, in the form of profilers, tracers, debuggers, pre-processors, and so forth; * Applications, Practice, and Experience with Haskell for scientific and symbolic computing, database, multimedia and Web applications, and so forth as well as general experience with Haskell in education and industry; * Functional Pearls being elegant, instructive examples of using Haskell. Papers in the latter two categories need not necessarily report original research results; they may instead, for example, report practical experience that will be useful to others, re-usable programming idioms, or elegant new ways of approaching a problem. The key criterion for such a paper is that it makes a contribution from which other practitioners can benefit. It is not enough simply to describe a program! Submission details Submission Deadline: Friday, June 15th 2007 Author Notification: Monday, July 16th 2007 Final Submission: Friday, August 3rd 2007 Submitted papers should be in postscript or portable document format, formatted using the ACM SIGPLAN style guidelines (http://www.acm.org/sigs/sigplan/authorInformation.htm). The length is restricted to 12 pages. Detailed submission instructions will be available at http://haskell.org/haskell-workshop/. Accepted papers will be published by the ACM and will appear in the ACM Digital Library. If there is sufficient demand, we will try to organise a time slot for system or tool demonstrations. If you are interested in demonstrating a Haskell related tool or application, please send a brief demo proposal to Gabriele Keller (keller at cse.unsw.edu.au) Program Committee * Lennart Augustsson, Credit Suisse, UK * Derek Dreyer, Toyota Technological Institute at Chicago, US * Patricia Johann, Department of Computer Science, Rutgers University, US * Gabriele Keller, School of Computer Science and Engineering, University of New South Wales (Program Chair), Australia * Andy Gill, Galois, US * Stephanie Weirich , School of Engineering and Applied Science, University of Pennsylvania, US * Ganesh Sittampalam, Credit Suisse, UK * Ross Patterson, Programming Languages and Systems Group, City University London, UK * Doaitse Swierstra, Department of Computer Science, Utrecht University, The Netherlands * Chung-chieh Shan, Department of Computer Science, Rutgers University, US -- =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- Dr. Gabriele Keller, Senior Lecturer Tel: +61-2-9385-6032 School of Computing Sciences & Engineering Fax: +61-2-9385-5995 University of New South Wales NSW 2052 Australia From lutz at lix.polytechnique.fr Mon Mar 12 10:29:17 2007 From: lutz at lix.polytechnique.fr (Lutz Strassburger) Date: Mon, 12 Mar 2007 15:29:17 +0100 (CET) Subject: [TYPES/announce] Post Doc Position in Paris Message-ID: -------------------------------------------------------- Postdoc Positions on Proof Theory in Paris -------------------------------------------------------- I am pleased to announce the opening of a postdoc position which is financed by the ANR within the project INFER This project is a grouping of three teams through their common interest for a new approach to proof theory, called deep inference, that has been developed during the last seven years. We aim at refining its enormous potential and at applying it to problems related to the foundations of logic and to more practical questions in the algorithmics of deductive systems. The working place of the postdoc will be in the suburbs of Paris at the Ecole Polytechnique which is one of the "Grand Ecoles" in the French education system. Applicants must have a Ph.D. or equivalent in computer science or mathematics, and should have a strong background in proof theory and/or related topics. The principal responsibility of the postdoc will be to carry out research in the area of deep inference. There are no teaching duties. For more information, please contact: Lutz Strassburger Applications should be sent via email to Lutz Strassburger , and should include a CV, a short research proposal (1-2 pages), and one or two recommendation letters. The position is open now, and applications are considered until the position is filled. Furthermore, I'd like to draw the attention to an INRIA postdoc offer on a related topic: http://www.talentsplace.com/syndication1/inria/ukpostdoc/details.html?id=PNGFK026203F3VBQB6G68LOE1&LOV5=4508&LOV2=4493&LOV6=4514&LG=EN&Resultsperpage=20&nPostingID=1124&nPostingTargetID=3132&option=52&sort=DESC&nDepartmentID=19 For this applications have to made online via the INRIA webpage (deadline 31 March). Nonetheless, potential applicants should contact me via email. Best regards, Lutz Strassburger From aserebre at win.tue.nl Mon Mar 12 16:46:46 2007 From: aserebre at win.tue.nl (A Serebrenik) Date: Mon, 12 Mar 2007 21:46:46 +0100 (CET) Subject: [TYPES/announce] CFP: LOPSTR 2007 International Symposium on Logic-Based Program Synthesis and Transformation Message-ID: Call for papers International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2007 22-24 August 2007, Kongens Lyngby, Denmark (co-located with SAS 2007) url: http://www.cs.kent.ac.uk/events/conf/2007/lopstr/ email: lopstr-2007 at kent.ac.uk Objectives: The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium, so authors can incorporate this feedback in the published papers. Topics: Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large. Papers describing applications in these areas are especially welcome. Contributions are welcome on all aspects of logic-based program development, including, but not limited to: specification synthesis verification transformation analysis optimisation composition security reuse applications and tools component-based software development software architectures agent-based software development program refinement Survey papers, that present some aspect of the above topics from a new perspective, and application papers, that describe experience with industrial applications, are also welcome. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with refereed proceedings. Submission information and Special Issue: Submissions can either be (short) extended abstracts or (full) papers whose length should not exceed 9 and 15 pages respectively. Submissions must be formatted in LNCS style (excluding bibliography and well-marked appendices not intended for publication). Referees are not required to read the appendices, and thus papers should be intelligible without them. After the symposium, the programme committee will select those papers to be considered for formal publication. These authors will be invited to revise their submissions in the light of the feedback solicited at the meeting. Then after another round of reviewing, these revised papers will be published by Springer-Verlag in the Lecture Notes in Computer Science series. The very best papers will additionally be invited to submit for a special issue or special track of the journal Higher-Order and Symbolic Computation, provided there are sufficient high-quality submissions. Papers should be submitted either in PostScript or PDF format and they should be interpretable by Ghostscript or Acrobat Reader. Invited Speaker: Michael Codish (Ben-Gurion University of the Negev, Israel) Program Committee: Elvira Albert (Universidad Complutense Madrid, Spain) John Gallagher (University of Roskilde, Denmark) Michael Hanus (Christian-Albrechts-Universit?t zu Kiel, Germany) Jacob Howe (City University, UK) Andy King (University of Kent, UK) Michael Leuschel (Heinrich-Heine-Universit?t D?sseldorf, Germany) Mario Ornaghi (Universit? degli Studi di Milano, Italy) ?tienne Payet (Universit? de La R?union, France) Alberto Pettorossi (Universit? di Roma Tor Vergata, Italy) Carla Piazza (Universit? degli Studi di Udine, Italy) C. R. Ramakrishnan (SUNY Stony Brook, USA) Abhik Roychoudhury (National University of Singapore, Singapore) Peter Schneider-Kamp (RWTH Aachen, Germany) Alexander Serebrenik (Technische Universiteit Eindhoven, Netherlands) Josep Silva (Technical University of Valencia, Spain) Wim Vanhoof (University of Namur, Belgium) Important dates: Submission of paper/extended abstract June 8, 2007 Notification July 13, 2007 Revised version (for pre-proceedings) August 10, 2007 Symposium August 22-24, 2007 Camera-ready version (for post-proceedings) December 14, 2007 From carette at mcmaster.ca Mon Mar 12 17:25:40 2007 From: carette at mcmaster.ca (Jacques Carette) Date: Mon, 12 Mar 2007 17:25:40 -0400 Subject: [TYPES/announce] Programming Languages for Mechanized Mathematics Workshop Message-ID: <45F5C554.1020705@mcmaster.ca> [The main aspect which separates many approaches to mechanized mathematics is the importance (or lack thereof) of types. Most of mathematics requires dependent types at some level or another, making this an interesting testing ground for types members] Programming Languages for Mechanized Mathematics Workshop As part of Calculemus 2007 Hagenberg, Austria [http://www.cas.mcmaster.ca/plmms07/] The intent of this workshop is to examine more closely the intersection between programming languages and mechanized mathematics systems (MMS). By MMS, we understand computer algebra systems (CAS), [automated] theorem provers (TP/ATP), all heading towards the development of fully unified systems (the MMS), sometimes also called universal mathematical assistant systems (MAS) (see Calculemus 2007 ). There are various ways in which these two subjects of /programming languages/ and /systems for mathematics/ meet: * Many systems for mathematics contain a dedicated programming language. For instance, most computer algebra systems contain a dedicated language (and are frequently built in that same language); some proof assistants (like the Ltac language for Coq) also have an embedded programming language. Note that in many instances this language captures only algorithmic content, and /declarative/ or /representational/ issues are avoided. * The /mathematical languages/ of many systems for mathematics are very close to a functional programming language. For instance the language of ACL2 is just Lisp, and the language of Coq is very close to Haskell. But even the mathematical language of the HOL system can be used as a functional programming language that is very close to ML and Haskell. On the other hand, these languages also contain very rich specification capabilities, which are rarely available in most computation-oriented programming languages. And even then, many specification languages ((B, Z, Maude, OBJ3, CASL, etc) can still teach MMSes a trick or two regarding representational power. * Conversely, functional programming languages have been getting "more mathematical" all the time. For instance, they seem to have discovered the value of dependent types rather recently. But they are still not quite ready to 'host' mathematics (the non-success of docon being typical). There are some promising languages on the horizon (Epigram , Omega ) as well as some hybrid systems (Agda , Focal ), although it is unclear if they are truly capable of expressing the full range of ideas present in mathematics. * Systems for mathematics are used to prove programs correct. (One method is to generate "correctness conditions" from a program that has been annotated in the style of Hoare logic and then prove those conditions in a proof assistant.) An interesting question is what improvements are needed for this both on the side of the mathematical systems and on the side of the programming languages. We are interested in all these issues. We hope that a certain synergy will develop between those issues by having them explored in parallel. These issues have a very colourful history. Many programming language innovations first appeared in either CASes or Proof Assistants, before migrating towards more mainstream languages. One can cite (in no particular order) type inference, dependent types, generics, term-rewriting, first-class types, first-class expressions, first-class modules, code extraction, and so on. However, a number of these innovations were never aggressively pursued by system builders, letting them instead be developped (slowly) by programming language researchers. Some, like type inference and generics have flourished. Others, like first-class types and first-class expressions, are not seemingly being researched by anyone. We want to critically examine what has worked, and what has not. Why are all the current ``popular'' computer algebra systems untyped? Why are the (strongly typed) proof assistants so much harder to use than a typical CAS? But also look at question like what forms of polymorphism exists in mathematics? What forms of dependent types exist in mathematics? How can MMS regain the upper hand on issues of 'genericity'? What are the biggest barriers to using a more mainstream language as a host language for a CAS or an ATP? This workshop will accept two kinds of submissions: full research papers as well as position papers. Research papers should be nore more than 15 pages in length, and positions papers no more than 3 pages. Submission will be through _EasyChair_. An informal version of the proceedings will be available at the workshop, with a more formal version to appear later. We are looking into having the best papers completed into full papers and published as a special issue of a Journal (details to follow). Important Dates April 25, 2007: Submission Deadline June 29-30, 2007: Workshop Program Committee Lennart Augustsson [Credit Suisse] Wieb Bosma [Radboud University Nijmegen, Netherlands] Jacques Carette (co-Chair) [McMaster University, Canada] David Delahaye [CNAM, France] Jean-Christophe Filli?tre [CNRS and Universit? de Paris-Sud, France] John Harrison [Intel Corporation, USA] Markus (Makarius) Wenzel [Technische Universit?t M?nchen, Germany] Freek Wiedijk (co-Chair) [Radboud University Nijmegen, Netherlands] Wolfgang Windsteiger [University of Linz, Austria] Location and Registration Location and registration information can be found on the Calculemus web site. -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070312/0888ff79/attachment.htm From Susanne.Graf at imag.fr Tue Mar 13 02:33:48 2007 From: Susanne.Graf at imag.fr (Susanne Graf) Date: Tue, 13 Mar 2007 07:33:48 +0100 Subject: [TYPES/announce] 1st Call for Papers: ATVA 2007 Message-ID: <45F645CC.4070804@imag.fr> CALL FOR PAPERS ********************************************************************* ATVA 2007 Fifth International Symposium on Automated Technology for Verification and Analysis http://www.yt.cs.titech.ac.jp/atva2007/ Tokyo, Japan, October 22-24, 2007 ********************************************************************* Sponsored by National Institute of Informatics, Japan Kayamori Foundation of Information Science Advancement --------------------------------------------------------------------- IMPORTANT DATES Submission of papers (firm): May 14, 2007 Notification of authors : June 25, 2007 Camera-ready papers : July 23, 2007 --------------------------------------------------------------------- INVITED SPEAKERS Martin Abadi (UCSC, Microsoft Research) Ken McMillan (Cadence Berkeley Labs) Moshe Vardi (Rice Univ.) --------------------------------------------------------------------- INTRODUCTION ============ ATVA 2007 is the fifth in the series of symposia on Automated Technology for Verification and Analysis. The purpose of ATVA is to promote research on theoretical and practical aspects of automated analysis, verification and synthesis in East Asia by providing a forum for interaction between the regional and the international research communities and industry in the field. The first three ATVA symposia were held in 2003, 2004 and 2005 in Taipei, and ATVA 2006 was held in Beijing. The Proceedings of ATVA 2007 will be published by Springer as a volume in the LNCS series. Submissions reporting original contributions are solicited in all areas of automated verification and analysis. Please visit the ATVA 2007 Web site for details not found in this CFP. SCOPE ===== The scope of interest is intentionally kept broad; it includes : - Theory useful for providing designers with automated support for obtaining correct software or hardware systems, including both functional and non functional aspects, such as: theory on (timed) automata, Petri-nets, concurrency theory, compositionality, model-checking, automated theorem proving, synthesis, performance analysis, correctness-by-construction results, infinite state systems, abstract interpretation, decidability results, parametric analysis or synthesis. - Applications of theory in engineering methods and particular domains and handling of practical problems occurring in tools, such as: analysis and verification tools, synthesis tools, reducing complexity of verification by abstraction, improved representations, handling user level notations, such as UML, practice in industry applications to hardware, software or real-time and embedded systems. Case studies, illustrating the usefulness of tools or a particular approach are also welcome. Theory papers should be motivated by practical problems and applications should be rooted in sound theory. Of particular interest are algorithms on one hand and methods and tools for integrating formal approaches into industrial practice. Special care should be taken as well to present papers in such a way that they are accessible not only to specialists, that is, jargon need to be defined and intuitive interpretation provided for theories. SUBMISSIONS =========== A submitted paper must contain original contributions, clearly written in English, and include comparison with related work. The authors are advised to prepare their manuscripts using the LNCS style. Each paper should be no more than 15 pages long and be submitted electronically via the ATVA 2007 Web site. Simultaneous submissions to other conferences are not allowed. ORGANISATION ================ GENERAL CO-CHAIRS: Teruo Higashino (Osaka Univ., Japan) Yoshio Okamura (STARC, Japan) PROGRAM CO-CHAIRS: Kedar Namjoshi (Bell Labs, USA) Tomohiro Yoneda (National Institute of Informatics, Japan) PROGRAM COMMITTEE ================= Rajeev Alur (University of Pennsylvania) Christel Baier (University of Dresden) Jonathan Billington (University of South Australia) Sung-Deok Cha (Korea Advanced Inst. of Sci. and Techn.) Ching-Tsun Chou (Intel) Jin Song Dong (National University of Singapore) E. Allen Emerson (University of Texas at Austin) Masahiro Fujita (University of Tokyo) Susanne Graf (VERIMAG) Wolfgang Grieskamp (Microsoft research) Teruo Higashino (Osaka University) Kiyoharu Hamaguchi (Osaka University) MoonZoo Kim (KAIST) Orna Kupferman (Hebrew University) Robert P. Kurshan (Cadence) Insup Lee (University of Pennsylvania) Xuandong Li (Nanjing University) Shaoying Liu (Hosei University) Zhiming Liu (IIST/United Nations University) Mila E. Majster-Cederbaum (University of Mannheim) Shin Nakajima (National Institute of Informatics) Akio Nakata (Osaka University) Kedar Namjoshi (Bell Labs) Mizuhito Ogawa (JAIST) Olaf Owe (University of Oslo) Doron A. Peled (University of Warwick) Mike Reed (UNU-IIST, Macao) Hiroyuki Seki (NAIST) Xiaoyu Song (Portland State University) Yih-Kuen Tsay (National Taiwan University) Irek Ulidowski (Leicester University) Bow-Yaw Wang (Academia Sinica) Farn Wang (National Taiwan University) Yi Wang (Uppsala University) Baowen Xu (Southeast University of China) Hsu-Chun Yen (National Taiwan University) Tomohiro Yoneda (National Institiute of Informatics) Shoji Yuen (Nagoya University) Wenhui Zhang (Chinese Academy of Sciences) Lenore Zuck (University of Illinois at Chicago) STEERING COMMITTEE ================== E.A. Emerson (University of Texas at Austin, USA) Oscar H. Ibarra (University of California, Santa Barbara, USA) Insup Lee (University of Pennsylvania, USA) Doron A. Peled (University of Warwick, UK) Farn Wang (National Taiwan University, Taiwan) Hsu-Chun Yen (National Taiwan University, Taiwan) From icfp.publicity at googlemail.com Tue Mar 13 12:33:02 2007 From: icfp.publicity at googlemail.com (Matthew Fluet (ICFP Publicity Chair)) Date: Tue, 13 Mar 2007 11:33:02 -0500 Subject: [TYPES/announce] ICFP07 Final CFP & Note from the Program Chair Message-ID: <53ff55480703130933n1675e3e3x8764cdadfffa7f11@mail.gmail.com> Call for Papers ICFP 2007: International Conference on Functional Programming Freiburg, Germany, 1-3 October 2007 Important Dates ~~~~~~~~~~~~~~~ Submission: 11:00 6 April 2007, Samoa time (AST) Author response: 11:00 23 May to 11:00 25 May 2007 (AST) Notification: 8 June 2007 Final papers due: 20 July 2007 Note from the ICFP07 Program Chair As the April 6 deadline for ICFP approaches, we thought it might be useful to call potential authors' attention to several significant points in the Call for Papers, the full text of which can be found at http://icfp07.eecs.harvard.edu/cfp.html Experience Reports ~~~~~~~~~~~~~~~~~~ This year ICFP is soliciting a new category of paper: the Experience Report. An Experience Report is a short paper of 2--4 pages. Unlike a normal ICFP paper, it is not intended to add to the body of *knowledge* of the functional-programming community. Rather, each Experience Report will add to a body of published, refereed, citable *evidence* that functional programming really works--or will describe obstacles that prevented it from working. Double-blind review ~~~~~~~~~~~~~~~~~~~ A reviewer's attitude toward a submission may be affected, even unconsciously, by the identity of the author. Our reviewers want to be able to approach each submission without such involuntary reactions as ``Peyton Jones; he writes a good paper'' or ``Who are these people? I have never heard of them.'' We especially want to ensure that work submitted by newcomers to our community gets the same careful consideration and scrutiny as the work of our best-known people. We are therefore requesting that authors make it possible for their submissions to be reviewed without forcing the reviewers to know who the authors are. Once all reviews are written, identities will be revealed at the PC meeting. For authors, this process should be simple: * Omit authors' names from your title page (or list them as ``omitted for submission''), and when you cite your own work, please make it difficult to figure out exactly who you are, even if a reviewer might be able to make a good guess. * If your submission is supported by other material, such as a technical report containing lengthy proofs, please do not cite this material on the web---instead, submit a zip file including both your paper and the technical report. Detailed guidelines can be found at http://icfp07.eecs.harvard.edu/blind.html Firm length limit; no appendices ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ The 12-page limit (for full papers) and 4-page limit (for Experience Reports) are *firm*. Papers exceeding these limits will be rejected summarily by the program chair. If an author wishes to include an appendix which would put the main submission over the limit, the appendix must be submitted as a separate document, in a zip file with the main submission. It is understood that the reviewers' only obligation is to read the main submission; material beyond the 12-page limit may well go unread. Other details ~~~~~~~~~~~~~ We are encouraging author-date citations (Peyton Jones and Wadler 1993) rather than the default numbered citations [27]. LaTeX users can \usepackage{natbib} and \bibliographystyle{plainnat}. The submission deadline is late morning Samoan time, but in many times zones of interest, this is equivalent to late afternoon or early evening. From matthes at informatik.uni-muenchen.de Tue Mar 13 14:45:56 2007 From: matthes at informatik.uni-muenchen.de (Ralph Matthes) Date: Tue, 13 Mar 2007 19:45:56 +0100 Subject: [TYPES/announce] CFP: Higher-Order Rewriting 2007 Message-ID: <45F6F164.2010706@informatik.uni-muenchen.de> ********************************** * * * HOR 2007 CALL FOR ABSTRACTS * * * ********************************** 4th International Workshop on Higher-Order Rewriting Monday June 25, 2007, Paris, France http://www.rdp07.org/hor.html IMPORTANT DATES: April 13, 2007 : deadline electronic submission of paper May 11, 2007 : notification of acceptance of papers June 4, 2007 : deadline for final version of accepted papers HOR 2007 is a forum to present work concerning all aspects of higher-order rewriting. The aim is to provide an informal and friendly setting to discuss recent work and work in progress. HOR 2002 was part of FLoC 2002 in Copenhagen, Denmark. HOR 2004 was part of RDP 2004 in Aachen, Germany. HOR 2006 was part of FLoC 2006 in Seattle, USA. HOR 2007 will be part of RDP 2007 in Paris. This year, HOR enjoys additionally the status of a "small workshop" of the TYPES project, see http://www.cs.chalmers.se/Cs/Research/Logic/Types/ There will also be a "small TYPES workshop" on Type theory, proof theory and rewriting (TPR '07), 4 days later in Paris. INVITED TALKS: Carsten Sch?rmann, IT University of Copenhagen, Denmark (confirmed) (another person, to be confirmed) TOPICS of interest include (but are not limited to): APPLICATIONS: proof checking, theorem proving, generic programming, declarative programming, program transformation. FOUNDATIONS: pattern matching, unification, strategies, narrowing, termination, syntactic properties, type theory. FRAMEWORKS: term rewriting, conditional rewriting, graph rewriting, net rewriting, comparisons of different frameworks. IMPLEMENTATION: explicit substitution, rewriting tools, compilation techniques. SEMANTICS: semantics of higher-order rewriting, higher-order abstract syntax STEERING COMMITTEE Delia Kesner Universit? Paris 7, France Femke van Raamsdonk Vrije Universiteit, The Netherlands PROGRAM COMMITTEE Herman Geuvers (Radboud University Nijmegen, Netherlands) Makoto Hamana (Gunma University, Japan) Ralph Matthes (C.N.R.S., University of Toulouse III, France), chair Albert Rubio (Technical University of Catalonia, Spain) Mark-Oliver Stehr (SRI International, U.S.A.) HOR 2007 SUBMISSIONS: Abstracts between 2 and 5 pages. As HOR is meant to be a platform to discuss ongoing research we are also interested in abstracts describing work in progress, or problems in higher-order rewriting. Please use the EasyChair page http://www.easychair.org/HOR2007/ to submit or update your paper. Please address your questions to the PC chair, under family_name at irit.fr. PROCEEDINGS: The proceedings of HOR 2007 will be made available on the HOR 2007 web page and copies will be distributed to the participants at the workshop. LOCAL ARRANGEMENTS: The organizers of RDP 2007 (Antonio Bucciarelli, Vincent Padovani, Ralf Treinen, Xavier Urbain), reachable trough oc at rdp07.org From shao at cs.yale.edu Wed Mar 14 11:26:27 2007 From: shao at cs.yale.edu (Zhong Shao) Date: Wed, 14 Mar 2007 10:26:27 -0500 (EST) Subject: [TYPES/announce] CFP: APLAS 2007 (The Fifth Asian Symposium on Programming Languages and Systems) Message-ID: <20070314152627.A44E93F21E@daffy.cs.yale.edu> The Fifth ASIAN Symposium on Programming Languages and Systems (APLAS 2007) CALL FOR PAPERS Singapore November 29 - December 1, 2007 http://flint.cs.yale.edu/aplas2007/ APLAS aims at stimulating programming language research by providing a forum for the presentation of recent results and the exchange of ideas and experience in topics concerned with programming languages and systems. APLAS is based in Asia, but is an international forum that serves the worldwide programming languages community. The APLAS series is sponsored by the Asian Association for Foundation of Software (AAFS), which has recently been founded by Asian researchers in cooperation with many researchers from Europe and the USA. The past formal APLAS symposiums were successfully held in Sydney (2006, Australia), Tsukuba (2005, Japan), Taipei (2004, Taiwan) and Beijing (2003, China) after three informal workshops held in Shanghai (2002, China), Daejeon (2001, Korea) and Singapore (2000). Proceedings of the past symposiums were published in Springer-Verlag's LNCS 2895, 3302, 3780, and 4279. TOPICS: The symposium is devoted to both foundational and practical issues in programming languages and systems. Papers are solicited on, but not limited, to the following topics: * semantics, logics, foundational theory * type systems, language design * program analysis, optimization, transformation * software security, safety, verification * compiler systems, interpreters, abstract machines * domain-specific languages and systems * programming tools and environments Original results that bear on these and related topics are solicited. Papers investigating novel uses and applications of language systems are especially encouraged. Authors concerned about the appropriateness of a topic are welcome to consult with the program chair (shao at cs.yale.edu) prior to submission. IMPORTANT DATES: Paper Submission Deadline: 11:00 AM (in Samoan Time), June 15, 2007 Author Notification: August 17, 2007 Camera Ready: September 7, 2007 Conference: November 29-December 1, 2007 SUBMISSIONS INFORMATION: Papers should be submitted electronically online via the conference submission webpage. Acceptable formats are PostScript or PDF, viewable by Ghostview or Acrobat Reader. Submissions should not exceed 16 pages in LNCS format, including bibliography and figures. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should clearly identify what has been accomplished and why it is significant. Submitted papers must be unpublished and not submitted for publication elsewhere. The proceedings of the symposium is planned to be published as a volume in Springer-Verlag's Lecture Notes in Computer Science series. GENERAL CHAIR Joxan Jaffar (National University of Singapore, Singapore) PROGRAM CHAIR Zhong Shao (Yale University, USA) PROGRAM COMMITTEE Lars Birkedal (IT University of Copenhagen, Denmark) Martin Hofmann (Univ of Munich, Germany) Kohei Honda (Queen Mary, University of London, UK) Atsushi Igarashi (Kyoto University, Japan) Suresh Jagannathan (Purdue University, USA) Annie Liu (State University of New York at Stony Brook, USA) Shin-Cheng Mu (Academia Sinica, Taiwan) Henrik Nilsson (University of Nottingham, UK) Michael Norrish (NICTA, Australia) Jens Palsberg (University of California, Los Angeles, USA) G. Ramalingam (Microsoft Research, India) Zhong Shao (Yale University, USA) Zhendong Su (University of California, Davis, USA) Martin Sulzmann (National University of Singapore, Singapore) Eijiro Sumii (Tohoku University, Japan) J?r?me Vouillon (CNRS, France) Kwangkeun Yi (Seoul National University, Korea) Jian Zhang (Chinese Academy of Sciences, China) LOCAL ARRANGEMENT CHAIR Wei-Ngan Chin (National University of Singapore, Singapore) From hwxi at cs.bu.edu Wed Mar 14 13:45:00 2007 From: hwxi at cs.bu.edu (Hongwei Xi) Date: Wed, 14 Mar 2007 12:45:00 -0500 (EST) Subject: [TYPES/announce] CFP for PLPV 2007 Message-ID: Call For Papers: Programming Languages meets Program Verification (PLPV) 2007 A workshop affiliated with ICFP 2007 Date: October 5th, 2007 URL: http://www.plpv.org *Topic*. PLPV is concerned with language-based approaches to program verification. These approaches integrate programming language semantics and verification techniques in a tighter way than is typically done in traditional verification. In some cases, this is done by designing the programming language to facilitate program verification, possibly through an expressive type system. In other cases, tighter integration is achieved by exporting more statically computed semantic information from the program to an external verification engine or environment. In all cases, the motivation is to reduce the burden of program verification by taking greater advantage of static properties (like type properties) of the program during verification. *Paper Topics*. Research on language-based approaches to program correctness spans compilers, programming languages, and computational logic. Possible paper topics include: -- practical programming with dependent types (possibly addressing issues such as mutable state and other effectful constructs). -- extended static checking; type systems and other static analyses relying on semantically rich program annotations. -- integration of theorem proving and programming environments. -- improving performance or quality of verification algorithms using richer semantic information (like type information) about the program. -- programming language constructs or methodologies where artifacts are included solely to convince the type checker that a piece of code is type safe (e.g., type representations, equality types). -- meta-theoretic properties of languages for programming with proofs or other evidential artifacts. *Submissions*. Submissions should be prepared with ACM SIGPLAN two-column conference format and fall into one of the following three categories: (1) Regular research papers (at most 12 pages in total length). Submissions in this category should describe new work on the above or related topics (not currently submitted elsewhere for publication). (2) Experience reports (at most 6 pages in total length). Submissions in this category should report on interesting worked examples as well as practical insights. They should focus on experience gained during implementation (and not on theoretical results). (3) Proposals for challenge problems (at most 6 pages in total length). Submissions in this category should describe an application problem, for which language-based program verification techniques could be applied to establish correctness. The application should be of appropriate size and complexity to serve as a challenge problem (with, for example, Microsoft Office being too large and merge-sort too small). Preference will be given to broadly used applications, and to ones where correctness is of demonstrable importance (a crucial piece of Internet infrastructure might be an example). *Review Process*. Each submission will receive three reviews. The PC members (except the co-chairs) may submit either kind of paper. Reviewing (as well as submission) will be managed using the EasyChair system, which prevents PC members from accessing discussions of their own papers. *Publication*. Accepted papers will be published by the ACM and appear in the ACM digital library. *Important Dates*. -- Electronic submission: June 15. -- Notification: July 13. -- Final version: August 3. -- Workshop: October 5. *Invited Speaker*: TBA *Organizers*. -- Aaron Stump (Washington University in St. Louis) -- Hongwei Xi (Boston University) *Program Committee*. -- Peter Dybjer (Chalmers, Sweden) -- John Hughes (Chalmers, Sweden) -- Conor McBride (University of Nottingham, UK) -- Stefan Monnier (University of Montreal, Canada) -- Brigitte Pientka (McGill University, Canada) -- Francois Pottier (INRIA, France) -- Chung-chieh Shan (Rutgers, USA) -- Tim Sheard (Portland State University, USA) -- Aaron Stump, co-chair (Washington University in St. Louis, USA) -- Martin Sulzmann (NUS, Singapore) -- Walid Taha (Rice University, USA) -- Simon Thompson (University of Kent, UK) -- Hongwei Xi, co-chair (Boston University, USA) From areces at loria.fr Thu Mar 15 06:25:56 2007 From: areces at loria.fr (Carlos Areces) Date: Thu, 15 Mar 2007 11:25:56 +0100 Subject: [TYPES/announce] EUROCORES Programme LogICCC - CfP Message-ID: <45F91F34.2070307@loria.fr> ----------------------------------------------------------------------- ## Please feel free to circulate this message ## Dear colleagues, Following agreement with funding organisations in Austria, Belgium, Croatia, Cyprus, Czech Republic, Denmark, Finland, France, Germany, Israel, Netherlands, Portugal, Rumania, Spain, Sweden and Turkey, the European Science Foundation is launching a Call for Outline Proposals for Collaborative Research Projects to be undertaken within the EUROCORES Programme ?Modelling intelligent interaction - Logic in the Humanities, Social and Computational sciences (LogICCC)?. The deadline for Outline Proposals is 11 May 2007, 12:00 PM (noon). The Call has been published on the ESF website at http://www.esf.org/logic, where you will also find useful information on the maximum number of individual projects that the participating funding agencies are able to fund. For your convenience, these documents have also been enclosed. Please note that applicants should contact their national funding agencies in order to verify their eligibility and to ensure compliance with the relevant agencies? current granting rules and regulations. Contact details can be found in the Call for Proposals. If you have any further questions about the Call, do not hesitate to contact me. Yours sincerely, Eva Hoogland Dr. Eva Hoogland EUROCORES Coordinator for the Cognitive Sciences European Science Foundation 1, quai Lezay Marn?sia F-67080 Strasbourg France +33 (0)3 88 76 2183 logic at esf.org -------------- next part -------------- A non-text attachment was scrubbed... Name: Call for Outline Proposals LogiCCC.pdf Type: application/octet-stream Size: 367288 bytes Desc: not available Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070315/3ed1bdcd/CallforOutlineProposalsLogiCCC.bin -------------- next part -------------- A non-text attachment was scrubbed... Name: Funding Information to Community.pdf Type: application/octet-stream Size: 219819 bytes Desc: not available Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070315/3ed1bdcd/FundingInformationtoCommunity.dll From mislove at tulane.edu Thu Mar 15 10:08:28 2007 From: mislove at tulane.edu (Michael Mislove) Date: Thu, 15 Mar 2007 09:08:28 -0500 Subject: [TYPES/announce] MFPS 23 Call for Participation Message-ID: <472BEE16-F0D0-45DB-871E-30A55A0F6D2D@tulane.edu> Dear Colleagues, This is a Call for Participation for the 23rd Conference on the Mathematical Foundations of Programming Semantics. The meeting will take place on the campus of Tulane University in New Orleans, LA from April 11 through April 14. The meeting will include invited lectures by Stephen Brookes (CMU), Jane Hillston (Edinburgh), John Mitchell (Stanford), Gordon Plotkin (Edinburgh) and John Power (Edinburgh). In addition there will be a special session honoring Gordon Plotkin on the 60th birthday, as well as special sessions on Security, on Systems Biology and on Physics, Information and Computation. The balance of the program is made up of papers submitted in response to the Call for Papers that was circulated last fall. A copy of the full program is available at http://www.math.tulane.edu/~mfps/program23.htm In addition to the conference, there will be a Tutorial Day on Domain Theory on April 10, with lectures by Achim Jung (Birmingham), Alex Simpson (Edinburgh), Andrej Bauer (Slovenia) and Giuseppe Rosolini (Genoa). To find out more about the meeting and to register, point your browser at http://www.math.tulane.edu/~mfps/mfps23.htm Best regards, Mike Mislove =============================================== Professor Michael Mislove Phone: +1 504 862-3441 Department of Mathematics FAX: +1 504 865-5063 Tulane University URL: http://www.math.tulane.edu/~mwm New Orleans, LA 70118 USA =============================================== From tobias at dsv.su.se Thu Mar 15 17:51:43 2007 From: tobias at dsv.su.se (Tobias Wrigstad) Date: Thu, 15 Mar 2007 22:51:43 +0100 Subject: [TYPES/announce] CFP: Workshop on Aliasing, Confinement and Ownership in OOP Message-ID: <31B2DB48-9326-4A25-B9F2-ABC378C2D106@dsv.su.se> (** Apologies for multiple copies **) International Workshop on Aliasing, Confinement and Ownership in object-oriented programming (IWACO) July 30 (tentative), 2007 in conjunction with ECOOP 2007 Berlin, Germany July 30th to August 3rd http://dsv.su.se/~tobias/iwaco2007.html Call For Papers =============== The power of objects lies in the flexibility of their inter- connection structure. But this flexibility comes at a cost. Because an object can be modified via any alias, object-oriented programs are hard to understand, maintain, and analyse. Aliasing makes objects depend on their environment in unpredictable ways, breaking the encapsulation necessary for reliable software components, making it difficult to reason about and optimise programs, obscuring the flow of information between objects, and introducing security problems. Aliasing is a fundamental difficulty, but we accept its presence. Instead we seek techniques for describing, reasoning about, restricting, analysing, and preventing the connections between objects and/or the flow of information between them. Promising approaches to these problems are based on ownership, confinement, information flow, sharing control, escape analysis, argument independence, read-only references, effects systems, and access control mechanisms. The workshop will generally address the question how to manage interconnected object structures in the presence of aliasing. In particular, we will consider the following issues (among others): * models, type and other formal systems, separation logic, programming language mechanisms, analysis and design techniques, patterns, tools and notations for expressing object ownership, aliasing, confinement, uniqueness, and/or information flow. * optimisation techniques, analysis algorithms, libraries, applications, tools, and novel approaches exploiting object ownership, aliasing, confinement, uniqueness, and/or information flow. * empirical studies of programs or experience reports from programming systems designed with these issues in mind * novel applications of aliasing management techniques such as ownership types, ownership domains, confined types, region types, and uniqueness. We encourage not only submissions presenting original research results, but also papers that attempt to establish links between different approaches and/or papers that include survey material. Original research results should be clearly described, and their usefulness to practitioners outlined. Paper selection will be based on the quality of the submitted material. The best papers will appear in a special issue of the IET Software journal. A workshop report written by the organisers will be published in the ECOOP workshop reader after the ECOOP conference. The workshop will be held as part of the ECOOP'07 conference taking place in Berlin, Germany. Invited Speaker --------------- Vijay Saraswat (IBM TJ Watson Research Lab and Penn State University) Programme Committee ------------------- Jonathan Aldrich (Carnegie Mellon University) Chandrasekhar Boyapati (University of Michigan) Dave Clarke (CWI) Sophia Drossopoulou (Imperial College) Rustan Leino (Microsoft Research) Peter M?ller (ETH Zurich) James Noble (Victoria University of Wellington) Peter O'Hearn (Queen Mary, University of London) Alex Potanin (Victoria University of Wellington) Jan Vitek (Purdue University) Tobias Wrigstad (Stockholm University) Important Dates --------------- Submission: May 13, 2007 Notification: June 6, 2007 Final version: June 29, 2007 Workshop: July 30 (tentative), 2007 ECOOP'07 Early Registration: June 15th. Organisers ---------- Dave Clarke (CWI) James Noble (Victoria University of Wellington) Tobias Wrigstad (Stockholm University) Participation ------------- The number of participants is limited to 25. Apart from those with accepted papers, others may attend by sending an email to Tobias Wrigstad (tobias at dsv.su.se) indicating what contribution you could make to the workshop. A small number of places will be reserved for PhD students and other researchers wishing to begin research in this area. Selection Process ----------------- Both full papers (up to 10 pgs.) and position papers (1-2 pgs.) are welcome. All submissions will be reviewed by the programme committee. The accepted papers, after rework by the authors, will be published in the Workshop Proceedings, which will be distributed at the workshop. All accepted submissions shall remain available from the workshop web page. Papers should be formatted in LaTeX and be sent as PS or PDF files to tobias at dsv.su.se by June 6, 2007 and be accompanied by a text-only message containing title, abstract and keywords, the authors' full names, and address and e-mail for correspondence. Submissions should be in English. Queries ------- Queries may be directed to Tobias Wrigstad (tobias at dsv.su.se). From pmt6sbc at maths.leeds.ac.uk Fri Mar 16 17:45:41 2007 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Fri, 16 Mar 2007 21:45:41 +0000 (GMT) Subject: [TYPES/announce] CiE 2007 - Call for informal presentations In-Reply-To: References: Message-ID: ************************************************************ CiE'07: COMPUTABILITY IN EUROPE 2007 http://www.mat.unisi.it/newsito/cie07.html University of Siena Siena, 18 - 23 June 2007 CALL FOR INFORMAL PRESENTATIONS DEADLINE: 27 April, 2007 * THERE IS A REMARKABLE DIFFERENCE in conference style between computer science and mathematics conferences. Mathematics conferences allow for informal presentations that are prepared very shortly before the conference and inform the participants about current research and work in progress. The format of computer science conferences with pre-produced proceedings volumes is not able to accommodate this form of scientific communication. Continuing the tradition established at CiE 2005 in Amsterdam, and at CiE 2006 in Swansea, the 2007 conference in Siena endeavours to get the best of both worlds. * IN ADDITION TO THIS YEAR'S RECORD NUMBER of formal presentations based on our projected LNCS and local proceedings volumes, we invite researchers to present informal presentations. For this, please send us a brief description of your talk (up to and approaching one page in length) before 27 April 2007. * PLEASE SUBMIT YOUR ABSTRACT via the online Submission Form at: http://www.amsta.leeds.ac.uk/~pmt6sbc/cie07.ipform.html * If you submit an informal presentation, you will get an e-mail with a decision on acceptance or rejection within two weeks of your submission. * Let us add that there will be four post-conference special issues of journals for CiE 2007. See: http://www.amsta.leeds.ac.uk/~pmt6sbc/cie07.jour.html * All speakers, including the speakers of informal presentations, are eligible to be invited to submit a full journal version of their talk to one of the post-conference publications. PLENARY AND TUTORIAL SPEAKERS: Pieter Adriaans (Amsterdam) Yaakov Benenson (Harvard) Anne Condon (Vancouver) Stephen Cook (Toronto) Yuri Ershov (Novosibirsk) Wolfgang Maass (Graz) Sophie Laplante (Paris) Anil Nerode (Cornell) George Odifreddi (Turin) Roger Penrose (Oxford) Michael Rathjen (Leeds) Dana Scott (Carnegie Mellon) Robert I. Soare (Chicago) Philip Welch (Bristol) SPECIAL SESSIONS SPEAKERS: Eric Allender (Rutgers) Andrej Bauer (Ljubljana) Vasco Brattka (Cape Town) Douglas Bridges (Canterbury, NZ) John Case (Newark, Delaware) Pieter Collins (Amsterdam) Thierry Coquand (Goeteborg) Felix Costa (Lisbon) Barbara F. Csima (Waterloo) Abbas Edalat (London) Martin Escardo (Birmingham) Joerg Flum (Freiburg) Sergey S. Goncharov (Novosibirsk) Hajime Ishihara (Tokyo) Natasha Jonoska (Tampa, Florida) Michal Koucky (Prague) James Ladyman (Bristol) Maria Emilia Maietti (Padua) Giancarlo Mauri (Milan) Klaus Meer (Odense) Itamar Pitowsky (Jerusalem) Robert Rettinger (Hagen) Grzegorz Rozenberg (Leiden) Frank Stephan (Singapore) Neil Thapen (Prague) Giuseppe Trautteur (Naples) Heribert Vollmer (Hannover) Osamu Watanabe (Tokyo) Jiri Wiedermann (Prague) Damien Woods (Cork) Liang Yu (Nanjing) Martin Ziegler (Paderborn) WOMEN IN COMPUTABILITY WORKSHOP in association with the Computer Research Association's Committee on the Status of Women in Computing Research (CRA-W) Organisers: Paola Bonizzoni, Elvira Mayordomo. Speakers: Anne Condon (Vancouver), Natasha Jonoska (Florida), Carmen Leccardi (Milan), and others CONFIRMED SPONSORS OF CiE 2007: AILA (Associazione Italiana di Logica e Applicazioni), EATCS (European Association for Theoretical Computer Science), ASL (Association for Symbolic Logic), EACSL (European Association for Computer Science Logic), FoLLI (The Association of Logic, Language and Information), GNSAGA-INdAM (Gruppo Nazionale per le Strutture Algebriche e Geometriche e loro Applicazioni-Istituto NAzionale di Alta Matematica) and The University of Siena. * CiE 2007 will be co-located with CCA 2007, the annual CCA (Computability and Complexity in Analysis) Conference: http://cca-net.de/cca2007/ ************************************************************ From aserebre at win.tue.nl Mon Mar 19 04:23:52 2007 From: aserebre at win.tue.nl (A Serebrenik) Date: Mon, 19 Mar 2007 09:23:52 +0100 (CET) Subject: [TYPES/announce] Second Call for papers - Workshop on Termination (WST 2007) - Paris Message-ID: Call for Papers Ninth International Workshop on Termination (WST 2007) Paris, France, June 29, 2007 Affiliated with RDP 2007 Termination is a fundamental topic in computer science. Though termination of processes is often a strict requirement, it may be hard to establish. Classical results state the undecidability of various termination problems, so research focuses on automated methods that prove termination or non-termination in practical cases. The topic is challenging both in theory (mathematical logic, proof theory) and practice (software development, formal methods), and many interesting ramifications are yet to be explored. The 9th International Workshop on Termination will delve into all aspects of termination. It will continue the sequence of successful workshops held in St. Andrews (1993), La Bresse (1995), Ede (1997), Dagstuhl (1999), Utrecht (2001), Valencia (2003), Aachen (2004), and Seattle (2006). We hope to attain the same friendly atmosphere as those past workshops. The intent is to bring together, in an informal setting, researchers interested in various aspects of termination, whether this interest be practical or theoretical, primary or derived. The workshop is hoped to provide a ground for cross-fertilisation of ideas from term rewriting and from programming. Contributions from the imperative, object-oriented, constraint, functional, and logic programming communities, and papers investigating new applications of termination are particularly welcome. Paper Submissions: Extended abstracts in the prescribed format, not exceeding 4 pages, should be submitted electronically through EasyChair's WST 2007 submission site http://www.easychair.org/WST2007/. A common workshop style file will be made available on the WST'2007 web site. Papers should be submitted in PostScript or PDF format. We expect proceedings to be made available through the Computing Research Repository, CoRR. The Termination Competition: The competition will run again in 2007, and entries are strongly encouraged. Detailed instructions for submission of problems and programs will be made available at the competition website http://www.lri.fr/~marche/termination-competition/2007/ Program Committee Nachum Dershowitz (Tel Aviv, Israel) Daniel De Schreye (Leuven, Belgium) Samir Genaim (Madrid, Spain) Juergen Giesl (Aachen, Germany) Isabelle Gnaedig (Nancy, France) Dieter Hofbauer (Kassel, Germany), co-chair Aart Middeldorp (Innsbruck, Austria) Etienne Payet (La Reunion, France) Alexander Serebrenik (Eindhoven, The Netherlands), co-chair Termination Competition Committee Claude Marche (Paris, France) Johannes Waldmann (Leipzig, Germany) Hans Zantema (Eindhoven, The Netherlands) Workshop Themes (non-exhaustive list) Termination of programs Termination of rewriting Normalization of lambda calculi Implementation of termination methods Challenging termination problems and proofs Application of termination methods, e.g. to program transformation and compilation Comparison and classification of termination methods Non-termination detection Termination methods for theorem provers Termination in distributed systems Termination proof methods for liveness and fairness Derivational complexity Well-quasi-orderings and ordinal notations Important Dates: Deadline for electronic submission of papers : April 8, 2007 Notification of acceptance : May 6, 2007 Deadline for final versions : May 27, 2007 Competition Deadlines: Submission of public problems : May 1, 2007 Registration of termination tools : May 21, 2007 Submission of secret problems : June 1, 2007 Submission of termination tools : June 1, 2007 Start of competition : June 4, 2007 Workshop Venue and Related Events: WST 2007 is part of the Federated Conference on Rewriting, Deduction, and Programming 2007. Co-located events include RTA'07, HOR'07, PATE'07, RULE'07, SecReT'07, UNIF'07, WFLP'07, and WRS'07. These colloquia will run from June 25 to June 29, 2007, in Paris (France). For details see the RDP website at http://www.rdp07.org/. Web Sites WST 2007: http://www.rdp07.org/wst.html Termination Competition: http://www.lri.fr/~marche/termination-competition/2007/ RDP 2007: http://www.rdp07.org/ From miculan at dimi.uniud.it Mon Mar 19 07:15:19 2007 From: miculan at dimi.uniud.it (Marino Miculan) Date: Mon, 19 Mar 2007 12:15:19 +0100 Subject: [TYPES/announce] TYPES 2007 remind Message-ID: <99F1B8F4-1AEE-447B-BCBE-E69838E0FF75@dimi.uniud.it> Dear All, this is to gentle remind you that the deadline for (early) registration to TYPES is approaching (March 31). And actually, hotels in Cividale have still a few free rooms left, so it would be a good idea to register and book your room as soon as possible. More details on the web page http://www.dimi.uniud.it/types07 All the best -Marino Miculan TYPES 2007 organization committee From areces at loria.fr Tue Mar 20 07:29:11 2007 From: areces at loria.fr (Carlos Areces) Date: Tue, 20 Mar 2007 12:29:11 +0100 Subject: [TYPES/announce] CFP: Workshop Logic, Rationality and Interaction, Beijing, China Message-ID: <45FFC587.9070609@loria.fr> CALL FOR PAPERS Workshop Logic, Rationality and Interaction, 5-9 August, 2007. URL: http://www.illc.uva.nl/LORI Beijing, China. *About the Workshop* In the past decade it has become increasingly clear that studying information, first and foremost, means studying information exchange. This acknowledgement of the inherently social character of information shows up at many places in modern logical theories. More generally, information exchange is a form of interaction where agents act together in strategic ways. This new perspective has led to contacts between logic and game theory, bringing a new set of disciplines into the scope of logic: viz., economics, and the social sciences. New interfaces are arising, such as epistemic studies of rational behavior in games. Another interesting development in this area is the rise of the notion of 'social software', the idea of using computational techniques for analyzing patterns of social behavior. And finally, interaction is also crucial to intelligent behavior in the field of natural language. Here pragmatics, the study of the actual use of language between different agents, has become the primary focus of research. Notions from game theory, in particular evolutionary games, are being used to-day to answer all kinds of pragmatic issues, for instance, how linguistic conventions can arise. This workshop aims to bring together researchers working on these and related topics in logic, philosophy, computer science, and related areas in order to arrive at an integrated perspective on knowledge acquisition, information exchange, and rational action. *Call for papers* Researchers from various fields, including artificial intelligence, game theory, linguistics, logic, philosophy, and cognitive science are invited to submit a paper to this workshop which aims to arrive at an interdisciplinary perspective on knowledge acquisition, information exchange, and rational action. Topics of interest include, but are not limited to a. semantic models for knowledge, for belief, and for uncertainty b. dynamic logics of knowledge, information flow, and action c. logical analysis of the structure of games d. belief revision, belief merging e. logics for preferences and utilities f. logics of probability and uncertainty All researchers in the area are invited to submit a paper of 12 pages. Each paper should include a title, the names and contact details of all authors, and a short abstract of 100-300 words. Talks will be 45 minutes long, including 10 - 15 minutes for discussion. The detailed submission procedure will be specified soon. A selection of the accepted papers will be published in a special issue of 'Knowledge, Rationality and Action'. *Important Dates* a. Paper submission deadline: 15 April 2007 b. Notification of authors: 7 May 2007 c. Camera-ready copies due: 1 June 2007 d. Workshop dates: 5-9 August 2007 *People involved* Chair: Johan van Benthem Co-Chairs: Shier Ju and Frank Veltman General Organizers : Minghui Xiong and Fenrong Liu Invited Speakers a. Alexandru Baltag (Oxford University, UK) b. Vincent F. Hendricks (Roskilde University, Denmark) c. Wiebe van der Hoek (Liverpool University, UK) d. Gerhard Jager (University of Bielefeld, Germany) e. Yossi Feinberg (Stanford University, USA) f. Jialong Zhang (Chinese Academy of Social Sciences, China) Programme Committee The Programme Committee consists of chairs and invited speakers. Committee of Recommendation a. Patrick Blackburn (European Association of Logic, Language and Information) b. Giacomo Bonanno (LOFT) c. Joseph Halpern (TARK) d. Johann Makowsky ( EACSL) e. Jacek Malinowski (Studia Logica) f. Gabriel Sandu (ESF Eurocores Intelligent Interaction) *Contact* If you have any questions or comments regarding the organization of the workshop or the paper submission procedure, please do not hesitate to contact us: a. Minghui Xiong (email: hssxmh at mail.sysu.edu.cn) b. Fenrong Liu (email: fenrong at science.uva.nl) From pasalic at cs.rice.edu Tue Mar 20 11:18:46 2007 From: pasalic at cs.rice.edu (Emir Pasalic) Date: Tue, 20 Mar 2007 10:18:46 -0500 Subject: [TYPES/announce] Call for Papers: Generative Programming and Component Engineering (GPCE'07) Message-ID: <9E13C11B-7F51-4097-934E-349000A4F85D@cs.rice.edu> - Apologies for multiple posts - Call for Papers Sixth International Conference on Generative Programming and Component Engineering (GPCE'07) October 1-3, 2007 Salzburg, Austria (co-located with ESWEEK'07) http://www.gpce.org/07 Important Dates: * Submission of abstracts: April 17, 2007 * Submission: April 20, 2007 * Notification: June 10, 2007 * Tutorial and workshop proposals: March 16, 2007 * Tutorial and workshop notification: April 9, 2007 Scope Generative and component approaches are revolutionizing software development similar to how automation and components revolutionized manufacturing. Generative Programming (developing programs that synthesize other programs), Component Engineering (raising the level of modularization and analysis in application design), and Domain-Specific Languages (elevating program specifications to compact domain-specific notations that are easier to write, maintain, and analyze) are key technologies for automating program development. GPCE provides a venue for researchers and practitioners interested in foundational techniques for enhancing the productivity, quality, and time-to-market in software development that stems from deploying standard componentry and automating program generation. In addition to exploring cutting-edge techniques for developing generative and component-based software, our goal is to foster further cross-fertilization between the software engineering research community and the programming languages community. As GPCE is co-located with ESWEEK this year, we also especially encourage papers from the embedded systems community. Submissions 10 pages in SIGPLAN proceedings style (sigplanconf.cls) reporting research results and/or experience related to the topics above (PC chair can advise on appropriateness). We particularly encourage original high-quality reports on applying GPCE technologies to real-world problems, relating ideas and concepts from several topics, or bridging the gap between theory and practice. Please note that in contrast to last year, GPCE 2007 is not using a double-blind reviewing process. Topics GPCE seeks contributions in software engineering and in programming languages related (but not limited) to: * Generative programming o Reuse, meta-programming, partial evaluation, multi-stage and multi-level languages, and step-wise refinement o Semantics, type systems, symbolic computation, linking and explicit substitution, in-lining and macros, templates, and program transformation o Runtime code generation, compilation, active libraries, synthesis from specifications, development methods, generation of non-code artifacts, formal methods, and reflection * Generative techniques for o Product-line architectures o Distributed, real-time and embedded systems o Model-driven development and architecture o Resource bounded/safety critical systems. * Component-based software engineering o Reuse, distributed platforms and middleware, distributed systems, evolution, patterns, development methods, deployment and configuration techniques, and formal methods * Integration of generative and component-based approaches * Domain engineering and domain analysis o Domain-specific languages (DSLs) including visual and UML-based DSLs * Separation of concerns o Aspect-oriented and feature-oriented programming, o Intentional programming and multi-dimensional separation of concerns * Industrial applications * Applications in embedded systems Reports on applications of these techniques to real-world problems are especially encouraged, as are submissions that relate ideas and concepts from several of these topics, or bridge the gap between theory and practice. The program chair is happy to advise on the appropriateness of a particular subject. Submissions must adhere to SIGPLAN's republication policy. Please contact the program chair if you have any questions about how this policy applies to your paper (gpce07 at diku.dk). General Chair * Charles Consel (LABRI/INRIA, Bordeaux) Program Committee Program Chair: * Julia Lawall (DIKU, University of Copenhagen) Program Committee Members: * Edwin Brady (University of St Andrews, UK) * Johan Brichau (Universit? Catholique de Louvain, Belgium) * Rastislav Bodik (UC Berkeley, USA) * Jacques Carette (McMaster University, Canada) * Albert Cheng (University of Houston, USA) * Remi Douence (Ecole des Mines de Nantes-Inria, Lina, France) * Lidia Fuentes (University of M?laga, Spain) * Ian Gorton (Pacific Northwest National Lab) * Jean-Marc Jezequel (IRISA (INRIA & Univ. Rennes 1), France) * Kyo Kang (Pohang University of Science and Technology, Korea) * Siau Cheng Khoo (National University of Singapore, Singapore) * Paul Kelly (Imperial College London, UK) * Anne-Francoise Le Meur (University of Lille 1, France) * Christian Lengauer (University of Passau, Germany) * Sandeep Neema (Vanderbilt University, USA) * Scott Owens (University of Cambridge, UK) * Jens Palsberg (UCLA, USA) * Renaud Pawlak (Rensselaer Polytechnic Institute, USA) * Zoltan Porkolab (Eotvos Lorand University, Hungary) * Robby (Kansas State University, USA) * Peter Sestoft (IT University of Copenhagen, Denmark) * Jeremy Siek (University of Colorado at Boulder, USA) * Tony Sloane (Macquarie University, Australia) * Kevin J. Sullivan (University of Virginia, USA) * Peri Tarr (IBM Thomas J. Watson Research Center, USA) From yitzhakm at CS.Princeton.EDU Tue Mar 20 14:51:43 2007 From: yitzhakm at CS.Princeton.EDU (Yitzhak Mandelbaum) Date: Tue, 20 Mar 2007 14:51:43 -0400 Subject: [TYPES/announce] Deadline extension: POPL Call for Event Proposals Message-ID: <23A265CD-94F3-4DA9-8EFF-08C5B3EEB4B7@cs.princeton.edu> Due to requests from event organizers, we are extending the deadline for submitting proposals for POPL 2008 co-located events (including workshops and conferences) by one week. The new deadline for submission will be Monday, March 26th, 2007. We will still try to notify all organizers of our decisions by Monday, April 16th, 2007. For further information, please see the announcement at: http://www.research.att.com/~yitzhak/workshops/popl08/ call_for_events.html --------------------------------------- Yitzhak Mandelbaum Workshop Chair, POPL 2008 -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070320/b0e76cc7/attachment.htm From rjsimmon at cs.cmu.edu Wed Mar 21 11:08:57 2007 From: rjsimmon at cs.cmu.edu (Robert J. Simmons) Date: Wed, 21 Mar 2007 11:08:57 -0400 Subject: [TYPES/announce] New Twelf Wiki Message-ID: <16e0158a0703210808h198b0801h1f6f61b01a05e7ce@mail.gmail.com> We are pleased to announce the Twelf Wiki, a major new source of documentation about Twelf: http://twelf.plparty.org Twelf is a tool used to specify, implement, and prove properties of deductive systems. The Twelf Wiki includes: * A new introduction to LF and Twelf. * Tutorials on common Twelf tricks and techniques. * Case studies of larger applications of Twelf, including encodings of and proofs about linear logic, mutable state, and CPS conversion. * Pre-compiled CVS builds of Twelf for Linux and Windows. We invite you to come share what you know, learn from what's there, and ask questions about what's not. - The Twelf Wiki Team From Luis.Caires at di.fct.unl.pt Wed Mar 21 14:02:15 2007 From: Luis.Caires at di.fct.unl.pt (=?ISO-8859-1?Q?Lu=EDs_Caires?=) Date: Wed, 21 Mar 2007 18:02:15 +0000 Subject: [TYPES/announce] Concur 2007 Final CFP Message-ID: CALL FOR PAPERS CONCUR'07 18th International Conference on Concurrency Theory September 4th - 7th, 2007 Lisbon, Portugal http://concur07.di.fc.ul.pt/ CONCUR 2007, the 18th International Conference on Concurrency Theory, will take place in Lisbon, Portugal, September 4 - 7, 2007. The purpose of the CONCUR conferences is to bring together researchers working on the theory of concurrency and its applications. Submissions are solicited in all areas of semantics, logics, and verification techniques for concurrent systems. The principal topics include (but are not limited to): * Basic models and logics of concurrent and distributed computation (such as process algebras, Petri nets, domain theoretic or game theoretic models, modal and temporal logics). * Specialized models or classes of systems (such as circuits, synchronous systems, real time and hybrid systems, stochastic systems, data bases, mobile and migrating systems, parametric protocols, biologically inspired systems). * Related verification techniques and tools (such as state-space exploration, model-checking, synthesis, abstraction, automated deduction, testing). * Related programming models (such as distributed, constraints or object oriented, graph rewriting, as well as associated type systems, static analyses, and abstract machines). Authors are invited to submit an extended abstract; submissions will be evaluated by the program committee for inclusion in the proceedings, which will be published by Springer-Verlag in the Lecture Notes in Computer Science series. Papers must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. Simultaneous submission to journals or other conferences with published proceedings is not allowed. Authors are required to submit a paper title and a short abstract before submitting the extended abstract. The short abstract should not exceed 200 words, and it should be entered at the conference web submission site. The extended abstract should not exceed 15 pages, and it should be formatted according to Springer-Verlag LNCS guidelines. If necessary, the extended abstract may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee. The link for submission is accessible from the Concur 2007 web site. Invited Speakers ================ * Luca Aceto, Aalborg University, Denmark * Peter O'Hearn, Queen Mary University of London, UK * Fred B. Schneider, Cornell University, USA Invited Tutorials ================= * Vincent Danos, Universite Paris 7, France * Jose Fiadeiro, University of Leicester, UK Important Dates =============== Abstract Submission: April 6, 2007 Paper Submission: April 9, 2007 (STRICT) Notification: May 27, 2007 Final version due: June 9, 2007. Affiliated Workshops ==================== Expressiveness in Concurrency (EXPRESS) Chairs: Roberto Amadio and Thomas Hildebrandt 3rd September 2007 http://express07.pps.jussieu.fr/ Applying Concurrency Research in Industry (IFIP WG 1.8 Concurrency Theory Meeting) Organizers: Luca Aceto, Jos Baeten, Wan Fokkink, Anna Ingolfsdottir, and Uwe Nestmann 7th September 2007 http://www.ru.is/luca/ifipworkshop/ From Biology To Concurrency and back (FBTC) Chairs: Emanuela Merelli and Nicola Cannata 8th September 2007 http://cosy.cs.unicam.it/FBTC/ Foundations of Coordination Languages and Software Architectures (FOCLASA) Chairs: Carlos Canal, Pascal Poizat, and Mirko Viroli 8th September 2007 http://foclasa07.lcc.uma.es/ Graph Transformation for Verification and Concurrency (GT-VC) Chairs: Barbara K?nig, Reiko Heckel, and Arend Rensink 3rd September 2007 http://www.ti.inf.uni-due.de/events/gtvc2007/ Security Issues in Concurrency (SECCO) Chairs: Daniele Gorla and Catuscia Palamidessi 3rd September 2007 http://www.dsi.uniroma1.it/~gorla/SecCo07/ Verification and Analysis of Multi-threaded Java-like Programs (VAMP) Organizers: Christian Haack, Joe Kiniry, Marieke Huisman, and Erik Poll 3rd September 2007 http://www.cs.ru.nl/~chaack/VAMP07/ Program Committee ================= Roberto Amadio, Universite Paris 7, France Jos Baeten, Eindhoven University of Technology, the Netherlands Bruno Blanchet, Ecole Normale Superieure de Paris, France Franck van Breugel, York University, Canada Luis Caires (co-chair), Universidade Nova de Lisboa, Portugal Luca Cardelli, Microsoft Research Cambridge, UK Luca de Alfaro, University of California at Santa Cruz, USA Wan Fokkink, Free University of Amsterdam, the Netherlands Daniel Hirschkoff, Ecole Normale Superieure de Lyon, France Radha Jagadeesan, DePaul University, USA Alan Jeffrey, Bell Labs, Alcatel-Lucent, USA Antonin Kucera, Masaryk University in Brno, Czech Republic Faron Moller, University of Wales Swansea, UK Ugo Montanari, University of Pisa, Italy Uwe Nestmann, Technical University of Berlin, Germany Mogens Nielsen, University of Aarhus, Denmark Catuscia Palamidessi, INRIA Futurs Saclay and LIX, France Davide Sangiorgi, Universita di Bologna, Italy Vladimiro Sassone, University of Southampton, UK Peter Van Roy, Catholic University of Louvain, Belgium Vasco T. Vasconcelos (co-chair), Universidade de Lisboa, Portugal Hagen Volzer, University of Lubeck, Germany Nobuko Yoshida, Imperial College London, UK CONCUR Steering Committee ========================= Roberto Amadio, Universite Paris 7, France Jos Baeten, Eindhoven University of Technology, the Netherlands Eike Best, University of Oldenburg University, Germany Kim Larsen, Aalborg University, Denmark Ugo Montanari, University of Pisa, Italy Scott Smolka, SUNY Stony Brook, USA CONCUR 2007 Organizing Committee ================================ Vasco T. Vasconcelos, Universidade de Lisboa, Portugal Luis Caires, Universidade Nova de Lisboa, Portugal Francisco Martins (workshops organisation), Universidade de Lisboa, Portugal Ant?nio Ravara (workshops organisation), Instituto Superior Tecnico, Portugal -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070321/5abf9e2b/attachment.htm From Luis.Caires at di.fct.unl.pt Wed Mar 21 14:33:02 2007 From: Luis.Caires at di.fct.unl.pt (=?ISO-8859-1?Q?Lu=EDs_Caires?=) Date: Wed, 21 Mar 2007 18:33:02 +0000 Subject: [TYPES/announce] Concur 2007 Final CFP In-Reply-To: References: Message-ID: <7CFE4D73-D397-41E7-9036-4BCE4BCE9153@di.fct.unl.pt> CALL FOR PAPERS CONCUR'07 18th International Conference on Concurrency Theory September 4 - 7, 2007 Lisbon, Portugal http://concur07.di.fc.ul.pt/ CONCUR 2007, the 18th International Conference on Concurrency Theory, will take place in Lisbon, Portugal, September 4 - 7, 2007. The purpose of the CONCUR conferences is to bring together researchers working on the theory of concurrency and its applications. Submissions are solicited in all areas of semantics, logics, and verification techniques for concurrent systems. The principal topics include (but are not limited to): * Basic models and logics of concurrent and distributed computation (such as process algebras, Petri nets, domain theoretic or game theoretic models, modal and temporal logics). * Specialized models or classes of systems (such as circuits, synchronous systems, real time and hybrid systems, stochastic systems, data bases, mobile and migrating systems, parametric protocols, biologically inspired systems). * Related verification techniques and tools (such as state-space exploration, model-checking, synthesis, abstraction, automated deduction, testing). * Related programming models (such as distributed, constraints or object oriented, graph rewriting, as well as associated type systems, static analyses, and abstract machines). Authors are invited to submit an extended abstract; submissions will be evaluated by the program committee for inclusion in the proceedings, which will be published by Springer-Verlag in the Lecture Notes in Computer Science series. Papers must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. Simultaneous submission to journals or other conferences with published proceedings is not allowed. Authors are required to submit a paper title and a short abstract before submitting the extended abstract. The short abstract should not exceed 200 words, and it should be entered in ASCII at the conference web site. The extended abstract should not exceed 15 pages, and it should be formatted according to Springer-Verlag LNCS guidelines. If necessary, the extended abstract may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee. The link for submission is accessible from the Concur 2007 web site. Invited Speakers ================ * Luca Aceto, Reykjavik University, Iceland * Peter O'Hearn, Queen Mary University of London, UK * Fred B. Schneider, Cornell University, USA Invited Tutorials ================= * Vincent Danos, Universite Paris 7, France * Jose Fiadeiro, University of Leicester, UK Important Dates =============== Abstract Submission: April 6, 2007 Paper Submission: April 9, 2007 (STRICT) Notification: May 27, 2007 Final version due: June 9, 2007. Affiliated Workshops ==================== Expressiveness in Concurrency (EXPRESS) Chairs: Roberto Amadio and Thomas Hildebrandt September 3, 2007 http://express07.pps.jussieu.fr/ Applying Concurrency Research in Industry (IFIP WG 1.8 Concurrency Theory Meeting) Organizers: Luca Aceto, Jos Baeten, Wan Fokkink, Anna Ingolfsdottir, and Uwe Nestmann September 7, 2007 http://www.ru.is/luca/ifipworkshop/ From Biology To Concurrency and back (FBTC) Organizers: Emanuela Merelli and Nicola Cannata September 8, 2007 http://cosy.cs.unicam.it/FBTC/ Foundations of Coordination Languages and Software Architectures (FOCLASA) Organizers: Carlos Canal, Pascal Poizat, and Mirko Viroli September 8, 2007 http://foclasa07.lcc.uma.es/ Graph Transformation for Verification and Concurrency (GT-VC) Organizers: Barbara K?nig, Reiko Heckel, and Arend Rensink September 3, 2007 http://www.ti.inf.uni-due.de/events/gtvc2007/ Security Issues in Concurrency (SECCO) Organizers: Daniele Gorla and Catuscia Palamidessi September 3, 2007 http://www.dsi.uniroma1.it/~gorla/SecCo07/ Verification and Analysis of Multi-threaded Java-like Programs (VAMP) Organizers: Christian Haack, Joe Kiniry, Marieke Huisman, and Erik Poll September 3, 2007 http://www.cs.ru.nl/~chaack/VAMP07/ Program Committee ================= Roberto Amadio, Universite Paris 7, France Jos Baeten, Eindhoven University of Technology, the Netherlands Bruno Blanchet, Ecole Normale Superieure de Paris, France Franck van Breugel, York University, Canada Luis Caires (co-chair), Universidade Nova de Lisboa, Portugal Luca Cardelli, Microsoft Research Cambridge, UK Luca de Alfaro, University of California at Santa Cruz, USA Wan Fokkink, Free University of Amsterdam, the Netherlands Daniel Hirschkoff, Ecole Normale Superieure de Lyon, France Radha Jagadeesan, DePaul University, USA Alan Jeffrey, Bell Labs, Alcatel-Lucent, USA Antonin Kucera, Masaryk University in Brno, Czech Republic Faron Moller, University of Wales Swansea, UK Ugo Montanari, University of Pisa, Italy Uwe Nestmann, Technical University of Berlin, Germany Mogens Nielsen, University of Aarhus, Denmark Catuscia Palamidessi, INRIA Futurs Saclay and LIX, France Davide Sangiorgi, Universita di Bologna, Italy Vladimiro Sassone, University of Southampton, UK Peter Van Roy, Catholic University of Louvain, Belgium Vasco T. Vasconcelos (co-chair), Universidade de Lisboa, Portugal Hagen Volzer, University of Lubeck, Germany Nobuko Yoshida, Imperial College London, UK CONCUR Steering Committee ========================= Roberto Amadio, Universite Paris 7, France Jos Baeten, Eindhoven University of Technology, the Netherlands Eike Best, University of Oldenburg University, Germany Kim Larsen, Aalborg University, Denmark Ugo Montanari, University of Pisa, Italy Scott Smolka, SUNY Stony Brook, USA CONCUR 2007 Organizing Committee ================================ Vasco T. Vasconcelos, Universidade de Lisboa, Portugal Luis Caires, Universidade Nova de Lisboa, Portugal Francisco Martins (workshops organisation), Universidade de Lisboa, Portugal Antonio Ravara (workshops organisation), Universidade Tecnica de Lisboa, Portugal -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070321/1513046b/attachment.htm From blanqui at loria.fr Thu Mar 22 08:57:34 2007 From: blanqui at loria.fr (Frederic Blanqui) Date: Thu, 22 Mar 2007 13:57:34 +0100 (CET) Subject: [TYPES/announce] One-year INRIA post-doctoral position Message-ID: A one-year INRIA post-doctoral position is available: Title: Generation of construction functions guaranteeing algebraic invariants on concrete data types Aim: Although concrete data types are very useful in defining complex data structures, they are not always sufficient to adequately specify the data structures required by some algorithms. Often, only a subset of the concrete data type is in fact used since some invariants between the components are mandatory to ensure the correctness of the program. Now, many invariants can be described by using some equational theory. For instance, a sorted list is a particular representative of the equivalence class of lists modulo commutativity. The usual way to solve this problem is to use abstract data types or, better, private data types if one does not want to lose the ability of doing pattern matching. We propose to study the automatic generation of certified construction functions guaranteeing algebraic invariants on concrete data types, and develop an extension of OCaml with relational data types, that is, data types with invariants described by user defined equations. More information and online application on: http://www.talentsplace.com/syndication1/inria/frpostdoc/details.html?id=PGTFK026203F3VBQB6G68LONZ&LOV5=4508&LOV6=4514&LG=FR&Resultsperpage=20&nPostingID=1155&nPostingTargetID=3197&option=52&sort=DESC&nDepartmentID=19 Competences and profile: The position involves research and development in the area of functional programming, rewriting theory (in particular Knuth-Bendix completion) and, possibly, interactive theorem proving (experience with a proof assistant such as Coq is welcome). Speaking french is not necessary. Requirements: Candidates are required to hold a PhD degree between May 2006 and June 2007. Salary: the monthly gross salary is approx. EUR 2,150. Environment: - laboratory: LORIA (http://www.loria.fr/) - team: Protheo (http://protheo.loria.fr/) - project: Quotient (http://quotient.loria.fr/) - location: Nancy, in the East of France is at 1:30 from Paris by tren, 1:30 from Luxembourg airport by car, and 1:30 from Germany and Belgium. Application deadline: 1st July 2007. Contact: Frederic Blanqui (http://www.loria.fr/~blanqui/) More information about INRIA post-doctoral positions: http://www.inria.fr/travailler/opportunites/postdoc/postdoc.en.html From boyland at cs.uwm.edu Mon Mar 26 00:13:14 2007 From: boyland at cs.uwm.edu (John Tang Boyland) Date: Sun, 25 Mar 2007 22:13:14 -0600 Subject: [TYPES/announce] CFP: Formal Techniques for Java-like Programs (FTfJP 2007) Message-ID: <23743.1174882394@pabst.cs.uwm.edu> Call for Contributions FTfJP 2007 9th Workshop on Formal Techniques for Java-like Programs in conjunction with ECOOP 2007 July 31, 2007 (Berlin, Germany) http://cs.nju.edu.cn/boyland/ftjp SCOPE Formal techniques can help analyze programs, precisely describe program behavior, and verify program properties. Newer languages such as Java and C# provide good platforms to bridge the gap between formal techniques and practical program development, because of their reasonably clear semantics and standardized libraries. Moreover, these languages are interesting targets for formal techniques, because the novel paradigm for program deployment introduced with Java, with its improved portability and mobility, opens up new possibilities for abuse and causes concern about security. Work on formal techniques and tools for programs and work on the formal underpinnings of programming languages themselves naturally complement each other. This workshop aims to bring together people working in both these fields, on topics such as: - specification techniques and interface specification languages, - specification of software components and library packages, - automated checking and verification of program properties, - verification logics, - language semantics, - type systems, - security. CONTRIBUTIONS Contributions are sought on open questions, new developments, or interesting new applications of formal techniques in the context of Java or similar languages, such as C#. Contributions should not merely present completely finished work, but also raise challenging open problems or propose speculative new approaches. We particularly welcome contributions that simply suggest good topics for discussion at the workshop, or raise issues that you feel deserve the attention of the research community. Submissions must be in English and are limited to 10 pages using LNCS style (excluding bibliography). Papers must be submitted electronically via the workshop website: http://cs.nju.edu.cn/boyland/ftjp PUBLICATION An informal proceedings will be made available to workshop participants. Papers will also be available from the workshop web page. There will be no formal publication of papers. We intend to invite selected papers for a special journal issue as a follow-up to the workshop, as has been done for some previous FTfJP workshops. Important Dates May 6, 2007 Deadline for submission of abstract May 13, 2007 Deadline for submission of full paper June 6, 2007 Notification June 30, 2007 Deadline for final version of paper for informal proceedings July 31, 2007 Workshop Program Committee Cyrille Artho AIST/RCIS, Japan Frank S. de Boer CWI, Netherlands Fabrice Bouquet University of Franche Comte, France John Boyland Nanjing University, China and University of Wisconsin-Milwaukee, USA, chair Alex Buckley Sun Microsystems, UK Patrice Chalin Concordia University, Canada Dave Clarke CWI, Netherlands Paola Giannini University of Piemonte Orientale, Italy Marieke Huisman INRIA Sophia Antipolis, France Giovanni Lagorio Universita di Genova, Italy Gary T. Leavens Iowa State University, USA Francesco Logozzo Microsoft Research, USA Wojciech Mostowski Radboud University Nijmegen, Netherlands Wolfram Schulte Microsoft Research, USA Organizers John Boyland, co-chair Sophia Drossopoulou Susan Eisenbach Gary T. Leavens Peter Mueller Arnd Poetzsch-Heffter Erik Poll, co-chair For more information, send email to the organizer co-chairs: boyland at cs.uwm.edu, E.Poll at cs.ru.nl From Susanne.Graf at imag.fr Sun Mar 25 11:23:56 2007 From: Susanne.Graf at imag.fr (Susanne Graf) Date: Sun, 25 Mar 2007 17:23:56 +0200 Subject: [TYPES/announce] Call for Papers : FORMATS'07 Message-ID: <4606940C.6070308@imag.fr> ---------- FORMATS'07 ---------- ---------------------------------------------- Call for Papers 5th International Conference on Formal Modelling and Analysis of Timed Systems ---------------------------------------------- Salzburg, Austria, October 3-5, 2007 http://www.ulb.ac.be/di/formats07/ (Co-Located with Embedded Systems Week) Chair persons: ------------- Jean-Francois Raskin (ULB, Belgium) and P.S. Thiagarajan (NUS, Singapore) Program Committee: ----------------- Rajeev Alur (UPenn, USA), Eug?ne Asarin (Paris 7, France), Patricia Bouyer (LSV, France), Ed Brinksma (ESI Eindhoven, The Netherlands), V?ronique Bruy?re (UMH, Belgium), Flavio Corradini (U Camerino, Italy), Martin Franzle (U Oldenbourg, Germany), Goran Frehse (Verimag, France), Salvatore La Torre (U Salerno, Italy), Nicolas Markey (LSV, France), Insup Lee (U Penn, USA), Rupak Majumdar (UCLA, USA), Brian Nielsen (U Aalborg, Danemark), Jo?l Ouaknine (U Oxford, UK), Paritosh Pandya (TIFR-ITT Bombay, India), Paul Pettersson (U M?lardalen, Sweden), Jean-Fran?ois Raskin (ULB, Belgium), Mari?lle Stoelinga (U Twente, The Netherlands), Stavros Tripakis (Cadence Berkeley Labs, USA), P.S. Thiagarajan (NUS, Singapore), Frits Vaandrager (U Nijmegen, The Netherlands). Steering Committee: ------------------ Rajeev Alur (Univ. Pennsylvania, USA), Flavio Corradini (Univ. Camerino, Italy), Kim G. Larsen (Aalborg Univ., Denmark), Oded Maler (Verimag, France), Walter Vogler (Univ. Augsburg, Germany), Wang Yi (Uppsala Univ., Sweden). Invited Speakers: ---------------- TBA Important Dates: --------------- Submission deadline: May 7, 2007 Notification to authors: June 25, 2007 Camera-ready version due: July 16, 2007 Conference: October 3-5, 2007 Contact Information: ------------------- email:formats07 at lit.ulb.ac.be Objectives and Scope of the Conference: -------------------------------------- Timing aspects of systems from a variety of computer science domains have been treated independently by different communities. Researchers interested in semantics, verification and performance analysis study models such as timed automata and timed Petri nets. The digital design community focuses on propagation and switching delays while designers of embedded controllers have to take account of the time taken by controllers to compute their responses after sampling the environment. Timing related questions in these separate disciplines do have their particularities. However, there is a growing awareness that there are basic problems that are common to all of them. In particular, all these sub-disciplines treat systems whose behaviour depends upon combinations of logical and temporal constraints; namely, constraints on the temporal distances between occurrences of events. The aim of FORMATS is to promote the study of fundamental and practical aspects of timed systems, and to bring together researchers from different disciplines that share interests in modelling and analysis of timed systems. Typical topics include (but are not limited to): ----------------------------------------------- - Foundations and Semantics: Theoretical foundations of timed systems and languages; - Comparison between different models (timed automata, timed Petri nets, hybrid automata, timed process algebra, max-plus algebra, probabilistic models). - Methods and Tools: techniques, algorithms, data structures, and software tools for analyzing timed systems and resolving temporal constraints (scheduling, worst-case execution time analysis, optimisation, model-checking, testing, constraint solving, etc). - Applications: adaptation and specialization of timing technology in application domains in which timing plays an important role (real-time software, hardware circuits, and problems of scheduling in manufacturing and telecommunication). Publication: ----------- The proceedings of FORMATS'07 will be published by Springer in the Lecture Notes in Computer Science series. Papers must contain original contributions, be clearly written, and include appropriate references to and comparison with related work. Simultaneous submission to other conferences with published proceedings is not allowed. Submissions should not exceed 15 pages, and should be formatted according to Springer LNCS guidelines. If necessary,the submission may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee. From ili at info.fundp.ac.be Tue Mar 27 03:36:06 2007 From: ili at info.fundp.ac.be (Isabelle Linden) Date: Tue, 27 Mar 2007 09:36:06 +0200 Subject: [TYPES/announce] MTCoord 2007 - CFP extended deadline Message-ID: <4608C966.30401@info.fundp.ac.be> [ Our apologies for multiple copies. ] ====================================================================== 3rd International Workshop on Methods and Tools for Coordinating Concurrent, Distributed and Mobile Systems (MTCoord'07) June 5, 2007, Paphos, Cyprus Workshop affiliated to Coordination 07, June 5-8 2007 ====================================================================== SCOPE Various classes of computational models, languages, and formalisms have emerged in the aim of providing high-level descriptions of concurrent, distributed, and mobile systems. Typical examples include so-called coordination languages and models (e.g. Gamma, Linda, Manifold, Reo, Klaim, Lime, ...), concurrent constraint languages (e.g. cc languages, Mozart, ...) and process algebras (e.g. CSP, CCS, pi-calculus, ...). These models are based on generative communication via a shared data space or on data communication through channels. In both cases, software components are typically conceived in isolation assuming that the required data will eventually be available. However, making a whole system out of these components and, in particular, ensuring that interactions occur properly is far from being obvious. The aim of the workshop is precisely to bring together researchers, working in different communities (coordination, constraints, process algebras), on methods and tools for the construction of concurrent, distributed and mobile systems. This year, the workshop will focus on model checking techniques and compositional and refinement-based methodologies. TOPICS OF INTEREST Special topics of interest are o Model checking techniques, in particular techniques for verifying coordinating properties (including distributed and probabilistic ones) o Compositional and refinement-based methodologies However, related topics are also invited such as o Design of high-level specifications, eg based on first-order, modal and temporal logics o Techniques for requirements capture and analysis o Theorem proving based methodologies o Debugging techniques o Abstract interpretation o Program analysis and transformation o Simulation and testing o Formal methods for security o Tools environments and architectures o Applications and case studies, in particular in web services and biology SUBMISSION GUIDELINES Papers describing original work are solicited as contributions to MTCoord'07. All papers must be unpublished and not submitted simultaneously for publication elsewhere. Submitted papers should be limited to 15 pages, preferrably formatted according to the Electronical Notes in Theoretical Computer Science. They should be submitted through the conference management system that will be available from the workshop web site. http://www.info.fundp.ac.be/MTCoord/ PUBLICATION The papers accepted for the symposium will be available at the workshop. Selected work will be published in a volume of the Electronical Notes in Theoretical Computer Science. IMPORTANT DATES o April 10, 2007: Paper Submission EXTENDED deadline. o May 3, 2007: Notification of acceptance. o May 11, 2007 : Final version. o June 4, 2007 : Meeting Date. LOCATION The MTCoord'07 workshop will be held in Paphos, Cyprus in June 5 2007. It is a satellite workshop of Coordination'07. For venue and registration, see the DisCoTec'07 web page at http://www.discotec07.cs.ucy.ac.cy/index.htm WORKSHOP ORGANIZERS o Carolyn Talcott, SRI International, USA o Isabelle Linden, University of Namur, Belgium PROGRAMME COMITTEE o Marco Bernardo, Universit? degli Studi di Urbino "Carlo Bo", Urbino, Italy o Christel Baier, Technical University Dresden, Germany o Lubos Brim, Masaryk University, Czech Republic o Giorgio Delzanno, University of Genova, Italy o Wan Fokkink, CWI, The Netherlands o Jean-Marie Jacquet, University of Namur, Belgium o Gerald Luettgen, University of York, United Kingdom o Angelika Mader, University of Twente, The Netherlands o Andreas Podelski, Max Plank Institute, Germany o Mirko Viroli, Alma Mater Studiorum Universit? di Bologna a Cesena, Italy o Kaisa Sere, Abo Akademi University, Finland -- --------------- Isabelle Linden, Teaching Coordinator Computer Science Dpt - University of Namur 21, rue Grandgagnage, B-5000 Namur - Belgium Tel : +32 (0)81 72 49 87 Fax : +32 (0)81 72 49 67 www.info.fundp.ac.be/~ili/ ---------------- From gmh at Cs.Nott.AC.UK Tue Mar 27 05:03:01 2007 From: gmh at Cs.Nott.AC.UK (Graham Hutton) Date: Tue, 27 Mar 2007 10:03:01 +0100 Subject: [TYPES/announce] New Book - Programming in Haskell Message-ID: <17660.1174986181@cs.nott.ac.uk> +--------------------------------------------------------------------+ *** NEW BOOK ANNOUNCEMENT *** Programming in Haskell Graham Hutton, University of Nottingham Cambridge University Press, 2007 Paperback: ISBN-13: 9780521692694 | ISBN-10: 0521692695 Hardback: ISBN-13: 9780521871723 | ISBN-10: 0521871727 DESCRIPTION Haskell is one of the leading languages for teaching functional programming, enabling students to write simpler and cleaner code, and to learn how to structure and reason about programs. This introduction is ideal for beginners: it requires no previous programming experience and all concepts are explained from first principles via carefully chosen examples. Each chapter includes exercises that range from the straightforward to extended projects, plus suggestions for further reading on more advanced topics. The presentation is clear and simple, and benefits from having been refined and class-tested over several years. Features include: freely accessible powerpoint slides for each chapter; solutions to exercises, and examination questions (with solutions) available to instructors; downloadable code that's fully compliant with the latest Haskell release. CONTENTS Preface 1. Introduction 2. First steps 3. Types and classes 4. Defining functions 5. List comprehensions 6. Recursive functions 7. Higher-order functions 8. Functional parsers 9. Interactive programs 10. Declaring types and classes 11. The countdown problem 12. Lazy evaluation 13. Reasoning about programs Appendix A. Standard prelude Appendix B. Symbol table Bibliography Index FURTHER DETAILS AND INSPECTION COPIES http://www.cs.nott.ac.uk/~gmh/book.html +---------------------------------------------------------------------+ | Dr Graham Hutton Email : gmh at cs.nott.ac.uk | | School of Computer Science and IT | | University of Nottingham Web : www.cs.nott.ac.uk/~gmh | | Jubilee Campus, Wollaton Road | | Nottingham NG8 1BB, UK Phone : +44 (0)115 951 4220 | +---------------------------------------------------------------------+ 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. From Alessandro.Facchini at unil.ch Tue Mar 27 09:18:28 2007 From: Alessandro.Facchini at unil.ch (Alessandro Facchini) Date: Tue, 27 Mar 2007 15:18:28 +0200 Subject: [TYPES/announce] CSL07: last call for papers Message-ID: ********* Last Call for Papers ************** CSL 07 11-15 September, 2007 Lausanne (CH) Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL). The conference is intended for computer scientists whose research activities involve logic, as well as for logicians working on issues significant for computer science. CSL'07, the 16th annual EACSL conference will be organized in Lausanne by the Western Swiss Center for Logic, History and Philosophy of Sciences, and the University of Lausanne. The Ackermann Award for 2007 is sponsored by Logitech and will be presented to the recipients at CSL'07. A joint session with GAMES 07, the annual meeting of the European Network will take place on 11 September, 2007. http://www.unil.ch/csl07/ Topics of interest include: - automated deduction and interactive theorem proving, - constructive mathematics and type theory, - equational logic and term rewriting, - automata and games, - modal and temporal logics, - model checking, - logical aspects of computational complexity, - finite model theory, - computational proof theory, - logic programming and constraints, - lambda calculus and combinatory logic, - categorical logic and topological semantics, - domain theory, - database theory, - specification, extraction and transformation of programs, - logical foundations of programming paradigms, - verification and program analysis, - linear logic, - higher-order logic, - nonmonotonic reasoning, - logics and type systems for biology. Proceedings will be published in the LNCS series. Each paper accepted by the Programme Committee must be presented at the conference by one of the authors, and final copy be prepared according to Springer's guidelines. Submitted papers must be in Springer's LNCS style and of no more than 15 pages, presenting work not previously published. They must not be submitted concurrently to another conference with refereed proceedings. Any closely related work submitted to a conference or journal before April 2, 2007 must be reported to the PC chairs. Papers authored or coauthored by members of the Programme Committee are not allowed. Submitted papers must be in English and provide sufficient detail to allow the Programme Committee to assess the merits of the paper. Full proofs may appear in a technical appendix which will be read at the reviewer's discretion. The title page must contain: title and author(s), physical and e-mail addresses, identification of the corresponding author, an abstract of no more than, 200 words, and a list of keywords. The submission deadline is in two stages. Titles and abstracts must be submitted by 02 April, 2007 and full papers by 09 April, 2007. Notifications of acceptance will be sent by 21 May, 2007, and final versions are due 18 June, 2007. Important Dates: Submission - title & abstract: 02 April, 2007 - full paper: 09 April, 2007 - Notification: 21 May, 2007 - Final papers: 18 June, 2007 Invited Speakers: -Samson Abramsky (Oxford) -Luca de Alfaro (Santa Cruz) -Arnold Beckmann (Swansea) -Anuj Dawar (Cambridge) -Orna Kupferman (Jerusalem) -Helmut Seidl (Munich) Programme Committee: -Serge? Artemov (New-York) -Franz Baader (Dresden) -Lev Beklemishev (Moscow) -Andrei Bulatov (Burnaby) -Michel De Rougemont (Paris) -Jacques Duparc (co-Chair) (Lausanne) -Erich Gr?del (Aachen) -Thomas Henzinger (co-Chair) (Lausanne) -Michael Kaminski (Ha?fa) -Stephan Kreutzer (Berlin) -Benedikt Loewe (Amsterdam) -Rupak Majumdar (Los Angeles) -Paul-Andr? M?llies (Paris) -Joel Ouaknine (Oxford) -Jean-Eric Pin (Paris) -Nicole Schweikardt (Berlin) -Luc Segoufin (Orsay) -Thomas Strahm (Bern) -Ashish Tiwari (Menlo Park, CA) -Helmut Veith (Munich) -Igor Walukiewicz (Bordeaux) -------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: text/enriched Size: 3959 bytes Desc: not available Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070327/5c470800/attachment.bin From Silvio.Ranise at loria.fr Wed Mar 28 11:50:53 2007 From: Silvio.Ranise at loria.fr (Silvio.Ranise@loria.fr) Date: Wed, 28 Mar 2007 17:50:53 +0200 Subject: [TYPES/announce] FTP'07 Call for papers Message-ID: <1175097053.460a8eddc548a@www.loria.fr> FTP'07 - Call for Papers International Workshop on First-Order Theorem Proving University of Liverpool Liverpool, England (UK) September 12-13, 2007 http://www.csc.liv.ac.uk/~ftp07/ Scope ------ The series of FTP workshops focusses on all aspects of theorem proving in first-order logic. It aims to be a forum for the presentation of original work, and for the discussion of work in progress. Relevant topics for the workshop include (but are not limited to) * theorem proving in first-order classical, many-valued, and modal logics, including: - satisfiability in propositional logic, - satisfiability modulo theories, - decision procedures, - constraint reasoning, - equational reasoning, - term rewriting, - resolution - paramodulation/superposition; * strategies and complexity of theorem proving procedures; * applications of first-order theorem proving to: - program verification, - model checking, - artificial intelligence, - mathematics, - computational linguistics. Previous editions of FTP took place in Schloss Hagenberg, Austria (1997); Vienna, Austria (1998); St Andrews, Scotland (2000); as part of IJCAR in Siena, Italy (2001); Valencia, Spain (2003); as part of IJCAR in Cork, Ireland (2004); and Koblenz, Germany (2005). For more information about FTP, its scope and previous workshops, please, see http://www.csc.liv.ac.uk/FTP-WS/ Paper Submissions ------------------ Authors are invited to submit papers in the following categories: * Extended abstracts of 5-10 pages describing original results, work in progress, or future directions of research. * System descriptions of up to 5 pages, describing new systems or significant upgrades of existing ones, especially including experiments; sources and manuals of systems will have to be freely available online. Authors are encouraged to use LaTeX and the standard article class/style file (10pt or 11pt). The first page should contain the title, the authors' names, e-mail and postal addresses. Submissions should be made via Easychair at the following address: http://www.easychair.org/FTP07/ Submissions will be reviewed by at least two referees, possibly more, and will be evaluated on their significance, technical merit, and relevance to the workshop. Publication ------------ Accepted submissions will be published as a technical report of the University of Liverpool and will be distribted at the workshop. They will also be available on the web. As for the previous editions of FTP, a journal special issue is planned after the workshop. The submission will be open to papers on First-Order Theorem Proving. Important Dates ---------------- Abstract submission deadline: May 7, 2007 Full paper submission deadline: May 14, 2007 Notification of acceptance/rejection: June 15, 2007 Final version due: July 6, 2007 Workshop: September 12-13, 2007 Program Committee ------------------ Peter Baumgartner (Canberra, Australia) Bernhard Beckert (Koblenz, Germany) Reiner Haehnle (Chalmers, Sweeden) Ullrich Hustadt (Liverpool, England, UK) Alexander Leitsch (Vienna, Austria) William McCune (Albuquerque, New Mexico, USA) Hans de Nivelle (Wroclaw, Poland) Nicolas Peltier (Grenoble, France) David A. Plaisted (Chapell Hill, USA) Silvio Ranise (Nancy, France) [Chair] Christophe Ringeissen (Nancy, France) Albert Rubio (Barcelona, Spain) Luca Vigano (Verona, Italy) Jian Zhang (Beijing, China) Local Organization Chair ------------------------- U. Hustadt (Liverpool, England, UK) Conference Venue ----------------- The workshop will take place in at the Universtiy of Liverpool on September 12 and 13, 2006. It will be co-located with the 6th International Symposium on Frontiers of Combining Systems (FroCos'07) which will take place prior to FTP'07. Further information -------------------- For regular updates about the workshop organization, please, visit the FTP'07 web page: http://www.csc.liv.ac.uk/~ftp07/ For contacting the PC chair, please, send an email to Silvio.Ranise[AT]loria.fr (substitute [AT] with "@"). From gorla at di.uniroma1.it Thu Mar 29 05:26:33 2007 From: gorla at di.uniroma1.it (Daniele Gorla) Date: Thu, 29 Mar 2007 11:26:33 +0200 Subject: [TYPES/announce] SecCo'07: preliminary call for papers In-Reply-To: References: Message-ID: <460B8649.4080403@di.uniroma1.it> 5th International Workshop on Security Issues in Concurrency (SecCo'07) September 3rd, 2007, Lisboa (Portugal) Affiliated to CONCUR 2007 http://www.dsi.uniroma1.it/~gorla/SecCo07/ SCOPE AND TOPICS: Emerging trends in concurrency theory require the definition of models and languages adequate for the design and management of new classes of applications, mainly to program either WANs (like Internet) or smaller networks of mobile and portable devices (which support applications based on a dynamically reconfigurable communication structure). Due to the openness of these systems, new critical aspects come into play, such as the need to deal with malicious components or with a hostile environment. Current research on network security issues (e.g. secrecy, authentication, etc.) usually focuses on opening cryptographic point-to-point tunnels. Therefore, the proposed solutions in this area are not always exploitable to support the end-to-end secure interaction between entities whose availability or location is not known beforehand. The aim of the workshop is to cover the gap between the security and the concurrency communities. More precisely, the workshop promotes the exchange of ideas, trying to focus on common interests and stimulating discussions on central research questions. In particular, we look for papers dealing with security issues (such as authentication, integrity, privacy, confidentiality, access control, denial of service, service availability, safety aspects, fault tolerance, trust, language-based security) in emerging fields like web services, mobile ad-hoc networks, agent-based infrastructures, peer-to-peer systems, context-aware computing, global/ubiquitous/pervasive computing. SecCo'07 follows the success of SecCo'03 (affiliated to ICALP'03), SecCo'04 (affiliated to CONCUR'04) and SecCo'05 (affiliated to CONCUR'05). SUBMISSION GUIDELINES: The workshop proceedings will be published in the ENTCS series (*Electronic Notes in Theoretical Computer Science*); we thus encourage submissions already in that format. Submissions may be of two kinds: - Short papers (not included in the proceedings): up to 5 ENTCS pages; - Full papers: up to 15 ENTCS pages (including bibliography). Papers must be sumbitted electronically at the following URL: http://www.easychair.org/SecCo07/ Simultaneous submission to other conferences or journals is only allowed for short papers. These are an opportunity to present innovative ideas (without working out a full paper) and to get feedback from a technically competent audience. As done for the previous SecCo workshops, if the quality of the accepted submissions warrants it, there will be a special issue of the *Journal of Computer Security* devoted to selected papers from the workshop. INVITED SPEAKER (joint with EXPRESS'07): C?dric Fournet (Microsoft Research - Cambridge, UK) PANEL DISCUSSION: "Information hiding: state-of-the-art and emerging trends" The last afternoon session will host a panel that will be a venue where researchers from different areas of computer security will present common/orthogonal problems, techniques and goals related to information hiding. We shall cover aspects like data secrecy, anonimity, database security, ... approached from different points of view (language-based security, quantitative aspects, access control, ...). in the security of concurrent systems. The panelists are: Sabrina De Capitani di Vimercati (Univ. Milano, IT), Steve Kremer (INRIA and ENS Cachan, F) Pasquale Malacaria (Queen Mary, UK) Peter Ryan (Newcastle Univ., UK) David Sands (Chalmers Univ., SE) They will present their point of view on the topic and take questions from the audience. Active participation in the discussion by the audience will be encouraged. IMPORTANT DATES: Paper submission: June 4th, 2007 Notification: July 13th, 2007 Pre-Final version: July 23rd, 2007 Meeting date: September 3rd, 2007 Final version: September 28th, 2007 WORKSHOP CO-CHAIRS: Daniele Gorla (Dip. di Informatica - Univ. di Roma "La Sapienza", IT) Catuscia Palamidessi (INRIA and Ecole polytechnique, F) PROGRAMME COMMITTEE: Michael Backes (Saarland Univ., G) Tom Chothia (CWI, NL) V?ronique Cortier (CNRS Loria, F) Yuxin Deng (Univ. of New South Wales, AUS) Heiko Mantel (RWTH, G) Mogens Nielsen (BRICS, DK) Flemming Nielson (DTU, DK) Mark Ryan (Univ. of Birmingham, UK) Luca Vigan? (Univ. Verona, IT) Jan Vitek (Purdue Univ., USA) From pmt6sbc at maths.leeds.ac.uk Fri Mar 30 04:39:50 2007 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Fri, 30 Mar 2007 09:39:50 +0100 (BST) Subject: [TYPES/announce] CiE 2007 - Call for Participation In-Reply-To: References: Message-ID: ************************************************************ CiE 2007 http://www.mat.unisi.it/newsito/cie07.html Computability in Europe 2007: Computation and Logic in the Real World University of Siena Siena, 18-23 June 2007 CALL FOR PARTICIPATION CiE 2007 will address various aspects of the ways computability and theoretical computer science enable scientists and philosophers to deal with mathematical and real world issues, ranging through problems related to logic, mathematics, physical processes, natural computing, real computation and learning theory. At the same time it will focus on different ways in which computability emerges from the real world, and how this affects our way of thinking about everyday computational issues. The CiE conference series has become a primary focus for basic and applied research into a full range of computability related issues, and CiE is the largest such international meeting. DEADLINE FOR EARLY REGISTRATION: May 18, 2007 DEADLINE FOR SUBMITTING INFORMAL PRESENTATIONS: April 27, 2007 All presenters of informal presentations, are eligible to be invited to submit a full journal version of their talk to one of the post-conference publications - see: http://www.amsta.leeds.ac.uk/~pmt6sbc/cie07.jour.html LOCATION Siena is one of Italy's best preserved medieval towns, located in the heart of Tuscany. Siena, built on three hills and surrounded by well preserved walls, is filled with fine examples of Gothic architecture and has one of the world's most unique piazzas - il Campo. The world-famous Palio, which takes place in the Campo, is an important part of Sienese identity, history and culture. CiE 2007 takes place just 6 days before the start of the Palio on 29 June, 2007. Siena makes an excellent base for other excursions in Tuscany, as it is not far from charming towns such as San Gimignano, Pienza, and towns world famous for wine, such as Montalcino and Montepulciano. Florence and Pisa too are within easy reach. INVITED TUTORIAL AND PLENARY SPEAKERS: Pieter Adriaans (Amsterdam) Kobi Benenson (Harvard) Anne Condon (Vancouver) Stephen Cook (Toronto) Yuri Ershov (Novosibirsk) Wolfgang Maass (Graz) Sophie Laplante (Paris) Anil Nerode (Cornell) George Odifreddi (Turin) Roger Penrose (Oxford) Michael Rathjen (Leeds) Dana Scott (Carnegie Mellon) Robert I. Soare (Chicago) Philip Welch (Bristol) SPECIAL SESSIONS: * Doing without Turing Machines: Constructivism and Formal Topology * Approaches to Computational Learning * Real Computation * Computability and Mathematical Structure * Complexity of Algorithms and Proofs * Logic and New Paradigms of Computability * Computational Foundations of Physics and Biology INVITED SPECIAL SESSIONS SPEAKERS: Eric Allender (Rutgers) Andrej Bauer (Ljubljana) Vasco Brattka (Cape Town) Douglas Bridges (Canterbury, NZ) John Case (Newark, Delaware) Pieter Collins (Amsterdam) Thierry Coquand (Goeteborg) Felix Costa (Lisbon) Barbara F. Csima (Waterloo) Abbas Edalat (London) Martin Escardo (Birmingham) Joerg Flum (Freiburg) Sergey S. Goncharov (Novosibirsk) Hajime Ishihara (Tokyo) Natasha Jonoska (Tampa, Florida) Michal Koucky (Prague) James Ladyman (Bristol) Maria Emilia Maietti (Padua) Giancarlo Mauri (Milan) Klaus Meer (Odense) Itamar Pitowsky (Jerusalem) Robert Rettinger (Hagen) Grzegorz Rozenberg (Leiden) Frank Stephan (Singapore) Neil Thapen (Prague) Christopher Timpson (Leeds) Giuseppe Trautteur (Naples) Heribert Vollmer (Hannover) Osamu Watanabe (Tokyo) Jiri Wiedermann (Prague) Damien Woods (Cork) Liang Yu (Nanjing) Martin Ziegler (Paderborn) WOMEN IN COMPUTABILITY WORKSHOP in association with the Computer Research Association's Committee on the Status of Women in Computing Research (CRA-W) Organisers: Paola Bonizzoni, Elvira Mayordomo. Speakers: Anne Condon (Vancouver), Natasha Jonoska (Florida), Carmen Leccardi (Milan), and Andrea Cerroni (Milan) PROGRAMME COMMITTEE: M. Agrawal (Kanpur) M. Arslanov (Kazan) G. Ausiello (Roma) A. Bauer (Ljubljana) A. Beckmann (Swansea) U. Berger (Swansea) P. Bonizzoni (Milan) A. Cantini (Firenze) B. Cooper (Leeds, co-chair) L. Crosilla (Firenze) J. Diaz (Barcelona) C. Dimitracopoulos (Athens) F. Ferreira (Lisbon) S. Goncharov (Novosibirsk) P. Gruenwald (Amsterdam) D. Harel (Rehovot) A. Hodges (Oxford) J. Kempe (Paris) G. Longo (Paris) B. Loewe (Amsterdam) J. Makowsky (Haifa) E. Mayordomo Camara (Zaragoza) W. Merkle (Heidelberg) F. Montagna (Siena) D. Normann (Oslo) T. Pheidas (Heraklion) G. Rozenberg (Leiden) G. Sambin (Padova) H. Schwichtenberg (Muenchen) W. Sieg (Carnegie Mellon) A. Sorbi (Siena, co-chair) I. Soskov (Sofia) P. van Emde Boas (Amsterdam) CONFIRMED SPONSORS OF CiE 2007: AILA (Associazione Italiana di Logica e Applicazioni), EATCS (European Association for Theoretical Computer Science), ASL (Association for Symbolic Logic), EACSL (European Association for Computer Science Logic), FoLLI (The Association of Logic, Language and Information), GNSAGA-INdAM (Gruppo Nazionale per le Strutture Algebriche e Geometriche e loro Applicazioni-Istituto NAzionale di Alta Matematica), Banca Monte Dei Paschi Di Siena, and The University of Siena. CiE 2007 will be co-located with CCA 2007, the annual CCA (Computability and Complexity in Analysis) Conference (Siena, College Santa Chiara, June 16-18, 2007): http://cca-net.de/cca2007/ ================================================================ Andrea Sorbi Dipartimento di Scienze Matematiche ed Informatiche "Roberto Magari" Pian dei Mantellini 44 53100 Siena, Italy Phone: 0039-0577-233727 Fax: 0039-0577-233730 From eduardo at sol.lifia.info.unlp.edu.ar Fri Mar 30 11:05:41 2007 From: eduardo at sol.lifia.info.unlp.edu.ar (eduardo@sol.lifia.info.unlp.edu.ar) Date: Fri, 30 Mar 2007 12:05:41 -0300 Subject: [TYPES/announce] LSFA'07, Second CFPs Message-ID: <20070330120541.7ygc0ijvtw48cssg@webmail.lifia.info.unlp.edu.ar> LSFA'07 Call for Papers LSFA'07 - 2nd Workshop on Logical and Semantic Frameworks, with Applications August 28th, 2007, Ouro Preto, Minas Gerais, Brazil http://www.mat.unb.br/lsfa2007 (Satellite Event to SBMF'07, the Brazilian Symposium on Formal Methods) Scope Logical and semantic frameworks are formal languages used to represent logics, languages and systems. These frameworks provide foundations for formal specification of systems and programming languages, supporting tool development and reasoning. The objective of this one-day workshop is to put together theoreticians and practitioners to promote new techniques and results, from the theoretical side, and feedback on the implementation and use of such techniques and results, from the practical side. Topics of interest to this forum include, but are not limited to: * Logical frameworks o Proof theory o Type theory o Automated deduction * Semantic frameworks o Specification languages and meta-languages o Formal semantics of languages and systems o Computational and logical properties of semantic frameworks * Implementation of logical and/or semantic frameworks * Applications of logical and/or semantic frameworks LSFA?07 also aims to be a forum for presenting and discussing work in progress, and therefore to provide feedback to authors on their preliminary research. Submissions to the workshop will in the form of full papers. The proceedings are produced only after the meeting, so that authors can incorporate this feedback in the published papers. Invited Speakers Fairouz Kamareddine, Heriot-Watt University, Edinburgh (Confirmed) Gilles Dowek, ?cole Polytechnique, Paris (Confirmed) Program Committee Mauricio Ayala-Rinc?n UnB (Bras?lia), co-chair Clemens Ballarin TUM (M?nchen) Mario Benevides UFRJ (Rio de Janeiro) Eduardo Bonelli UNLP (La Plata) Christiano Braga UCM (Madrid) Clare Dixon University of Liverpool (Liverpool) Marcelo Finger USP (S?o Paulo) Bernhard Gramlich UWien (Wien) Delia Kesner Paris 7 (Paris) Claude Kirchner Loria (Nancy) Edward Hermann Haeusler PUC-Rio (Rio de Janeiro), co-chair Fairouz Kamareddine Heriot-Watt (Edinburgh) Jo?o Marcos UFRN (Natal) Narciso Mart?-Oliet UCM (Madrid) Pierre-Etienne Moreau INRIA (Nancy) Peter Mosses Swansea University (Swansea) Mart?n Musicante UFRN (Natal) C?sar Mu?oz NIA-NASA (Hampton) Elaine Pimentel UFMG (Belo Horizonte) Ruy de Queiroz UFPE (Recife) Simona Ronchi Della Rocca Universit? di Torino (Torino) Hongwei Xi Boston University (Boston) Organizing Committee Mauricio Ayala-Rinc?n UnB (Bras?lia) Christiano Braga UCM (Madrid) Luc?lia C. Figueiredo UFOP (Ouro Preto), local-chair Edward Hermann Hauesler PUC-Rio (Rio de Janeiro) Fl?vio L. C. de Moura UnB (Bras?lia) Elaine Pimentel UFMG (Belo Horizonte), local-chair Dates and Submission Paper submission deadline: May 19th Author notification: June 30th Camera ready: July 31st Contributions should be written in English and submitted in the form full papers with at most 16 pages. They must be unpublished and not submitted simultaneously for publication elsewhere. The submission should be in the form of a PDF file uploaded to LSFA'07 page at EasyChair until the submission deadline in May 19th, by midnight, Central European Standard Time (GMT+1). The papers should be prepared in latex using Elsevier ENTCS style. The workshop pre-proceedings, containing the reviewed extended abstracts, will be handed-out at workshop registration. After the workshop, according to the quantity and quality of selected papers, the authors will be invited to submit full versions of their works that will be also reviewed to high standards. Currently a special issue of the first edition of the workshop LSFA'06 is being processed and will appear in the new Elsevier Journal on Algorithms in Applied Logic. At least one of the authors should register at the conference. The paper presentation should be in english. Contact Information For more information please contact the chairs The web page of the event can be reached at: http://www.mat.unb.br/lsfa2007/ ---------------------------------------------------------------- Este mensaje ha sido enviado utilizando IMP desde LIFIA. From aserebre at win.tue.nl Fri Mar 30 14:03:24 2007 From: aserebre at win.tue.nl (A Serebrenik) Date: Fri, 30 Mar 2007 20:03:24 +0200 (CEST) Subject: [TYPES/announce] ***Submission Deadline Postponed*** Workshop on Termination 2007 In-Reply-To: References: Message-ID: *************************************************************** Submission Deadline Postponed ********************************* Call for Papers Ninth International Workshop on Termination (WST 2007) Paris, France, June 29, 2007 Affiliated with RDP 2007 Termination is a fundamental topic in computer science. Though termination of processes is often a strict requirement, it may be hard to establish. Classical results state the undecidability of various termination problems, so research focuses on automated methods that prove termination or non-termination in practical cases. The topic is challenging both in theory (mathematical logic, proof theory) and practice (software development, formal methods), and many interesting ramifications are yet to be explored. The 9th International Workshop on Termination will delve into all aspects of termination. It will continue the sequence of successful workshops held in St. Andrews (1993), La Bresse (1995), Ede (1997), Dagstuhl (1999), Utrecht (2001), Valencia (2003), Aachen (2004), and Seattle (2006). We hope to attain the same friendly atmosphere as those past workshops. The intent is to bring together, in an informal setting, researchers interested in various aspects of termination, whether this interest be practical or theoretical, primary or derived. The workshop is hoped to provide a ground for cross-fertilisation of ideas from term rewriting and from programming. Contributions from the imperative, object-oriented, constraint, functional, and logic programming communities, and papers investigating new applications of termination are particularly welcome. Paper Submissions: Extended abstracts in the prescribed format, not exceeding 4 pages, should be submitted electronically through EasyChair's WST 2007 submission site http://www.easychair.org/WST2007/. A common workshop style file will be made available on the WST'2007 web site. Papers should be submitted in PostScript or PDF format. We expect proceedings to be made available through the Computing Research Repository, CoRR. The Termination Competition: The competition will run again in 2007, and entries are strongly encouraged. Detailed instructions for submission of problems and programs will be made available at the competition website http://www.lri.fr/~marche/termination-competition/2007/ Program Committee Nachum Dershowitz (Tel Aviv, Israel) Daniel De Schreye (Leuven, Belgium) Samir Genaim (Madrid, Spain) Juergen Giesl (Aachen, Germany) Isabelle Gnaedig (Nancy, France) Dieter Hofbauer (Kassel, Germany), co-chair Aart Middeldorp (Innsbruck, Austria) Etienne Payet (La Reunion, France) Alexander Serebrenik (Eindhoven, The Netherlands), co-chair Termination Competition Committee Claude Marche (Paris, France) Johannes Waldmann (Leipzig, Germany) Hans Zantema (Eindhoven, The Netherlands) Workshop Themes (non-exhaustive list) Termination of programs Termination of rewriting Normalization of lambda calculi Implementation of termination methods Challenging termination problems and proofs Application of termination methods, e.g. to program transformation and compilation Comparison and classification of termination methods Non-termination detection Termination methods for theorem provers Termination in distributed systems Termination proof methods for liveness and fairness Derivational complexity Well-quasi-orderings and ordinal notations Important Dates: Deadline for electronic submission of papers : April 23, 2007 Notification of acceptance : May 14, 2007 Deadline for final versions : May 27, 2007 Competition Deadlines: Submission of public problems : May 1, 2007 Registration of termination tools : May 21, 2007 Submission of secret problems : June 1, 2007 Submission of termination tools : June 1, 2007 Start of competition : June 4, 2007 Workshop Venue and Related Events: WST 2007 is part of the Federated Conference on Rewriting, Deduction, and Programming 2007. Co-located events include RTA'07, HOR'07, PATE'07, RULE'07, SecReT'07, UNIF'07, WFLP'07, and WRS'07. These colloquia will run from June 25 to June 29, 2007, in Paris (France). For details see the RDP website at http://www.rdp07.org/. Web Sites WST 2007: http://www.rdp07.org/wst.html Termination Competition: http://www.lri.fr/~marche/termination-competition/2007/ RDP 2007: http://www.rdp07.org/ From hilde at itu.dk Fri Mar 30 16:36:16 2007 From: hilde at itu.dk (hilde@itu.dk) Date: Fri, 30 Mar 2007 22:36:16 +0200 (CEST) Subject: [TYPES/announce] PhD Scholarship in Formal Semantics and Types for Mobile Adaptive Business Processes Message-ID: <38425.80.63.146.6.1175286976.squirrel@secure.itu.dk> PhD Scholarship in Formal Semantics and Types for Mobile Adaptive Business Processes I hereby invite applicants for a PhD scholarship within Formal Semantics and Types for Mobile Adaptive Business Processes (ref. no. 225-0026) at the IT University of Copenhagen (ITU). The scholarship is affiliated to the FIRST graduate school (www.first.dk), the Programming, Logic and Semantics Research Group (http://www.itu.dk/research/pls/) and the Computer Supported Mobile Adaptive Business Processes (www.CosmoBiz.org) research project at ITU. Application deadline is May 7, 2007 at 12.00 noon. The PhD scholarship runs for a period of three years (possibly four years if initiated prior to obtaining a MSc). It is expected to start summer/fall 2007. Applicants are expected to have an MSc (or having completed 4 years of studies towards a MSc) in Computer Science, Engineering or Mathematics and in particular have experience in one or more of the areas of: - type theory - formal semantics - process calculi - bigraphs - graph rewriting - concurrency theory - implementation of research-based software systems. The successful applicant will be an excellent student capable of conducting research, under supervision, at the highest international level. In the evaluation of the applications emphasis will especially be put on grade average, prior academic performance, collaborative skills and the ability to make a realistic and promising work plan for the project. CosmoBiz is funded by ITU, the Danish Research Council for Technology and Production (grant no 274-06-0415) and Microsoft Development Center Copenhagen (http://www.microsoft.com/danmark/om/mdcc/default.mspx). The full announcement of the scholarship can be found at: http://www1.itu.dk/sw60830.asp Application form and guidelines for the application can be found at: http://www1.itu.dk/sw38325.asp For more information on the CosmoBiz project please consult the project web page at www.CosmoBiz.org and feel free to contact me by email at hilde at itu.dk Best regards, Thomas Hildebrandt, Associate Professor The Programming, Logic and Semantics Research Group (http://www.itu.dk/research/pls/) IT University of Copenhagen, Denmark From djg at cs.washington.edu Sun Apr 1 11:13:17 2007 From: djg at cs.washington.edu (Dan Grossman) Date: Sun, 01 Apr 2007 08:13:17 -0700 Subject: [TYPES/announce] Summer School on Language-Based Techniques for Integrating with the External World Message-ID: <460FCC0D.3090404@cs.washington.edu> [Registration extended! Please register today. ] Call for Participation: Summer School on Language-Based Techniques for Integrating with the External World July 18-26, 2007 University of Oregon Eugene, Oregon Registration Deadline: March 31 (NOW EXTENDED: April 30), 2007 Registration requests received after April 30 will be evaluated on a space-available basis http://www.cs.uoregon.edu/activities/summerschool/summer07/ e-mail: summerschool at cs.uoregon.edu Program ------- This Summer School will cover current research in language-based techniques for integrating with the external world, ranging from foundational materials on principles, logic and type systems, advanced techniques, and applications of these ideas in practice. Material will be presented at a tutorial level that will help graduate students and researchers from academia or industry understand the critical issues and open problems confronting the field. The course is open to anyone interested. Prerequisites are an elementary knowledge of logic and mathematics that is usually covered in undergraduate classes on discrete mathematics. Some knowledge of programming languages at the level provided by an undergraduate survey course will also be expected. Our primary target group is PhD students. We also expect attendance by faculty members who would like to conduct research on this topic or introduce new courses at their universities. The program consists of more than thirty, 80 minute lectures presented by internationally recognized leaders in programming languages and security research. Topics include: Fault Tolerant Computing - David August, Princeton, with Frances Perry and George Reis Scalable Defect Detection - Manuvir Das, Microsoft Corporation, with Zhe Yang and Daniel Wang Typing Ad-hoc Data - Kathleen Fisher, AT&T Research Understanding Multilingual Software - Jeff Foster, University of Maryland Types for Safe C-Level Programming - Dan Grossman, University of Washington Statistical Debugging - Ben Liblit, University of Wisconsin-Madison XML and Web Application Programming - Anders Moller, University of Aarhus Programming Models for Distributed Computing - Yannis Smaragdakis, University of Oregon Web and Database Application Security - Zhendong Su, University of California, Davis Staged Programming - Walid Taha, Rice University Venue ----- The summer school will be held at the University of Oregon, located in the southern Willamette Valley city of Eugene, close to some of the world's most spectacular beaches, mountains, lakes and forests. On Sunday, July 22, students will have the option of participating in a group activity in Oregon's countryside. Registration ------------ The cost for registration is $300.00 (USD) for graduate students, and $450.00 (USD) for other participants. Registration must be paid upon acceptance to the summer school, and is non-refundable. There are a limited number of grants available to fund part of the cost of student participation. If you are a graduate student and want to apply for grant money to cover your expenses, please also include a statement of your needs with your registration. Additional information about the program, registration, venue, and housing options is available on the web site. Or, you may request more information by email. To register for the Summer School, send a CV that includes a short description of your educational background and one letter of reference, unless you have already been granted a Ph.D. Please include your name, address and current academic status. Send all registration materials to summerschool at cs.uoregon.edu All registration materials should be delivered to the program by March 31, 2007. Materials received after the closing date will be evaluated on a space available basis. Non U.S. citizens should begin immediately to obtain travel documents. Housing ------- The school will provide on-campus housing and meals. To share a room with another student attending the school, the cost is $490.00 (USD) per person. Housing rates are based on check-in Tuesday, July 17 and check-out before noon on Friday, July 27. Some single rooms may be available for an additional fee of $130.00 (USD). If you'd like a single room, please indicate your choice and we will try to accommodate you on a first-come/first-served basis. Organizers ---------- Organizing committee: Jeff Foster, Dan Grossman, and Zena Ariola From mirko.viroli at unibo.it Mon Apr 2 11:20:29 2007 From: mirko.viroli at unibo.it (Mirko Viroli) Date: Mon, 02 Apr 2007 17:20:29 +0200 Subject: [TYPES/announce] Call for Track Proposals: ACM SAC 2008 (Symposium on Applied Computing) Message-ID: <46111F3D.2070005@unibo.it> CALL FOR TRACK PROPOSALS ? SAC 2008 The 23rd ACM Symposium on Applied Computing March 16 ? 20, 2008, Fortaleza, Cear?, Brazil http://www.acm.org/conferences/sac/sac2008 For the past twenty-two years the ACM Symposium on Applied Computing (SAC) has been a primary and international forum for applied computer scientists, computer engineers and application developers to gather, interact and present their work. The ACM Special Interest Group on Applied Computing (SIGAPP) is the sole sponsor of SAC. The conference proceedings are published by ACM and are also available online through ACM's Digital Library. SAC is based on a flexible structure of mostly self-contained and self-managed tracks. Over the past years SAC hosted tracks on a variety of timely topics such as Artificial Intelligence, Bioinformatics, Computer Security, Database Technology, Data Mining, Embedded Systems, Evolutionary Computing, Distributed Systems and Grid Computing, Mobile Computing, Programming Languages, Software Engineering, and Web Technologies. SAC 2007, which was held in Seul, Korea, consisted of 38 tracks that hosted 256 accepted papers out of about 786 submissions. More information on past SAC events can be found at http://www.acm.org/conferences/sac. The 23nd Annual SAC meeting will be held 16-20 March 2008 in Fortaleza, Cear?, Brazil, and is hosted by the University of Fortaleza (UNIFOR) and the Federal University of Cear? (UFC). The conference Organizing Committee solicits proposals for organizing and hosting tracks. Prospective track chairs should submit an up to two-page description for organizing a track, which should include at least the following items: 1) The proposed title for the track with a description of its aims, topics it will cover, and rationale for having such a track in SAC. This rationale should refer to any related conference events that are held regularly and why the proposed track differs from them or complements them. The proposed track should not be overly general but also not overly specialized, thus being able to attract a wide audience of people sharing similar interests. Proposals from industry are also welcomed. Despite its name, SAC also welcomes topics of mostly theoretical nature, provided there is clear practical potential in applying the results of such work. 2) A short description of the activities the track chair(s) will undertake upon acceptance of the proposal, to disseminate the call-for-papers for the track, and to manage the review process. (Specific guidelines to track chairs regarding these issues will also be provided.) 3) A short CV of the prospective track chair(s) with reference to research interests and publication record directly related to the themes of the proposed track, and any previous experience of involvement in the organization of similar events (in the interest of brevity, reference to a personal web page where such information can be found will be sufficient). All proposals will be reviewed by the Program Committee using the criteria described above. The Committee reserves the right to: (1) accept a proposal as is, (2) require modifications before acceptance, (3) recommend merging of similar proposals with a considerable overlap in the topics addressed (in this case the track chairs of the different proposals will be asked to form a single chair), (4) reject a proposal. Upon acceptance of a proposal, the track chairs will be notified of their responsibilities in managing the affairs of their track; as such responsibilities are defined by both the ACM and SAC conference rules. The Committee reserves the rights to cancel a track at any time if these responsibilities are not addressed adequately by the track chair(s). IMPORTANT DATES April 13, 2007: Submission of track proposals April 30, 2007: Notification of acceptance/rejection of tracks Sept 8, 2007: Submission of papers by authors Oct 16, 2007: Notification of paper acceptance/rejection Please submit your proposal electronically in any acceptable readable format to: Mirko Viroli SAC 2008 Program Co-Chair Alma Mater Studiorum - Universit? di Bologna, Italy mirko.viroli [@] unibo.it From pierre.courtieu at cnam.fr Tue Apr 3 02:39:04 2007 From: pierre.courtieu at cnam.fr (Pierre Courtieu) Date: Tue, 3 Apr 2007 08:39:04 +0200 Subject: [TYPES/announce] CFP RDP Workshop Proof Assistants and Types in Education Message-ID: <20070403083904.6b0b3c07@centaur.cnam.fr> ============================================================================= Final call for papers, the deadline for submission has been extended to April 11, 2007. ===================================================================== Call for Papers RDP (RTA 07 + TLCA 07) Workshop PATE Proof Assistants and Types in Education June 25 2007 http://www.rdp07.org/pate.html ===================================================================== This workshop is supported by the EU Types Coordination Action. The purpose of the workshop is to bring together researchers and lecturers interested in applying type theory and proof assistants in teaching. Contributions are solicited in the following subject areas and related topics: - type theory as a language for (teaching) mathematics and programming; - computer assisted informal reasoning; - tools and languages for teaching math and logic; - experience in using proof assistants in class. Submissions and Publication ----------------------------- Authors are invited to submit a paper (max 15 pages) by e-mail to Pierre.Courtieu at cnam.fr by April 11, 2007. Preliminary proceedings will be available at the workshop. Submissions should be in PostScript or PDF format, using ENTCS style files. Important Dates ----------------- Submission deadline: April 11, 2007 Notification: May 15, 2007 Pre-proceedings version due: June 7, 2007 Workshop: June 25, 2007 Programme Committee -------------------- Pierre Courtieu CNAM Paris (Co-Chair) Herman Geuvers Nijmegen (Co-Chair) Hugo Herbelin INRIA Paris Adam Naumowicz Bialystok Claudio Sacerdoti Coen Bologna Pawel Urzyczyn Warsaw From moggi at disi.unige.it Wed Apr 4 08:48:29 2007 From: moggi at disi.unige.it (moggi@disi.unige.it) Date: Wed, 4 Apr 2007 14:48:29 +0200 (CEST) Subject: [TYPES/announce] ICTCS'07 - final call for papers Message-ID: <20070404124829.423663A676@mailstore.csita.unige.it> The 10th Italian Conference on Theoretical Computer Science (ICTCS'07) Rome, Italy, October 3-5, 2007 http://www.disp.uniroma2.it/ictcs07/ Final Call for Papers Important Dates: Deadline for abstract pre-submission: 15 April 2007 Deadline for paper submission: 19 April 2007 Notification of Acceptance: 31 May 2007 Conference: 3-5 October 2007 Conference Web Page: http://www.disp.uniroma2.it/ictcs07/ Electronic Submission Web Page: http://www.easychair.org/ICTCS07/ The 10th Italian Conference on Theoretical Computer Science (ICTCS'07) will be held in Rome, Italy. Papers presenting original contributions in any area of theoretical computer science are being sought. Typical but not exclusive topics of interest include: * Algebraic and categorical models; * Algorithmic aspects of networks; * Algorithmic game theory; * Algorithms and data structures; * Computability; * Computational complexity; * Computational biology; * Computational geometry; * Cryptography and security; * Databases, semi-structured data and finite model theory; * Emerging and non-standard models of computation; * Experimental analysis of algorithms; * Formal languages and automata theory; * Internet algorithmics; * Logics, formal methods and model checking; * Models of concurrent, distributed and mobile systems; * Models of reactive, hybrid and stochastic systems; * Parallel, distributed and external memory computing; * Principles of programming languages; * Program analysis and transformation; * Quantum computing; * Specification, refinement and verification * Type systems and theory, typed calculi. SUBMISSION GUIDELINES. Only submissions received through the electronic submission web page will be considered. Authors must pre-submit title and plain text abstract by April 15, only these authors will be allowed to submit an extended abstract (in pdf) by April 19. The extended abstract should start with a title page consisting of the title of the paper; each author's name, affiliation, and email address; and a brief summary of the results to be presented. This should then be followed by a technical exposition of the main ideas and techniques used to achieve the results, including motivation and a clear comparison with related work. The full extended abstract should not exceed 12 single-spaced pages. If more details are needed to substantiate the main claims of the paper, the submission may include a clearly marked appendix that will be read at the discretion of the program committee. Submissions deviating significantly from these guidelines risk rejection without consideration of their merits. PROCEEDINGS. The proceedings of the conference will be published by World Scientific, and will be available for distribution at the conference. The final version of each accepted paper must be submitted in electronic form conforming to the World Scientific style and not exceeding 12 pages. Invited Speakers: * Giorgio Ausiello * Rocco de Nicola Invited Speakers of special session for Coppo-Dezani-Ronchi: * Henk Barendregt * Chantal Berline * Corrado Boehm * Furio Honsell * Giuseppe Longo * Pawel Urzyczyn Program Committee: * Marcella Anselmo (Salerno Univ., Italy), * Alberto Bertoni (Milano Univ., Italy), * Roberto Bruni (Pisa Univ., Italy), * Nadia Busi (Bologna Univ., Italy) * Ferruccio Damiani (Torino Univ., Italy), * Paola Inverardi (L'Aquila Univ., Italy), * Giuseppe F. Italiano (Roma "Tor Vergata" Univ., Italy, Co-Chair), * Irit Katriel (Brown Univ., USA), * Giovanni Manzini (Univ. Piemonte Orientale, Italy), * Alberto Marchetti-Spaccamela (Roma "La Sapienza" Univ., Italy), * Dimitrios Michail (MPI Saarbruecken, Germany), * Eugenio Moggi (Genova Univ., Italy, Co-Chair), * Alberto Momigliano (Edinburgh Univ., UK), * Piotr Sankowski (Warsaw Univ., Poland), * Roberto Segala (Verona Univ., Italy), * Francesca Toni (Imperial College London, UK). Organizing Committee: * Fabio Dellutri (Roma "Tor Vergata" Univ.), * Luigi Laura (Roma "La Sapienza" Univ.), * Michela Loja (Roma "Tor Vergata" Univ.), * Maurizio Saltali (Roma "Tor Vergata" Univ.). From aichernig at ist.tugraz.at Tue Apr 10 14:05:33 2007 From: aichernig at ist.tugraz.at (Bernhard K. Aichernig) Date: Tue, 10 Apr 2007 20:05:33 +0200 Subject: [TYPES/announce] ICTAC 2007: Final call for papers Message-ID: <1176228334.27026.127.camel@localhost.localdomain> Call for Papers ICTAC 2007 4th International Colloquium on Theoretical Aspects of Computing 26-28 September 2007, Macao SAR, China http://www.iist.unu.edu/ictac07 Important Dates: Paper submission: 20 April 2007, Notification of acceptance: 1 June 2007, Final copy for proceedings: 22 June 2007, ICTAC 2007: 26-28 September 2007. Associated Events: - School on Domain Modelling and the Duration Calculus, 17-21 September 2007, Shanghai - Festschrift Symposium dedicated to the 70th birthdays of Dines Bj?rner and Zhou Chaochen, 24-25 September 2007, Macao - Workshops, 22-23 September, 2007, Macao See Call for Workshop Proposals at conference URL! ICTAC is an International Colloquium on Theoretical Aspects of Computing founded by the International Institute for Software Technology of the United Nations University (UNU-IIST). The aim of the colloquium is to bring together practitioners and researchers from academia, industry and government to present research results, and exchange experience, ideas, and solutions for their problems in theoretical aspects of computing. Beyond these scholarly goals, another main purpose of the conference is to promote cooperation in research and education between participants and their institutions, from developing and industrial countries, as in the mandate of the United Nations University. The previous three ICTAC events were held in Guiyang, China (2004), Hanoi, Vietnam (2005), Tunis, Tunisia (2006). The topics of the conference include, but are not limited to: - automata theory and formal languages - principles and semantics of programming languages - logics and their applications - software architectures and their description languages - software specification, refinement, and verification - model checking and theorem proving - formal techniques in software testing - models of object and component systems - coordination and feature interaction - integration of formal and engineering methods - service-oriented development - models of concurrency, security, and mobility - theory of parallel, distributed, and internet-based (grid) computing - real-time, embedded and hybrid systems - type and category theory in computer science - case studies - theories, tools and experiments of verified systems - integration of theories of system development and their tool support ICTAC 2007 will have a technical program for five days including a two-day festschrift symposium dedicated to the 70th birthdays of former UNU-IIST directors, Dines Bj?rner and Zhou Chaochen, and three days for a conference. There will also be a training school in the preceding week on topics of Domain Modelling and the Duration Calculus, to which Dines Bj?rner and Zhou Chaochen have made significant contribution. Paper Submissions: Submissions to the conference must not have been published or be concurrently considered for publication elsewhere. All submissions will be judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. Papers should be written in English and not exceed 15 pages in LNCS format (see http://www.springer.de/comp/lncs/authors.html for details). Proceedings of the previous editions of ICTAC were published by Springer in the LNCS series. We plan to do the same this year. Best papers will be selected from the accepted papers and their authors invited to submit an extended version of their work to a special issue of Formal Aspects of Computing. Submission Procedure: Further information and instruction about submission can be found at the conference website http://www.iist.unu.edu/ictac07. General Chairs: John Fitzgerald, Newcastle University, UK George Michael Reed, UNU-IIST, Macao Program Chairs: Cliff Jones, Newcastle University, UK Zhiming Liu, UNU-IIST, Macao Jim Woodcock, University of York, UK Organisation Chair: Chris George, UNU-IIST, Macao Workshop Chair: Dang Van Hung, UNU-IIST, Macao Publicity Chair: Bernhard K. Aichernig, TU Graz, Austria Sponsored by: UNU-IIST, Formal Methods Europe PC Members: M?che?l mac an Airchinnigh, IE Farhad.Arbab, NL Kamel Barkaoui, FR Jonathan P. Bowen, UK Andrew Butterfield, IE Ana Cavalcanti, UK Antonio Cerone, MO Jim Davies, UK David Deharbe, BR Jin Song Dong, SG Lindsay Groves, NZ Stefan Hallerstede, CH Michael Hansen, DK Ian Hayes, AU Dang Van Hung, MO Mathai Joseph, IN Joseph Kiniry, IE Peter Gorm Larsen,DK Xuandong Li, CN Shaoying Liu, JP Ali Mili, US Joe Morris, IE Leonor Prensa Nieto, FR Anders Ravn, DK Augusto Sampaio, BR Emil Sekerinski, CA Natarajan Shankar, US Ji Wang, CN Naijun Zhan, CN Invited Speakers: Dines Bj?rner, JAIST, Japan Zhou Chaochen, Institute of Software, CAS, China He Jifeng, East China Normal University, China Zohar Manna, Stanford University, USA -- Dr. Bernhard K. Aichernig, Assistant Professor, IST, TU Graz http://www.ist.tugraz.at/aichernig From paul-andre.mellies at pps.jussieu.fr Tue Apr 10 17:27:21 2007 From: paul-andre.mellies at pps.jussieu.fr (=?ISO-8859-1?Q?Paul-Andr=E9_Melli=E8s?=) Date: Tue, 10 Apr 2007 23:27:21 +0200 Subject: [TYPES/announce] CNRS postdoctoral position in Paris Message-ID: <600BBC4C-081E-473B-BE47-05B2B901A23D@pps.jussieu.fr> CNRS POSTDOCTORAL POSITION ANNOUNCEMENT A one-year postdoctoral fellowship in mathematics and computer science has been opened by the CNRS for the next academic year. The purpose of the postdoc position is to work in our research team PPS (Proofs, Programs, Systems) on a project at the interface between -- proof theory (linear logic) -- type theory (dependent types) -- rewriting theory (rewriting modulo) -- homotopy theory (model structures) -- category theory (higher dimensional categories) The more detailed research project appears below. The postdoc position will take place at the Institut Mathematique de Jussieu, a very large and lively mathematical research institute situated in Paris centre. The deadline for submission is 10 MAY 2007. Potential applicants should contact us as early as possible Pierre-Louis Curien (curien at pps.jussieu.fr) Paul-Andre Mellies (mellies at pps.jussieu.fr) For more information about the PPS research group, the institute, and the new foundation for mathematical sciences in Paris, see http://www.pps.jussieu.fr http://www.math.jussieu.fr http://www.sciencesmaths-paris.fr/ ------------------------------------------------------------------------ -------------------------------------------- Research project Type theory plays a fundamental role in the definition of programming languages and proof systems. More specifically, dependent type theory introduced by Martin-Lof in the 1970s lies at the heart of many proof assistants, like the Coq system developed at INRIA. Recently, a promising meeting point has emerged between dependent type theory, and homotopy theory -- a theory embracing all of algebraic topology. The basic idea is simple: the typing towers encountered in type theory, where a program M has a type tau, which itself has a class s... are of the same nature as the homotopy towers, where two paths f and g of dimension 1 are related by homotopy relations alpha and beta of dimension 2, themselves related by homotopy relations of dimension 3, etc. However, this meeting point between type theory and homotopy theory can only be reached at the price of abstraction, using the higher dimensional category theory. We are convinced that this homotopic point of view leads eventually to a better integration of type theory (dependent types), proof theory (linear logic), and rewriting theory (rewriting modulo). Profile of the candidate The candidate will have an expertise in at least one of the following fields: proof theory, type theory, rewriting theory, homotopy theory, higher dimensional category theory. He will also be curious to learn the other fields, and to work at their interface. -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070410/0045ca8c/attachment.htm From blanqui at loria.fr Wed Apr 11 09:13:20 2007 From: blanqui at loria.fr (Frederic Blanqui) Date: Wed, 11 Apr 2007 15:13:20 +0200 (CEST) Subject: [TYPES/announce] INRIA PhD position In-Reply-To: References: Message-ID: Title: Generation of construction functions guaranteeing algebraic invariants on concrete data types Aim: Although concrete data types are very useful in defining complex data structures, they are not always sufficient to adequately specify the data structures required by some algorithms. Often, only a subset of the concrete data type is in fact used since some invariants between the components are mandatory to ensure the correctness of the program. Now, many invariants can be described by using some equational theory. For instance, a sorted list is a particular representative of the equivalence class of lists modulo commutativity. The usual way to solve this problem is to use abstract data types or, better, private data types if one does not want to lose the ability of doing pattern matching. We propose to study the automatic generation of certified construction functions guaranteeing algebraic invariants on concrete data types, and develop an extension of OCaml with relational data types, that is, data types with invariants described by user defined equations. More information and online application on: http://www.talentsplace.com/syndication1/inria/frdoc/details.html?id=PGTFK02620$ Competences and pro The position involves research and development in the area of functional programming, rewriting theory (in particular Knuth-Bendix completion) and interactive theorem proving. Speaking french is not necessary. Salary: the monthly gross salary is approx. EUR 1,875. Environment: - laboratory: LORIA (http://www.loria.fr/) - team: Protheo (http://protheo.loria.fr/) - project: Quotient (http://quotient.loria.fr/) - location: Nancy, in the East of France is at 1:30 from Paris by tren, 1:30 from Luxembourg airport by car, and 1:30 from Germany and Belgium. Application deadline: 30 April 2007. Contact: Frederic Blanqui (http://www.loria.fr/~blanqui/) More information about INRIA PhD positions: http://www.inria.fr/travailler/opportunites/doc.en.html From odersky at gmail.com Wed Apr 11 15:00:51 2007 From: odersky at gmail.com (martin odersky) Date: Wed, 11 Apr 2007 21:00:51 +0200 Subject: [TYPES/announce] PostDoc and Ph.D. Student Positions in the Scala Group Message-ID: <9461d7d00704111200l13c5d048vf482bdfaaab11bb2@mail.gmail.com> Post-doctoral and Ph.D. Student Positions in the Scala Group EPFL Lausanne Prof. Martin Odersky Do you want to work in an academic environment on a cutting edge programming language with real industrial impact? We are looking for post-docs and Ph.D. students to join the Scala group. Postdoctoral applicants should have a strong background in programming language theory and implementation, with special focus on functional and object-oriented programming. Previous experience with Scala is a plus. The appointment is a yearly contract renewable to up to four years depending on funding. Ph.D. student applicants should have strong research interests in the areas given above and should like to work on the boundary between theory and practice. They should have obtained a masters degree with outstanding grades. Ph.D. students with a 4 year bachelor degree are eligible for the EPFL graduate school which offers a Master/Ph.D. program (in English). All positions are open from Fall 2007, but we might also consider later starting dates. Compensation is competitive: CHF 80K+ for the post-doc position, and CHF 47K+ for the PhD student position (at present , 1US$ = 1.23 CHF). Informal inquiries about the positions may be addressed to martin.odersky at epfl.ch. Formal applications for postdoctoral positions should be sent by e-mail to the following address: Danielle Chamberlain danielle.chamberlain at epfl.ch Applications should consist of a curriculum vitae, a publication list, and the names of three personal references. Please ask your references to send their letters directly to the contact address, there is no need for a request from us. Formal applications for Ph.D. student positions go directly to the EPFL graduate school: EPFL Doctoral school EDIC - Computer, Communication and Information Sciences http://phd.epfl.ch/page55508.html Cut-off date for both kinds of applications is April 30, 2007. EPFL Lausanne is one of two federal universities in Switzerland. It has one of the most nationally diverse research, teaching and learning communities in Europe. Lausanne is situated in very attractive surroundings in the French-speaking part of Switzerland, bordering Lake Geneva, in close proximity to the Alps. From blanqui at loria.fr Thu Apr 12 10:52:30 2007 From: blanqui at loria.fr (Frederic Blanqui) Date: Thu, 12 Apr 2007 16:52:30 +0200 (CEST) Subject: [TYPES/announce] Last Call for Papers TPR'07 Deadline April 13th Message-ID: ================================================================ LAST CALL FOR PAPERS TPR '07 International Workshop on Type theory, proof theory, and rewriting Paris, France, June 29th 2007 http://www.lix.polytechnique.fr/~dowek/tpr.html ================================================================ Type theory, proof theory, and rewriting Friday, June 29th, 2007, Paris Type theory, proof theory and rewriting is a workshop to present on-going work on proof theory and type theory with an emphasis on the use of rewriting techniques in these areas. Topics include, but are not limited to, extensions of type theory with rewriting, deduction modulo and other extensions of predicate logic, the use of rewriting in logical frameworks and proof assistants, proof search methods using rewriting and related methods, proof search tools using rewriting, cut elimination, structural proof analysis... This workshop is supported by the Types project, a coordination action in EU's 6th framework programme. Types also organizes the HOR workshop, a few days before. Program Committee Fr?d?ric Blanqui (LORIA, France) Gilles Dowek (?cole polytechnique, France) Jim Lipton (Wesleyan University, United States and UPM, Spain) Sara Negri (University of Helsinki, Finland) Mitsu Okada (Keio University, Japan) Submissions Submissions --- an extended abstract of length ranging from 3 to 15 pages --- should be sent to Gilles.Dowek AT polytechnique.edu before Friday, April 13th, 2007. Venue The workshop will be hosted by the laboratory Preuves, Programmes et Syst?mes, 175 rue du Chevalleret, 75013 Paris, France, Room 0C2. Important Dates Deadline for submissions: Friday, April 13th, 2007. Workshop: Friday, June 29th, 2007. From blanqui at loria.fr Fri Apr 13 05:26:09 2007 From: blanqui at loria.fr (Frederic Blanqui) Date: Fri, 13 Apr 2007 11:26:09 +0200 (CEST) Subject: [TYPES/announce] INRIA PhD position Message-ID: Title: Termination of higher-order rule-based programs Application deadline: 30 April 2007. Aim: Being able to prove that a program does not loop but eventually provides some result to the user is essential. Since termination is undecidable in general, various techniques and tools have been developed depending on the class of programs under consideration: rule-based, functional, logic or imperative programs. This subject aims at extending some procedure for checking the termination of simply-typed rule-based programs based on type checking and constraint solving to richer type disciplines, study its complexity, turn it into an automated termination prover by infering for each function a relation between the size of its arguments and the size of its result, and study its application to other class of programs. More information and online application on: http://www.talentsplace.com/syndication1/inria/frdoc/details.html?id=PGTFK026203F3VBQB6G68LONZ&LOV5=4509&LOV6=4514&LG=FR&Resultsperpage=20&nPostingID=1374&nPostingTargetID=3618&option=52&sort=DESC&nDepartmentID=28 Competences and profile: The position involves research and development in the area of lambda-calculus, rewriting, type systems, constraint solving (in particular Presburger arithmetic) and, possibly, interactive theorem proving. Speaking french is not necessary. Salary: the monthly gross salary is approx. EUR 1,875. Environment: - laboratory: LORIA (http://www.loria.fr/) - team: Protheo (http://protheo.loria.fr/) - location: Nancy, in the East of France is at 1:30 from Paris by train, 1:30 from Luxembourg airport by car, and 1:30 from Germany and Belgium. Contact: Frederic Blanqui (http://www.loria.fr/~blanqui/) More information about INRIA PhD positions: http://www.inria.fr/travailler/opportunites/doc.en.html From degroote at loria.fr Fri Apr 13 07:08:37 2007 From: degroote at loria.fr (de Groote) Date: Fri, 13 Apr 2007 13:08:37 +0200 Subject: [TYPES/announce] PhD position at INRIA Lorraine,,Nancy, France Message-ID: <461F64B5.7070307@loria.fr> Since the pioneering work of Richard Montague, lambda-calculus, higher-order logic, and type theory have been widely used in natural language semantics. The following announcement concerns this line of research. ------------------------------------------------ PhD Position at INRIA-Lorraine, Nancy (France) Topic: Expressing discourse dynamics through continuations Applications are invited for a Ph.D. student to work on a three-year INRIA funded Ph.D. project, in the field of computational linguistics. The candidate will work in Nancy, in the east of France, under the supervision of Philippe de Groote, in the INRIA team Calligramme. Applicants must have a Master's degree in Computer Science or equivalent qualification. Additional information is available at: http://www.loria.fr/%7Edegroote/PhDproposal.html Putative candidates are requested to send an email to Philippe de Groote for further enquiry. From jeremy.siek at gmail.com Thu Apr 12 23:50:04 2007 From: jeremy.siek at gmail.com (Jeremy Siek) Date: Thu, 12 Apr 2007 21:50:04 -0600 Subject: [TYPES/announce] CFP: Library-Centric Software Design 2007 Message-ID: ACM SIGPLAN SYMPOSIUM ON LIBRARY-CENTRIC SOFTWARE DESIGN - LCSD'07 http://lcsd.cs.tamu.edu/2007 on October 21st, 2007 at Object-Oriented Programming, Systems, Languages and Applications (OOPSLA'07) conference in Montreal, Canada, October 21-25, 2007 CALL FOR PAPERS Libraries are central to all major scientific, engineering, and business areas, yet the design, implementation, and use of libraries are underdeveloped arts. This symposium is one of the first steps in the process of placing all aspects of libraries on a sound technical and scientific basis through research into fundamental issues and documentation of best practices. A software library is an organized collection of code with associated tools supporting programming in general or in specific domains, usually united by a specified set of principles and conventions. Most libraries are aimed for use by several people and in different environments. The areas of software library research include * Design and implementation of libraries * Program and system design based on libraries * Libraries supporting specific application domains, such as biology or banking * Evolution, refactoring, and maintenance of libraries * Empirical studies of library use * Performance of libraries, including benchmarking and library-based optimizations * Design of language facilities and tools in support of library definition and use * Validation, debugging, and testing of libraries * Extensibility, parameterization, and customization * Distribution of libraries * Specification of libraries and their semantics * Usability for library users and developers * Assessing quality of libraries * Documentation and teaching of libraries * Creating and supporting communities of library users * Using several libraries in combination We invite the submission of papers on software library research, including, but not limited to, the above list of topics. The papers should address issues important to libraries as a field, i.e., describe ideas or techniques that can be reused for libraries across problem domains and/or languages. Authors should use the latest ACM SIGS conference style file (option 1) at http://www.acm.org/sigs/pubs/proceed/template.html. Submissions should be limited to 12 pages in this style. Accepted papers will be published in the ACM proceedings for the symposium. IMPORTANT DATES Aug 1 Submission of papers Sep 1 Notification of acceptance Sep 15 Submission of final versions of the papers Oct 21 Symposium SUBMISSION PROCEDURE For details of the electronic submission procedure, see the symposium's Web site, http://lcsd.cs.tamu.edu/2007. ORGANIZERS * Jaakko J?rvi, Texas A&M University * David Musser, Rensselaer Polytechnic Institute * Sibylle Schupp, Chalmers University of Technology * Jeremy Siek, University of Colorado at Boulder * Frank Tip, IBM T.J. Watson Research PROGRAM COMMITTEE * Matthew Austern, Google * Antonio Cisternino, University of Piza * Sean Parent, Adobe Systems Incorporated * Brian Goetz, Quiotix Corp. * Andrew Lumsdaine, Indiana University * Oege de Moor, Oxford University * Lawrence Rauchwerger, Texas A&M * Peter Sestoft, University of Copenhagen * Bjarne Stroustrup, AT&T Labs, Texas A&M * Michelle Strout, Colorado State University * Matthias Troyer, ETH Zurich * Todd Veldhuizen, University of Waterloo In addition, the organizers will serve as program committee members, with Jaakko J?rvi and Josh Bloch as program co-chairs. Primarily, the email address lcsd07 at cs.tamu.edu should be used for questions addressed to the organizers. KEYNOTE ADDRESS There will be an invited talk by Doug Lea, State University of New York at Oswego. Doug Lea is the author of the book "Concurrent Programming in Java", and co-author of the text "Object-Oriented System Development". He is the author of several widely used software packages and components, as well as articles, reports, and standardization efforts dealing with object oriented software development including those on specification, design and implementation techniques, distributed, concurrent, and parallel object systems, and software reusability. SYMPOSIUM GOALS AND ACTIVITIES The symposium is a scientific forum for presenting original research in the design, implementation, and evaluation of software libraries. Other major activities include the identification of open questions specific to library research and the discussion of a strategic plan for establishing library research as a field. The outcome of the symposium is a combination of research contributions and specific next steps for improving the infrastructure for library research. Participants are expected to read the accepted submissions beforehand. The technical presentations, although based on the accepted papers, should not provide mere summaries of the papers. Instead, authors are encouraged to use their presentation slots (20 + 10 mins) to bring up topics for discussion. The technical presentations are mixed with scientific and organizational discussions. The discussions aim at furthering the topics of the presentations, thus their agenda will be publicly discussed among the participants and then posted on the website of the symposium. All participants are expected to come prepared with their tentative answers or thoughts. The full-day symposium starts with a keynote talk for the stimulation of discussion and concludes with a plenary discussion that decides the specific next steps for improving the infrastructure for library research. FOR MORE INFORMATION AND UPDATES please visit the symposium's Web site, http://lcsd.cs.tamu.edu/2007 ______________________________________ Jeremy Siek http://www.cs.colorado.edu/~siek/ Visiting Assistant Professor Department of Computer Science University of Colorado at Boulder -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070412/4e6e22d3/attachment.htm From Laurent.Vigneron at loria.fr Fri Apr 13 07:58:07 2007 From: Laurent.Vigneron at loria.fr (Laurent Vigneron) Date: Fri, 13 Apr 2007 13:58:07 +0200 Subject: [TYPES/announce] CFP: International School on Rewriting Message-ID: <17951.28751.419582.973554@jolimome.loria.fr> [ Apologies for multiple copies ] ********************************************************************** Call for Participation Second International School on Rewriting ISR'2007, July 2-6, 2007 Nancy, France http://isr2007.loria.fr/ ********************************************************************** ---------------------------------------------------------------------- Overview ---------------------------------------------------------------------- Rewriting is a fundamental concept and tool in computer science, logic and mathematics. It models the notion of transition or elementary transformation of abstract entities as well as common data structures like terms, strings, graphs. Rewriting is central in computation as well as deduction and is a crucial concept in semantics of programming languages as well as in proof theory. This results from a long tradition of cross-fertilization with the lambda-calculus and automated reasoning research communities. This second International School on Rewriting is organized for Master and PhD students, researchers and practitioners interested in the study of rewriting concepts and applications. This school is supported by the IFIP Working Group on Term Rewriting. The lectures will be given by some of the best experts on rewriting (termination, higher-order systems, strategies, ...) and applications (security, theorem proving, program analysis and proofs, ...). ISR'2007 will hold in Nancy, just after the RDP Conference in Paris: http://www.rdp07.org/ This will be a good opportunity to take the new TGV Est Europeen, reaching Nancy from Paris in 90 minutes! ---------------------------------------------------------------------- Lecturers ---------------------------------------------------------------------- Hassan Ait Kaci, ILOG, France Franz Baader, Dresden University, Germany Gilles Dowek, Ecole Polytechnique & INRIA, France Thomas Genet, Universite de Rennes I & IRISA, France Juergen Giesl, Aachen University, Germany Denis Lugiez, Universite de Provence, France Christopher Lynch, Clarkson University, USA Pierre-Etienne Moreau, INRIA & LORIA, France Vincent van Oostrom, Utrecht University, Netherlands Detlef Plump, University of York, UK Femke van Raamsdonk, Free University Amsterdam, Netherlands Michael Rusinowitch, INRIA & LORIA, France ---------------------------------------------------------------------- Contents ---------------------------------------------------------------------- - Introduction to term rewriting - Termination of term rewriting and applications - Higher order rewrite systems - Call by need, call by value - Compilation and implementations - Applications: Security, Business rules, Theorem proving, Program analysis and proofs - Advanced topics: Graph rewriting, Tree automata, Deduction modulo ---------------------------------------------------------------------- Scientific Committee ---------------------------------------------------------------------- - Juergen Giesl (Aachen) - Claude Kirchner (Nancy), chair - Pierre Lescanne (Lyon) - Christopher Lynch (Potsdam) - Aart Middeldorp (Innsbruck) - Femke van Raamsdonk (Amsterdam) - Yoshihito Toyama (Sendai) - Laurent Vigneron (Nancy), local organization chair ---------------------------------------------------------------------- Further Information ---------------------------------------------------------------------- For up-to-date details on the school organization, visit the official web page: http://isr2007.loria.fr/ or contact the organizers by e-mail: isr2007(at)loria(dot)fr From areces at loria.fr Sat Apr 14 14:07:15 2007 From: areces at loria.fr (Carlos Areces) Date: Sat, 14 Apr 2007 20:07:15 +0200 Subject: [TYPES/announce] E. W. Beth Dissertation Prize 2007: Extended Deadline Message-ID: <46211853.7040408@loria.fr> E. W. Beth Dissertation Prize: call for submissions ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Since 2002, FoLLI (the European Association for Logic, Language, and Information, www.folli.org) awards the E. W. Beth Dissertation Prize to outstanding dissertations in the fields of Logic, Language, and Information. Submissions are invited for 2007. The prize will be awarded to the best dissertation which resulted in a Ph.D. in the year 2006. The dissertations will be judged on technical depth and strength, originality, and impact made in at least two of the three fields of Logic, Language, and Computation. Who qualifies. ~~~~~~~~~~~~~~ Nominations of candidates are admitted who were awarded a Ph.D. degree in the areas of Logic, Language, or Information between January 1st, 2006 and December 31st, 2006. There is no restriction on the nationality of the candidate or the university where the Ph.D. was granted. After a careful consideration, FoLLI has decided to accept only dissertations written in English. Dissertations produced in 2006 but not written in English or not translated will be allowed for submission, after translation, also with the call next year (in 2008). Prize. ~~~~~~ The prize consists of * a certificate * a donation of 2500 euros provided by the E. W. Beth Foundation. * an invitation to submit the thesis (or a revised version of it) to the new series of books in Logic, Language and Information to be published by Springer-Verlag as part of LNCS or LNCS/LNAI. (Further information on this series is available on the FoLLI site) How to submit. ~~~~~~~~~~~~~~ Only electronic submissions are accepted. The following documents are required: 1. the thesis in pdf or ps format (doc/rtf not accepted); 2. a ten page abstract of the dissertation in ascii or pdf format; 3. a letter of nomination from the thesis supervisor. Self-nominations are not admitted: each nomination must be sponsored by the thesis supervisor. The letter of nomination should concisely describe the scope and significance of the dissertation and state when the degree was officially awarded; 4. two additional letters of support, including at least one letter from a referee not affiliated with the academic institution that awarded the Ph.D. degree. All documents must be submitted electronically to beth_award at dimi.uniud.it . Hard copy submissions are not admitted. In case of any problems with the email submission or a lack of notification within three working days after submission, nominators should write to policriti at dimi.uniud.it or areces at loria.fr Important dates. ~~~~~~~~~~~~~~~~ Deadline for Submissions: May 6th, 2007. Notification of Decision: July 15th, 2007. Committee. ~~~~~~~~~ * Anne Abeill? (Universit? Paris 7) * Johan van Benthem (University of Amsterdam) * Didier Caucal (IRISA-CNRS) * Nissim Francez (The Technion, Haifa) * Valentin Goranko (University of the Witwatersrand, Johannesburg) * Alessandro Lenci (University of Pisa) * Ewa Orlowska (Institute of Telecommunications, Poland) * Gerald Penn (University of Toronto) * Alberto Policriti (chair) (Universit? di Udine) * Rob van der Sandt (University of Nijmegen) * Colin Sterling (University of Edinburgh) * Wolfgang Thomas (RWTH Aachen) ================================================================== Carlos Areces phone : +33 (0)3 54 95 84 90 INRIA Researcher fax : +33 (0)3 83 41 30 79 e-mail: carlos.areces at loria.fr INRIA Lorraine. www : http://www.loria.fr/~areces Equipe TALARIS - Batiment B 615, rue du Jardin Botanique 54600 Villers les Nancy Cedex, France From skalka at cs.uvm.edu Mon Apr 16 08:06:32 2007 From: skalka at cs.uvm.edu (Christian Skalka) Date: Mon, 16 Apr 2007 08:06:32 -0400 Subject: [TYPES/announce] Postdoctoral Position at UVM Computer Science Message-ID: <032b01c7801f$af17e9f0$190ac684@Pers> ================================================== POSTDOCTORAL RESEARCH POSITION IN COMPUTER SCIENCE The University of Vermont, USA ================================================== Location: Department of Computer Science, The University of Vermont (UVM), Burlington, Vermont, USA. http://www.cs.uvm.edu http://www.uvm.edu http://www.ci.burlington.vt.us Job Description: We are seeking a qualified postdoctoral research assistant for ongoing projects in the foundations of computer security. Applicants should have a background in programming languages, type theory, and/or mathematical logic, with an interest in the intersection of theory and practice. Information about previous relevant research at UVM is available online: http://www.cs.uvm.edu/~skalka/skalka-pubs/skalka-projects.html Research will be conducted in the context of larger projects being carried out by the Distributed Systems Group: http://www.cs.uvm.edu/research/distrsys This position is funded by a grant from the Department of Defense (DoD), Air Force Office of Scientific Research (AFOSR). Duration: 1 year. Inquiries: Please direct questions to Christian Skalka, skalka at cs.uvm.edu. Requirements: Applicants should have or be sufficiently near completion of a PhD, and have a background (including published work) in topics described above. To Apply: Please send cv, statement of research, and contact information for 2 references by June 15, 2006, to (email is preferable): Christian Skalka Department of Computer Science University of Vermont 33 Colchester Ave. Burlington, VT 05405 skalka at cs.uvm.edu http://www.cs.uvm.edu/~skalka ============================== Christian Skalka Assistant Professor Department of Computer Science University of Vermont http://www.cs.uvm.edu/~skalka ============================== From matthes at informatik.uni-muenchen.de Mon Apr 16 09:30:12 2007 From: matthes at informatik.uni-muenchen.de (Ralph Matthes) Date: Mon, 16 Apr 2007 15:30:12 +0200 Subject: [TYPES/announce] 2nd CFP: Higher-Order Rewriting 2007 Message-ID: <46237A64.4090602@informatik.uni-muenchen.de> ************************************** * * * HOR 2007 2nd CALL FOR ABSTRACTS * * * ************************************** 4th International Workshop on Higher-Order Rewriting Monday June 25, 2007, Paris, France http://www.rdp07.org/hor.html IMPORTANT DATES: April 27, 2007 : (extended) deadline electronic submission of paper May 14, 2007 : notification of acceptance of papers June 4, 2007 : deadline for final version of accepted papers HOR 2007 is a forum to present work concerning all aspects of higher-order rewriting. The aim is to provide an informal and friendly setting to discuss recent work and work in progress. HOR 2002 was part of FLoC 2002 in Copenhagen, Denmark. HOR 2004 was part of RDP 2004 in Aachen, Germany. HOR 2006 was part of FLoC 2006 in Seattle, USA. HOR 2007 is part of RDP 2007 in Paris. This year, HOR enjoys additionally the status of a "small workshop" of the TYPES project, see http://www.cs.chalmers.se/Cs/Research/Logic/Types/ There will also be a "small TYPES workshop" on Type theory, proof theory and rewriting (TPR '07), 4 days later in Paris. INVITED SPEAKERS: Carsten Sch?rmann, IT University of Copenhagen, Denmark (confirmed) Tarmo Uustalu, Institute of Cybernetics, Tallinn University of Technology, Estonia (confirmed) TOPICS of interest include (but are not limited to): APPLICATIONS: proof checking, theorem proving, generic programming, declarative programming, program transformation. FOUNDATIONS: pattern matching, unification, strategies, narrowing, termination, syntactic properties, type theory. FRAMEWORKS: term rewriting, conditional rewriting, graph rewriting, net rewriting, comparisons of different frameworks. IMPLEMENTATION: explicit substitution, rewriting tools, compilation techniques. SEMANTICS: semantics of higher-order rewriting, higher-order abstract syntax PROGRAM COMMITTEE Herman Geuvers (Radboud University Nijmegen, Netherlands) Makoto Hamana (Gunma University, Japan) Ralph Matthes (C.N.R.S., University of Toulouse III, France), chair Albert Rubio (Technical University of Catalonia, Spain) Mark-Oliver Stehr (SRI International, U.S.A.) HOR 2007 SUBMISSIONS: Abstracts between 2 and 5 pages. As HOR is meant to be a platform to discuss ongoing research we are also interested in abstracts describing work in progress, or problems in higher-order rewriting. Please use the EasyChair page http://www.easychair.org/HOR2007/ to submit or update your paper (updates are always possible before the deadline). Please address your questions to the PC chair, under family_name at irit.fr. PROCEEDINGS: The proceedings of HOR 2007 will be made available on the HOR 2007 web page and copies will be distributed to the participants at the workshop. STEERING COMMITTEE Delia Kesner Universit? Paris 7, France Femke van Raamsdonk Vrije Universiteit, The Netherlands LOCAL ARRANGEMENTS: The organizers of RDP 2007 (Antonio Bucciarelli, Vincent Padovani, Ralf Treinen, Xavier Urbain). From Pierre-Louis.Curien at pps.jussieu.fr Mon Apr 16 11:40:44 2007 From: Pierre-Louis.Curien at pps.jussieu.fr (Pierre-Louis Curien) Date: Mon, 16 Apr 2007 17:40:44 +0200 Subject: [TYPES/announce] Foundation SMP: a new postdoc (et al.) program in Paris Message-ID: <129AD4FB-FC02-44E2-9D05-62E89ACA5BFF@pps.jussieu.fr> Dear colleagues, I am happy to announce that a new Foundation called "Sciences Mathematiques de Paris" has just been created: www.sciencesmaths-paris.fr It groups several major laboratories of Paris in the field of mathematics, as well as the two computer science laboratories of Paris 7 University (LIAFA, www.liafa.jussieu.fr, and PPS, www.pps.jussieu.fr). The foundation will launch a number of programs. For this coming academic year (2007/2008), the following programs may be relevant for computer scientists interested to spend some time in Paris and wish to work in LIAFA or PPS: - a postdoc program (deadline for application: May 4th) - an invitation program for scientists for visits of 2 to 3 months (deadline for application: May 18th) -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.e