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.edu/pipermail/types-announce/attachments/20070416/94ddd2de/attachment.htm From Gilles.Barthe at sophia.inria.fr Tue Apr 17 09:05:55 2007 From: Gilles.Barthe at sophia.inria.fr (Gilles.Barthe@sophia.inria.fr) Date: Tue, 17 Apr 2007 15:05:55 +0200 (CEST) Subject: [TYPES/announce] PhD position at INRIA Message-ID: <3385.138.96.219.44.1176815155.squirrel@imap-sop.inria.fr> The Everest project-team at INRIA Sophia Antipolis is opening 3 PhD positions, to start on September 1, 2007, or as soon as possible after this date. Team ---- The Everest project-team focuses on increasing reliability and security of mobile and embedded software. The current research interests include: - deductive program verification, - proof carrying code, - language-based security, - machine-checked cryptography, - proof assistants. Topics ------ The positions are related to the European project MOBIUS on Proof Carrying Code, and to the secure distributed computations project within the INRIA-MSR Joint Center. Topics of research include: - Efficient certified certificate checkers via proof-irrelevance supervision: Benjamin Gr?goire The goal of this reasearch is to develop and verify executable certificate checkers using reflection techniques. For further information, please visit: http://www-sop.inria.fr/everest/offers/proof_irrelevance.php - Language-Based Security supervision: Gilles Barthe and Tamara Rezk (MSR-INRIA) For further information, please visit: http://www-sop.inria.fr/everest/offers/language-based.php The goal of this research is to explore flexible enforcement mechanisms for enforcing confidentiality of mobile and distributed applications. - Code-based techniques for proved provable cryptography supervision: Gilles Barthe and Benjamin Gr?goire The goal of this research is to develop Coq tactics and libraries to verify formally game-based proofs of cryptographic systems, and to carry selected proofs within this environment. For further information, please visit: http://www-sop.inria.fr/everest/offers/crypto-proofs.php Terms of employment ------------------- Each position is for three years, and should lead to a Ph.D. thesis. We might propose a 6 month contract, before starting the 3 years Ph.D. contract. The salary will be 1529 euros net per month for the first 2 years, and 1611 euros net/month the final year. Full health insurance and social benefits are included. Interested? ------------ We are seeking motivated candidates with a background in formal methods and/or security. To apply, send a curriculum vitae, a motivation letter explaining your research interests, and the name of three references to everest_jobs at sophia.inria.fr . Applications must be received no later than May 4, 2007. For more information about - INRIA, see http://www.inria.fr - the Everest project, see http://www-sop.inria.fr/everest/ and http://www-sop.inria.fr/everest/offers/index.php - Sophia Antipolis, see http://www.sophia-antipolis.org/ From lerner at cs.ucsd.edu Tue Apr 17 16:06:39 2007 From: lerner at cs.ucsd.edu (Sorin Lerner) Date: Tue, 17 Apr 2007 13:06:39 -0700 Subject: [TYPES/announce] POPL 08 Call for Papers Message-ID: <200704172006.l3HK6dWP003604@csefast.ucsd.edu> ********************************************************************* * ACM SIGPLAN-SIGACT Symposium * * on * * Principles of Programming Languages * * * * Thursday 10--Saturday 12 January 2008 * * San Francisco, California, USA * * * * Call for Papers * * * * http://www.cs.ucsd.edu/popl/08 * ********************************************************************* NEW: POPL 2008 encourages the submission of pearls, which are elegant essays that illustrate an idea, often by developing a short program. Please see below for details. Important dates Submission 11:00 PM Apia Time Monday 16 July 2007 Author response 11:00 PM Apia Time Monday 17 September 2007-- 11:00 PM Apia Time Wednesday 19 September 2007 Notification Friday 28 September 2007 Camera ready Thursday 1 November 2007 Conference Thursday 10--Saturday 12 January 2008 Scope The annual Symposium on Principles of Programming Languages is a forum for the discussion of all aspects of programming languages and systems, with emphasis on how principles underpin practice. Both theoretical and experimental papers are welcome, on topics ranging from formal frameworks to experience reports. Submissions on a diversity of topics are sought, particularly ones that identify new research directions. POPL 2008 is not limited to topics discussed in previous symposia. Authors concerned about the appropriateness of a topic may communicate by electronic mail with the program chair prior to submission. Pearls and Advice to Authors Explaining a known idea in a new way may make as strong a contribution as inventing a new idea. We encourage the submission of pearls: elegant essays which illustrate an idea, often by developing a short program. There is no formal separation of categories, but a pearl should be labelled as such in its abstract. All papers, whether pearl or otherwise, will be judged on their correctness, significance, novelty, clarity, elegance, and beauty. Pearls have long been an accepted form of submission for the Journal of Functional Programming (JFP) and the International Conference on Functional Programming (ICFP). Advice on writing pearls can be found in the ICFP 2006 Call for Papers: http://icfp06.cs.uchicago.edu/icfp06-cfp.html Each paper, pearl or otherwise, should explain its contributions in both general and technical terms, identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. Authors should strive to make their papers understandable to a broad audience. Advice on writing technical papers can be found on the SIGPLAN Author Information page: http://www.acm.org/sigs/sigplan/authorInformation.htm Unlike in 2007, there are no special categories of short and long submissions. Submission guidelines Submissions must be filed at the web site by 11:00 PM Monday 16 July, Apia, Samoa time. Some equivalents to this time are * San Francisco: 3:00 AM (17 July) * New York: 6:00 AM (17 July) * Chicago: 5:00 AM (17 July) * London: 11:00 AM (17 July) * Paris: Noon (17 July) * Hong Kong: 6:00 PM (17 July) * UTC: 10:00 AM (17 July) For other time-zones/locations, see the Worldclock at the following URL: http://www.timeanddate.com/worldclock/fixedtime.html?month=7&day=16&year=2007&hour=23&min=0&sec=0&p1=282 Submissions will be carried out electronically via the Web, at the Submission URL: http://quad.softconf.com/start/popl08/submit.html Authors should submit an abstract of at most 300 words and a full paper of no more than 12 pages (including bibliography and appendices). Submissions that do not meet these guidelines will not be considered. The submission deadline and length limitations are firm. Submissions should be in standard ACM SIGPLAN 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). Detailed formatting guidelines, along with a LaTex class file and template, are available on the SIGPLAN Author Information page: http://www.acm.org/sigs/sigplan/authorInformation.htm You need not include categories or keywords in the submission, though you are welcome to do so. The ACM copyright notice is not required of submissions, only of accepted papers. Papers must be submitted in PDF format and printable on US Letter size paper. Individuals for which this requirement is a hardship should contact the program chair at least one week before the deadline. Submitted papers must adhere to the SIGPLAN Republication Policy: http://acm.org/sigplan/republicationpolicy.htm Concurrent submissions to other journals, conferences, workshops, or similar forums of publication are not allowed. Authors of accepted papers will be required to sign the ACM copyright form. Proceedings will be published by ACM Press. Author Response Period Authors will be given a 48-hour period (from 11:00 PM Apia Time Monday 17 September to 11:00 PM Apia Time Wednesday 19 September) to read and respond to the reviews of their papers before the PC meeting. Details of the response process will be announced by e-mail a few days beforehand. Student Attendees Students who have a paper accepted for the conference are offered student membership of SIGPLAN free for one year. As members of SIGPLAN they may apply for travel fellowships from the PAC fund. Conference Chair George Necula Electrical Engineering and Computer Science Department University of California Berkeley, CA 94720, USA necula at cs.berkeley.edu Program Chair Philip Wadler School of Informatics, University of Edinburgh James Clerk Maxwell Building, King's Buildings Mayfield Road, Edinburgh EH9 3JZ popl-08 at inf.ed.ac.uk Program Committee Amal Ahmed, Toyota Technological Institute, Chicago Lars Birkedal, ITU Copenhagen Guy Blelloch, Carnegie-Mellon University Gilad Bracha, Cadence Design Systems Byron Cook, Microsoft Research Thierry Coquand, Chalmers University Vincent Danos, Paris VII Robby Findler, University of Chicago Neal Glew, Intel Haruo Hosoya, University of Tokyo Matthew Hennessy, University of Sussex Ranjit Jhala, University of California, San Diego Tobias Nipkow, Technische Universität München James Noble, Victoria University of Wellington Sanjiva Prasad, IIT Delhi Zhong Shao, Yale University Yannis Smaragdakis, University of Oregon Eijiro Sumii, Tohoku University Peter Thiemann, Universität Freiburg Peter Van Roy, Université catholique de Louvain Jan Vitek, Purdue University Nobuko Yoshida, Imperial College London Steve Zdancewic, University of Pennsylvania From Daniel.Hirschkoff at ens-lyon.fr Wed Apr 18 11:20:11 2007 From: Daniel.Hirschkoff at ens-lyon.fr (Daniel.Hirschkoff@ens-lyon.fr) Date: Wed, 18 Apr 2007 17:20:11 +0200 Subject: [TYPES/announce] postdoc position available at ENS Lyon Message-ID: <17958.14123.218256.104649@gargle.gargle.HOWL> The Plume team of the Ecole Normale Superieure de Lyon (http://www.ens-lyon.fr/LIP/PLUME/index.html.en) is offering a 12 months 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. Technically, work in this project will involve areas of research belonging to the following list: process calculi, behavioural equivalences, type systems, abstract machines, denotational models. See https://www2.cnrs.fr/DRH/post-docs07/?pid=1&action=view&id=546&lang=en for a more detailed description of the offer. Important facts to notice (see https://www2.cnrs.fr/DRH/post-docs07/index.php?pid=8&lang=en): - the deadline to apply is April 30th - salary will be 2500 euros gross The application file is downloadable from the above URL. For more information, get in contact with Daniel.Hirschkoff at ens-lyon.fr. From streicher at mathematik.tu-darmstadt.de Thu Apr 19 07:21:38 2007 From: streicher at mathematik.tu-darmstadt.de (Thomas Streicher) Date: Thu, 19 Apr 2007 13:21:38 +0200 (CEST) Subject: [TYPES/announce] Workshop Novosibirsk Message-ID: <200704191121.l3JBLc70001772@fb04209.mathematik.tu-darmstadt.de> Dear colleagues, Below (also as a pdf-attachment) you find the call for submission of contributed talks to the Joint Workshop 'Domains8' and 'Computability Over Continuous Data Types', Novosibirsk, September 11--15, 2007. It suffices to submit a title with an abstract. The Deadline is May 15. As foreign participants need a visa, registration has to be done until June 30 through the webpage indicated below. As the procedure to obtain a visa is time consuming (see below), these dates are mandatory. You also find the list of invited speakers below. Usually, in the middle of September the weather is nice and sunny in Novosibirsk with temperatures around 15 C. Kind regards, Klaus Keimel _________________________________________________________- Call for Contributed Talks 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/index.en.html 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. CONTRIBUTED TALKS There will be ample time available for contributed talks. If you would like to participate and to give a talk, please submit a one page abstract 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 INVITED SPEAKERS Andrej Bauer, Ljubljana Ulrich Berger, Swansea Thierry Coquand, G?teborg Martin Escardo, Birmingham Sergei Godunov, Novosibirsk Peter Hertling, Munich Alex Simpson, Edinburgh Atsushi Yoshikawa, Kyushu University PROCEEDINGS Conference Proceedings will be published as a special issue of 'Annals in Pure and Applied Logic'. Submission for the Proceddings will be after the Workshop. They will be refereed according to the usual standards 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. For obtaining a visa, one needs an official invitation issued by the local authorities at Novosibirsk. For this, you should fill in the registration. form available at the conference web page www.sbras.ru/ws/domains/index.en.html and you will have to provide to the local organizers the informations enumerated on the web page www.sbras.ru/ws/domains/visa.html 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 WEATHER The weather in Novosibirsk in the middle of September is usually warm and sunny, with temperatures around +15 C. 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: call3.pdf Type: application/octet-stream Size: 65460 bytes Desc: Url : http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070419/bb5a6be8/call3.dll From royer at ecs.syr.edu Thu Apr 19 22:49:27 2007 From: royer at ecs.syr.edu (James S. Royer) Date: Thu, 19 Apr 2007 22:49:27 -0400 Subject: [TYPES/announce] Extended CFP: 9th Intl Workshop on Logic & Computational Complexity Message-ID: <90765139-8470-4739-89BF-8F1C0B9CB520@ecs.syr.edu> The deadline for submissions has be extended to April 30. For workshop and submission details, see: http://www.cis.syr.edu/~royer/icc/LCC07/ LCC'07 will be held on 15 July 2007 in Wroclaw, Poland as a satellite workshop of the Logic in Computer Science Conference (LICS'07). From aserebre at win.tue.nl Fri Apr 20 01:55:19 2007 From: aserebre at win.tue.nl (A Serebrenik) Date: Fri, 20 Apr 2007 07:55:19 +0200 (CEST) Subject: [TYPES/announce] LAST Call for papers - Workshop on Termination (WST 2007) - Paris In-Reply-To: References: Message-ID: ***************** SUBMISSION DEADLINE APRIL 23, 2007 ******************* 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 Ricky.Robinson at nicta.com.au Fri Apr 20 03:10:00 2007 From: Ricky.Robinson at nicta.com.au (Ricky Robinson) Date: Fri, 20 Apr 2007 17:10:00 +1000 Subject: [TYPES/announce] DAIS 2007 - Call for Participation Message-ID: --------------------------------------------------------------------- Call for Participation DAIS 2007 7th IFIP International Conference on Distributed Applications and Interoperable Systems "Towards Sustainability" Paphos, Cyprus 6 - 8 June 2007 --------------------------------------------------------------------- Early Registration Deadline: May 5, 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. 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. --------------------------------------------------------------------- ADVANCE PROGRAM --------------------------------------------------------------------- WEDNESDAY June 6th ------------------ 9:30 - 10:30 INVITED SPEAKER FMOODS Mariangiola Dezani-Ciancaglini Asynchronous Session Types and Progress for Object Oriented Languages Break 11:00 - 12:30 SESSION 1: CONTEXT-AWARENESS I The Context-Dependent Role Model Jorge Vallejos, Peter Ebraert, Brecht Desmet, Tom Van Cutsem, Stijn Mostinckx, Pascal Costanza Integrating Facts and Beliefs to Model and Reason about Context Waltenegus Dargie, Thomas Springer Situation Specification and Realization in Rule-Based Context-Aware Applications Patricia Dockhorn Costa, Joao Paulo A. Almeida, Luis Ferreira Pires, Marten van Sinderen Lunch 14:30 - 15:30 SESSION 2: DISTRIBUTED APPLICATIONS I Observability and Controllability of Wireless Software Components Fabien Romeo, Franck Barbier, and Jean-Michel Bruel Service level agreement management in federated virtual organizations Tuomas Nurmela, Lea Kutvonen Break 16:00 - 17:30 SESSION 3: ADAPTATION I Construction and Execution of Adaptable Applications using an Aspect-Oriented and Model Driven Approach Sten A. Lundesgaard, Arnor Solberg, Jon Oldevik, Robert France, Jan Oyvind Aagedal, Frank Eliassen Component Adaptation in Contemporary Execution Environments Susan Eisenbach, Chris Sadler, Dominic Wong Managing Distributed Adaptation of Mobile Applications Mourad Alia, Svein Hallsteinsen, Nearchos Paspallis, Frank Eliassen THURSDAY June 7th ----------------- 9:30 - 10:30 SESSION 4: PEER-TO-PEER DOLCLAN Middleware Support for Peer-to-Peer Distributed Shared Objects Jakob E. Bardram, Martin Mogensen Peer-to-Peer based QoS Registry Architecture for Web Services Fei Li, Fangchun Yang, Kai Shuang, Sen Su Break 11:00 - 12:30 SESSION 5: MOBILITY I Migration in CORBA Component Model Jacek Cala A Serialisation Based Approach for Processes Strong Mobility Soumaya Marzouk, Maher Ben Jemaa, Mohamed Jmaiel Parallel State Transfer in Object Replication Systems Rudiger Kapitza, Thomas Zeman, Franz J. Hauck, Hans P. Reiser Lunch 14:30 - 15:30 SESSION 6: DISTRIBUTED APPLICATIONS II MARS: An Agent-based Recommender System for the Semantic Web Salvatore Garruzzo, Domenico Rosaci, Giuseppe M.L. Sarne An HTML Fragments Based Approach for Portlet Interoperability Jingyu Song, Jun Wei, Shuchao Wan Break 16:00 - 17:30 SESSION 7: CONTEXT-AWARENESS II Scalable Processing of Context Information with COSMOS Denis Conan, Romain Rouvoy, Lionel Seinturier Experiences from Developing a Distributed Context Management System for Enabling Adaptivity Nearchos Paspallis, Avraam Chimaris, George A. Papadopoulos Towards Context-Aware Web Applications Po-Hao Chang, Gul Agha FRIDAY June 8th -------------- 9:30 - 10:30 INVITED SPEAKER COORDINATION Rachid Guerraoui Sommersby: The Return of the Transaction Break 11:00 - 12:30 SESSION 8: ADAPTATION II A Flexible Architecture for Enforcing and Composing Policies in a Service-Oriented Environment Tom Goovaerts, Bart De Win, Wouter Joosen Managing concern interactions in middleware Frans Sanen, Eddy Truyen, Wouter Joosen An Improved Genetic Algorithm for Web Services Selection Sen Su, Chengwen Zhang, Junliang Chen Lunch 14:30 - 16:00 SESSION 9 : MOBILITY II A UML Profile for Modeling Mobile Information Systems Vegard Dehlen, Jan Oyvind Aagedal A Planning Method for Component Placement in Smart Item Environments using Heuristic Search Jurgen Anke, Bernhard Wolf, Gregor Hackenbroich, Klaus Kabitzsch A Generic Infrastructure for Decentralised Dynamic Loading of Platform-Specific Code Rudiger Kapitza, Holger Schmidt, Udo Bartlang, Franz J. Hauck --------------------------------------------------------------------- VENUE AND LOCATION INFORMATION --------------------------------------------------------------------- The DisCoTec 2007 conference will be held at the Paphos Amathus Hotel, in Paphos, Cyprus. More information about the venue, including travel information, can be found at the following web page: http://www.discotec07.cs.ucy.ac.cy/location.htm --------------------------------------------------------------------- REGISTRATION FEES --------------------------------------------------------------------- The early registration deadline is May 5, 2007. All prices quoted are in Euro. Early Delegate's Registration Fees: 480 Early Student Registration Fees: 350 Early Paper Presenters Fees: 480 Workshop Registration Fees: 150 Late Delegate's Registration Fees: 550 Late Student Registration Fees: 400 Late Paper Presenters Fees: 550 Workshop Registration Fees: 170 --------------------------------------------------------------------- REGISTRATION PROCEDURES --------------------------------------------------------------------- Please visit http://www.cyprusconferences.org/discotec/registration.html, then download and complete the registration form. Registrations will be accepted by fax, mail or e-mail. -- Ricky Robinson, Ph.D. Researcher Queensland Laboratory NICTA 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 From stephan at cs.tu-berlin.de Fri Apr 20 18:37:47 2007 From: stephan at cs.tu-berlin.de (Stephan Herrmann) Date: Sat, 21 Apr 2007 00:37:47 +0200 Subject: [TYPES/announce] Call for Participation: ECOOP 2007 in Berlin Message-ID: <200704210037.47487.stephan@cs.tu-berlin.de> [Apologies for multiple copies] *********************************************************************** CALL FOR PARTICIPATION 21st European Conference on Object-Oriented Programming Berlin, Germany July 30 - August 3, 2007 http://2007.ecoop.org *********************************************************************** ECOOP 2007 has opened its gate for registration. Early registration lasts until June 15, 2007. ECOOP is the premier forum for discussing and advancing a broad range of disciplines woven with the common thread of object technology. It is a well integrated collage of events, including outstanding invited speakers, carefully refereed technical papers, topic focused workshops, exciting tutorials, and late-breaking demonstrations. The program is taking shape and promises another exciting scientific event: Invited Speaker is Joe Armstrong: "Erlang - Software for a Concurrent World" The annual Dahl-Nygaard prizes will be awarded; The laureates will answer the award by invited talks. The program committee has selected 25 high quality technical papers: http://2007.ecoop.org/mainconf/papers.html 20 Workshops are currently accepting contributions: http://2007.ecoop.org/workshops/wslist.html 5 Tutorials are open for registration: http://2007.ecoop.org/tutorials/tutlist.html Proposals for Demonstrations and Exhibitions can still be submitted: http://2007.ecoop.org/demos (Submission deadline for demos is May 31) http://2007.ecoop.org/exhibitions Additionally, you may expect various contributions from our top sponsors: Deutsche Telekom SAP IBM Microsoft and others. As you come to ECOOP, why not spend some additional days in the vibrant city of Berlin, were old meets new, were world politics meets everyday's life, were high tech meets nature (see http://www.zoo-berlin.de/en/experience/young-animals/ice-bear-knut.html) and hopefully, we will meet you. http://2007.ecoop.org/berlin.html We look forward to seeing you in July & August, The Berlin ECOOP'07 Team. From alwen.tiu at rsise.anu.edu.au Tue Apr 24 02:58:38 2007 From: alwen.tiu at rsise.anu.edu.au (Alwen Tiu) Date: Tue, 24 Apr 2007 16:58:38 +1000 Subject: [TYPES/announce] Postdoc position at the Australian National University Message-ID: <462DAA9E.8070709@rsise.anu.edu.au> Dear all, the Computer Science Lab at the Australian National University has an opening for a 2-year postdoc in the area of logic-based framework for trust and security. Details of the position, including salary range and qualifications, can be found at the ANU website: http://info.anu.edu.au/hr/Jobs/Academic_Positions/_CECS3966.asp Application deadline is 31 May 2007. -Alwen From ayala at unb.br Thu Apr 26 17:03:38 2007 From: ayala at unb.br (ayala@unb.br) Date: Thu, 26 Apr 2007 18:03:38 -0300 Subject: [TYPES/announce] LSFA 2007 (Third CFP) Message-ID: <20070426180338.pqe28k5cb8ck0sc8@webmail.unb.br> Third Call for papers http://www.mat.unb.br/lsfa2007 ===> Proceeding as a volume of Elsevier ENTCS confirmed <=== LSFA'07 - Second Workshop on Logical and Semantic Frameworks, with Applications August 28th, 2007, Ouro Preto, Minas Gerais, Brazil (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 TU Wien (Vienna) 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 and the proceedings will be published as a volume of ENTCS. 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/ ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program. From bpientka at cs.mcgill.ca Tue Apr 24 23:36:25 2007 From: bpientka at cs.mcgill.ca (Brigitte Pientka) Date: Tue, 24 Apr 2007 23:36:25 -0400 (EDT) Subject: [TYPES/announce] CFP: LFMTP'07 Message-ID: Important changes: ** Updated workshop date: 15 July, 2007 ** Invited speaker: Randy Pollack, University of Edinburgh ----------------------------------------------------------------------- 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, 15 July, 2007 FINAL 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 15 July 2007 ----------------------------------------------------------------------- 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: Randy Pollack, University of Edinburgh 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 damiani at di.unito.it Tue Apr 24 05:56:32 2007 From: damiani at di.unito.it (Ferruccio Damiani) Date: Tue, 24 Apr 2007 11:56:32 +0200 Subject: [TYPES/announce] "CDR60" Colloquium in Rome - Joint event with ICTCS 2007 Message-ID: <462DD450.3010004@di.unito.it> We are pleased to announce the special event "CDR60 Colloquium" to celebrate the 60-th birthday of Mario Coppo, Mariangiola Dezani-Ciancaglini and Simona Ronchi Della Rocca. The event will take place on Wednesday, October 3, 2007, the first day of the congress ICTCS 2007, in Rome: http://www.disp.uniroma2.it/ictcs07/ The invited speakers are: - Henk Barendregt - Chantal Berline - Corrado Boehm - Furio Honsell - Giuseppe Longo - Pawel Urzyczyn In the evening there will be a social dinner. Official registration is not open yet. Likely, you will have the possibility of registering either for CDR60 only, or both for CDR60 and for ICTCS 2007. Hoping to see you in Rome, Stefano Berardi Ferruccio Damiani Ugo de' Liguoro -- To contact the organizers: cdr60 at di.unito.it From icfp.publicity at googlemail.com Fri Apr 27 08:11:40 2007 From: icfp.publicity at googlemail.com (Matthew Fluet (ICFP Publicity Chair)) Date: Fri, 27 Apr 2007 07:11:40 -0500 Subject: [TYPES/announce] ICFP Programming Contest 2007 Message-ID: <53ff55480704270511s174a41a1n98b95378c755f88f@mail.gmail.com> Want to show off your programming skills? Your favorite programming language? Your best programming tools? Join the ICFP Programming Contest 2007! The 10th ICFP Programming Contest celebrates a decade of contests. This is one of the world's most advanced and prestigious programming contest you can enter. For free! Book July 20 - 23, 2007. Check out http://www.icfpcontest.org/. -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070427/f14a8ad5/attachment.htm From msteffen at ifi.uio.no Tue Apr 24 02:29:59 2007 From: msteffen at ifi.uio.no (Martin Steffen) Date: 24 Apr 2007 08:29:59 +0200 Subject: [TYPES/announce] Call for Participation: Fmoods'07 (as part of DisCoTec 07. Paphos, Cyprus, 6.-8. June 2007) Message-ID: ----------------------------------------------------------------- Call for Participation FMOODS 2007 9th IFIP International Conference on Formal Methods for Open Object-Based Distributed Systems http://www.liacs.nl/home/marcello/FMOODS ---------------------------------------------------------------- As part of DisCoTec, the federated conferences on Distributed Computing Techniques - Fmoods'07 - COORDINATION'07 (9th International Conference on Coordination Models and Languages) - DAIS'07 (7th IFIP International Conference on Distributed Applications and Interoperable Systems) http://www.discotec07.cs.ucy.ac.cy Paphos, Cyprus 6 - 8 June 2007 ------------------------------------------------------------------- plus - 1 day pre-conference workshop as a merge of * DSE: International Workshop on Dynamic Software Evolution. Organizers: Manuel Oriol (ETHZ), Oscar Nierstrasz (U. Bern) * MTCoord'07: 3rd International Workshop on Methods and Tools for Coordinating Concurrent, Distributed and Mobile Systems- Organizers: Carolyn Talcott and Isabelle Linden o Early registration deadline approaching (until 5 May 2007) o for - further registration details (student reductions, workshop fees...), - travel information and information about Cyprus, see (under "registration") http://www.discotec07.cs.ucy.ac.cy - for accepted papers of the conferences, the call for papers, and further information, consult the web-site, as well. o Invited speakers for the joint event: - Mariangiola Dezani-Ciancaglini, University of Torino, Italy - Rachid Guerraoui, School of Computer and Communication Sciences, Ecole Polytechnique Federale de Lausanne - Wolfgang Ahrendt, Chalmers University of Technology, G?teborg ----------------------------------------------------------------------------- PROGRAM of Fmoods'07 (for exact time slots, see the web page) ----------------------------------------------------------------------------- o WEDNESDAY June 6th - INVITED SPEAKER FMOODS: Mariangiola Dezani-Ciancaglini Asynchronous Session Types and Progress for Object Oriented Languages - Session: REWRITING LOGIC * On Formal Analysis of OO Languages using Rewriting Logic: Designing for Performance M. Hills and G. Rosu * Distributed applications implemented with parameterized skeletons in Maude A. Riesco and A. Verdejo * Formal Modeling and Analysis of the OGDC Wireless Sensor Network Algorithm in Real-Time Maude P. C. Olveczky and S. Thorvaldsen - Session: ALGEBRAIC CALCULI * A Mechanized Model of the Theory of Objects L. Henrio and F. Kammueller * Pict Correctness Revisited P. Bidinger and A. Compagnoni - Session 3: MODEL CHECKING * Analysis of UML Activities using Dynamic Meta Modeling C. Soltenborn, H. Wehrheim and G. Engels * Verifying Distributed, Event-Based Middleware Applications Using Domain-Specific Software Model Checking L. R. Cai, J. Bradbury and J. Dingel * Model checking of Extended OCL constraints on UML models in SOCLe J. Mullins and R. Oarga o Thursday, June 7th - INVITED SPEAKER FMOODS: Wolfgang Ahrendt KeY - A Formal Method for Object-Oriented Systems - Session 4: QUANTITATIVE ANALYSIS * Performance-Oriented Comparison of Web Services via Client-Specific Testing Preorders M. Bernardo and L. Padovani * A Probabilistic Formal Analysis Approach to Cross Layer Optimization in Distributed Embedded Systems M. Kim, M.-O. Stehr, C. Talcott, N. Dutt and N. Venkatasubramanian * On Resource-Sensitive Timed Component Connectors M. Sun and F. Arbab - Session 5: COMPONENTS AND SERVICES I (Joint session FMOODS and Coordination) * A Representation-Independent Behavioral Semantics for Object-Oriented Components A. Poetzsch-Heffter and J. Sch?fer * Combining Formal Methods and Aspects for Specifying and Enforcing Architectural Invariants S. Kallel, A. Charfi, M. Mezini, M. Jmaiel * A Formal Language for Electronic Contracts C. Prisacariu and G. Schneider o FRIDAY June 8th - INVITED SPEAKER COORDINATION Rachid Guerraoui Sommersby: The Return of the Transaction - Session 6: SPECIFICATION, VERIFICATION, AND REFINEMENT * A Sound and Complete Shared-Variable Concurrency Model for Multi-Threaded Java Programs F. de Boer * Refactoring object-oriented specifications with data and processes T. Ruhroth and H. Wehrheim * A Refinement Method for Java Programs H. Grandy, K. Stenzel and W. Reif - SESSION 7: COMPONENTS AND SERVICES II (Joint session Coordination and FMOODS) * Component Connectors with QoS Guarantees F. Arbab, T. Chothia, M. Sun, Y.-J. Moon * Adaptation of Open Component-based Systems P. Poizat and G. Sala?n * Context-Based Adaptation of Component Behavioural Interfaces J. Ca'mara, C. Canal Velasco, J. Cubo, E. Pimentel, G. Salaun ------------------------------------------------------------------------------------------------------------ OBJECTIVES AND SCOPE: Established in 1996, the FMOODS series of conferences aims to provide an integrated forum for research on formal aspects of Open Object-based Distributed Systems. The conference will especially welcome novel contributions reflecting recent developments in the area, in particular component- and model-based design, service-oriented computing and software quality. Areas of interest include but are not limited to: - Semantics and implementation of object-oriented programming and (visual) modelling languages - Formal techniques for specification, design, analysis, verification, validation and testing - Model checking, theorem proving and deductive verification - Type systems and behavioural typing - Formal methods for service-oriented computing - Formal techniques for security and trust in global computing - Formalization of runtime system evolution (e.g. dynamic updates, reconfiguration) - Multiple viewpoint modelling and consistency between different views - Model transformations and refactorings - Integration of quality of service requirements into formal models - Formal approaches to component-based design - Applications of formal methods (e.g. web services, multimedia, telecommunications) - Experience reports on best practices and tools ORGANISERS: General chair: George Papadopoulos (U. of Cyprus, CY) PC chairs: Einar Broch Johnsen (U. of Oslo, NO) Marcello Bonsangue (LIACS, NL) Publicity Chair: Martin Steffen (U. of Oslo, NO) Steering Committee: John Derrick (U. of Sheffield, UK) Roberto Gorrieri (U. of Bologna, IT) Elie Najm (ENST, Paris, FR) Carolyn Talcott (SRI International, US) Program Committee Bernhard Aichernig (TU. of Graz, AT) Alessandro Aldini (U. of Urbino, IT) Frank de Boer (CWI, NL) Eerke Boiten (U. of Kent, UK) Marcello Bonsangue (LIACS, NL) John Derrick (U. of Sheffield, UK) Einar Broch Johnsen (U. of Oslo, NO) Robert France (Colorado State U., US) Reiko Heckel (U. of Leicester, UK) Naoki Kobayashi (Tohoku University, JP) Zhiming Liu (UNU-IIST, MO) Elie Najm (ENST, Paris, FR) David Naumann (Stevens Inst. of Technology, US) Uwe Nestmann (TU of Berlin, DE) Erik Poll (U. of Nijmegen, NL) Antonio Ravara (TU of Lisbon, PT) Arend Rensink (U. of Twente, NL) Ralf Reussner (U. of Karlsruhe, DE) Grigore Rosu (U. of Illinois at Urbana-Champaign, US) Bernhard Rumpe (TU Braunschweig, DE) Martin Steffen (U. of Oslo, NO) Carolyn Talcott (SRI International, US) Heike Wehrheim (U. of Paderborn, DE) Martin Wirsing (U. of Munich DE) Wang Yi (Uppsala University, SE) Gianluigi Zavattaro (U. of Bologna, IT) Elena Zucca (U. of Genova, IT) From sanjiva at cse.iitd.ac.in Wed Apr 25 03:26:47 2007 From: sanjiva at cse.iitd.ac.in (Sanjiva Prasad) Date: Wed, 25 Apr 2007 12:56:47 +0530 Subject: [TYPES/announce] Brief announcement re: FSTTCS 2007 Message-ID: <462F02B7.40506@cse.iitd.ac.in> FST TCS 2007 will take place in New Delhi during the period 12--14 December 2007. The call for papers is available at www.fsttcs.org The call for papers specifically mentions several areas of interest to this mailing list. The important dates are: submission (abstract): 10th June 2007 submission( paper): 17th June 2007 notification: 19th August 2007 conference 12th-14th December 2007 Confirmed invited speakers include Maurice Herlihy , Richard Karp , Benjamin Pierce , Thomas Reps , Salil Vadhan , and Andrew Yao . Two satellite workshops are also being planned, one each on 11 December and 15 December respectively. V. Arvind and Sanjiva Prasad PC Co-chairs, FST TCS 2007 From C.Haack at cs.ru.nl Mon Apr 30 10:04:05 2007 From: C.Haack at cs.ru.nl (Christian Haack) Date: Mon, 30 Apr 2007 16:04:05 +0200 Subject: [TYPES/announce] CFP: Verification and Analysis of Multi-threaded Java-like Programs Message-ID: <4635F755.9020400@cs.ru.nl> Call for Contributions: Vamp 2007 1st Workshop on Verification and Analysis of Multi-threaded Java-like Programs A satellite workshop at Concur 2007 Lisbon, Portugal, September 3, 2007 http://www.cs.ru.nl/~chaack/VAMP07 SCOPE The VAMP workshop provides a forum for researchers interested in verification and analysis of multi-threaded Java-like programs. It aims to bring together practically minded tool builders and theoretically minded concurrency researchers who are interested in verification and analysis techniques for Java-like languages. Topics of interest include but are not limited to (where MJLL stands for multi-threaded Java-like languages): * program logics for MJLL * automatic verification and static analysis techniques for MJLL * type-based verification for MJLL * software model checking for MJLL * specification techniques for MJLL * formal semantics for MJLL * formalizations of the Java memory model * race condition detection, deadlock detection, etc. * static analysis for bug discovery CONTRIBUTIONS We invite papers of up to 12 pages in ENTCS-style format. Papers must be submitted electronically following the instructions on the workshop webpage. The papers will be refereed by the program committee. We will prepare preliminary proceedings for the workshop and, if there is a sufficient number of good submissions, post-workshop proceedings will be published in the Electronic Notes in Theoretical Computer Science (ENTCS). We also invite short papers of up to 6 pages that may raise interesting issues for discussion. These will not be included in the post-proceedings. IMPORTANT DATES Paper submission: Friday, 1 June Notification date: Friday, 6 July Submission of version for the preliminary proceedings: Friday, 13 July Submission of final version for ENTCS: Friday, 28 September PROGRAM COMMITTEE Stephen Freund Williams College, U.S.A. Christian Haack Radboud Universiteit Nijmegen, The Netherlands Marieke Huisman INRIA Sophia Antipolis, France Bart Jacobs Katholieke Universiteit Leuven, Belgium Joe Kiniry University College Dublin, Ireland Alexander Knapp Ludwig-Maximilians-Universit?t M?nchen, Germany Erik Poll Radboud Universiteit Nijmegen, The Netherlands Robby Kansas State University, U.S.A. ORGANIZERS Christian Haack Radboud Universiteit Nijmegen, The Netherlands Marieke Huisman INRIA Sophia Antipolis, France Joe Kiniry University College Dublin, Ireland Erik Poll Radboud Universiteit Nijmegen, The Netherlands If you have questions, please send e-mail to chaack at cs.ru.nl. From Philippe.LAHIRE at unice.fr Mon Apr 30 11:20:37 2007 From: Philippe.LAHIRE at unice.fr (Philippe.LAHIRE@unice.fr) Date: Mon, 30 Apr 2007 17:20:37 +0200 Subject: [TYPES/announce] Call for Participation: TOOLS Europe 2007 Message-ID: <46360945.3050806@unice.fr> ============================================================================ CALL FOR PARTICIPATION TOOLS EUROPE 2007 Objects, Models, Components, Patterns ETH Zurich, Switzerland 24-28 June 2007 http://tools.ethz.ch/ ============================================================================ Keynote Speakers Steve Cook (Microsoft) Erich Gamma (IBM) Robin Milner (University of Cambridge) Dave Thomas (Bedarra Research Labs) Overview TOOLS 2007 is the 45th TOOLS conference. Started in 1989, TOOLS conferences, held in Europe, the USA, Australia, and China 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. 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. It will include both scientific and experience conference papers, workshops, tutorials, a poster session, and a venture forum. 24 papers have been accepted after a rigorous selection process by the international Program Committee, with an emphasis on originality, practicality and overall quality. Topics addressed this year by selected papers include model-driven engineering, aspect-orientation, component-based languages, and language reflection. TOOLS also includes a number of workshops, starting on June 24th, on topics such as variability management and programming languages, MDD, and software education. Note that it is STILL POSSIBLE to include selected workshops on themes related to TOOLS, or working group meetings etc.; please contact stephane.ducasse at univ-savoie.fr or Jean-Claude.Royer at emn.fr. Registration Early bird registration: 31 May 2007 or earlier Advance registration: 20 June 2007 or earlier After the advance registration date, registration will be on site only. The registration form can be found on the TOOLS website. Venue and accommodation The conference will take place in the main building of the ETH Z?rich, located in the centre of Z?rich, close to the main station. Z?rich is the largest city in Switzerland, home to the country's largest airport with numerous international connections, and is the country's main commercial and industrial centre. ETH is one of Europe's premier universities in the fields of Chemistry, Physics, Electrical Engineering, and Computer Science. A list of suggested hotels can be found on the TOOLS website at the following URL: http://tools.ethz.ch/venue.html Chairpersons Conference chair: Bertrand Meyer Program chair: Jean Bezivin Publicity chairs: Philippe Lahire, Laurence Tratt Workshop chairs: St?phane Ducasse, Jean-Claude Royer Program committee Patrick Albert, Gustavo Alonso, Uwe Assman, Don Batory, Claude Baudoin, Bernhard Beckert, Jean-Pierre Briot, Stefano Ceri, Siobhan 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 Lemmel, 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 Susanne.Graf at imag.fr Fri Apr 27 16:09:00 2007 From: Susanne.Graf at imag.fr (Susanne Graf) Date: Fri, 27 Apr 2007 22:09:00 +0200 Subject: [TYPES/announce] Call for Papers: ATVA 2007 Message-ID: <4632585C.2020305@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) Aarti Gupta (NEC 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. Allen 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 greg at eecs.harvard.edu Mon Apr 30 14:38:45 2007 From: greg at eecs.harvard.edu (Greg Morrisett) Date: Mon, 30 Apr 2007 14:38:45 -0400 Subject: [TYPES/announce] CFP: ISMM'07 Message-ID: <463637B5.5070009@eecs.harvard.edu> ISMM'07 CALL FOR PAPERS ABSTRACTS DUE 7 MAY 2007 2007 ACM International Symposium on Memory Management To be co-located with OOPSLA 2007 in Montreal http://www.eecs.harvard.edu/~greg/ismm07/ Important Dates: Abstract Submission: 7 May 2007 Papers Submission: 14 May 2007 Author Response Period: 8-11 June 2007 Notification: 20 June 2007 Camera-ready Copy: 30 July 2007 Conference: 21-22 October 2007 ISMM is a forum for research in management of dynamically allocated memory. Areas of interest include but are not limited to: explicit storage allocation and deallocation; garbage collection algorithms and implementations; compiler analyses to aid memory management; interactions with languages, operating systems, and hardware, especially the memory system; and empirical studies of allocation and referencing behavior in programs that make significant use of dynamic memory. We encourage submissions in new topics related to memory management, e.g., transactional memory, security, and correctness of memory systems, as well as survey papers that present an aspect of memory management with a new coherence. For more information, including submission procedures, see the ISMM'07 web site: http://www.eecs.harvard.edu/~greg/ismm07/ From benhamou at cmi.univ-mrs.fr Tue May 1 08:03:45 2007 From: benhamou at cmi.univ-mrs.fr (benhamou) Date: Tue, 01 May 2007 14:03:45 +0200 Subject: [TYPES/announce] Call for participation: Tableaux 2007 Message-ID: <46372CA1.4000900@cmi.univ-mrs.fr> %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% Call for Participation %% %% %% %% 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/ GENERAL INFORMATION This conference is the 16th in a series of international meetings on Automated Reasoning with Analytic Tableaux and Related Methods. 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. INVITED SPEAKERS: Piero Bonatti, Universit? di Napoli John-Jules Meyer, Utrecht University Cesare Tinelli, University of Iowa TUTORIALS: The Tableau Work Bench: Theory and Practice (P. Abate, R. Gor?) Tableau Methods for Interval Temporal Logics (V. Goranko, A. Montanari) Semistructured Databases and Modal Logic (S. Cerrito) COLOCATED WORKSHOP: AGENTS, LOGIC AND THEOREM PROVING 3 July 2007, http://www.lif-sud.univ-mrs.fr/~schwind/Agentws.html ON-LINE REGISTRATION is now open at: http://tableaux2007.univ-cezanne.fr Bela?d Benhamou Publicity Chair of TABLEAUX From skalka at cs.uvm.edu Tue May 1 12:35:56 2007 From: skalka at cs.uvm.edu (Christian Skalka) Date: Tue, 01 May 2007 12:35:56 -0400 Subject: [TYPES/announce] Postdoctoral Research Position at University of Vermont Message-ID: <01fa01c78c0e$cc3a1da0$2802a8c0@Pers> **Please note: this announcement was originally sent April 16 with an incorrect application deadline, that has been corrected in this posting (correct deadline is June 15, 2007). ================================================== 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, 2007, 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 hilde at itu.dk Wed May 2 03:02:56 2007 From: hilde at itu.dk (hilde@itu.dk) Date: Wed, 2 May 2007 09:02:56 +0200 (CEST) Subject: [TYPES/announce] CFP: EXPRESS'07- deadline for abstracts May 28 (extended) Message-ID: <30281.80.63.146.6.1178089376.squirrel@secure.itu.dk> ==========deadline extension for abstracts May 28=========== CALL FOR PAPERS EXPRESS'07 http://express07.pps.jussieu.fr/ 14th International Workshop on Expressiveness in Concurrency Monday, 3 September, 2007. Gulbenkian Foundation, Lisbon, Portugal Affiliated with CONCUR 2007. ============================================================ SCOPE. The EXPRESS workshops aim at bringing together researchers interested in the relations between various formal systems, particularly in the field of Concurrency. More specifically, they focus on the comparison between programming concepts (such as concurrent, functional, imperative, logic and object-oriented programming) and between mathematical models of computation (such as process algebras, Petri nets, event structures, modal logics, rewrite systems etc.) on the basis of their relative expressive power. SUBMISSION Short papers (up to 4 pages, 11pt font) and Full papers (up to 12 pages, 11pt font, excluding bibliography and technical appendices) are accepted, preferably in ENTCS-style. IMPORTANT DATES. Abstract submission: Friday, 28 May, 2007. (EXTENDED!) Paper submission: Friday, 1 June, 2007. Notification: Friday, 29 June, 2007. Submission of preliminary version for the Proceedings: Friday, 6 July, 2007. Workshop: Monday, 3 September, 2007 (day before CONCUR07). Submission of final version for ENTCS: Friday, 28 September, 2007. For more informations, visit http://express07.pps.jussieu.fr/ . ============================================================== From tobias at dsv.su.se Wed May 2 13:52:56 2007 From: tobias at dsv.su.se (Tobias Wrigstad) Date: Wed, 2 May 2007 19:52:56 +0200 Subject: [TYPES/announce] CFP: Workshop on Aliasing, Confinement and Ownership in OOP Message-ID: **Note** This is a resend of the CFP for the IWACO workshop to broadcast that the workshop date is now fixed at July 30th, 2007. --------------------------------------------------------------- International Workshop on Aliasing, Confinement and Ownership in object-oriented programming (IWACO) ----> July 30, 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 May 13, 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 Antonio.Bucciarelli at pps.jussieu.fr Fri May 4 10:17:36 2007 From: Antonio.Bucciarelli at pps.jussieu.fr (Antonio Bucciarelli) Date: Fri, 04 May 2007 16:17:36 +0200 Subject: [TYPES/announce] RDP'07 call for participation Message-ID: <463B4080.5030609@pps.jussieu.fr> RDP 2007 - Call for Participation Federated Conference on Rewriting, Deduction, and Programming June 25 to 29, Paris, France http://www.rdp07.org ======================================================================== Online Registration is open until May, 31. ======================================================================== RDP'07 is the fourth edition of the International Conference on Rewriting, Deduction, and Programming, consisting of two main conferences: * Rewriting Techniques and Applications (RTA'07) * Typed Lambda Calculi and Applications (TLCA'07) a colloquium: * From Type Theory to Morphologic Complexity: a Colloquium in Honor of Giuseppe Longo as well as the following workshops: * Higher Order Rewriting (HOR) * Proof Assistants and Types in Education (PATE) * Rule-Based Programming (RULE) * Security and Rewriting Techniques (SecReT) * Unification (UNIF) * Functional and (Constraint) Logic Programmming (WFLP) * Reduction Strategies in Rewriting and Programming (WRS) * Termination (WST) Invited Speakers: ================= Joint RTA/TLCA: * Frank Pfenning (Carnegie Mellon University) TLCA: * Patrick Baillot (CNRS, University Paris 13) * Greg Morrisett (Harvard University) RTA: * Xavier Leroy (INRIA Rocquencourt) * Robert Nieuwenhuis (Technical University of Catalonia) Celebration of the 75th anniversary of the lambda calculus: * Henk Barendregt (Nijmegen University) Registration: ============= http://www.rdp07.org/registration.html Student Travel Grants: ====================== A limited number of travel grants for students is available. A call for applications will be issued separately. Information about travel grants will also be published on http://www.rdp07.org/grants. From Antonio.Bucciarelli at pps.jussieu.fr Fri May 4 11:20:19 2007 From: Antonio.Bucciarelli at pps.jussieu.fr (Antonio Bucciarelli) Date: Fri, 04 May 2007 17:20:19 +0200 Subject: [TYPES/announce] RDP'07 Student Travel Grants Message-ID: <463B4F33.3020102@pps.jussieu.fr> RDP'07 Student Travel Grants Call for Applications ********************************************************************** RDP'07 is the fourth edition of the International Conference on Rewriting, Deduction and Programming, to be held June 25 to 29 in Paris, France. Please consult the RDP'07 web page http://www.rdp07.org for more information. A limited number of travel grants is available for students who would not otherwise have resources to attend RDP'07, and whose attendance would benefit both the applicant and the conference. The number of grants and the per-grant amount will be established on a case by case basis, depending on the applicant's need and the total amount of funds available for the program. Applicants should note that a grant is limited, and that costs in excess of the grant will not be reimbursed. Grants will be awarded based on the evaluating committee's assessment of the applicant's genuine financial need, the potential benefit to the applicant's education, research, and career, and the potential benefit to the conference or workshop. Among those applicants who genuinely could not attend the conference without a grant, the evaluating committee gives priority to (co-)authors of accepted papers. Applications should explain - the current status of the applicant - the kind of participation of the applicant in RDP - a breakdown of the estimated amount needed Applications should be send by May 20, midnight UT time zone, by email to registration at rdp07.org. Applicants should have their supervisor send a recommendation email to the same address and by the same deadline. This letter should describe the student's work, the benefit to that work of attending the conference, and an assessment of the student's financial need. Timeline: - Sunday, May 20, midnight UT Deadline for applications and recommendation letters - Thursday, May 24 Notification about acceptance or rejection - Thursday, May 31 Deadline for RDP'07 registration From Danny.Dube at ift.ulaval.ca Fri May 4 14:01:40 2007 From: Danny.Dube at ift.ulaval.ca (=?iso-8859-1?q?Danny_Dub=E9?=) Date: 04 May 2007 14:01:40 -0400 Subject: [TYPES/announce] CfP: Scheme and Functional Programming 2007 Message-ID: <87k5votqm3.fsf@dadub.ift.ulaval.ca> [Apologies of you receive multiple copies of this message] > (for-papers) ; call for papers 2007 Workshop on Scheme and Functional Programming http://sfp2007.ift.ulaval.ca/ Freiburg, Germany --- 30 September 2007 The 2007 Scheme Workshop is a forum for discussing experience with and future development of the Scheme programming language. The scope of the workshop includes all aspects of the design, implementation, theory, and application of Scheme. We encourage everyone interested in Scheme to participate. This workshop forms part of the 2007 International Conference on Functional Programming (ICFP) as an associated, ACM SIGPLAN sponsored event. Topics of interest for technical papers include (but are not limited to): Design. Language critiques and extensions, concurrency and distribution, components and composition, language embedding, object systems, type systems, exception handling, syntactic abstraction, module systems and libraries, multiparadigm programming, scripting. Implementation. Compilers, interpreters, runtime systems, virtual machines, resource management, program analysis and transformation, partial evaluation, compile-time and run-time optimization, foreign function and operating system interfaces, embedded systems. Development tools. Profilers, tracers, debuggers, program development environments, program understanding tools, performance and conformance test suites. Theory. Formal semantics, correctness of analyses and transformations, lambda calculus, continuations, program verification. Education. Teaching Scheme, teaching with Scheme. Topics of interest for experience papers include (but are not limited to): Applications. Domain-specific languages, graphical user interfaces, web programming, network applications, multimedia programming, systems programming, symbolic computing, large systems, use of Scheme as a scripting language. Practice and experience. Experience with Scheme in education and industry. Scheme pearls. Elegant, instructive uses of Scheme. Experience papers need not necessarily report original research results; they may instead 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! System Demonstrations. Authors of both technical and experience papers are invited to describe, in an appendix, proposals for system demonstrations to be given during the workshop. Panel Discussions. We also invite proposals for panel discussions on topics of interest to the Scheme community. Authors of accepted proposals will give a brief presentation on the topic and then moderate the discussion that follows. For submission details, please see http://sfp2007.ift.ulaval.ca/. Program committee John Clements (Cal Poly) Danny Dub?, chairman (Laval University) Martin Gasbichler (Z?hlke Engineering) Aubrey Jaffer (ClearMethods Inc.) Christian Queinnec (University Paris 6) Chung-chieh Shan (Rutgers University) Steering committee William D. Clinger (Northeastern University) Marc Feeley (University of Montr?al) Robby Findler (University of Chicago) Dan Friedman (Indiana University) Christian Queinnec (University Paris 6) Manuel Serrano (INRIA Sophia Antipolis) Olin Shivers (Northeastern University) Mitchell Wand (Northeastern University) Submission deadline June 22, 2007 Author notification August 3, 2007 Final paper due September 7, 2007 Workshop September 30, 2007 From tkt at imm.dtu.dk Mon May 7 05:15:43 2007 From: tkt at imm.dtu.dk (Terkel K. Tolstrup) Date: Mon, 7 May 2007 11:15:43 +0200 (CEST) Subject: [TYPES/announce] SAS 2007: Call for Posters Message-ID: <1350.130.225.70.123.1178529343.squirrel@www2.imm.dtu.dk> Call for Posters Static Analysis Symposium SAS 2007 22-24 August 2007, Kongens Lyngby, Denmark (co-located with LOPSTR 2007) In connection with the Static Analysis Symposium (SAS 2007) we are arranging a poster session for PhD students and young researchers. The topics of the poster session will be the same as those of the symposium; see the website http://www.imm.dtu.dk/sas2007 for further information. Submitted posters should be in A2 format and should be accompanied by 1-2 page abstract in LNCS format (to be collected and distributed at the symposium). The files must be submitted to sasposter at imm.dtu.dk in one email as two seperate pdf files. Selection committee Terkel K. Tolstrup (Chair) Sebastian Nanz Flemming Nielson Hanne Riis Nielson Christian W. Probst Important dates Submission of poster: May 29, 2007 Notification: June 11, 2007 Camera-ready version: June 22, 2007 Conference: August 22-24, 2007 The acceptance will be conditional on at least one of the authors having registered at the conference. -- Terkel K. Tolstrup, PhD Assistant Professor, IMM, DTU http://www.imm.dtu.dk/~tkt From einarj at ifi.uio.no Tue May 8 12:29:44 2007 From: einarj at ifi.uio.no (Einar Broch Johnsen) Date: Tue, 08 May 2007 18:29:44 +0200 Subject: [TYPES/announce] Oslo: PhD Position in Formal Methods for Sensor Networks Message-ID: ======================================================== Oslo: PhD Position in Formal Methods for Sensor Networks ======================================================== 1 PhD position available at the Interventional Centre at Rikshospitalet and the Department of Informatics, University of Oslo within the research project: CONNECT: Active Behavioral Interfaces for Seamless Network Integration The main objective of the CONNECT project is to develop a framework for the modeling and analysis of heterogeneous networks in which devices may connect seamlessly in a semantically meaningful way. The project involves an extended case study of biomedical sensor networks for patient monitoring. More information on the CONNECT project can be found at the following webpage: http://www.ifi.uio.no/forskning/grupper/pma/connect The candidate is expected to work on the design and application of behavioral interfaces as a construct for seamless adaptation in heterogeneous networks. The candidate will collaborate closely with the staff at the Interventional Centre at Rikshospitalet in the development of a case study on heterogeneous nets for patient monitoring. The candidate is also expected to participate in the development of a formal model for active behavioral interfaces and on techniques for validating objects with respect to active behavioral interfaces, in collaboration with researchers at the Department of Informatics. The candidate should have a background in either software engineering, concurrency, and formal methods, or in signal processing and sensor networks, and will be expected to acquire knowledge in the other discipline. The PhD candidate should have at least a master degree in computer science. Terms of employment ------------------- The position is available for 3 years from August 1, 2007, or as soon as possible after this date. Pay grade: 43-48 (NOK 325 800 - 355 200) (Norwegian LTR scale, depending on qualifications) Further details --------------- For further information, please contact Professor Ilangko Balasingham, email: ilangkob at ulrik.uio.no, associate professor Einar Broch Johnsen, email: einarj at ifi.uio.no, or professor Olaf Owe, email: olaf 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, and complete information about your education (both bachelor and master level) with transcripts of grades, job experience, scientific publications, and 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 (ref 07/5502) PO Box 1032 Blindern, NO-0315 Oslo, NORWAY Applications may also be submitted electronically to Einar Broch Johnsen, email: einarj at ifi.uio.no Deadline for applications: June 1, 2007 The formal announcement of the position is available from http://heim.ifi.uio.no/~einarj/ConnectStip2.pdf Application papers will not be returned, with the exception of original publications. From Jeremy.Gibbons at comlab.ox.ac.uk Wed May 9 04:17:39 2007 From: Jeremy.Gibbons at comlab.ox.ac.uk (Jeremy.Gibbons@comlab.ox.ac.uk) Date: Wed, 9 May 2007 08:17:39 GMT Subject: [TYPES/announce] Integrated Formal Methods 2007: Call for participation Message-ID: <200705090817.l498HdEP021064@mercury.comlab.ox.ac.uk> IFM2007: INTEGRATED FORMAL METHODS CALL FOR PARTICIPATION 2nd to 5th July 2007 St Anne's College, Oxford, UK www.ifm2007.org The design and analysis of computing systems presents a significant challenge: systems need to be understood at many different levels of abstraction, and examined from many different perspectives. Formal methods - languages, tools, and techniques with a sound, mathematical basis - can be used to develop a thorough understanding, and to support rigorous examination. Further research into effective integration is required if these methods are to have a significant impact outside academia. The IFM series of conferences seeks to promote that research, to bring together the researchers carrying it out, and to disseminate the results of that research among the wider academic and industrial community. This is the sixth IFM conference. It will be held in the historic university town of Oxford, at St Anne's College - one of the larger colleges of the University, with excellent new conference facilities. Oxford is easily reached from most UK cities, and is 70 minutes from the country's largest airport. Earlier conferences in the series were held at York (1999), Schloss Dagstuhl (2000), Turku (2002), Kent (2004), and Eindhoven (2005). The conference runs for three full days, 3rd to 5th July. Invited speakers include Jifeng He on "UTP Semantics for Web Services" and Daniel Jackson on "Recent Advances in Alloy"; a third invited speaker is yet to be confirmed. There are 32 contributed papers, including a special session on Unifying Theories of Programming. In addition, there are four satellite events, taking place on 2nd and 3rd July - three workshops: * Refinement Workshop * C/C++ Verification * MeMoT (Methods, Models and Tools for Fault Tolerance) and a tutorial: * KeY (Integrating OO Design and Deductive Verification of Software) The full programme is available at: http://www.ifm2007.org/programme-ifm.html Registration for the conference is now open, at: http://www.ifm2007.org/registration.html Special early-registration fees apply until 1st June 2007. For more information, visit the conference web page: http://www.ifm2007.org/ or contact the local organisers: Jim Davies http://www.softeng.ox.ac.uk/Jim.Davies Jeremy Gibbons http://www.softeng.ox.ac.uk/Jeremy.Gibbons From mwh at cs.umd.edu Wed May 9 11:28:35 2007 From: mwh at cs.umd.edu (mwh@cs.umd.edu) Date: Wed, 9 May 2007 11:28:35 -0400 Subject: [TYPES/announce] Call for Participation: PLAS 2007 Message-ID: <20070509_152835_052029.mwh@cs.umd.edu> 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 Call For Participation 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. We have a strong program consisting of 13 technical papers and one informal presentation, on a variety of topics, including: * Language-based techniques for security, including new accounts of declassification, new proof techniques, new application domains, and practical implementations * Program analysis techniques for discovering security vulnerabilities * New host-based intrusion techniques, based on static analysis and application frameworks The conference hotel registration deadline is May 9; early registration deadline is May 11. Generous support from IBM Research has made it possible for us to offer travel grants for students attending PLAS. See Application form on the PLAS web page for further instructions. Preliminary Program Jifclipse: Development Tools for Security-Typed Applications - Boniface Hicks, Dave King and Patrick McDaniel Towards Usable Information Flow Security in Java - Mark Thober and Scott F. Smith A Domain-Specific Programming Language for Secure Multiparty Computation - Janus Dam Nielsen and Michael I. Schwartzbach Quantitative Analysis of Leakage for Multi-threaded Programs - Pasquale Malacaria and Han Chen A Simulation-based Proof Technique for Dynamic Information Flow - Stephen McCamant and Michael Ernst Cautious Virus Detection in the Extreme (Short Paper) - John Case and Samuel Moelius Localized Delimited Release: Combining the What and Where Dimensions of Information Release - Aslan Askarov and Andrei Sabelfeld Towards a Logical Account of Declassification (Short Paper) - Anindya Banerjee, David Naumann and Stan Rosenberg Fast Probabilistic Simulation, Nontermination, and Secure Information Flow (Short Paper) - Geoffrey Smith and Rafael Alpizar Informal Presentation: A Trust Management Perspective on Managing Policy Updates in Security-Typed Languages - Sruthi Bandhakavi, William Winsborough and Marianne Winslett Large-scale analysis of format string vulnerabilities in Debian Linux - Karl Chen, David Wagner and Daniel Wilkerson Guarded Models For Intrusion Detection - Hassen Saidi Using Web Application Construction Frameworks To Protect Against Code Injection Attacks - Benjamin Livshits Abash: Finding Bugs in Bash Scripts - Karl Mazurak and Steve Zdancewic 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 eeide at cs.utah.edu Wed May 9 13:39:08 2007 From: eeide at cs.utah.edu (Eric Eide) Date: Wed, 9 May 2007 11:39:08 -0600 Subject: [TYPES/announce] CFP: PLOS '07: 4th Workshop on Programming Languages and Operating Systems Message-ID: <17986.1852.456209.304232@bas.flux.utah.edu> If you apply type-based or other advanced language ideas in the implementation of operating systems, we hope you will consider submitting a paper to PLOS '07. See the CFP below, or visit the Web site at http://plosworkshop.org/2007/ Best wishes --- Eric, Marc, Robert, and Olaf The PLOS 2007 Organizing Committee ------------------------------------------------------------------------------- CALL FOR PAPERS Fourth Workshop on Programming Languages and Operating Systems (PLOS 2007) October 18, 2007 Skamania Lodge / Stevenson, WA, USA http://plosworkshop.org/2007/ Paper submission deadline: June 29, 2007 Notification of acceptance: August 15, 2007 Final papers due: September 15, 2007 Workshop: October 18, 2007 Historically, operating system development and programming language development went hand-in-hand. Cross-fertilization was the norm. Challenges in one area were often approached using ideas or techniques developed in the other, and advances in one enabled new capabilities in both. Today, although the systems community at large retains an iron grip on C, novel approaches to OS construction based on new programming language ideas continue to be an active and important area of research. The systems field continues to provide a wealth of challenge problems and new results that should spark advances in programming languages, software designs, and idioms. This workshop aims to bring together researchers and developers from the programming language and the operating system domains to discuss recent work at the intersection of these fields. It will be a platform for discussing new visions, challenges, experiences, problems, and solutions arising from the application of advanced programming and software engineering concepts to operating systems construction, and vice versa. Suggested paper topics include, but are not restricted to: * critical evaluations of new programming language ideas in support of OS construction * domain-specific languages for operating systems * type-safe languages for operating systems * object-oriented and component-based operating systems * language-based approaches to crosscutting system concerns, such as security and run-time performance * language support for system verification * language support for OS testing and debugging * static/dynamic configuration of operating systems * static/dynamic specialization within operating systems * the use of OS abstractions and techniques in language runtimes AGENDA The workshop will be highly interactive, and attendance will be limited to about thirty (30) people to promote focused and lively discussions. Each potential participant should submit a paper as described below. A single paper may have multiple authors, but the number of authors per paper at the workshop may be limited. The workshop organizers will use the accepted papers and input from invited participants to compile a list of topics for working groups, to be held during the workshop. The list of discussion topics may be extended or changed during the workshop, based on the presentation and discussion of the workshop papers. SUBMISSION GUIDELINES Invitations to the workshop will be based on accepted papers, up to five (5) pages in length. The workshop welcomes research, experience, and position papers; papers describing industrial experience are particularly encouraged. All papers must be written in English and submitted in PDF format via the workshop Web site. Papers should be formatted according to the ACM proceedings format. Submissions will be reviewed by the workshop program committee and designated reviewers. Papers will be evaluated based on technical quality, originality, relevance, and presentation. Accepted papers will be published electronically in the ACM Digital Library, and the authors of accepted papers will be required to sign ACM copyright release forms. However, the publication of a paper in the PLOS workshop proceedings is not intended to replace future conference publication. PROGRAM COMMITTEE Emery Berger, University of Massachusetts Amherst Eric Brewer, University of California, Berkeley Eric Eide, University of Utah Manuel A. Fahndrich, Microsoft Research Marc E. Fiuczynski, Princeton University Robert Grimm, New York University Gilles Muller, Ecole des Mines de Nantes Olaf Spinczyk, University of Erlangen-Nuremberg ORGANIZING COMMITTEE Eric Eide (co-chair), University of Utah Marc E. Fiuczynski (co-chair), Princeton University Robert Grimm, New York University Olaf Spinczyk, University of Erlangen-Nuremberg From Stephan.Merz at loria.fr Wed May 9 15:56:09 2007 From: Stephan.Merz at loria.fr (Stephan Merz) Date: Wed, 09 May 2007 21:56:09 +0200 Subject: [TYPES/announce] Special Issue of Formal Aspects of Computing: Formal Modeling and Verification of Critical Systems Message-ID: <46422759.9070301@loria.fr> Call For Papers Journal on Formal Aspects of Computing Special Issue on Formal Modeling and Verification of Critical Systems This special issue is devoted to the scope of two international workshops: the Workshop on Automated Verification of Critical Systems (AVoCS 2006) and the Verification Workshop (VERIFY'06), which took place during September 2006 in Nancy (France) and during August 2006 in Seattle (USA), respectively. Topics of interest include automated verification (abstract interpretation, model checking, theorem proving, ...), formal development methodologies (compositional and modular reasoning, refinement, stepwise development, ...), formal modeling techniques (architectural modeling, behavioral modeling, generic security models, ...), and case studies (academic as well as industrial). Possible application areas include safety-critical, security-critical, and performance-critical systems. Submission to this special issue is completely open. We expect original articles (typically 15-30 pages) that present high-quality contributions that have not been previously published in an archival venue and that must not be simultaneously submitted for publication elsewhere. Submissions must comply with FAC's author guidelines (see http://www.springer.com/journal/00165/submission), be written in English, and be formatted using LaTeX. Submission to this special issue are hereby encouraged via the EasyChair submission system at http://www.easychair.org/AVOCSVERIFYJFAC07. The deadline for submissions is June 1st, 2007. Guest editors: Serge Autexier, Heiko Mantel, Stephan Merz, Tobias Nipkow Useful websites: * Special issue: http://www.dfki.de/~serge/AVOCS-VERIFY-07 * Submission Webpage: http://www.easychair.org/AVOCSVERIFYJFAC07 * AVOCS'06 Webpage: http://avocs06.loria.fr/ * VERIFY'06 webpage: http://www.easychair.org/FLoC-06/VERIFY.html * Journal homepage: http://www.bcs-facs.org/journal * Author guidelines: http://www.springer.com/journal/00165/submission -------------- 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/20070509/f1415c82/Stephan.Merz.bin From ratiu at math.lmu.de Thu May 10 10:21:39 2007 From: ratiu at math.lmu.de (ratiu@math.lmu.de) Date: Thu, 10 May 2007 16:21:39 +0200 Subject: [TYPES/announce] Festkolloquium and Workshop honoring H.Schwichtenberg Message-ID: <20070510162139.8nzesrx2g65cggs8@webmail.mathematik.uni-muenchen.de> We are pleased to announce two special events to be held on June 22/23, 2007 at the Mathematical Institute of the Ludwig-Maximilians-Universit"at M"unchen. ----------------------------------------------------------------------- Festkolloquium on the occasion of Helmut Schwichtenberg's 65th birthday ----------------------------------------------------------------------- to be held on Friday June 22, 2007 from 3 p.m. by the Faculty of Mathematics, Computer Science, and Statistics of the LMU. -------------------------------------- Workshop "Proof and Computation II" -------------------------------------- complementing the Festkolloquium and taking place on Saturday June 23, 2007 at the Mathematical Institute of the LMU. SPEAKERS: Festkolloquium: Ulrich Berger and Stanley Wainer Workshop: Peter Aczel, Hajime Ishihara, Gerhard Jaeger, Ralph Matthes, Erik Palmgren, Monika Seisenberger, and Anton Setzer. PROGRAMME: Friday 22 June: 3-6 p.m. Festkolloquium (H"orsaal B051) 7-? p.m. Social Dinner Saturday 23 June: 9-12 a.m. and 3-6 p.m. Workshop (tentative) More information: http://www.mathematik.uni-muenchen.de/~pschust/puc2.html (not before May 20). REGISTRATION: No later than June 1, 2007 by email to ratiu at math.lmu.de Please specify the intended duration of stay (Friday, Saturday, or both); whether you need assistance with booking accommodation (if so, then please provide arrival and departure date); and if you would like to attend the social dinner (a' la carte) on Friday from 7 p.m. in the Ratskeller. There will be no registration fee, but voluntary contributions to the expenses for the coffee breaks will be appreciated. Wilfried Buchholz Peter Schuster ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program. From tobias at dsv.su.se Thu May 10 17:30:30 2007 From: tobias at dsv.su.se (Tobias Wrigstad) Date: Thu, 10 May 2007 23:30:30 +0200 Subject: [TYPES/announce] Deadline Extension: IWACO Message-ID: <75B4D722-D898-49C7-8163-6A0EDF491CBD@dsv.su.se> **Note** This is a resend of the CFP for the IWACO workshop to broadcast that, due to requests, the deadline has been extended to May 15. --------------------------------------------------------------- International Workshop on Aliasing, Confinement and Ownership in object-oriented programming (IWACO) ----> July 30, 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 15, 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 May 15, 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. You may use any suitable document class (a4+twocolumn, llncs, sigplanconf, etc.). Queries ------- Queries may be directed to Tobias Wrigstad (tobias at dsv.su.se). From Susanne.Graf at imag.fr Sat May 12 14:40:33 2007 From: Susanne.Graf at imag.fr (Susanne Graf) Date: Sat, 12 May 2007 20:40:33 +0200 Subject: [TYPES/announce] ATVA 2007: deadline extension to May 21 Message-ID: <46460A21.9010706@imag.fr> CALL FOR PAPERS (:@ SUBMISSION DEADLINE EXTENDED TO MAY 21, 2007 @:) ********************************************************************* 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 (extended): May 21, 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) Aarti Gupta (NEC 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. Allen 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 ruy at cin.ufpe.br Sat May 12 10:07:02 2007 From: ruy at cin.ufpe.br (ruy@cin.ufpe.br) Date: Sat, 12 May 2007 11:07:02 -0300 (BRT) Subject: [TYPES/announce] WoLLIC'2007 - Call for Participation Message-ID: <1218.189.1.6.77.1178978822.squirrel@webmail.cin.ufpe.br> [** sincere apologies for duplicates **] Call for Participation 14th Workshop on Logic, Language, Information and Computation (WoLLIC'2007) Rio de Janeiro, Brazil July 2-5, 2007 (a satellite event to Brazilian Computer Society Conference - CSBC'07) 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, in conjunction with the 27th Brazilian Computer Society Conference. It is 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). PROCEEDINGS The proceedings of WoLLIC'2007, including both invited and contributed papers, will be published in advance of the meeting as a volume in Springer's Lecture Notes in Computer Science. In addition, abstracts will be published in the Conference Report section of the Logic Journal of the IGPL, and selected contributions will be published as a special post-conference WoLLIC'2007 special issue of the journal Information and Computation. INVITED SPEAKERS Alex Borgida (Rutgers) Alessandra Carbone (Paris) Martin Escardo (Birmingham) Philippa Gardner (Imperial Coll) Achim Jung (Birmingham) Louis Kauffman (U Illinois Chicago) Michael Moortgat (Utrecht) Paulo Oliva (London/QM) John Reif (Duke) Yde Venema (Amsterdam) TUTORIAL LECTURES Stone duality, by A. Jung Quantum topology and quantum computation, by L. Kauffman Biological computing, by J. Reif INVITED TALKS Description Logics: formal foundations and applications, by A. Borgida Group Theory and Classical Proofs, by A. Carbone Algorithmic Topology of Program Types, by M. Escardo Contex Logic and Tree Update, by Ph. Gardner On the interplay of logic and information: A topological analysis, by A. Jung Spin networks in quantum computation, by L. Kauffman Symmetries in natural language syntax and semantics: the Lambek-Grishin calculus, by M. Moortgat Computational Interpretations of Classical Linear Logic, by P. Oliva Autonomous programmable biomolecular devices using self-assembled DNA nanostructures specifying properties of data DNA Nanostructures, by J. Reif A modal distributive law, by Y. Venema BOOK EXHIBITION The following publishers are expected to be exhibiting various books from their catalogue, prospectuses, journal samples, etc., and there will be a chance to order items at promotional prices: The MIT Press Springer-Verlag A K Peters Cambridge Univ Press CSLI Publications (Stanford Univ) Oxford Univ Press World Scientific It is likely that a few other international publishers will also take part in the book exhibit. 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 curien at pps.jussieu.fr Sun May 13 15:34:33 2007 From: curien at pps.jussieu.fr (Pierre-Louis Curien) Date: Sun, 13 May 2007 21:34:33 +0200 Subject: [TYPES/announce] Giuseppe Longo's symposium Message-ID: FROM TYPE THEORY TO MORPHOLOGIC COMPLEXITY A Colloquium in Honor of Giuseppe Longo Paris, 28-29 June 2007, in conjunction with Federated Conference on Rewriting, Deduction, and Programming (RDP 2007). This colloquium is organised to celebrate the 60th birthday of Giuseppe Longo. It includes the following speakers and talks (in alphabetical order). More details are available at the page http://www.pps.jussieu.fr/~gc/other/rdp/talks.html. To attend this event, please register following the instructions available at the RDP07 page http://www.rdp07.org/. INVITED SPEAKERS AND TALKS. Henk Barendregt and Jan Willem Klop. Non-left linear reductions via infinitary lambda calculus. Kim Bruce. Modularity and Scope in Object-Oriented Languages. Luca Cardelli. Artificial Biochemistry. Pierre-Louis Curien. Computational self-assembly. Mariangiola Dezani. Session Types for Object-Oriented Languages. Abbas Edalat. Recursively measurable sets and computable measurable sets. Jean-Yves Girard. Truth, modality, intersubjectivity. Furio Honsell and Gordon Plotkin. On the beta-eta-completeness and expressiveness of some classes of combinatory algebras. Martin Hyland. Modelling the Impossible. Giuseppe Longo. From exact sciences to life phenomena: a few concluding remarks on Bohr and Schr?dinger Eugenio Moggi. Category Theory and Lambda Calculus. Mioara Mugur-Sch?chter. On the patient quest of Giuseppe Longo for a general unity and coherence. Thierry Paul. Semiclassical analysis and sensitivity to initial data. Jean Petitot. Neurogeometry and the origin of space. John Stewart: Is "life" computable? ----------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070513/7ba44acd/attachment.htm From Belaid.Benhamou at cmi.univ-mrs.fr Fri May 11 09:14:25 2007 From: Belaid.Benhamou at cmi.univ-mrs.fr (benhamou) Date: Fri, 11 May 2007 15:14:25 +0200 Subject: [TYPES/announce] First CFP of SymCon 2007 In-Reply-To: <45BA360F.1010204@cmi.univ-mrs.fr> References: <458EA81F.8070604@cmi.univ-mrs.fr> <45BA360F.1010204@cmi.univ-mrs.fr> Message-ID: <46446C31.5090500@cmi.univ-mrs.fr> We apologize for multiple copies of this Call. ================================================================ First Call for Papers SymCon'07 The Seventh International Workshop on Symmetry and Constraint Satisfaction Problems (http://www.cmi.univ-mrs.fr/~benhamou/symcon07/) To be held at the Thirteenth International Conference on Principles and Practice of Constraint Programming (CP 2007) Providence, RI, USA September 23rd 2007 ================================================================ WORKSHOP DESCRIPTION -------------------- SymCon'07 is the 7th in a series of workshops affiliated with the CP conference, and focuses on the investigation of symmetry and symmetry breaking techniques for Constraint Satisfaction Problems (CSPs). Symmetries occur frequently in CSPs. When undetected, they cause thrashing during traditional backtracking search by redundantly exploring symmetric parts of the search space. The topic was discussed as far back as 1874 by Glaisher, and new techniques to detect and/or break symmetry have been proposed in recent years. However, many outstanding problems remain. For instance, the detection and exploitation of local, dynamic, and weak forms of symmetry remains a challenge. The workshop is a forum for researchers to present advances in symmetry breaking techniques and to discuss the above or other open problems. Additionally, the workshop welcomes the presentation of applications and case studies that exhibit some form of symmetry. The workshop is relevant to the computational group theory (CGT) community because CGT is often the theory underlying many symmetry breaking techniques. Importantly, the organizers welcome submissions from researchers working in other areas of Artificial Intelligence who feel that their work would be of interest to the CP community. Such areas include planning, model checking, QBF formulas, finite model search, and theorem proving in FOL. Workshop topics include, but are not limited to: - Symmetry definition: semantic symmetry, syntactic symmetry, constraint symmetry, solution symmetry - Automatic symmetry detection: static approaches and dynamic approaches - Global symmetry detection and elimination - Dynamic symmetry detection and elimination - Combining symmetry breaking techniques - Exploiting weak forms of symmetries like "dominance" and "almost-symmetries" - Case studies of problems that exhibit interesting symmetries - Application of computational group theory techniques to symmetry breaking - Heuristics that use information about symmetry to guide search - Elimination and avoidance of symmetry by re-modelling - Dynamic avoidance of symmetric states during search - Complexity analysis of symmetry breaking techniques - Application of CSPs to symmetry and related algebraic problems - Comparing symmetry breaking techniques in constraint programming with techniques for dealing with symmetry in other search domains - Symmetry in CNF formulas and OBF formulas - Symmetry in finite model search in first order logic - Novel exploitation of symmetry in varied search domains of interest to the CP community ATTENDANCE ---------- The workshop is open to all members of the CP community. At least one author of each submission accepted for presentation must attend the workshop and present the contribution. All workshop attendees must pay the workshop fee. PAPER SUBMISSION ---------------- To submit a paper to the workshop, please e-mail a PS or PDF file in IJCAI03 style to symcon07 at cmi.univ-mrs.fr. Style files can be obtained at http://www.cmi.univ-mrs.fr/~benhamou/symcon07/ Papers can be of any length but should not exceed 8 pages. All submissions must be received by June 22nd, 2007. The Program Committee Chairs will acknowledge all submissions. If a submitted paper is not acknowledged in 2 working days, the authors are kindly requested to contact one of the chairs. SELECTION PROCESS ----------------- All submissions will be reviewed. Those that present a significant contribution to the workshop topics will be accepted for publication in the workshop proceedings. The proceedings will be available electronically at the workshop web-page and in hardcopy at CP 2007. If necessary, for time reasons, only a subset of the papers will be presented. A selection will then be made by the Program Committee Chairs. Post-publication of the proceedings is currently under negotiation. IMPORTANT DATES --------------- Submission deadline: Friday, 22nd June 2007 Notification of acceptance: Tuesday, 17th July 2007 Camera ready deadline: Friday, 3rd August 2007 Workshop: Monday, 23rd September 2007 PROGRAM COMMITTEE CHAIRS ------------------------ - Bela?d Benhamou Universit? de Provence (Aix-Marseille I) LSIS-CMI, 39 F. Joliot-Curie 13453 Marseille Cedex13 France. Email: Belaid.Benhamou at cmi.univ-mrs.fr - Berthe Y. Choueiry 256 Avery Hall Constraint Systems Laboratory CSE--University of Nebraska-Lincoln Lincoln, NE, 68588-0115, USA Email: choueiry at cse.unl.edu - Brahim Hnich Faculty of Computer Sciences Izmir University of Economics Sakarya Caddesi No:156, 35330 balcova Izmir, Turkey Email: brahim.hnich at ieu.edu.tr PROVISIONAL PROGRAM COMMITTEE ----------------------------- - Fadi A. Aloul, American University of Sharjah, U.S.A - Gilles Audemard, Universit? d'Artois, France. - Rolf Backofen, Albert-Ludwigs-University, Germany - Pierre Flener, Sabanci University, Turkey and Uppsala University, Sweden - Zeynep Kiziltan, University of Bologna, Italy - Igor Markov, University of Michigan, U.S.A. - Pedro Meseguer, Universitat Autonoma de Barcelona, Spain. - Michela Milano, University of Bologna, Italy - Justin Pearson, Uppsala University, Sweden - Karen Petrie, Oxford University, UK - Steve Prestwich, University College Cork, Ireland - Jean-Fran?ois Puget, ILOG, France - Lakhdar Sais, Universit? d'Artois, France. - Pierre Seigel, University of Provence, Aix-Marseille I, France - Meinolf Sellmann, Brown University, U.S.A. - Barbara Smith, Cork Constraint Computation Centre, Irland. - Pascal van Hentenryck, Brown University, U.S.A. - Toby Walsh, University of New South Wales, Australia From pmt6sbc at maths.leeds.ac.uk Tue May 15 14:59:58 2007 From: pmt6sbc at maths.leeds.ac.uk (S B Cooper) Date: Tue, 15 May 2007 19:59:58 +0100 (BST) Subject: [TYPES/announce] CiE 2007 - Final 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 FINAL 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. 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 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, where the world-famous Palio takes place. CiE 2007 takes place just 6 days before the start of the Palio on 29 June, 2007. 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/ ************************************************************ From einarj at ifi.uio.no Wed May 16 11:36:53 2007 From: einarj at ifi.uio.no (Einar Broch Johnsen) Date: Wed, 16 May 2007 17:36:53 +0200 Subject: [TYPES/announce] CfP: Nordic Workshop on Programming Theory (NWPT'07) Message-ID: CALL FOR PAPERS The 19th Nordic Workshop on Programming Theory (NWPT'07) Oslo, Norway, 10-12 October, 2007 http://www.ifi.uio.no/nwpt07 The NWPT series of annual workshops is a forum bringing together programming theorists from the Nordic and Baltic countries (but also elsewhere). The previous workshops were held in Uppsala (1989, 1999 and 2004), Aalborg (1990), Gothenburg (1991 and 1995), Bergen (1992 and 2000), Turku (1993, 1998, and 2003), Aarhus (1994), Oslo (1996), Tallinn (1997 and 2002), Lyngby (2001), Copenhagen (2005), and Reykjavik (2006). This year it will be held in Oslo. IMPORTANT DATES 3 September: Submission of abstracts 15 September: Notification of acceptance 25 October: Registration CLOSES 10-12 October: WORKSHOP SCOPE Typical topics of the workshop include (but are not limited to): * Semantics of programs * Programming logics * Program verification * Formal specification of programs * Program synthesis * Program transformation and program refinement * Real-Time and hybrid systems * Modeling of concurrency * Programming methods * Tools for program construction and verification INVITED SPEAKERS To be announced. SUBMISSIONS Authors wishing to give a talk at the workshop are requested to submit an abstract of 1-3 pages (ps or pdf, printable on A4 paper) to nwpt07(at)ifi.uio.no by the 3rd September 2007. Submission of work submitted for formal publication elsewhere and work in progress is permitted. The abstracts of the accepted contributions will be available at the workshop. After the workshop, selected papers will be published in a special issue of the Journal of Logic and Algebraic Programming (JLAP, Elsevier). PROGRAMME COMMITTEE * Luca Aceto, Reykjavík Univ., Iceland, and Aalborg Univ., Denmark * Michael R. Hansen, Techn. U. of Denmark, Denmark * Anna Ingolfsdottir, Reykjavík Univ., Iceland, and Aalborg Univ., Denmark * Einar Broch Johnsen, University of Oslo, Norway * Kim G. Larsen, Aalborg Univ., Denmark * Bengt Nordström, Univ. of Gothenburg, Chalmers Univ. of Tech., Sweden * Olaf Owe, University of Oslo, Norway * Gerardo Schneider, University of Oslo, Norway * Tarmo Uustalu, Inst. of Cybernetics, Estonia * Jüri Vain, Tallinn Technical University, Estonia * Marina Waldén, Åbo Akademi University, Finland * Uwe E. Wolter, University of Bergen, Norway * Wang Yi, Uppsala University, Sweden ORGANIZING COMMITTEE Einar Broch Johnsen, Olaf Owe, and Gerardo Schneider. EMAIL: nwpt07(at)ifi.uio.no More (and more current) information is available at http://nwpt07.ifi.uio.no A short history of the workshop is available at http://www.cc.ioc.ee/nwpt02/history.html From ddino at dcs.qmul.ac.uk Wed May 16 12:40:59 2007 From: ddino at dcs.qmul.ac.uk (Dino Distefano) Date: Wed, 16 May 2007 17:40:59 +0100 Subject: [TYPES/announce] AHA 2007: Call for Participation Message-ID: ==================================================== Call for Participation ==================================================== AHA 2007 International symposium on Automatic Heap Analysis July 2nd 2007 Berlin, Germany satellite event of CAV 2007 http://www.dcs.qmul.ac.uk/~ddino/aha.html =================================================== Aim and Scope =================================================== One of the frontiers of formal software verification is the analysis of dynamically allocated and recursive data structures. This symposium aims at bringing together leaders in the field of automatic heap analysis as well as researchers interested in the field. We have invited 10 speakers representing different communities (including predicate abstraction, 3-valued logic, separation logic, graph transformation systems, software model checking, etc.). ================================================ Talks ================================================ - Ahmed Bouajjanni (University of Paris 7, France) "Automata-based techniques for shape analysis" - Cristiano Calcagno (Imperial College, London, UK) "Can logic tame systems programs?" - Tom Henzinger (EPFL Lausanne, Switzerland) "Lazy Abstraction Refinement" - Shuvendu Lahiri (Microsoft Research, Redmond, USA) "HAVOC: Heap Aware Verification Of C programs" - Ken McMillan (Cadence Berkeley Labs) "Constructing quantified invariants using interpolants" - Amir Pnueli (New York University, USA) "Shape Analysis with Precise Abstraction" - Andreas Podelski (University of Freiburg, Germany) "Symbolic Shape Analysis" - Arend Rensink (University of Twente, The Netherlands) "Abstraction in Graph Transformation" - Radu Rugina (Cornell University, USA) "Shape Analysis with tracked cells" - Mooly Sagiv (Tel-Aviv University, Israel) "Partially Disjunctive Shape Analysis" ============================================== Organizers ============================================== Byron Cook, Microsoft Research Cambridge, UK Dino Distefano, Queen Mary University of London, UK -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070516/1728b80a/attachment.htm From ohearn at dcs.qmul.ac.uk Mon May 21 14:31:28 2007 From: ohearn at dcs.qmul.ac.uk (Peter O'Hearn) Date: Mon, 21 May 2007 19:31:28 +0100 Subject: [TYPES/announce] Reynolds Festschrift Message-ID: Readers of the types list might be interested in the Festschrift for John C Reynolds's 70th Birthday Special Issue of Theoretical Computer Science, Vol 375(1-3), 1 May 2007 It is available online at http://www.sciencedirect.com/science?_ob=PublicationURL&_tockey=% 23TOC%235674%232007%23996249998%23648814%23FLP% 23&_cdi=5674&_pubType=J&view=c&_auth=y&_acct=C000050221&_version=1&_urlV ersion=0&_userid=10&md5=8e76f2c9e41b22feb6d9e14a7c1448a6 Peter O'Hearn (for the Festschrift editors: Olivier Danvy, Peter O'Hearn and Phil Wadler) From gorla at di.uniroma1.it Mon May 21 07:50:52 2007 From: gorla at di.uniroma1.it (Daniele Gorla) Date: Mon, 21 May 2007 13:50:52 +0200 Subject: [TYPES/announce] SecCo'07: call for papers In-Reply-To: References: Message-ID: <4651879C.6030107@di.uniroma1.it> Apologies for multiple copies! 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 ohearn at dcs.qmul.ac.uk Tue May 22 06:40:28 2007 From: ohearn at dcs.qmul.ac.uk (Peter O'Hearn) Date: Tue, 22 May 2007 11:40:28 +0100 Subject: [TYPES/announce] Reynolds Festschrift In-Reply-To: References: Message-ID: <6CD06747-895B-4821-91A1-2FCAA31CDF59@dcs.qmul.ac.uk> It seems that the long url in the message below got messed up in transit. This shorted one should work. http://tinyurl.com/24narx Peter On 21 May 2007, at 19:31, Peter O'Hearn wrote: > [ The Types Forum (announcements only), > http://lists.seas.upenn.edu/mailman/listinfo/types-announce ] > > Readers of the types list might be interested in the > > Festschrift for John C Reynolds's 70th Birthday > Special Issue of Theoretical Computer Science, Vol 375(1-3), 1 > May 2007 > > It is available online at > http://www.sciencedirect.com/science?_ob=PublicationURL&_tockey=% > 23TOC%235674%232007%23996249998%23648814%23FLP% > 23&_cdi=5674&_pubType=J&view=c&_auth=y&_acct=C000050221&_version=1&_ur > lV > ersion=0&_userid=10&md5=8e76f2c9e41b22feb6d9e14a7c1448a6 > > > Peter O'Hearn > (for the Festschrift editors: Olivier Danvy, Peter O'Hearn and Phil > Wadler) > From ayala at unb.br Tue May 22 07:39:08 2007 From: ayala at unb.br (ayala@unb.br) Date: Tue, 22 May 2007 08:39:08 -0300 Subject: [TYPES/announce] Extended deadline - LSFA 2007 (CFP) In-Reply-To: <20070426180338.pqe28k5cb8ck0sc8@webmail.unb.br> References: <20070426180338.pqe28k5cb8ck0sc8@webmail.unb.br> Message-ID: <20070522083908.wrive1lxgoosgcog@webmail.unb.br> Extended Deadline Mai the 31st, 2007 http://www.mat.unb.br/lsfa2007 ===> Proceeding as a volume of Elsevier ENTCS confirmed <=== LSFA'07 - Second Workshop on Logical and Semantic Frameworks, with Applications August 28th, 2007, Ouro Preto, Minas Gerais, Brazil (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 TU Wien (Vienna) 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 31st **Extended** 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 31st, 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 and the proceedings will be published as a volume of ENTCS. 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/ ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program. From shao at cs.yale.edu Tue May 22 13:33:58 2007 From: shao at cs.yale.edu (Zhong Shao) Date: Tue, 22 May 2007 13:33:58 -0400 Subject: [TYPES/announce] Final CFP: APLAS 2007 (Deadline: June 15, 2007) Message-ID: <200705221733.l4MHXwwT022009@daffy.cs.yale.edu> [Recent updates: (1) Submission site is now open: (2) New info about invited speakers. (3) Deadline is just 3-week away. -Zhong] -------------------------------------------------------------------------- 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 prior to submission. INVITED SPEAKERS: Vincent Danos (University of Paris VII & CNRS, France) Sriram Rajamani (Microsoft Research, India) Vijay Saraswat (IBM TJ Watson Research Lab, USA) 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 web page at URL . 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 Antonio.Bucciarelli at pps.jussieu.fr Wed May 23 03:47:30 2007 From: Antonio.Bucciarelli at pps.jussieu.fr (Antonio Bucciarelli) Date: Wed, 23 May 2007 09:47:30 +0200 Subject: [TYPES/announce] RDP'07 call for participation Message-ID: <4653F192.5090507@pps.jussieu.fr> RDP 2007 - Call for Participation Federated Conference on Rewriting, Deduction, and Programming June 25 to 29, Paris, France http://www.rdp07.org ======================================================================== Online Registration is open until May, 31. ======================================================================== RDP'07 is the fourth edition of the International Conference on Rewriting, Deduction, and Programming, consisting of two main conferences: * Rewriting Techniques and Applications (RTA'07) * Typed Lambda Calculi and Applications (TLCA'07) a colloquium: * From Type Theory to Morphologic Complexity: a Colloquium in Honor of Giuseppe Longo as well as the following workshops: * Higher Order Rewriting (HOR) * Proof Assistants and Types in Education (PATE) * Rule-Based Programming (RULE) * Security and Rewriting Techniques (SecReT) * Unification (UNIF) * Functional and (Constraint) Logic Programmming (WFLP) * Reduction Strategies in Rewriting and Programming (WRS) * Termination (WST) Invited Speakers: ================= Joint RTA/TLCA: * Frank Pfenning (Carnegie Mellon University) TLCA: * Patrick Baillot (CNRS, University Paris 13) * Greg Morrisett (Harvard University) RTA: * Xavier Leroy (INRIA Rocquencourt) * Robert Nieuwenhuis (Technical University of Catalonia) Celebration of the 75th anniversary of the lambda calculus: * Henk Barendregt (Nijmegen University) Registration: ============= http://www.rdp07.org/registration.html From sacerdot at cs.unibo.it Wed May 23 05:35:02 2007 From: sacerdot at cs.unibo.it (Claudio Sacerdoti Coen) Date: Wed, 23 May 2007 11:35:02 +0200 Subject: [TYPES/announce] Types Summer School 07: Deadline for grants approaching Message-ID: <20070523093502.GT6946@cs.unibo.it> TYPES Summer School 2007 Proofs of Programs and Formalisation of Mathematics August 19-31 2007, Bertinoro, Italy http://TypesSummerSchool07.cs.unibo.it >>>>>>> DEADLINE FOR GRANTS: JUNE 4th <<<<<<<< During the last ten years major achievements have been made in using computers for interactive proof developments to produce secure software and to show interesting mathematical results. Recent major results are, for instance, the complete formalisation of a proof of the four colour theorem, and a formalisation of the prime number theorem. The summer school is a two weeks course for postgraduate students, researchers and industrials who want to learn about interactive proof development. The present school follows the format of previous TYPES summer school (in Baastad 1993, Giens 1999, Giens 2002 and Goteborg 2005). There will be introductory and advanced lectures on lambda calculus, type theory, logical frameworks, program extraction, proof carrying code, formal topology and models, with relevant theoretical background. Several talks will be devoted to applications. During the two weeks, participants will get extensive opportunities to use and compare most ot the current tools for the automation of formal reasoning, comprising Agda, Coq, Epigram, Matita, Mizar and Isabelle/ Isar. The school is organised by the TYPES working group "Types for Proofs and Programs", which is a project in the IST (Information Society Technologies) program of the European Union. Grants covering part of travel, fees and accommodation are available. Neither participation nor grants are restricted to TYPES participants. Grants ------ To apply for a grant you are required to send a recommendation letter and a CV or a similar short description of yourself. All information/documentation concerning grant applications must reach us by June 4. Both the recommendation letter and the CV should be sent to typessummerschool at cs.unibo.it. Please use the subject: "grant application". The recommendation letter must be sent to us directly by the person that writes it. We will confirm by email each CV and recommendation letter we receive. Important dates and figures --------------------------- * June 4: deadline for grant applications. * June 25: deadline for inscription With double room accomodation: 1100 Euros. With single room accomodation: 1300 Euros. The fee is all inclusive (accomodation, meals, school participation fees, and social activities). Confirmed Lecturers ------------------- Thorsten Altenkirch, Nottingham Andrea Asperti, Bologna Stefano Berardi, Torino Thierry Coquand, Chalmers Jean-Christophe Filli?tre, Paris Sud Herman Geuvers, Nijmegen Benjamin Gregoire, INRIA Sophia Tobias Nipkow, TU Munich Christine Paulin-Mohring, Paris Sud David Pichardie, IRISA Rennes Giovanni Sambin, Padova Andrzej Trybulec, Bialystok Markus Wenzel, TU Munich TENTATIVE PROGRAM ----------------- Introduction to Type Theory: Lambda-calculus Propositions-as-types Inductive sets and families of sets Predicative and non-predicative theories Model Theory Introduction to Systems: Agda Coq Epigram Isabelle/Isar Mizar Matita Why/Krakatoa Advanced topics: Program extraction Proving properties of Java programs Reasoning about Programming Languages Proof Carrying Code Dependently typed programming languages Formal Topology ORGANIZING COMMITTEE -------------------- Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi Any question concerning the school may be sent to typessummerschool at cs.unibo.it -- ---------------------------------------------------------------- Real name: Claudio Sacerdoti Coen Doctor in Computer Science, University of Bologna E-mail: sacerdot at cs.unibo.it http://www.cs.unibo.it/~sacerdot ---------------------------------------------------------------- From michael.norrish at nicta.com.au Thu May 24 01:39:29 2007 From: michael.norrish at nicta.com.au (Michael Norrish) Date: Thu, 24 May 2007 15:39:29 +1000 Subject: [TYPES/announce] Workshop on Mechanising Metatheory (WMM07): submission deadline approaches Message-ID: <46552511.5060905@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 Laurent.Vigneron at loria.fr Thu May 24 02:43:47 2007 From: Laurent.Vigneron at loria.fr (Laurent Vigneron) Date: Thu, 24 May 2007 08:43:47 +0200 Subject: [TYPES/announce] 2nd CFP: ISR 2007 Message-ID: <18005.13347.606269.341871@loria1.loria.fr> [ Apologies for multiple copies ] ********************************************************************** Second Call for Participation International School on Rewriting ISR'2007, July 2-6, 2007 Nancy, France http://isr2007.loria.fr/ ********************************************************************** Early registration deadline: May 31, 2007. ---------------------------------------------------------------------- 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! NEW: some grants are available; please see on the web site for more information. ---------------------------------------------------------------------- Lecturers ---------------------------------------------------------------------- Hassan Ait Kaci, ILOG Vancouver, Canada Franz Baader, Dresden University, Germany Dan Dougherty, Worcester Polytechnic Institute, USA 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, CWI and Free University Amsterdam, Netherlands Michael Rusinowitch, INRIA & LORIA, France Christian Urban, TU Munich, Germany ---------------------------------------------------------------------- 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: Rule based security, Rule based languages, Theorem proving, Program analysis and proofs - Advanced topics: Graph rewriting, Tree automaton, Deduction modulo, Normalisation proofs, Nominal techniques ---------------------------------------------------------------------- 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 rene.david at univ-savoie.fr Thu May 24 08:32:09 2007 From: rene.david at univ-savoie.fr (=?ISO-8859-1?Q?Ren=E9_David?=) Date: Thu, 24 May 2007 14:32:09 +0200 Subject: [TYPES/announce] post-doc position Message-ID: <465585C9.8090000@univ-savoie.fr> The University of Chambery proposes a post-doc position for the next academic year (from october 1-st 2007 to september 30-th 2008). The candidate must come from a foreign country. The salary is 1830 euros per month. The fields of research of our group is : - Logic : proof theory, type theory, proof assistants, lambda-calculus, ... - Discrete mathematics : combinatorics on words, cellular automata, discrete geometry, ... More details on our web page : www.lama.univ-savoie.fr The deadline for the formal application is June 25-th 2006. If you want to apply for this position and work with the Logic group in Chambery, please contact me as soon as possible. Ren? ********************************** Ren? DAVID Laboratoire de Maths Campus Scientifique F 73376 Le Bourget du Lac email david at univ-savoie.fr www.lama.univ-savoie.fr/~david from France tel 04 79 75 87 17 fax 04 79 75 81 42 from outside France tel (33) 4 79 75 87 17 fax (33) 4 79 75 81 42 From O.Chitil at kent.ac.uk Fri May 25 09:17:20 2007 From: O.Chitil at kent.ac.uk (Olaf Chitil) Date: Fri, 25 May 2007 14:17:20 +0100 Subject: [TYPES/announce] IFL 2007: Symposium on Implementation and Application of Functional Languages Message-ID: <4656E1E0.5080805@kent.ac.uk> ********************************************************************** Announcement and Call for Papers for the 19th International Symposium on Implementation and Application of Functional Languages IFL 2007 27th-29th September 2007, Freiburg, Germany co-located with ICFP 2007 http://proglang.informatik.uni-freiburg.de/IFL2007/ ********************************************************************** The aim of the IFL symposium is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. The symposium provides an open forum for researchers who wish to present and discuss new ideas and concepts, work in progress, preliminary results, etc. related primarily but not exclusively to the implementation and application of functional languages. Topics of interest include (but are not limited to): * language concepts * type checking * compilation techniques * (abstract) interpretation * generic programming techniques * automatic program generation * array processing * concurrent/parallel programming * concurrent/parallel program execution * heap management * runtime profiling * performance measurements * debugging and tracing * (abstract) machine architectures * verification * formal aspects * tools and programming techniques Papers on applications or tools demonstrating the suitability of novel ideas in any of the above areas and contributions on related theoretical work are also welcome. The change of the symposium name adding the term "application", introduced in 2004, reflects the broader scope IFL has gained over the years. Contributions Prospective authors are encouraged to submit papers to be published in the draft proceedings and present them at the symposium. All contributions must be written in English, conform to the Springer-Verlag LNCS series format and not exceed 16 pages. The draft proceedings will appear as a technical report. Every attendee of IFL 2007 will have the opportunity to submit a revised version of their paper for post-symposium reviewing. As in previous years, selected papers will be published by Springer Verlag in the Lecture Notes in Computer Science (LNCS) Series. Important Dates Submission for Draft Proceedings 31 August 2007 Early Registration Deadline 1 September 2007 Symposium 27-29 September 2007 Submission for post-refereeing 2 November 2007 Notification of acceptance / rejection 14 December 2007 Submission of camera-ready version 25 January 2008 Programme Committee Peter Achten Radboud University Nijmegen, The Netherlands Kenichi Asai Ochanomizu University, Japan Manuel Chakravarty The University of New South Wales, Australia Olaf Chitil (chair) University of Kent, UK Martin Erwig Oregon State University, Oregon, USA Marc Feeley Universit? de Montr?al, Canada Martin Gasbichler Z?hlke Engineering AG, Switzerland Kevin Hammond University of St. Andrews, Scotland Zolt?n Horv?th E?tv?s Lor?nd University, Budapest, Hungary John Hughes Chalmers University of Technology, Sweden Ken Friis Larsen University of Copenhagen, Denmark Rita Loogen Philipps-Universit?t Marburg, Germany Michel Mauny ENSTA, France Sven-Bodo Scholz University of Hertfordshire, UK Clara Segura Universidad Complutense de Madrid, Spain Tim Sheard Portland State University, Oregon, USA Glenn Strong Trinity College, Dublin, Ireland Doaitse Swierstra Utrecht University, The Netherlands Malcolm Wallace The University of York, UK Local Organisation Markus Degen Universit?t Freiburg, Germany Peter Thiemann Universit?t Freiburg, Germany Stefan Wehr Universit?t Freiburg, Germany Further Information http://proglang.informatik.uni-freiburg.de/IFL2007/ From Gilles.Barthe at sophia.inria.fr Fri May 25 10:47:56 2007 From: Gilles.Barthe at sophia.inria.fr (Gilles Barthe) Date: Fri, 25 May 2007 16:47:56 +0200 Subject: [TYPES/announce] Call For Papers TGC'07 Message-ID: <4656F71C.4030205@sophia.inria.fr> [Apologies for multiple copies] =========================================================== Call For Papers Trustworthy Global Computing 2007 November 5-6, 2007, Sophia-Antipolis, France http://www-sop.inria.fr/everest/tgc/tgc07 ========================================================== Scope The Symposium on Trustworthy Global Computing is an international annual venue dedicated to safe and reliable computation in global computers. It focuses on providing tools and frameworks for constructing well-behaved applications and for reasoning about their behaviour and properties in models of computation that incorporate code and data mobility over distributed networks with highly dynamic topologies and heterogeneous devices. We solicit paper in all areas of global computing, including (but not limited to): * theories, models and algorithms for global computing and service oriented computing * language concepts and abstraction mechanisms * security through verifiable evidence * information flow and resource usage policies * verification of cryptographic protocols and their use * trust, access control and security enforcement mechanisms * self configuration, adaptation, and dynamic components management * software principles to support debugging and verification * test generators, symbolic interpreters, type checkers * model checkers, theorem provers * privacy, reliability and business integrity Invited Speakers * Andrew D. Gordon (Microsoft Research) * Martin Hofmann (Ludwig-Maximilians-Universit?t M?nchen) Important Dates * Abstract submissions: July 27, 2007 * Paper submissions: August 3, 2007 * Notification to authors: September 17, 2007 * Final version for pre-proceedings: October 5, 2007 * Conference: November 5-6, 2007 * Version for post-proceedings: December 7, 2007 Submission Details Contributions must be in Postscript or PDF and consist of no more than 15 pages in the Springer LNCS style. Additional details and proofs omitted due to space limitations may be included in a clearly marked appendix. Submitted papers must describe work unpublished in refereed venues, and not submitted for publication elsewhere. Proceedings and Special Issue It is planned to publish post proceedings, shortly after the conference, to give the authors the opportunity to take into account discussions and suggestions at the conference. Pre-proceedings with the accepted papers will be made available at the conference. The authors of the best papers might be invited to submit an extended revision for inclusion in a special issue of a journal. Program Chairs * Gilles Barthe (INRIA) * C?dric Fournet (Microsoft Research) Program Committee * Gilles Barthe (INRIA) * Roberto Bruni (University of Pisa) * Luis Caires (Universidade Nova de Lisboa) * Bruno Crispo (Vrije Universiteit Amsterdam) * Silvano Dal Zilio (CNRS) * Rocco De Nicola (University of Pisa) * C?dric Fournet (Microsoft Research) * Manuel Hermenegildo (T.U. of Madrid - UPM) * Alan Jeffrey (Bell Labs - Alcatel Lucent) * Christos Kaklamanis (University of Patras) * Cosimo Laneve (University of Bologna) * Uwe Nestmann (TU Berlin) * Dave Sands (Chalmers University of Technology of G?teborg) * Vladimiro Sassone (University of Southampton) * Ian Stark (University of Edinburgh) * Alan Schmitt (INRIA) * Paul G. Spirakis (University of Patras and RACTI) * ?ric Tanter (Universidad de Chile) * Nobuko Yoshida (Imperial College London) From matthes at informatik.uni-muenchen.de Fri May 25 11:56:25 2007 From: matthes at informatik.uni-muenchen.de (Ralph Matthes) Date: Fri, 25 May 2007 17:56:25 +0200 Subject: [TYPES/announce] HOR 2007 Call for Participation (Higher-Order Rewriting 2007) Message-ID: <46570729.6060400@informatik.uni-muenchen.de> *************************************** * * * HOR 2007 CALL FOR PARTICIPATION * * * *************************************** 4th International Workshop on Higher-Order Rewriting Monday June 25, 2007, Paris, France http://www.rdp07.org/hor.html 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 is also a "small TYPES workshop" on Type theory, proof theory and rewriting (TPR '07), 4 days later in Paris. 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. INVITED TALKS: * Carsten Sch?rmann (IT University of Copenhagen, Denmark) On the formalization of logical relation arguments in Twelf * Tarmo Uustalu (Institute of Cybernetics, Tallinn University of Technology, Estonia) Circular proofs = Mendler in sequent form TALKS: * Andreas Abel Syntactical strong normalization for intersection types with term rewriting rules * Lisa Allali Algorithmic equality in Heyting arithmetic modulo * Takahito Aoto and Toshiyuki Yamada Argument filterings and usable rules for simply typed dependency pairs * Lionel Marie-Magdeleine and Serguei Soloviev Non-standard reductions in simply-typed, higher order and dependently-typed systems * Kristoffer Rose CRSX - an open source platform for experiments with higher-order rewriting * Max Sch?fer Elements of a categorical semantics for the Open Calculus of Constructions * Daniel Ventura, Mauricio Ayala-Rincon and Fairouz Kamareddine Principal typings for explicit substitutions calculi SYSTEM DEMO: * Kristoffer Rose Demonstration of CRSX Short abstracts can also be found through the URL http://www.irit.fr/~Ralph.Matthes/HOR/ REGISTRATION: This has to be done before *May 31* through the facilities on the RDP web site http://www.rdp07.org/ PROCEEDINGS: The accepted contributed extended abstracts of HOR 2007 are distributed to the participants and will be made available via the HOR web page. 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.) 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 jbw at macs.hw.ac.uk Sat May 26 14:18:49 2007 From: jbw at macs.hw.ac.uk (Joe Wells) Date: Sat, 26 May 2007 19:18:49 +0100 Subject: [TYPES/announce] PhD Studentships: Logics, Types, & Rewriting for Software & Mathematics @ Heriot-Watt, Scotland, UK Message-ID: <86lkfba1o6.fsf@macs.hw.ac.uk> Ph.D. Student Positions 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 posting can be found at: http://www.macs.hw.ac.uk/~jbw/phd-student-ad.html Description of the Positions Ph.D. student positions are available in areas involving research into the theories of logics, types, and rewriting and their applications in reasoning about computer systems and mathematics. The positions are in the ULTRA (Useful Logics, Types, Rewriting, and their Automation) group[1] in the Computer Science Department[2] in the School of Mathematical and Computer Sciences[3] at Heriot-Watt University[4] in Edinburgh[5], the capital of Scotland[6]. The Ph.D. supervisors will be either Fairouz Kamareddine[7] and/or Joe Wells[8]. Available research topics include work on any of the following: * The Poly*[9] polymorphic retargetable type system for process and mobility calculi, aimed at the goal of supporting modular reasoning and compositional analysis for systems involving mobility and concurrency (such systems can include combinations of hardware, software, human organizations, biological components, etc.). Possible Poly* work includes: + Applying Poly* to the analysis of existing systems expressed in various existing process calculi. This can include not just work on computer systems, but also work on business or biological processes. + Improving the implementation of algorithms related to Poly*. This includes better use of graph visualization tools for presenting Poly* types and more compositional and/or more efficient analysis algorithms. + Improving the theoretical strength of Poly* to encompass the power of more existing calculi, such as the single-threadedness of Safe Ambients, the different style of polymorphism of the polymorphic pi-calculus, the structured messages of the spi-calculus, the non-local reduction rules of bigraphs, the substitution of entire processes of the higher-order pi-calculus, etc. + And lots of other things! * The MathLang[10] framework for computerizing mathematical text. MathLang tries to keep the computerization as close as possible to the mathematician's text while at the same time providing a formal structure supporting mathematical software systems (e.g., computer algebra systems, theorem provers, etc.). Possible MathLang work includes: + Extending the MathLang framework to better handle more aspects of mathematical text. This includes ways to connect mathematical text with its meaning, typesetting issues, document structure issues, informal and formal handling of argumentation and proof, etc. + Improving existing MathLang implementations. This includes improving integration of MathLang support into the TeXmacs scientific WYSIWYG editor and better interfaces to other tools (including proof assistants (e.g., Coq, Mizar, Isabelle, OMEGA, etc.) and computer algebra systems). + Exercising and evaluating the MathLang framework through building libraries of computerized mathematical texts. + And lots of other things! * The idea of Expansion[11] as a fundamental organizing principle for obtaining flexible and compositional polymorphic type inference for computer software. Possible work on expansion includes: + Expanding the scope of the expansion theory. This includes extending it to handle "for all" (?) quantifiers like those of System F, extending it to handle information flow for security analysis, and getting a better understanding of the semantics of the linearity control already incorporated in expansion theory. + Further improvement of the core theory, such as the expansion algebra, unification algorithms, type inference algorithms, and methods for proving subject reduction. + Various implementation work using expansion. This includes type inference algorithms, better type error explanation methods, better data structures for representing analysis results, etc. + And lots of other things! * The use of Type Error Slicing[12] as a superior user interface for explaining type errors to users of new programming languages with advanced (and complicated!) type systems. * Any other reasonable idea which builds on work we have already started, including both theory and implementation. In general, we are interested in the design and implementation of useful and elegant type systems and logics which can reason about or extend existing programming languages and theorem provers. It will be helpful to have interests (or possibly even competence) in 1 or more of the following background knowledge areas: * Formal calculi for reasoning about the meaning of systems (including computer programs) such as the lambda calculus, the pi calculus, and the numerous other calculi they have inspired that deal with aspects of concurrency, mobility, modules, components, linking & loading, resource usage, staged compilation, classes & objects, etc. * Methods for analyzing specific systems (e.g., specific computer programs) represented by individual terms of such formal calculi. * Formal calculi for representing mathematical texts, including those aspects related to how actual practicing mathematicians (i.e., not mathematical logicians) construct and present mathematics. * Type systems for the kinds of formal calculi mentioned above, especially those with features similar to intersection, union, dependent, and singleton types. * Rewriting theories, especially those with higher-order features, such as the lambda calculus, higher-order rewriting (HOR), systems with explicit substitutions, higher-order abstract syntax (HOAS), combinators, etc. * Constraint solving and unification. * Theorem provers and mathematical reasoning tools. * Programming languages especially suitable for use for any of the above. The expected duration of Ph.D. studentships in the UK is 3 years. The positions will be expected to start around 2007-10-01; alternative start dates can be discussed. Currently, funding is only available for EU citizens. Non-EU-citizens are welcome to apply; they will either need their own funding or alternative funding will need to be found. The Ph.D. students will probably collaborate on 1 or more of the following activities. The specific activities will be matched to their strengths. * Designing languages/calculi for representing various aspects of such things as computer programs, concurrent systems, mathematical texts, etc. * Developing theories for reasoning about such a calculus as a whole as well as individual terms written in the calculus. * Developing new type systems for such calculi with useful properties. * Developing analysis algorithms for the new type systems. * Proving various properties of the above items. * Making software systems incorporating the new calculi, theories, type systems, and algorithms. * Publishing scientific reports on the work done. References 1. http://www.macs.hw.ac.uk/ultra/ 2. http://www.macs.hw.ac.uk/cs/ 3. http://www.macs.hw.ac.uk/ 4. http://www.hw.ac.uk/ 5. http://www.geo.ed.ac.uk/home/tour/edintour.html 6. http://www.geo.ed.ac.uk/home/scotland/scotland.html 7. http://www.macs.hw.ac.uk/~fairouz/ 8. http://www.macs.hw.ac.uk/~jbw/ 9. http://www.macs.hw.ac.uk/DART/software/PolyStar/ 10. http://www.macs.hw.ac.uk/~fairouz/talks/talks2005/mathlang-general-talk.pdf 11. http://www.macs.hw.ac.uk/~jbw/papers/#Car+Wel:ITRS-2004 12. http://www.macs.hw.ac.uk/ultra/compositional-analysis/type-error-slicing/ Contact Information Inquiries can be directed to Fairouz Kamareddine at: Web: http://www.macs.hw.ac.uk/~fairouz/ E-mail: fairouz at macs.hw.ac.uk Fax: +44 131 451 8179 Inquiries can 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 8179 Applying for the Positions Please contact Fairouz Kamareddine and Joe Wells for full details on how to apply. We will want to see your curriculum vitae, as well as 2 (or even 3 if possible) recommendation letters (preferably written by people familiar with your academic and research abilities, but a letter from an industry source is better than no letter at all). We will expect recommendation letters to be sent directly by their authors and will need contact details for the letter authors. You should probably already have a master's degree or equivalent experience. It can be helpful to write a brief statement about why your research interests are a good match for the ULTRA group. If you already have research publications (this is not required), it can be helpful to send 1 (or even 2) of them. There will also be official Heriot-Watt application forms to fill out. For documents sent by e-mail, please use a public and standard format. The best formats are plain text and PDF. LaTeX is okay if using only standard packages. HTML is okay (if not generated by Microsoft Word). PostScript is ill-advised. Open Document format is undesirable. Microsoft Word format is forbidden except where returning a form we have supplied in that format. For your information, it is helpful if the writers of recommendation 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 record including details of the candidate's role(s) 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 choosing the right candidate. From royer at ecs.syr.edu Mon May 28 13:08:17 2007 From: royer at ecs.syr.edu (James S. Royer) Date: Mon, 28 May 2007 13:08:17 -0400 Subject: [TYPES/announce] Program for LCC'07 (early registration deadline May 31) Message-ID: <7E3A4F82-71D0-40AE-B0A0-76901C0D0B7B@ecs.syr.edu> The following is a program for LCC'07 (the 2007 Workshop on Logic and Computational Complexity) which will be a satellite workshop of the Logic in Computer Science Conference (LICS 2007). The deadline for early registration for LCC'07 and LICS 2007 is **Thursday, May 31**. See http://july2007.ii.uni.wroc.pl/registration.html for on-line registration. LCC'07 PROGRAM SESSION 1 9.00-10.00 INVITED TALK: Algorithmic meta-theorems Martin Grohe (Humboldt University of Berlin) SESSION 2 10.30-11.30 INVITED TALK: An algebraic approach to the constraint satisfaction problem Matt Valeriote (McMaster University) 11.30-12.00 Meta-finite model expansion Evgenia Ternovska, David Mitchell, and Brendan Guild (Simon Fraser Unversity) 12.00-12.30 On canonical forms of concrete problems via first-order projections Blai Bonet and Nerio Borges (Simon Bolivar University) SESSION 3 14.00-15.00 INVITED TALK: Expressive power of tree logics Mikolaj Bojanczyk (University of Warsaw) 15.00-15.30 Order-invariant MSO is stronger than counting MSO Tobias Ganzow (RWTH Aachen University) and Sasha Rubin (University of Auckland) SESSION 4 16.00-17.00 INVITED TALK: Resolution proof systems and clause learning SAT algorithms Jan Johannsen (Ludwig Maximilians University Munich) 17.00-17.30 Resource control of object-oriented programs Jean-Yves Marion and Romain Pechoux (LORIA/Nancy) 17.30-18.00 Improvements on and optimality of a recent method of certifying polynomial running time and linear/polynomial space Karl-Heinz Niggl and Jan Mehler (Technical University of Ilmenau) ------------------------------------------------------------------------ ---- The LCC'07 Homepage: http://www.cis.syr.edu/~royer/lcc/LCC07/ The joint conference site for ICALP, LICS, LC, PPDP 2007: http://july2007.ii.uni.wroc.pl/ From gorla at di.uniroma1.it Tue May 29 07:21:58 2007 From: gorla at di.uniroma1.it (Daniele Gorla) Date: Tue, 29 May 2007 13:21:58 +0200 Subject: [TYPES/announce] SecCo'07: final call for papers In-Reply-To: References: Message-ID: <465C0CD6.8090503@di.uniroma1.it> Apologies for multiple copies! =========== 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 dreyer at tti-c.org Tue May 29 09:48:38 2007 From: dreyer at tti-c.org (Derek Dreyer) Date: Tue, 29 May 2007 09:48:38 -0400 Subject: [TYPES/announce] Final CFP: The 2007 ACM SIGPLAN Workshop on ML Message-ID: <7fa251b70705290648o79d20b29n1aac7cb94d2df3b7@mail.gmail.com> Below is the Final Call for Papers for the 2007 Workshop on ML. It's only a few weeks until the submission deadline (June 15), so whether you are a designer, developer or user of ML, please consider contributing a paper! 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 below for more details. If you are interested in submitting a paper, but you are not sure about what category it belongs in or if it would be appropriate for the workshop, please contact me or Claudio Russo, the Workshop Organizer. Derek Dreyer (Program Chair) ------------------------------------------------------------------- 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/ Submission web site (now open): https://www.softconf.com/starts/ml07/submit.html FINAL 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: http://www.acm.org/sigs/sigplan/authorInformation.htm 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. Submissions are now being accepted electronically via START: https://www.softconf.com/starts/ml07/submit.html IMPORTANT DATES: Submission deadline: Friday, June 15, 2007 Notification of acceptance: Friday, July 13, 2007 Final revision due: Friday, August 3, 2007 Workshop: Friday, October 5, 2007 WORKSHOP ORGANIZER: * Claudio Russo (Microsoft Research, Cambridge) crusso_AT_microsoft.com PROGRAM CHAIR: * Derek Dreyer (Toyota Technological Institute at Chicago) dreyer_AT_tti-c.org 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 blanqui at loria.fr Thu May 31 06:26:17 2007 From: blanqui at loria.fr (Frederic Blanqui) Date: Thu, 31 May 2007 12:26:17 +0200 (CEST) Subject: [TYPES/announce] TPR'07 Call for participation Message-ID: TPR'07 Call for participation 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. Talks will be given by Jim Lipton, Olivier Hermant, Michele Pagani and Lorenzo Tortora de Falco, Makoto Hamana, Mitsu Okada, Fr?d?ric Blanqui, Jean-Pierre Jouannaud and Albert Rubio, Thorsten Altenkirch and James Chapman, Nicolas Oury, Bruno Barras and Bruno Bernardo, and Ross Duncan. The program is online at: http://www.lix.polytechnique.fr/~dowek/tpr.html No registration is required. This workshop is a small TYPES meeting. It will be hosted by the laboratory Preuves, Programmes et Syst?mes, 175 rue du Chevalleret, 75013 Paris, France, Room 0C2. Hope to see you there. Regards. Gilles Dowek, Fr?d?ric Blanqui, Jim Lipton, Sara Negri, Mitsu Okada From gorla at di.uniroma1.it Fri Jun 1 04:32:22 2007 From: gorla at di.uniroma1.it (Daniele Gorla) Date: Fri, 01 Jun 2007 10:32:22 +0200 Subject: [TYPES/announce] SecCo'07: deadline extended! In-Reply-To: References: Message-ID: <465FD996.90309@di.uniroma1.it> Apologies for multiple copies! ---------------------------------------- | | | 5th International Workshop on | | Security Issues in Concurrency | | | | (SecCo'07) | | | ---------------------------------------- | | | September 3rd, 2007, Lisboa (Portugal) | | Affiliated to CONCUR 2007 | | | ---------------------------------------- New submission deadlines: Submission of abstracts: June 4th, 2007 Submission of papers: June 7th, 2007 For more details, see the web-page: http://www.dsi.uniroma1.it/~gorla/SecCo07/ From madhu at cs.uiuc.edu Sat Jun 2 18:07:59 2007 From: madhu at cs.uiuc.edu (Madhusudan Parthasarathy) Date: Sat, 2 Jun 2007 17:07:59 -0500 Subject: [TYPES/announce] Call for Papers: INFINITY 2007 References: <9405872F1401D14787BAD91FFC7C7A4017E5AC05@DSBEXCLUSTER.ad.uiuc.edu> Message-ID: <981BF34319C5B946AFE5BF6A4DDC7DFD01413D74@DSBEXCLUSTER.ad.uiuc.edu> --------------------------------------------------------------- TYPES mailing list recipients may be interested as types are often used in the verification of programs. --------------------------------------------------------------- CALL FOR PAPERS: INFINITY 2007 9th International Workshop on Verification of Infinite-State Systems (A Satellite Workshop of CONCUR 2007) http://www.cs.uiuc.edu/infinity07 September 8, Lisboa, Portugal Aim: The aim is to provide a forum for researchers interested in the development of mathematical techniques for the analysis and verification of systems with infinitely many states. Topics of interest include (but are not limited to): techniques for modeling, testing, analyzing, and debugging infinite-state systems; model-checking infinite-state systems; parameterized systems; probabilistic and timed systems; calculi for mobility and security; finite-state abstractions of infinite-state systems; logics on infinite graphs; analysis of heap structures; automata theory for infinite state reasoning (pushdown systems, Petri nets, unfoldings, etc.), data structures for infinite state spaces, model checking concurrent systems, verifying infinite state systems using learning, automated theorem proving paradigms, combinations of decision procedures, testing infinite-state systems. Paper Submission: Authors are invited to submit an extended abstract presenting recent (or ongoing) work in the areas relevant for the scope of INFINITY. Contributions should not exceed 10 pages and the ENTCS format of the submission is highly recommended. The submissions will be evaluated by the program committee and accepted papers will be published in the workshop proceedings. By submitting you agree that at least one co-author will register and present the paper at the workshop, if the paper is accepted. Papers should be submitted electronically (in pdf/ps format), by email to the conference chair (madhu at cs.uiuc.edu) on or before June 11, 2007. Please include a title, an abstract, all author names, and the the contact of a single corresponding author (address, email, phone number) into the email in plain text. You should receive a confirmation of your submission within four days. Proceedings: Pre-proceedings of INFINITY 2007 will be available at the workshop, Selected papers may be invited to submit a more detailed paper in a volume of Electronic Notes in Theoretical Computer Science series dedicated to workshops affiliated to CONCUR'07. Registration: The INFINITY 2007 workshop is a satellite workshop of the 18th International Conference on Concurrency Theory (CONCUR 2007) (see http://concur07.di.fc.ul.pt/). The workshop will be held at the same location as CONCUR 2007, on the day immediately after the conference (September 8). Registration will be handled by the CONCUR 2007 organizing committee. Program Committee: Thomas Colcombet, France Javier Esparza, Germany Christof Loding, Germany Vineet Kahlon, USA Narayan Kumar, India P. Madhusudan (chair), USA Jiri Srba, Denmark. From areces at loria.fr Fri Jun 1 10:45:40 2007 From: areces at loria.fr (Carlos Areces) Date: Fri, 01 Jun 2007 16:45:40 +0200 Subject: [TYPES/announce] ESSLLI 2008: Call for Course and Workshop Proposals Message-ID: <46603114.1010801@loria.fr> %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 20th European Summer School in Logic, Language and Information ESSLLI 2008 Monday, 4 August - Friday, 15 August 2008 Hamburg, Germany %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% CALL FOR COURSE and WORKSHOP PROPOSALS -------------------------------------- The European Summer School in Logic, Language and Information (ESSLLI) is organized every year by the Association for Logic, Language and Information (FoLLI, http://www.folli.org) in different sites around Europe. The main focus of ESSLLI is on the interface between linguistics, logic and computation. ESSLLI offers foundational, introductory and advanced courses, as well as workshops, covering a wide variety of topics within the three areas of interest: Language and Computation, Language and Logic, and Logic and Computation. Previous summer schools have been highly successful, attracting up to 500 students from Europe and elsewhere. The school has developed into an important meeting place and forum for discussion for students and researchers interested in the interdisciplinary study of Logic, Language and Information. The ESSLLI 2008 Program Committee invites proposals for foundational, introductory, and advanced courses, and for workshops for the 20th annual Summer School on a wide range of timely topics that have demonstrated their relevance in the following fields: - Logic and Language - Logic and Computation - Language and Computation PROPOSAL SUBMISSION: Proposals should be submitted through a web form available at http://www.folli.org/submission.php All proposals should be submitted no later than ******* Monday July 2, 2007. ******* Authors of proposals will be notified of the committee's decision no later than Monday September 10, 2007. Proposers should follow the guidelines below while preparing their submissions; proposals that deviate can not be considered. GUIDELINES FOR SUBMISSION: Anyone interested in lecturing or organizing a workshop during ESSLLI-2006, please read the following information carefully. ALL COURSES: Courses are taught by 1 or max. 2 lecturers. They consists of five sessions (a one-week course), each session lasting 90 minutes. Lecturers who want to offer a long, two-week course should submit two independent one-week courses (for example an introductory course in the first week of ESSLLI, and a more advanced course during the second). The ESSLLI program committee has the right to select only one of the two proposed courses. Timetable for Course Proposal Submissions: July 2, 2007: Proposal Submission Deadline Sep 10, 2007: Notification June 2, 2008: Deadline for receipt of camera-ready course material (by ESSLLI Local Organizers) FOUNDATIONAL COURSES: These are strictly elementary courses not assuming any background knowledge. They are intended for people to get acquainted with the problems and techniques of areas new to them. Ideally, they should allow researchers from other fields to acquire the key competences of neighboring disciplines, thus encouraging the development of a truly interdisciplinary research community. Foundational courses may presuppose some experience with scientific methods in general, so as to be able to concentrate on the issues that are germane to the area of the course. INTRODUCTORY COURSES: Introductory courses are central to the activities of the Summer School. They are intended to equip students and young researchers with a good understanding of a field's basic methods and techniques. Introductory courses in, for instance, Language and Computation, can build on some knowledge of the component fields; e.g., an introductory course in computational linguistics should address an audience which is familiar with the basics of linguistics and computation. Proposals for introductory courses should indicate the level of the course as compared to standard texts in the area (if available). ADVANCED COURSES: Advanced courses should be pitched at an audience of advanced Masters or PhD students. Proposals for advanced courses should specify the prerequisites in detail. WORKSHOPS: The aim of the workshops is to provide a forum for advanced Ph.D. students and other researchers to present and discuss their work. Workshops should have a well defined theme, and workshop organizers should be specialists in the theme of the workshop. It is a strict requirement that organizers give a general introduction to the them during the first session of the workshop. They are also responsible for the organization and program of the workshop including inviting the submission of papers, reviewing, expenses of invited speakers, etc. In particular, each workshop organizer will be responsible for producing a Call for Papers for the workshop by November 11, 2007. The call must make it clear that the workshop is open to all members of the LLI community. It should also note that all workshop contributors must register for the Summer School. Timetable for Workshop Proposal Submissions: July 2, 2007: Proposal Submission Deadline Sep 10, 2007: Notification Nov 11, 2007: Deadline for receipt of Call for Papers (by ESSLLI PC chair) Nov 18, 2007: Workshop organizers send out (First) Call for Papers Mar 17, 2008: Deadline for Papers (suggested) Apr 28, 2008: Notification of Workshop Contributors (suggested) June 2, 2008: Deadline for receipt of camera-ready copy of Workshop Proceedings (by ESSLLI Local Organizers) Notice that workshop speakers will be required to register for the Summer School; however, they will be able to register at a reduced rate to be determined by the Local Organizers. FORMAT FOR PROPOSALS: The web-based form for submitting course and workshop proposals is accessible at http://www.folli.org/submission.php. You will be required to submit the following information: * Name (name(s) of proposed lecturer(s)/organizer) * Address (contact addresses of proposed lecturer(s)/organizer; where possible, please include phone and fax numbers) * Title (title of proposed course/workshop) * Type (is this a workshop, a foundational course, an introductory course, or an advanced course?) * Section (does your proposal fit in Language & Computation, Language & Logic or Logic & Computation? name only one) * Description (in at most 150 words, describe the proposed contents and substantiate timeliness and relevance to ESSLLI) * External funding (will you be able to find external funding to help fund your travel and accommodation expenses? if so, how?) * Further particulars (any further information that is required by the above guidelines should be included here; in particular, indicate here your teaching experience in an interdisciplinary field as the one addressed by ESSLLI.) FINANCIAL ASPECTS: Prospective lecturers and workshop organizers should be aware that all teaching and organizing at the summer schools is done on a voluntary basis in order to keep the participants fees as low as possible. Lecturers and organizers are not paid for their contribution, but are reimbursed for travel and accommodation (up to a fixed, maximum amount that will be notified to lecturers when courses are accepted). It should be stressed that while proposals from all over the world are welcomed, the Summer School cannot guarantee full reimbursement of travel costs, specially from destinations outside Europe. Please note the following: In case a course is to be taught by two lecturers, a lump sum is reimbursed to cover travel and accommodation expenses for one lecturer. The splitting of the sum is up to the lecturers. The local organizers highly appreciate it if, whenever possible, lecturers and workshop organizers find alternative funding to cover travel and accommodation expenses, and such issues might be taken into account when selecting courses. PROGRAM COMMITTEE: Chair: Rineke Verbrugge Institute of Artificial Intelligence University of Groningen Grote Kruisstraat 2/1 9712 TS Groningen The Netherlands phone +31 (0)50 571 81 41 e-mail : rineke (at) ai.rug.nl www : http://www.ai.rug.nl/~rineke Local co-chair: Benedikt L?we Area Specialists: Petra Hendriks and Philippe Schlenker (Logic and Language) Michael Kaminski and Enrico Franconi (Logic and Computation) Khalil Sima'an and Massimo Poesio (Language and Computation) ORGANIZING COMMITTEE: Walter von Hahn and Cristina Vertan FURTHER INFORMATION: The website for ESSLLI 2008 will become operational in the second half of 2007. For this year's summer school, please see the web site at http://www.cs.tcd.ie/esslli2007/ . With best regards, Rineke Verbrugge From bcpierce at cis.upenn.edu Sun Jun 3 23:36:51 2007 From: bcpierce at cis.upenn.edu (Benjamin Pierce) Date: Sun, 3 Jun 2007 23:36:51 -0400 Subject: [TYPES/announce] Call for Papers -- ASIAN'07 Message-ID: CALL FOR PAPERS ASIAN'07 12th Annual Asian Computing Science Conference Focusing on Computer and Network Security December 9-11, 2007 Carnegie Mellon University Doha, Qatar http://www.qatar.cmu.edu/asian07 The ASIAN conference series provides a forum for researchers throughout Asia to present cutting-edge results in yearly-themed areas of Computer Science, to discuss advances in these fields, and to interact with researchers from other continents. The 2007 edition focuses on computer and network security. Networked computer systems stand at the core of today's information society: by providing fast access to huge quantities of information, they enable higher productivity at a much higher convenience than ever in the past. They also provide a substantial opportunity for abuse. The closely related areas of Network and Computer Security are concerned with mitigating this risk and preventing disruption, fraud, disclosure, etc. The former tends to concentrate on the infrastructure, while the latter deals with everything else. In recent years, they have made enormous progress both in our theoretical understanding of what security is and in the development of practical protection mechanisms. Yet, they are engaged in a continuing arms race with an underground army of ever more sophisticated attackers intent to bypass whatever shield protects a system. This makes network and computer security one of the most active fields in today's scientific landscape. New results in the fields of computer and network security are welcome. Also welcome are more exploratory presentations, which may examine open questions and raise fundamental concerns about existing theories and practices. Topics of interest include, but are not limited to: * Access control * Data and system integrity * Database security * Distributed systems security * Privacy and Anonymity * Security for mobile computing * Cryptographic protocols * Wireless network security * Trust and trust management * Denial-of-service and prevention * Authentication * Intrusion detection and avoidance * Digital rights management * Digital forensics * Executable content * Vulnerabilities and risk management * Language-based security * Secure electronic commerce * Formal methods for security * Secure software engineering Invited Speakers ---------------- It has been a tradition of ASIAN to invite three of the most influential researchers in the focus area, one from Asia, one from Europe and one from the Americas, to discuss their work and their vision for the field. We are honored that the following members of the community have accepted this invitation. * Joshua Guttman, MITRE (USA) * Andrei Sabelfeld, Chalmers University (Sweden) * Kazuhiko Kato, University of Tsukuba (Japan) Submission Instructions ----------------------- Submissions must not substantially overlap papers that have been published or that are simultaneously submitted to a journal or a conference with proceedings. Papers should be submitted in Postscript or Portable Document Format (PDF); papers submitted in a proprietary word processor format such as Microsoft Word cannot be considered. Submissions can be of two types: * Regular papers are meant to describe solid new research results. They can be up to 15 pages long in LNCS style, including figures, bibliography and appendices. * Short papers are intended to report on interesting work in progress. They can be at most 7 pages long in the LNCS style. Papers can be electronically submitted by visiting http://www.easychair.org/ASIAN07/. Prospective authors are required to register a title and an abstract a week before the paper submission deadline (see below). As with the previous editions, the proceedings of ASIAN'07 will be published in Springer-Verlag's Lecture Notes in Computer Science series. They will be available at the conference. Participation ------------- Authors of accepted papers are required to ensure that at least one will be present at the symposium. Papers that do not adhere to this policy will be removed from the proceedings. Important Dates --------------- Abstract submission deadline: July 27, 2007 Paper submission deadline: August 3, 2007 Notification of acceptance: September 7, 2007 Camera-ready papers: September 28, 2007 ASIAN 2007: December 9-11, 2007 Program Committee ----------------- * Michael Backes, Saarland University (Germany) * Iliano Cervesato, Carnegie Mellon University (Qatar) - chair * Anupam Datta, Stanford University (USA) * Mourad Debbabi, Concordia University (Canada) * Sven Dietrich, CERT (USA) * Masami Hagiya, University of Tokyo (Japan) * Yassine Lakhnech, VERIMAG (France) * Ninghui Li, Purdue University (USA) * Catherine Meadows, Naval Research Lab (USA) * R. Ramanujam, Institute of Mathematical Sciences (India) * Takamichi Saito, Meiji University (Japan) * Dheeraj Sanghi, IIT Kanpur (India) * Thierry Sans, Carnegie Mellon University (Qatar) * Andre Scedrov, University of Pennsylvania (USA) * Vitaly Shmatikov, University of Texas-Austin (USA) * Duminda Wijesekera, George Mason University (USA) * Yuqing Zhang, Chinese Academy of Sciences (China) * Jianying Zhou, Institute for Infocomm Research (Singapore) Contact Information ------------------- Email: asian07 at qatar.cmu.edu Web page: http://www.qatar.cmu.edu/asian07 From femke at cs.vu.nl Mon Jun 4 04:58:18 2007 From: femke at cs.vu.nl (Femke van Raamsdonk) Date: Mon, 4 Jun 2007 10:58:18 +0200 (CEST) Subject: [TYPES/announce] PhD position at VU Amsterdam Message-ID: ========================================================= Vrije Universiteit Amsterdam PhD position in Theoretical Computer Science Project title: Higher-Order Termination ========================================================= A four year PhD position is available in the Section of Theoretical Computer Science of the Vrije Universiteit (VU) in Amsterdam on the research project Higher-Order Termination (HOT) The project ----------- The goal of the project is to develop, extend, and improve methods to prove termination of higher-order rewriting systems. Higher-order rewriting can be thought of as a combination of lambda calculus and first-order term rewriting. Termination methods for higher-order rewriting need to deal with both substitution, as in the lambda calculus, and algebraic manipulations, as in first-order term rewriting. In the project we will study the higher-order recursive path ordering and the dependency pairs method. We aim at an integrated approach that is suitable both for rewriting modulo alpha, and rewriting modulo alpha-beta-eta. Further goals of the project are to study termination of type theory with rewriting (relevant for proof assistants), and to contribute to the development of a higher-order termination tool. For more detailed information on the project, please see http://www.cs.vu.nl/~femke/hot.pdf The research will be carried out in the Section of Theoretical Computer Science of the Vrije Universiteit. The main research themes of the section are formal methods, term rewriting, lambda calculus, process algebra, coalgebra. The section has various international cooperations. Qualifications -------------- Applicants should have a masters degree in computer science, mathematics, logic, or a closely related area. Knowledge of term rewriting and lambda calculus is considered an advantage. Application ----------- Please send applications by email to Femke van Raamsdonk at femke at cs.vu.nl. The deadline for application is August 1, 2007. Your application should consist of a cover letter, a curriculum vitae (including detailed information concerning your academic degree, interests, and possibly publications), and the contact details of two references. Contact ------- For further information about the project and the position please contact dr. Femke van Raamsdonk femke at cs.vu.nl +31 (0)20 5987710 From david.j.clark at kcl.ac.uk Mon Jun 4 10:59:46 2007 From: david.j.clark at kcl.ac.uk (David Clark) Date: Mon, 04 Jun 2007 15:59:46 +0100 Subject: [TYPES/announce] Call for presentations at PLID 2007 Message-ID: <466428E2.6080303@kcl.ac.uk> *CALL FOR PRESENTATIONS* ******************************************************** * The Third International Workshop * * on * * Programming Language Interference and Dependence * * * * (affiliated with SAS'07 and LOPSTR'07) * * * * 21 August, 2007, Kongens Lyngby, Denmark * * * * Call for Contributions * * * * http://www.dcs.kcl.ac.uk/pg/cmu/plid07/ * * * ******************************************************** PLID'07 Important dates: [Expression of interest] July 6, 2007 [Extended abstract] July 20, 2007 [Workshop] August 21, 2007 Scope Interference and dependence are closely related concepts, the first being the observable phenomenon connected to the second. Interference essentially means that behaviour of some parts of a dynamic system may influence the behaviour of other parts of the system. Dependence specifies the relation between the semantics of sub-components of a dynamic system. Discovering, measuring and controlling interference is essential in many aspects of modern computer science, in particular in security, program analysis and verification, debugging, systems specification, model checking, program manipulation, program slicing, reverse engineering, data mining, distributed databases and systems biology. Doing these things requires theories, models and semantics for interference and dependence, as well as algorithms and tools for analysis and reasoning about interference and dependence. The aim of this workshop is to gather together the community of people that study dependence and interference from the different points of view in order to generate new possible research directions. PLID is devoted to bridging all these communities and assisting work towards a common goal, providing the appropriate environment for reasoning about the state of the art in interference and dependence. Organisation and Submission: The workshop welcomes contributions of on-going work and ideas in the field of dependence and interference. Those who are interested in having a talk at the workshop and/or discussing issues related with these subjects are invited to send your expression of interest to David Clark (david.j.clark at kcl.ac.uk) before July 6, 2007. A web-page will be organised collecting all the workshop contributions. Submitted extended abstracts should be of at most 10 pages LNCS-style and should be sent before July 20th 2007. A special issue of Mathematical Structures in Computer Science on the theme of workshop has been arranged. The special issue will not be restricted to papers based on workshop presentations. It will have a December 2007 deadline and its own, separate call for papers. Program Committee Michele Boreale (U. Florence, Italy) David Clark (Kings College, London, UK) (Chair) Roberto Giacobazzi (U. Verona, Italy) Samir Genaim (U. Politecnica de Madrid, Spain) Chris Hankin (Imperial College, London, UK) Mark Harman (King's College, London, UK) Sebastian Hunt (City U., London, UK) Pasquale Malacaria (Queen Mary, London, UK) Isabella Mastroeni (U. Verona, Italy) David Sands (Chalmers UT, Goteborg, Sweden) Nobuko Yoshida (Imperial College, London, UK) -- _______________________________________________________ David Clark, room 541, Department of Computer Science, King's College London, The Strand, London, WC2R 2LS, UK. ph: +44 20 7848 2472 From vv at di.fc.ul.pt Tue Jun 5 03:54:37 2007 From: vv at di.fc.ul.pt (Vasco Vasconcelos) Date: Tue, 5 Jun 2007 08:54:37 +0100 Subject: [TYPES/announce] The AITO Dahl-Nygaard Prize Winners for 2007 Message-ID: AITO is very proud to announce that the Dahl-Nygaard Prizes for 2007 will be given to Luca Cardelli, Microsoft Research Cambridge (Senior prize) for his overall contribution to both theory and practice for object-oriented languages, and to Jonathan Aldrich, Carnegie Mellon University Pittsburgh (Junior prize) for his recent contribution to expressing and verifying software architecture in object-oriented languages. Luca Cardelli systematically developed typing theories for objects, from record types to bounded quantification, eventually leading to the famous book "A Theory of Objects", published with Martin Abadi in 1996. This masterpiece develops an "object calculus" as a foundation for object-oriented languages, in much the same way that Church's lambda-calculus is a foundation for procedural languages. Overall, Luca's work was inspired by strong expertise on language design, including functional languages and theory, such as ML, and object- oriented languages such as Modula-3. This leads Luca to further contribute to language design in the domain of mobility and locality with contributions such as Obliq and Ambient. The Ambient Calculus (developed with Andy Gordon) enables the formal analysis of mobile and wide-area systems, in part by taking advantage of a decade of previous work on process algebra. This work on mobility indirectly led to his recent interest in Systems Biology. Jonathan Aldrich develops lightweight ways to statically assure architectural characteristics of large, real-world object-oriented systems. His pioneering thesis work on ArchJava (with advisors Craig Chambers and David Notkin) was the first system to verify at compile time that the dynamic structure of an object-oriented application conforms to an abstract, hierarchical software architecture. ArchJava, like Jonathan's other work, tackles head-on challenging aspects of object-oriented systems, including aliasing, reentrancy, inheritance, and the use of sophisticated design patterns. Jonathan's research is grounded in formal soundness proofs yet is validated through case study evaluations with realistic software systems and tasks. More recently, Jonathan and his students have made contributions in other aspects of object-oriented architecture assurance, including object protocol checking, modularity in aspect- oriented programming, and novel object models. The AITO Dahl-Nygaard Prizes are named for Ole-Johan Dahl and Kristen Nygaard, two pioneers in the area of programming and simulation. Their foundational work on object-oriented programming, made concrete in the Simula language, is one of the most important inventions in software engineering. Their key ideas were expressed already around 1965, but took over 20 years to be absorbed and appreciated by the broader software community. After that, object-orientation has profoundly transformed the landscape of software design and development techniques. It was a great loss to our community that both Ole-Johan Dahl and Kristen Nygaard passed away in 2002. In remembrance of their scholarship and enthusiastic encouragement of young researchers, AITO has established in 2004 a prize to be awarded annually to a senior researcher with outstanding career contributions and a younger researcher who has demonstrated great potential for following in the footsteps of these pioneers. For 2006, the prize committee has recommended deviating from the norm and giving one prize but to a group of four people. The prizes will be awarded in July at ECOOP 2007, July 30 - August 03, Berlin, Germany. Luca Cardelli and Jonathan Aldrich have agreed to give keynotes talks. For details, see the conference program. -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070605/1c71d9d8/attachment.htm From morazanm at shu.edu Tue Jun 5 12:57:15 2007 From: morazanm at shu.edu (Marco T Morazan) Date: Tue, 5 Jun 2007 12:57:15 -0400 Subject: [TYPES/announce] TFP 2007: Draft Proceedings Available On-line Message-ID: Dear Colleagues, The draft proceedings of TFP 2007 are now available on the symposium's website. You may access the draft proceedings directly at: http://cs.shu.edu/tfp2007/draftProcDocument.pdf . This volume represents the articles associated with the work presented at TFP 2007. As in previous versions of TFP it is called the draft proceedings to distinguish it from the formal peer-reviewed post-symposium proceedings. The work presented at TFP 2007 was selected by its international program committee through the screening of extended abstracts. 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/20070605/542a64d8/attachment.htm From sophia_katrenko at gmx.de Tue Jun 5 14:04:21 2007 From: sophia_katrenko at gmx.de (Sophia Katrenko) Date: Tue, 05 Jun 2007 20:04:21 +0200 Subject: [TYPES/announce] ESSLLI'08: Call for Course Proposals Message-ID: <20070605180421.88390@gmx.net> %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 20th European Summer School in Logic, Language and Information ESSLLI 2008 Monday, 4 August - Friday, 15 August 2008 Hamburg, Germany %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% CALL FOR COURSE and WORKSHOP PROPOSALS -------------------------------------- The European Summer School in Logic, Language and Information (ESSLLI) is organized every year by the Association for Logic, Language and Information (FoLLI, http://www.folli.org) in different sites around Europe. The main focus of ESSLLI is on the interface between linguistics, logic and computation. ESSLLI offers foundational, introductory and advanced courses, as well as workshops, covering a wide variety of topics within the three areas of interest: Language and Computation, Language and Logic, and Logic and Computation. Previous summer schools have been highly successful, attracting up to 500 students from Europe and elsewhere. The school has developed into an important meeting place and forum for discussion for students and researchers interested in the interdisciplinary study of Logic, Language and Information. The ESSLLI 2008 Program Committee invites proposals for foundational, introductory, and advanced courses, and for workshops for the 20th annual Summer School on a wide range of timely topics that have demonstrated their relevance in the following fields: - Logic and Language - Logic and Computation - Language and Computation PROPOSAL SUBMISSION: Proposals should be submitted through a web form available at http://www.folli.org/submission.php All proposals should be submitted no later than ******* Monday July 2, 2007. ******* Authors of proposals will be notified of the committee's decision no later than Monday September 10, 2007. Proposers should follow the guidelines below while preparing their submissions; proposals that deviate can not be considered. GUIDELINES FOR SUBMISSION: Anyone interested in lecturing or organizing a workshop during ESSLLI-2006, please read the following information carefully. ALL COURSES: Courses are taught by 1 or max. 2 lecturers. They consists of five sessions (a one-week course), each session lasting 90 minutes. Lecturers who want to offer a long, two-week course should submit two independent one-week courses (for example an introductory course in the first week of ESSLLI, and a more advanced course during the second). The ESSLLI program committee has the right to select only one of the two proposed courses. Timetable for Course Proposal Submissions: July 2, 2007: Proposal Submission Deadline Sep 10, 2007: Notification June 2, 2008: Deadline for receipt of camera-ready course material (by ESSLLI Local Organizers) FOUNDATIONAL COURSES: These are strictly elementary courses not assuming any background knowledge. They are intended for people to get acquainted with the problems and techniques of areas new to them. Ideally, they should allow researchers from other fields to acquire the key competences of neighboring disciplines, thus encouraging the development of a truly interdisciplinary research community. Foundational courses may presuppose some experience with scientific methods in general, so as to be able to concentrate on the issues that are germane to the area of the course. INTRODUCTORY COURSES: Introductory courses are central to the activities of the Summer School. They are intended to equip students and young researchers with a good understanding of a field's basic methods and techniques. Introductory courses in, for instance, Language and Computation, can build on some knowledge of the component fields; e.g., an introductory course in computational linguistics should address an audience which is familiar with the basics of linguistics and computation. Proposals for introductory courses should indicate the level of the course as compared to standard texts in the area (if available). ADVANCED COURSES: Advanced courses should be pitched at an audience of advanced Masters or PhD students. Proposals for advanced courses should specify the prerequisites in detail. WORKSHOPS: The aim of the workshops is to provide a forum for advanced Ph.D. students and other researchers to present and discuss their work. Workshops should have a well defined theme, and workshop organizers should be specialists in the theme of the workshop. It is a strict requirement that organizers give a general introduction to the them during the first session of the workshop. They are also responsible for the organization and program of the workshop including inviting the submission of papers, reviewing, expenses of invited speakers, etc. In particular, each workshop organizer will be responsible for producing a Call for Papers for the workshop by November 11, 2007. The call must make it clear that the workshop is open to all members of the LLI community. It should also note that all workshop contributors must register for the Summer School. Timetable for Workshop Proposal Submissions: July 2, 2007: Proposal Submission Deadline Sep 10, 2007: Notification Nov 11, 2007: Deadline for receipt of Call for Papers (by ESSLLI PC chair) Nov 18, 2007: Workshop organizers send out (First) Call for Papers Mar 17, 2008: Deadline for Papers (suggested) Apr 28, 2008: Notification of Workshop Contributors (suggested) June 2, 2008: Deadline for receipt of camera-ready copy of Workshop Proceedings (by ESSLLI Local Organizers) Notice that workshop speakers will be required to register for the Summer School; however, they will be able to register at a reduced rate to be determined by the Local Organizers. FORMAT FOR PROPOSALS: The web-based form for submitting course and workshop proposals is accessible at http://www.folli.org/submission.php. You will be required to submit the following information: * Name (name(s) of proposed lecturer(s)/organizer) * Address (contact addresses of proposed lecturer(s)/organizer; where possible, please include phone and fax numbers) * Title (title of proposed course/workshop) * Type (is this a workshop, a foundational course, an introductory course, or an advanced course?) * Section (does your proposal fit in Language & Computation, Language & Logic or Logic & Computation? name only one) * Description (in at most 150 words, describe the proposed contents and substantiate timeliness and relevance to ESSLLI) * External funding (will you be able to find external funding to help fund your travel and accommodation expenses? if so, how?) * Further particulars (any further information that is required by the above guidelines should be included here; in particular, indicate here your teaching experience in an interdisciplinary field as the one addressed by ESSLLI.) FINANCIAL ASPECTS: Prospective lecturers and workshop organizers should be aware that all teaching and organizing at the summer schools is done on a voluntary basis in order to keep the participants fees as low as possible. Lecturers and organizers are not paid for their contribution, but are reimbursed for travel and accommodation (up to a fixed, maximum amount that will be notified to lecturers when courses are accepted). It should be stressed that while proposals from all over the world are welcomed, the Summer School cannot guarantee full reimbursement of travel costs, specially from destinations outside Europe. Please note the following: In case a course is to be taught by two lecturers, a lump sum is reimbursed to cover travel and accommodation expenses for one lecturer. The splitting of the sum is up to the lecturers. The local organizers highly appreciate it if, whenever possible, lecturers and workshop organizers find alternative funding to cover travel and accommodation expenses, and such issues might be taken into account when selecting courses. PROGRAM COMMITTEE: Chair: Rineke Verbrugge Institute of Artificial Intelligence University of Groningen Grote Kruisstraat 2/1 9712 TS Groningen The Netherlands phone +31 (0)50 571 81 41 e-mail : rineke (at) ai.rug.nl www : http://www.ai.rug.nl/~rineke Local co-chair: Benedikt L?we Area Specialists: Petra Hendriks and Philippe Schlenker (Logic and Language) Michael Kaminski and Enrico Franconi (Logic and Computation) Khalil Sima'an and Massimo Poesio (Language and Computation) ORGANIZING COMMITTEE: Walter von Hahn and Cristina Vertan FURTHER INFORMATION: The website for ESSLLI 2008 will become operational in the second half of 2007. For this year's summer school, please see the web site at http://www.cs.tcd.ie/esslli2007/ >>> . With best regards, Rineke Verbrugge -- Best regards, Sophia Katrenko sophia_katrenko at gmx.de GMX FreeMail: 1 GB Postfach, 5 E-Mail-Adressen, 10 Free SMS. Alle Infos und kostenlose Anmeldung: http://www.gmx.net/de/go/freemail From areces at loria.fr Wed Jun 6 03:59:35 2007 From: areces at loria.fr (Carlos Areces) Date: Wed, 06 Jun 2007 09:59:35 +0200 Subject: [TYPES/announce] CFP: 5th Worskhop on "Methods for Modalities" (M4M-5) Message-ID: <46666967.3090904@loria.fr> ==================================================================== 5th Worskhop on "Methods for Modalities" (M4M-5) http://m4m.loria.fr/M4M5 Ecole Normale Superieure de Cachan, France November 29-30 ==================================================================== Scope ----- The workshop ``Methods for Modalities'' (M4M) aims to bring together researchers interested in developing algorithms, verification methods and tools based on modal logics. Here the term ``modal logics'' is conceived broadly, including temporal logic, description logic, guarded fragments, conditional logic, temporal and hybrid logic, etc. To stimulate interaction and transfer of expertise, M4M will feature a number of invited talks by leading scientists, research presentations aimed at highlighting new developments, and submissions of system demonstrations. We strongly encourage young researchers and students to submit papers and posters, especially for experimental and prototypical software tools which are related to modal logics. More information about the previous editions can be found at http://m4m.loria.fr/ Paper Submissions ------------------ Authors are invited to submit papers in the following three categories. - Regular papers up to 15 pages, describing original results, work in progress, or future directions of research. - System descriptions of up to 12 pages, describing new systems or significant upgrades of existing ones. - Presentation-only papers, describing work recently published or submitted (no page limit). These will not be included in the proceedings, but pre-prints or post-prints can be made available to participants. Submissions should be made via Easychair at the following address: http://www.easychair.org/M4M5/ Final versions of accepted papers will be published online in an Elsevier ENTCS volume. A preliminary version of the proceedings will also be available at the workshop. Invited speakers ----------------- Ahmed Bouajjani (University of Paris 7) Patricia Bouyer (OUCL, Oxford - LSV, ENS Cachan) Balder ten Cate (University of Amsterdam) Koen Claessen (Chalmers University of Technology) Wiebe van der Hoek (University of Liverpool) Important dates --------------- Deadline for submissions: September 7th, 2007 Notification: October 10, 2007 Camera ready versions: November 5, 2007 Workshop dates: November 29-30, 2007 Program Committee ----------------- Natasha Alechina, University of Nottingham Carlos Areces, INRIA Lorraine (co-chair) Philippe Balbiani, IRIT, Nicole Bidoit, Universite Paris-Sud Patrick Blackburn, INRIA Lorraine Torben Brauner, Roskilde University Stephane Demri, ENS de Cachan (co-chair) Maarten de Rijke, University of Amsterdam Valentin Goranko, University of the Witwatersrand Rajeev Gore, ANU, NICTA Carsten Lutz, Dresden University of Technology Nicolas Markey, ENS de Cachan Angelo Montanari, University of Udine Ulrike Sattler, University of Manchester Holger Schlingloff, Humboldt University / FIRST Renate Schmidt, University of Manchester Johan van Benthem, University of Amsterdam/ Stanford University -- ================================================================== 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 rlc3 at mcs.le.ac.uk Thu Jun 7 04:02:37 2007 From: rlc3 at mcs.le.ac.uk (Roy L. Crole) Date: Thu, 07 Jun 2007 09:02:37 +0100 Subject: [TYPES/announce] GRADUATE TEACHING ASSISTANT (PhD) - Leicester, UK Message-ID: Dear Colleagues, Please could you bring the following PhD position to the attention of suitable students? Note the tight closing date for applications. Roy Crole. GRADUATE TEACHING ASSISTANT - Ref: S3276 Department of Computer Science, University of Leicester, UK. Applications are invited for a Graduate Teaching Assistant and offer an excellent opportunity to pursue a doctorate in a dynamic and successful department. Research projects centered on both Category Theory and Type Theory are very active. A Graduate Teaching Assistant is expected to undertake teaching-related duties within the Department, not normally exceeding six contact hours per week during term, while undertaking research leading to a PhD supervised by a member of staff. Downloadable application forms and further particulars are available from http://www.le.ac.uk/personnel/supportjobs/s3276a.html Available immediately for 4 years. ?9,073 maintenance grant, Home/EU fee waiver, and salary ?3,527 pa. Closing date: 15 June 2007 From eeide at cs.utah.edu Thu Jun 7 12:17:02 2007 From: eeide at cs.utah.edu (Eric Eide) Date: Thu, 7 Jun 2007 10:17:02 -0600 Subject: [TYPES/announce] 2nd CFP: PLOS '07: 4th Workshop on Programming Languages and Operating Systems In-Reply-To: Eric Eide's message of Wednesday, May 9 2007 <17986.1852.456209.304232@bas.flux.utah.edu> References: <17986.1852.456209.304232@bas.flux.utah.edu> Message-ID: <18024.12158.104801.394021@bas.flux.utah.edu> This is a brief reminder of the PLOS 2007 workshop and its upcoming deadline. If you apply type-based or other advanced language ideas in the implementation of operating systems, we hope you will consider submitting a paper to PLOS '07. See the CFP below, or visit the Web site at http://plosworkshop.org/2007/ Latest news: Jun 4: The PLOS 2007 submission site is now open! May 15: PLOS 2007 is now sponsored by ACM SIGOPS! Best wishes --- Eric, Marc, Robert, and Olaf The PLOS 2007 Organizing Committee ------------------------------------------------------------------------------- (ABBREVIATED) CALL FOR PAPERS Fourth Workshop on Programming Languages and Operating Systems (PLOS 2007) October 18, 2007 Skamania Lodge / Stevenson, WA, USA http://plosworkshop.org/2007/ Sponsored by ACM SIGOPS Paper submission deadline: June 29, 2007 Historically, operating system development and programming language development went hand-in-hand. Today, although the systems community at large retains an iron grip on C, many people continue to explore novel approaches to OS construction based on new programming language ideas. This workshop will bring together researchers and developers from the programming language and operating system domains to discuss recent work at the intersection of these fields. It will be a platform for discussing new visions, challenges, experiences, problems, and solutions arising from the application of advanced programming and software engineering concepts to operating systems construction, and vice versa. Please visit the Web site for more info: http://plosworkshop.org/2007/ From morazanm at shu.edu Thu Jun 7 18:43:18 2007 From: morazanm at shu.edu (Marco T Morazan) Date: Thu, 7 Jun 2007 18:43:18 -0400 Subject: [TYPES/announce] TFP 2007: Draft Proceedings Articles In-Reply-To: Message-ID: Dear Colleagues, Thank you for the interest expressed in the draft proceedings of TFP 2007. To make accessing individual articles easier for those who do not wish to download the entire proceedings, we have added links to individual articles. You may download the complete draft proceedings at: http://cs.shu.edu/tfp2007/draftProcDocument.pdf You may download individual articles in the draft proceedings at: http://cs.shu.edu/tfp2007/schedule.html 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/20070607/555fe097/attachment.htm From Aart.Middeldorp at uibk.ac.at Fri Jun 8 09:34:28 2007 From: Aart.Middeldorp at uibk.ac.at (Aart Middeldorp) Date: Fri, 08 Jun 2007 15:34:28 +0200 Subject: [TYPES/announce] postdoctoral researcher position in Innsbruck Message-ID: <46695AE4.9010406@uibk.ac.at> The University of Innsbruck invites applications for a 4 year position as postdoctoral researcher at the Computational Logic group of the Institute of Computer Science. Depending on a change in the law and performance, this position might lead to a permanent position at the associate professor level. The preferred starting date is 1 September 2007. Candidates are required to hold a PhD degree. A strong background in computational logic (model checking, automated reasoning) is an asset. So is the ability to implement your ideas. Candidates with a strong theoretical background in related areas are also encouraged to apply. The ideal candidate furthermore enjoys the opportunity of working with students at all levels. Candidates are expected to contribute to research, teaching and administration. Knowledge of German is an advantage but not essential. The position is a so-called "Kategorie I" position (according to the Austrian salary scheme) with teaching obligations of 4 hours. The annual gross salary is approximately EUR 50,000. The official job advert appeared in the "Mitteilungsblatt" of the University on 6 June 2007 (code MIP-4573) http://www.uibk.ac.at/personalabteilung/nuetzliches_interessantes/bewerber/ausschreibungen/ Applications (including CV, publication list, and two references) may be mailed to the address stated there or, by email, to aart.middeldorp at uibk.ac.at no later than 27 June 2007. Informal inquiries are also welcome at the same email address. The city of Innsbruck, which hosted the Olympic Winter Games in 1964 and 1976, is superbly located in the beautiful surroundings of the Tyrolean Alps. The combination of the Alpine environment and urban life in this historic town provides a high quality of living. The University of Innsbruck has a long tradition dating back to the 16th century and offers a wide spectrum of research and teaching activities with interesting opportunities for interdisciplinary collaboration. Further information is available from the following links: Institute of Computer Science: http://informatik.uibk.ac.at/ University of Innsbruck: http://www.uibk.ac.at/ City of Innsbruck: http://www.innsbruck.at/ --- Univ.-Prof. Dr. Aart Middeldorp Institute of Computer Science, University of Innsbruck Technikerstr. 21a, 6020 Innsbruck, Austria phone: +43 512 507 6430 fax: +43 512 507 9887 From tkt at imm.dtu.dk Fri Jun 8 18:10:36 2007 From: tkt at imm.dtu.dk (Terkel K. Tolstrup) Date: Sat, 9 Jun 2007 00:10:36 +0200 (CEST) Subject: [TYPES/announce] SAS 2007 Call for Posters *Deadline extension* Message-ID: <63623.62.243.82.133.1181340636.squirrel@www2.imm.dtu.dk> Call for Posters Static Analysis Symposium SAS 2007 22-24 August 2007, Kongens Lyngby, Denmark (co-located with LOPSTR 2007) * Extended submission deadline * In connection with the Static Analysis Symposium (SAS 2007) we are arranging a poster session for PhD students and young researchers. The topics of the poster session will be the same as those of the symposium; see the website http://www.imm.dtu.dk/sas2007 for further information. Submitted posters should be in A2 format and should be accompanied by 1-2 page abstract in LNCS format (to be collected and distributed at the symposium). The files must be submitted to sasposter at imm.dtu.dk in one email as two seperate pdf files. Selection committee Terkel K. Tolstrup (Chair) Sebastian Nanz Flemming Nielson Hanne Riis Nielson Christian W. Probst Important dates Submission of poster: Juli 31, 2007 Notification: August 6, 2007 Conference: August 22-24, 2007 The acceptance will be conditional on at least one of the authors having registered at the conference. Students that are presenting papers or posters at the conference will have the possibility of getting a sponsored ticket to the conference dinner. -- Terkel K. Tolstrup, PhD Assistant Professor, IMM, DTU http://www.imm.dtu.dk/~tkt From sanjiva at cse.iitd.ac.in Tue Jun 12 03:33:46 2007 From: sanjiva at cse.iitd.ac.in (Sanjiva Prasad) Date: Tue, 12 Jun 2007 13:03:46 +0530 Subject: [TYPES/announce] Call for Papers Reminder: FST TCS 2007 Submission deadline is June 17 Message-ID: <466E4C5A.3070506@cse.iitd.ac.in> [Apologies for multiple mailings. This announcement is likely to be of interest to subscribers of various lists] CALL FOR PAPERS (FSTTCS 2007) Foundations of Software Technology and Theoretical Computer Science December 12--14, 2007, New Delhi, India IARCS, the Indian Association for Research in Computing Science, announces the 27th Annual FSTTCS Conference in New Delhi. The FSTTCS conference is a forum for presenting original results in foundational aspects of Computer Science and Software Technology. As in the past, it is expected that the conference proceedings will be published by Springer-Verlag as Lecture Notes in Computer Science (LNCS). The Proceedings of the 2006 conference were published as LNCS 4337. Confirmed invited speakers: Maurice Herlihy, Richard Karp, Benjamin Pierce, Thomas Reps, Salil Vadhan, and Andrew Yao. In addition to invited talks and contributed papers, the FSTTCS 2007 programme will include two one-day workshops in areas of current interest on Dec 11 and Dec 15, 2007. Authors are invited to submit papers presenting original and unpublished research in any area of Theoretical Computer Science or Foundational aspects of Software Technology. Representative areas include, but are not limited to: Automata, Languages and Computability; Automated Reasoning, Rewrite Systems, and Applications; Combinatorial Optimization; Computational Biology; Computational Complexity; Computational Geometry; Concurrency Theory; Cryptography and Security Protocols; Database Theory and Information Retrieval; Data Structures; Graph and Network Algorithms; Logic, Proof Theory, Model Theory and Applications; Logics of Programs and Temporal Logics; New Models of Computation; Parallel and Distributed Computing; Programming Language Design and Semantics; Randomized and Approximation Algorithms; Software Specification and Verification; Timed and Hybrid Systems; Type Systems Authors may submit drafts of full papers or extended abstracts. Submissions are limited to 12 pages in LNCS style (see the conference site for full details). Proofs omitted due to space constraints may be put into a clearly marked appendix (but the paper should be intelligible without the appendix, as reviewers are not required to read appendices). Concurrent submission to other conferences / journals is not acceptable. Electronic submission is very strongly recommended. Details will be made available at the conference site http://www.fsttcs.org . For an accepted paper to be included in the proceedings, one of the authors must commit to presenting the paper at the conference. Important dates: Deadline (abstracts) : 10 June 2007 Deadline (paper) : 17 June 2007 Notification to Authors : 19 Aug 2007 Final Version due : 17 Sep 2007 Programme Committee: Roberto Amadio (Univ. Paris 7) V. Arvind (IMSc, Chennai), co-chair Iliano Cervesato (CMU, Qatar) Supratik Chakraborty (IIT Bombay) Sunil Chandran (IISc, Bangalore) Samir Datta (CMI, Chennai) Deepak D'Souza (IISc, Bangalore) Sumit Ganguly (IIT Kanpur) Rajeev Gore (ANU and NICTA) Aarti Gupta (NEC Labs, Princeton) Vineet Gupta (Google, Bangalore) Prasad Jayanti (Dartmouth College) Ranjit Jhala (UC San Diego) Deepak Kapur (U. New Mexico) Subhash Khot (Georgia Tech., Atlanta) Johannes Koebler (Humboldt U., Berlin) K. Narayan Kumar (CMI, Chennai) Kim G. Larsen (Aalborg U) Satya Lokam (Microsoft Research) Greg Morrissett (Harvard, Cambridge) Sanjiva Prasad (IIT Delhi), co-chair Shaz Qadeer (Microsoft Research) S. Srinivasa Rao (ITU, Copenhagen) Pranab Sen (TIFR, Mumbai) Helmut Seidl (TU Munchen) Aravind Srinivasan (U. Maryland) C.R. Subramanian (IMSc, Chennai) Denis Therien (McGill U., Montr e al) Ashish Tiwari (SRI, Palo Alto) Vinodchandran Variyam (U. Nebraska) Heribert Vollmer (U. Hannover) Hongseok Yang (QMU, London) Addresses for Correspondence Submissions: Email : fsttcs at imsc.res.in Phone: +91 44 2254 1856 Fax: +91 44 2254 1586 Local Arrangements: FSTTCS '07 Department of Computer Science and Engineering Indian Institute of Technology Delhi Hauz Khas, New Delhi 110016, INDIA Phone: +91 11 2659 1294 Fax: +91 11 2658 1060 URL: http://www.fsttcs.org From ana.matos at ist.utl.pt Tue Jun 12 05:23:26 2007 From: ana.matos at ist.utl.pt (Ana Almeida Matos) Date: Tue, 12 Jun 2007 10:23:26 +0100 Subject: [TYPES/announce] Assistant Professor Position in IST Lisbon, Deadline 18 June Message-ID: <466E660E.706@ist.utl.pt> Assistant Professor Position in IST Lisbon, Portugal ***** Application deadline: 18 June 2007 ***** The Department of Information Systems and Computer Engineering at the Technical University of Lisbon, is seeking candidates for a tenure track faculty position at assistant professor level. More precisely, it is a 5 year teaching+research position, for either a "Professor Auxiliar" (the selected candidate holds a PhD, salary +-28K euro net) or an "Assistente" (masters degree is required, salary +-15K euro net). These 5 years are considered probatory in order to obtain a full permanent position. The candidate will be selected according to scientific activities and professional experience. Applications consist of the following: 1 - A formal cover letter addressed to the President of IST, sent by registered mail to N?cleo de Gest?o de Pessoal do Instituto Superior T?cnico Av. Rovisco Pais 1049?001 Lisboa. that should contain personal identification info (name, parents names, nationality, birth date, identification document number and emission date and entity, address, telephone number), degrees and professional position, as well as any other elements that could be considered relevant to your application. 2 - A complete CV. 3 - Copy of diplomas. Candidates who have obtained their PhD degree outside Portugal should "register" their degree in a Portuguese University. To meet the deadline, it is sufficient to produce a proof that the registration has been requested. The ability to speak Portuguese is valued, for teaching purposes, but it is not mandatory. We expect the selected candidate to learn to be able to teach undergraduate courses in Portuguese, within a couple of years. For more information about the application procedure, please contact Sr. Ant?nio Gon?alves (gon?alves.monteiro at ist.utl.pt). --- ABOUT THE DEPARTMENT --- TEACHING The Department participates in the following degrees of IST: - Undergraduate degrees: * Information Systems and Computer Engineering - Alameda https://fenix.ist.utl.pt/leic-pB * Information and Communication Networks Engineering https://fenix.ist.utl.pt/lerci-pB * Electrical and Computer Engineering https://fenix.ist.utl.pt/leec-pB * Industrial Engineering and Management https://fenix.ist.utl.pt/legi-pB - Postdgraduate degrees: * Master in Information Systems and Computer Engineering https://fenix.ist.utl.pt/publico/showDegreeSite.do?method=showDescription°reeID=43 * PhD Programme on Information Systems and Computer Engineering http://berlin.inesc-id.pt/CCPGPortal/DEIC%20(Eng Second International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'07) 15 July, 2007 Bremen, Germany http://www.cs.mcgill.ca/~bpientka/lfmtp07/ A CADE-21 affiliated workshop http://www.cadeconference.org/meetings/cade21/ 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 has been the focus of considerable research over the last two decades, using competing and sometimes incompatible basic principles. This workshop will bring together designers, implementors, and practitioners to discuss all aspects of logical frameworks. 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: Randy Pollack. Locally Nameless Representation and Nominal Isabelle Accepted papers: Alberto Momigliano, Alan J. Martin and Amy P. Felty. Two-Level Hybrid: A System for Reasoning Using Higher-Order Abstract Syntax William Lovas and Frank Pfenning. A Bidirectional Refinement Type System for LF Paul Callaghan. Coercive Subtyping via Mappings of Reduction Behaviour Brigitte Pientka, Florent Pompigne and Xi Li. Focusing the Inverse Method for LF: a Preliminary Report Julien Narboux and Christian Urban. A Formalisation of the Logical Relation Proof given by Crary for Completeness of Equivalence Checking Alexandre Buisse and Peter Dybjer. Formalizing Categorical Models of Type Theory in Type Theory Michael Zeller, Aaron Stump and Morgan Deters. A Signature Compiler for the Edinburgh LF Anders Schack-Nielsen. Induction on Concurrent Terms Fredrik Lindblad. Higher-Order Proof Construction Based on First-Order Narrowing Murdoch Gabbay and Stephane Lengrand. The Lambda Context Calculus Registration to the LFMTP workshop is independent from registration to CADE-21. http://www.cadeconference.org/meetings/cade21/registration.html I hope to see you there, Best regards, Carsten Schuermann From johanj at cs.uu.nl Wed Jun 13 03:01:39 2007 From: johanj at cs.uu.nl (Johan Jeuring) Date: Wed, 13 Jun 2007 09:01:39 +0200 Subject: [TYPES/announce] PhD student on Real-life datatype-generic programming Message-ID: <7C9F62B1-234F-4DFA-BD0C-5DCB59F6D7E8@cs.uu.nl> =================================================== Vacancy PhD student on Real-life datatype-generic programming Software Technology, Utrecht University, The Netherlands. =================================================== Within the Software Technology group of the Information and Computing Sciences department of Utrecht University there is a vacancy for a PhD student to work on Real-life datatype-generic programming. The position is funded by NWO, the Netherlands Organisation for Scientific Research. ------------------------------------------------------------------------ ----------------- Project summary: Datatype-generic programming has been around for more than 10 years now. We think a lot of progress has been made in the last decade. As an example, there are more than 10 proposals for generic-programming libraries or language extensions just for the lazy functional- programming language Haskell. Although generic programming has been applied in several applications, it lacks users for real-life projects. This is understandable. Developing a large application takes a couple of years, and choosing a particular approach to generic programming for such a project involves a risk. Few approaches that have been developed over the last decade are still supported, and there is a high risk that the chosen approach will not be supported anymore, or that it will change in a backwards-incompatible way in a couple of years time. We propose to create an environment that supports developing real- life applications using generic-programming techniques. We will focus on developing: - a library or a mixture of a library with a language extension for which we will guarantee continuing support. - an example of a real-life application fundamentally using generic- programming techniques. This application will serve as a showcase for generic-programming support for software development and evolution. - generic-programming design patterns. The usage of the generic- programming techniques in real-life projects will exhibit recurrent patterns, and will give valuable advice for and help with developing other applications using generic-programming techniques. Thus we will show how generic programming can be used to develop powerful tools in little time, and that the resulting tools are easy to maintain, adapt, and reuse. ------------------------------------------------------------------------ ----------------- Requirements: Master degree in Computer Science, or equivalent. Good knowledge of functional programming, and several advanced computer science techniques. Knowledge of Haskell, parsing, rewriting, strategies, generic programming, etc. will be useful. Terms of employment: the PhD student should start as soon as possible, but no later than January 1, 2008. The position is for four years (after one year there will be an evaluation), full-time. Gross salary starts with ? 1956,-- per month in the first year and increases to ? 2502,-- in the fourth year of employment. The salary is supplemented with a holiday bonus of 8% and an end-of-year bonus of 3%. In addition we offer: a pension scheme, partially paid parental leave, facilities for child care, flexible employment conditions in which you may trade salary for vacation days or vice versa. Conditions are based on the Collective Employment Agreement of the Dutch Universities. More information about the project can be found on http:// www.cs.uu.nl/~johanj/publications/nwo-ew2006.pdf More information about the Software Technology group on http:// www.cs.uu.nl/wiki/Center More information about the Information and Computing Sciences department on http://www.cs.uu.nl/ More information about this vacancy can be obtained from Johan Jeuring (johanj at cs.uu.nl, http://www.cs.uu.nl/~johanj/, +31 6 40010053). Send your application in pdf (or another non-proprietary format) to SciencePenO at uu.nl with a cc to johanj at cs.uu.nl. on or before July 31, 2007. We expect to arrange interviews in September. Mention vacancy nr 62712. From dreyer at tti-c.org Wed Jun 13 08:48:25 2007 From: dreyer at tti-c.org (Derek Dreyer) Date: Wed, 13 Jun 2007 07:48:25 -0500 Subject: [TYPES/announce] 2007 ML Workshop deadline extended Message-ID: <7fa251b70706130548n33654d24n54cc516f2f707fc@mail.gmail.com> In response to requests from several authors, the deadline for the 2007 ML Workshop will be extended over the weekend. Submissions will be accepted until 6 PM Samoan time on Sunday, June 17. However, so that we know how many papers to expect, PLEASE submit at least a stub document to the submission website (linked to below) by Friday, June 15. You can then resubmit a revised document over the weekend. After 6 PM Samoan time on Sunday, June 17, the submission site will be closed. If you want more time than that to polish your submission, you will need to contact the program chair to ask permission. Workshop website: http://research.microsoft.com/~crusso/ml2007/ Submission website: https://www.softconf.com/starts/ml07/submit.html Regards, Derek Dreyer Program Chair From davide at disi.unige.it Thu Jun 14 09:53:20 2007 From: davide at disi.unige.it (Davide Ancona) Date: Thu, 14 Jun 2007 15:53:20 +0200 Subject: [TYPES/announce] Call for papers: OOPS track at SAC 2008 Message-ID: <46714850.8000408@disi.unige.it> OOPS 2008 Call for Papers Object-Oriented Programming Languages and Systems http://oops.disi.unige.it/OOPS08 Special Track at the 23rd ACM Symposium on Applied Computing, SAC 2008 http://www.acm.org/conferences/sac/sac2008 Fortaleza, Brazil March 16 - 20, 2008 - Important Dates Sept. 8, 2007: Paper submissions Oct. 16, 2007: Author notification Oct. 30, 2007: Camera-Ready Copy - SAC 2008 For the past twenty-two years, the ACM Symposium on Applied Computing (SAC) has been a primary gathering forum for applied computer scientists, computer engineers, software engineers, and application developers from around the world. SAC 2008 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and is hosted by the University of Fortaleza and the Federal University of Cear\'a, in Brazil. - OOPS Track Today's large scale software systems are typically designed and implemented using the concepts of the object-oriented (OO) paradigm. However, there is still a need for existing OO languages and architectures to continuously adapt in response to demands for new features and innovative approaches. The basic aim of the OOPS track at the SAC 2008 is to promote and stimulate further research on the object-oriented programming and distributed-object paradigms. This track will invite papers investigating the development of extensions and enhancements to the prevalent OO languages, such as Java, C# and C++, the formulation of innovative OO-based middleware approaches, and the improvements to existing and well-established distributed-object based systems. A medium to long-term vision is also solicited, tackling general issues about the current and future role of prevalent OO languages and distributed architectures in Computer Science and Engineering. The specific topics of interest for the OOPS track include, but are not limited to, the following: * Design and implementation of novel abstractions, constructs and mechanisms * Type systems * Multi-paradigm features * Language features in support of adaptability * Aspect-oriented programming * Component-based programming * Meta-programming, reflection, generative programming * Program structuring, modularity * Distributed objects and concurrency * Middleware * Heterogeneity and interoperability * Applications of distributed object computing * Compilation techniques * Virtual machines Original papers and implementation reports are invited from all areas of OO programming languages and distributed-object computing. Particularly of interest are papers that provide a thorough analysis covering theory, design, implementation, applicability, performance evaluation, and comparison/integration with existing constructs and mechanisms. - Submission Instructions All papers should represent original and previously unpublished works that are currently not under review in any conference or journal. Both basic and applied research papers are welcome. Prospective papers should be submitted in pdf format using the provided automated submission system. Hardcopy and fax submissions will not be accepted. Submission of the same paper to multiple tracks is not allowed. The author(s) name(s) and address(es) must not appear in the body of the paper, and self-reference should be in the third person. This is to facilitate a blind review process. The format of the paper must adhere to the sig-alternate style (the templates are available at http://www.acm.org/conferences/sac/sac2008/downloads08.htm). The body of the paper should not exceed 4000 words (5 pages according to the above style). Papers that fail to comply with length limitations risk rejection. All papers must be submitted by September 8, 2007. For more information please visit the SAC 2008 Website at http://www.acm.org/conferences/sac/sac2008/. - Proceedings and special issue Accepted full papers will be published by ACM in the annual conference proceedings, with the option (at additional expense) to add 3 more pages. Accepted poster papers will be published as extended 2-page abstracts in the same proceedings. Please note that full registration is required for paper and poster inclusion in the conference proceedings and CD. Student registration does not cover paper and poster inclusion in the conference proceedings, but it is only intended to encourage student attendance. Finally, as it is customary, after the conference the accepted full papers will be selected for publication in a journal special issue. - Track Co-Chairs Davide Ancona (davide at disi.unige.it) DISI, University of Genova, Italy Alex Buckley (Alex.Buckley at Sun.COM) Sun Microsystems, USA - Program Committee * Eric Allen, Sun Microsystems Laboratories, USA * Lorenzo Bettini, University of Firenze, Italy * Kim Bruce, Pomona College, USA * Luis Caires, Universidade Nova de Lisboa, Portugal * Patrice Chalin, Concordia University, Canada * Shigeru Chiba, Tokyo Institute of Technology, Japan * Curtis Clifton, Rose-Hulman Inst. of Tech., USA * Alessandro Coglio, Kestrel Institute, USA * Pascal Costanza, Vrije Universiteit Brussel, Belgium * Grzegorz Czajkowski, Google, USA * Susan Eisenbach, Imperial College, UK * Erik Ernst, University of Aarhus, Denmark * Atsushi Igarashi, Kyoto University, Japan * Doug Lea, Suny Oswego, USA * Francesco Logozzo, Microsoft Research, USA * Matthew Parkinson, University of Cambridge, UK * Giovanni Rimassa, Whitestein Technologies, Switzerland * Don Syme, Microsoft Research, UK From tkt at imm.dtu.dk Thu Jun 14 16:33:45 2007 From: tkt at imm.dtu.dk (Terkel K. Tolstrup) Date: Thu, 14 Jun 2007 22:33:45 +0200 (CEST) Subject: [TYPES/announce] SAS 2007: Call for Participation Message-ID: <63329.62.243.82.133.1181853225.squirrel@www2.imm.dtu.dk> ****************************************************************** Call for Participation SAS 2007 - LOPSTR 2007 - PLID 2007 Kongens Lyngby, Denmark ****************************************************************** IMPORTANT DATES: Early registration: July 2, 2007 ****************************************************************** LOPSTR 2007, August 22-24 International Symposium on Logic-based Program Synthesis and Transformation http://www.cs.kent.ac.uk/events/conf/2007/lopstr/ SAS 2007, August 22-24 Static Analysis Symposium http://www.imm.dtu.dk/sas2007 Talks schedule: http://www.imm.dtu.dk/sas2007/program.htm PLID 2007, August 21 Workshop on Programming Language Interference and Dependence http://www.dcs.kcl.ac.uk/pg/cmu/plid07/ REGISTRATION Please register online at http://palace.imm.dtu.dk/SASLOPSTR/ The early registration deadline is July 2, 2007. -- Terkel K. Tolstrup, PhD Assistant Professor, IMM, DTU http://www.imm.dtu.dk/~tkt From icfp.publicity at googlemail.com Fri Jun 15 10:53:28 2007 From: icfp.publicity at googlemail.com (Matthew Fluet (ICFP Publicity Chair)) Date: Fri, 15 Jun 2007 09:53:28 -0500 Subject: [TYPES/announce] ICFP07 Accepted Papers Message-ID: <53ff55480706150753p6b6825bcm777faf5d5ae332f7@mail.gmail.com> Accepted Papers ICFP 2007: International Conference on Functional Programming http://www.informatik.uni-bonn.de/~ralf/icfp07.html Freiburg, Germany, 1-3 October 2007 The ICFP 2007 Program Chair and Committee are pleased to announce that the following papers have been accepted for the conference. Additional information regarding the final program, invited speakers, and registration will be forthcoming. However, the Local Arrangements Chair offers the following advice regarding hotel reservations: * As September and October is Freiburg's main tourist season, it is important that participants book hotel rooms early. The blocks of hotel rooms reserved for ICFP participants will be held until August 1. It is expected that many downtown hotels will be fully booked at the time of the conference. [However, there should be little to no penalty for cancelling a hotel room reservation after August 1.] More details regarding accommodation and travel may be obtained from the ICFP 2007 Local Information webpage: http://proglang.informatik.uni-freiburg.de/ICFP2007/ Accepted papers ~~~~~~~~~~~~~~~ A Generic Usage Analysis with Subeffect Qualifiers by Jurriaan Hage, Stefan Holdermans, Arie Middelkoop Experience Report: A Haskell interpreter for CellML by Jonathan Cooper, Steve McKeever A type directed translation of MLF to System-F by Daan Leijen A Type System for Recursive Modules by Derek Dreyer Adding Delimited and Composable Control to a Production Programming Environment by Matthew Flatt, Gang Yu, Robert Bruce Findler, Matthias Felleisen Bidirectionalization Transformation based on Automatic Derivation of View Complement Functions by Kazutaka Matsuda, Zhenjiang Hu, Keisuke Nakano, Makoto Hamana, Masato Takeichi Experience Report: Building an Eclipse-based IDE for Haskell by Leif Frenzel Compiling with Continuations, Continued by Andrew J. Kennedy Constructor specialisation for Haskell programs by Simon Peyton Jones Evaluating High-Level Distributed Language Constructs by Jan Nystrom, Phil Trinder, David King Extensible Pattern Matching via a Lightweight Language Extension by Don Syme, Gregory Neverov, James Margetson Faster laziness using dynamic pointer tagging by Simon Marlow, Alexey Rodriguez, Simon Peyton Jones Feedback Directed Implicit Parallelism by Tim Harris, Satnam Singh Finger Trees in Russell by Matthieu Sozeau Functional Pearl: The Great Escape by David Herman Experience Report: Functional Programming in C-Rules by Jeremy Wazny Inductive Reasoning about Effectful Data Types by Andrzej Filinski, Kristian Stoevring iTasks: Executable Specifications of Interactive Work Flow Systems for the Web by Rinus Plasmeijer, Peter Achten, Pieter Koopman Lazy Call-By-Value Evaluation by Frank Huch, Bernd Brassel, Sebastian Fischer, Michael Hanus, German Vidal McErlang: A Model Checker for a Distributed Functional Programming Language by Lars-?ke Fredlund, Hans Svensson On Barron and Strachey's Cartesian Product Function by Michael Spivey, Olivier Danvy Ott: Effective Tool Support for the Working Semanticist by Peter Sewell, Francesco Zappa Nardelli, Scott Owens, Gilles Peskine, Thomas Ridge, Susmit Sarkar, Rok Strnisa Relating Complexity and Precision in Control Flow Analysis by David Van Horn, Harry Mairson Experience Report: Scheme in Commercial Web Application Development by Noel Welsh, David Gurnell Stream Fusion: From Lists to Streams to Nothing at All by Duncan Coutts, Roman Leshchinskiy, Don Stewart Tangible Functional Programming by Conal Elliott Termination Analysis and Call Graph Construction for Higher-Order Functional Programs by Damien Sereni The Portable R6RS Syntax System by Abdulaziz Ghuloum, R. Kent Dybvig Experience Report: The Reactis Validation Tool by Steve Sims, Daniel C. DuVarney Type-safe Higher-order Channels in ML-like Languages by Sungwoo Park User-Friendly Functional Programming for Web Mashups by Rob Ennals, David Gay Experience Report: Using Functional Programming to Manage a Linux Distribution by Clifford Beshers, David Fox, Jeremy Shaw -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070615/9b0a8e2c/attachment.htm From Oege.de.Moor at comlab.ox.ac.uk Sun Jun 17 13:50:48 2007 From: Oege.de.Moor at comlab.ox.ac.uk (Oege.de.Moor@comlab.ox.ac.uk) Date: Sun, 17 Jun 2007 17:50:48 GMT Subject: [TYPES/announce] PhD on refactoring at Oxford Message-ID: <200706171750.l5HHompI029819@mercury.comlab.ox.ac.uk> UNIVERSITY OF OXFORD COMPUTING LABORATORY Programming Tools Group Oxford University Computing Laboratory has a fully funded three year research studentship working in the Programming Tools Group with the abc team: http://progtools.comlab.ox.ac.uk http://aspectbench.org PROJECT SUMMARY Software systems are rarely written from scratch: they evolve over long periods of time. When a change is made, this often affects many different locations in a system, and it is hard to make a change consistently. For that reason, automated tools to help the process of software change are desirable. "Refactoring" refers to the process of restructuring an existing piece of software, often prior to introducing new functionality, or to take advantage of a new technology. Refactoring must preserve the behaviour of existing code, and tools that help in refactoring both assist in the restructuring process and in checking that the behaviour has not changed. Unfortunately today's refactoring tools are very hard to construct, they are still quite limited in functionality, and they often contain bugs. This project aims to construct a framework for better refactoring tools. In particular, the work is driven by refactorings for a new set of language features, called `aspect-oriented programming' that have recently been added to Java. Our framework will be based on developments in three separate areas of computer science: * "strategies" to control the process of rewriting program code, from the term rewriting community * "reference attribute grammars" to specify the conditions that guarantee behaviour is preserved, from the compilers community * "incremental evaluation" of declarative rules, from the functional and logic programming community. The quality of our framework will be assessed by coding selected case studies using alternative methods. In particular, we shall implement several refactorings directly in Eclipse, the leading development environment for writing aspect-oriented programs in industry. SELECTION CRITERIA The PhD student will be concerned with the theoretical foundations of the refactoring framework, for instance proofs of correctness for refactorings, and also for the incremental evaluation mechanism. We are thus looking for someone with good mathematical skills, in particular regarding formal properties of type systems and program analyses. Candidates must have an outstanding undergraduate or master's degree in computer science. More generally, candidates must satisfy the usual requirements: http://web.comlab.ox.ac.uk/oucl/prospective/dphil/dphil-criteria.pdf for doing a doctorate at Oxford. HOW TO APPLY The deadline for applications has been extended to July 17, 2007, but earlier applications will be reviewed immediately, so candidates are encouraged to apply as soon as possible. Previous applicants need not re-apply. To apply you need to download the University's application form from: http://www.admin.ox.ac.uk/postgraduate/apply/forms You will need to submit references and a transcript with your application. It is also required to submit a research proposal: in this proposal, please elaborate on the reasons why you are interested in this project, and the research questions you find most exciting and important to address within the scope of the project. To make a convincing proposal, you may wish to consult some of the suggested reading below. Please submit your application to: Mrs. Julie Sheppard Secretary for Graduate Studies Oxford University Computing Laboratory Wolfson Building Parks Road Oxford OX1 3QD United Kingdom AND NOT TO THE ADDRESS ON THE APPLICATION FORM FURTHER INFORMATION We are happy to discuss any of the above informally with prospective candidates. Just email one or all of the project leaders: Oege de Moor (oege at comlab.ox.ac.uk) Torbjorn Ekman (torbjorn at comlab.ox.ac.uk) Mathieu Verbaere (matv at comlab.ox.ac.uk) SUGGESTED READING Avgustinov et al, Semantics of Static Pointcuts in AspectJ, POPL 2007 http://progtools.comlab.ox.ac.uk/members/oege/publications/documents/pcsemantics.pdf Ekman and Hedin. Rewritable Reference Attributed Grammars, ECOOP 2004. http://www.cs.lth.se/gorel/publications/2004-ReRAGs-LNCS.pdf Verbaere, Ettinger and De Moor. JunGL: a Scripting Language forRefactoring, ICSE 2006 http://progtools.comlab.ox.ac.uk/publications/icse06jungl Visser. Program Transformation with Stratego/XT: Rules, Strategies, Tools and Systems in StrategoXT-0.9. Domain-specific program generation. http://www.cs.uu.nl/research/techreps/UU-CS-2004-011.html From igarashi at kuis.kyoto-u.ac.jp Mon Jun 18 10:11:55 2007 From: igarashi at kuis.kyoto-u.ac.jp (Atsushi Igarashi) Date: Mon, 18 Jun 2007 23:11:55 +0900 Subject: [TYPES/announce] FOOL2008 Call for Papers Message-ID: <877iq1l5ck.wl%igarashi@kuis.kyoto-u.ac.jp> Call For Papers 2008 International Workshop on Foundations of Object-Oriented Languages (FOOL '08) Sponsored by ACM SIGPLAN Sunday, 13 January 2008 San Francisco, California, USA Following POPL '08 http://fool08.kuis.kyoto-u.ac.jp/ Deadlines Submissions: Monday, 8 October 2007 Notifications: Monday, 26 November 2007 Final versions: Monday, 17 December 2007 Workshop Description The search for sound principles for object-oriented languages has given rise to much work during the past two decades, leading to a better understanding of the key concepts of object-oriented languages and to important developments in type theory, semantics, program verification, and program development. FOOL became FOOL/WOOD in 2006, joining forces with the Workshop on Object-Oriented Developments. Although this year the name returns to FOOL, it is the third workshop in that successful merger. FOOL'08 will be held in San Francisco, California, USA on Sunday, 13 January 2008, the day after POPL. Submissions for this event are invited in the general area of foundations of object-oriented languages and program analysis. Topics of interest include language semantics, type systems, program analysis and verification, formal calculi, concurrent and distributed languages, database languages, and language-based security issues. Papers are welcome to include formal descriptions and proofs, but these are not required; the key consideration is that papers should present novel and valuable ideas or experiences. The main focus in selecting workshop contributions will be the intrinsic interest and timeliness of the work, so authors are encouraged to submit polished descriptions of work in progress as well as papers describing completed projects. A web page will be created and made available as an informal electronic proceedings. Historically, presentation at FOOL (or FOOL/WOOD) does not count as prior publication, and many of the results presented at FOOL have later been published at ECOOP, OOPSLA, POPL, and other conferences. Submission Instructions We solicit submissions on original research not previously published or currently submitted for publication elsewhere. The program chair should be informed of any related submissions; see the ACM SIGPLAN Republication Policy (http://www.acm.org/sigs/sigplan/republicationpolicy.htm). Submissions should be PDF or PostScript in standard SIGPLAN 9pt conference format for a US-letter size page. Templates are available at http://www.acm.org/sigs/sigplan/authorInformation.htm . While submissions can be up to 12 pages, shorter papers describing promising preliminary work are also encouraged. More detailed submission instructions will be announced on the workshop web site at http://fool08.kuis.kyoto-u.ac.jp/. Program Chair Atsushi Igarashi (Kyoto University) e-mail: fool08 at kuis.kyoto-u.ac.jp Program Committee Jonathan Aldrich (Carnegie Mellon University) Susan Eisenbach (Imperial College) Manuel Fahndrich (Microsoft Research) Cormac Flanagan (University of California, Santa Cruz) Matthew Flatt (University of Utah) Jacques Garrigue (Nagoya University) Matthew Parkinson (University of Cambridge) Julian Rathke (University of Southampton) Frank Tip (IBM) Tobias Wrigstad (Stockholm University) Steering Committee Viviana Bono (Universita` di Torino) Michele Bugliesi (Universita` Ca' Foscari) Kathleen Fisher (AT&T Labs) Benjamin Pierce (University of Pennsylvania) John Reppy (University of Chicago) Christopher Stone (Harvey Mudd College) [Chair] Philip Wadler (University of Edinburgh) From tarmo at cs.ioc.ee Sat Jun 16 17:12:36 2007 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Sun, 17 Jun 2007 00:12:36 +0300 Subject: [TYPES/announce] Postdoc position at IoC, Tallinn Message-ID: <20070616211522.53C7FBF088@sool.cc.ioc.ee> Postdoc position at Institute of Cybernetics, Tallinn A postdoc position is available in the logic and semantics group of the Institute of Cybernetics (IoC), the Tallinn University of Technology, within the EU IST FP6 integrated project MOBIUS, on proof-carrying code technology. IoC is a semi-autonomous interdisciplinary research institute of the Tallinn University of Technology specializing in control science, mechanics and computer science. In computer science, IoC is the leading research institution in Estonia. The logic and semantics group is active in program logics and certified software, functional programming and coalgebraic methods. Apart from MOBIUS, the group participated in APPSEM II, is participating in TYPES and was the organizing team behind APPSEM 2004, AFP 2004, TFP/ICFP/GPCE 2005, MPC/AMAST 2006. For MOBIUS, the group is working on program analyses and optimizations for low-level stack-based languages, on type-systematic description of program analyses and optimizations, and on transformation of proofs of programs alongside their optimization. The position is for two years, the preferred start date is 1 Sept 2007. For closer information about the position and the research environment, contact Dr Tarmo Uustalu, tarmo at cs.ioc.ee. To apply, email us your CV and publication list no later than 15 July 2007. From Belaid.Benhamou at cmi.univ-mrs.fr Sun Jun 17 11:47:02 2007 From: Belaid.Benhamou at cmi.univ-mrs.fr (benhamou) Date: Sun, 17 Jun 2007 17:47:02 +0200 Subject: [TYPES/announce] Reminder: CFP of SymCon'07 In-Reply-To: <458C0FEC.4030407@cmi.univ-mrs.fr> References: <200601291711.k0THB45e018819@birkhoff.cas.mcmaster.ca> <458C0FEC.4030407@cmi.univ-mrs.fr> Message-ID: <46755776.3010804@cmi.univ-mrs.fr> We apologize for multiple copies of this Call. ================================================================ Call for Papers SymCon'07 The Seventh International Workshop on Symmetry and Constraint Satisfaction Problems (http://www.cmi.univ-mrs.fr/~benhamou/symcon07/) To be held at the Thirteenth International Conference on Principles and Practice of Constraint Programming (CP 2007) Providence, RI, USA September 23rd 2007 ================================================================ WORKSHOP DESCRIPTION -------------------- SymCon'07 is the 7th in a series of workshops affiliated with the CP conference, and focuses on the investigation of symmetry and symmetry breaking techniques for Constraint Satisfaction Problems (CSPs). Symmetries occur frequently in CSPs. When undetected, they cause thrashing during traditional backtracking search by redundantly exploring symmetric parts of the search space. The topic was discussed as far back as 1874 by Glaisher, and new techniques to detect and/or break symmetry have been proposed in recent years. However, many outstanding problems remain. For instance, the detection and exploitation of local, dynamic, and weak forms of symmetry remains a challenge. The workshop is a forum for researchers to present advances in symmetry breaking techniques and to discuss the above or other open problems. Additionally, the workshop welcomes the presentation of applications and case studies that exhibit some form of symmetry. The workshop is relevant to the computational group theory (CGT) community because CGT is often the theory underlying many symmetry breaking techniques. Importantly, the organizers welcome submissions from researchers working in other areas of Artificial Intelligence who feel that their work would be of interest to the CP community. Such areas include planning, model checking, QBF formulas, finite model search, and theorem proving in FOL. Workshop topics include, but are not limited to: - Symmetry definition: semantic symmetry, syntactic symmetry, constraint symmetry, solution symmetry - Automatic symmetry detection: static approaches and dynamic approaches - Global symmetry detection and elimination - Dynamic symmetry detection and elimination - Combining symmetry breaking techniques - Exploiting weak forms of symmetries like "dominance" and "almost-symmetries" - Case studies of problems that exhibit interesting symmetries - Application of computational group theory techniques to symmetry breaking - Heuristics that use information about symmetry to guide search - Elimination and avoidance of symmetry by re-modelling - Dynamic avoidance of symmetric states during search - Complexity analysis of symmetry breaking techniques - Application of CSPs to symmetry and related algebraic problems - Comparing symmetry breaking techniques in constraint programming with techniques for dealing with symmetry in other search domains - Symmetry in CNF formulas and OBF formulas - Symmetry in finite model search in first order logic - Novel exploitation of symmetry in varied search domains of interest to the CP community ATTENDANCE ---------- The workshop is open to all members of the CP community. At least one author of each submission accepted for presentation must attend the workshop and present the contribution. All workshop attendees must pay the workshop fee. PAPER SUBMISSION ---------------- To submit a paper to the workshop, please e-mail a PS or PDF file in IJCAI03 style to both Belaid.Benhamou at cmi.univ-mrs.fr and symcon07 at cmi.univ-mrs.fr. Style files can be obtained at http://www.cmi.univ-mrs.fr/~benhamou/symcon07/ Papers must be formated in IJCAI requirements and can be of any length but should not exceed 8 pages. All submissions must be received by June 22nd, 2007. The Program Committee Chairs will acknowledge all submissions. If a submitted paper is not acknowledged in 2 working days, the authors are kindly requested to contact one of the chairs. SELECTION PROCESS ----------------- All submissions will be reviewed. Those that present a significant contribution to the workshop topics will be accepted for publication in the workshop proceedings. The proceedings will be available electronically at the workshop web-page and in hardcopy at CP 2007. If necessary, for time reasons, only a subset of the papers will be presented. A selection will then be made by the Program Committee Chairs. Post-publication of the proceedings is currently under negotiation. IMPORTANT DATES --------------- Submission deadline: Friday, 22nd June 2007 Notification of acceptance: Tuesday, 17th July 2007 Camera ready deadline: Friday, 3rd August 2007 Workshop: Monday, 23rd We apologize for multiple copies of this Call. ================================================================ Call for Papers SymCon'07 The Seventh International Workshop on Symmetry and Constraint Satisfaction Problems (http://www.cmi.univ-mrs.fr/~benhamou/symcon07/) To be held at the Thirteenth International Conference on Principles and Practice of Constraint Programming (CP 2007) Providence, RI, USA September 23rd 2007 ================================================================ WORKSHOP DESCRIPTION -------------------- SymCon'07 is the 7th in a series of workshops affiliated with the CP conference, and focuses on the investigation of symmetry and symmetry breaking techniques for Constraint Satisfaction Problems (CSPs). Symmetries occur frequently in CSPs. When undetected, they cause thrashing during traditional backtracking search by redundantly exploring symmetric parts of the search space. The topic was discussed as far back as 1874 by Glaisher, and new techniques to detect and/or break symmetry have been proposed in recent years. However, many outstanding problems remain. For instance, the detection and exploitation of local, dynamic, and weak forms of symmetry remains a challenge. The workshop is a forum for researchers to present advances in symmetry breaking techniques and to discuss the above or other open problems. Additionally, the workshop welcomes the presentation of applications and case studies that exhibit some form of symmetry. The workshop is relevant to the computational group theory (CGT) community because CGT is often the theory underlying many symmetry breaking techniques. Importantly, the organizers welcome submissions from researchers working in other areas of Artificial Intelligence who feel that their work would be of interest to the CP community. Such areas include planning, model checking, QBF formulas, finite model search, and theorem proving in FOL. Workshop topics include, but are not limited to: - Symmetry definition: semantic symmetry, syntactic symmetry, constraint symmetry, solution symmetry - Automatic symmetry detection: static approaches and dynamic approaches - Global symmetry detection and elimination - Dynamic symmetry detection and elimination - Combining symmetry breaking techniques - Exploiting weak forms of symmetries like "dominance" and "almost-symmetries" - Case studies of problems that exhibit interesting symmetries - Application of computational group theory techniques to symmetry breaking - Heuristics that use information about symmetry to guide search - Elimination and avoidance of symmetry by re-modelling - Dynamic avoidance of symmetric states during search - Complexity analysis of symmetry breaking techniques - Application of CSPs to symmetry and related algebraic problems - Comparing symmetry breaking techniques in constraint programming with techniques for dealing with symmetry in other search domains - Symmetry in CNF formulas and OBF formulas - Symmetry in finite model search in first order logic - Novel exploitation of symmetry in varied search domains of interest to the CP community ATTENDANCE ---------- The workshop is open to all members of the CP community. At least one author of each submission accepted for presentation must attend the workshop and present the contribution. All workshop attendees must pay the workshop fee. PAPER SUBMISSION ---------------- To submit a paper to the workshop, please e-mail a PS or PDF file in IJCAI03 style to both Belaid.Benhamou at cmi.univ-mrs.fr and symcon07 at cmi.univ-mrs.fr. Style files can be obtained at http://www.cmi.univ-mrs.fr/~benhamou/symcon07/ Papers must be formated in IJCAI requirements and can be of any length but should not exceed 8 pages. All submissions must be received by June 22nd, 2007. The Program Committee Chairs will acknowledge all submissions. If a submitted paper is not acknowledged in 2 working days, the authors are kindly requested to contact one of the chairs. SELECTION PROCESS ----------------- All submissions will be reviewed. Those that present a significant contribution to the workshop topics will be accepted for publication in the workshop proceedings. The proceedings will be available electronically at the workshop web-page and in hardcopy at CP 2007. If necessary, for time reasons, only a subset of the papers will be presented. A selection will then be made by the Program Committee Chairs. Post-publication of the proceedings is currently under negotiation. IMPORTANT DATES --------------- Submission deadline: Friday, 22nd June 2007 Notification of acceptance: Tuesday, 17th July 2007 Camera ready deadline: Friday, 3rd August 2007 Workshop: Monday, 23rd September 2007 PROGRAM COMMITTEE CHAIRS ------------------------ - Bela?d Benhamou Universit? de Provence (Aix-Marseille I) LSIS-CMI, 39 F. Joliot-Curie 13453 Marseille Cedex13 France. Email: Belaid.Benhamou at cmi.univ-mrs.fr - Berthe Y. Choueiry 256 Avery Hall Constraint Systems Laboratory CSE--University of Nebraska-Lincoln Lincoln, NE, 68588-0115, USA Email: choueiry at cse.unl.edu - Brahim Hnich Faculty of Computer Sciences Izmir University of Economics Sakarya Caddesi No:156, 35330 balcova Izmir, Turkey Email: brahim.hnich at ieu.edu.tr PROGRAM COMMITTEE ----------------- - Fadi A. Aloul, American University of Sharjah, U.A.E - Gilles Audemard, Universit? d'Artois, France. - Rolf Backofen, Albert-Ludwigs-University, Germany - Pierre Flener, Sabanci University, Turkey and Uppsala University, Sweden - Zeynep Kiziltan, University of Bologna, Italy - Derek Long, University of Strathclyde, Glasgow, UK - Igor Markov, University of Michigan, U.S.A. - Pedro Meseguer, Universitat Autonoma de Barcelona, Spain. - Michela Milano, University of Bologna, Italy - Justin Pearson, Uppsala University, Sweden - Karen Petrie, Oxford University, UK - Steve Prestwich, University College Cork, Ireland - Jean-Fran?ois Puget, ILOG, France - Lakhdar Sais, Universit? d'Artois, France. - Pierre Seigel, University of Provence, Aix-Marseille I, France - Meinolf Sellmann, Brown University, U.S.A. - Barbara Smith, Cork Constraint Computation Centre, Irland. - Pascal van Hentenryck, Brown University, U.S.A. - Toby Walsh, University of New South Wales, Australia September 2007 PROGRAM COMMITTEE CHAIRS ------------------------ - Bela?d Benhamou Universit? de Provence (Aix-Marseille I) LSIS-CMI, 39 F. Joliot-Curie 13453 Marseille Cedex13 France. Email: Belaid.Benhamou at cmi.univ-mrs.fr - Berthe Y. Choueiry 256 Avery Hall Constraint Systems Laboratory CSE--University of Nebraska-Lincoln Lincoln, NE, 68588-0115, USA Email: choueiry at cse.unl.edu - Brahim Hnich Faculty of Computer Sciences Izmir University of Economics Sakarya Caddesi No:156, 35330 balcova Izmir, Turkey Email: brahim.hnich at ieu.edu.tr PROGRAM COMMITTEE ----------------- - Fadi A. Aloul, American University of Sharjah, U.A.E - Gilles Audemard, Universit? d'Artois, France. - Rolf Backofen, Albert-Ludwigs-University, Germany - Pierre Flener, Sabanci University, Turkey and Uppsala University, Sweden - Zeynep Kiziltan, University of Bologna, Italy - Derek Long, University of Strathclyde, Glasgow, UK - Igor Markov, University of Michigan, U.S.A. - Pedro Meseguer, Universitat Autonoma de Barcelona, Spain. - Michela Milano, University of Bologna, Italy - Justin Pearson, Uppsala University, Sweden - Karen Petrie, Oxford University, UK - Steve Prestwich, University College Cork, Ireland - Jean-Fran?ois Puget, ILOG, France - Lakhdar Sais, Universit? d'Artois, France. - Pierre Seigel, University of Provence, Aix-Marseille I, France - Meinolf Sellmann, Brown University, U.S.A. - Barbara Smith, Cork Constraint Computation Centre, Irland. - Pascal van Hentenryck, Brown University, U.S.A. - Toby Walsh, University of New South Wales, Australia From thomas.ehrhard at pps.jussieu.fr Mon Jun 18 17:16:47 2007 From: thomas.ehrhard at pps.jussieu.fr (Thomas Ehrhard) Date: Mon, 18 Jun 2007 23:16:47 +0200 Subject: [TYPES/announce] Jean-Yves Girard's Festschrift Message-ID: <4676F63F.8010003@pps.jussieu.fr> In honour of Jean-Yves Girard on the occasion of his 60th birthday year, a Festschrift will be published as a special issue of Theoretical Computer Science, where the "Linear Logic" paper was published twenty years ago. The Festschrift follows the two events organized in Siena (http://www.unisi.it/eventi/LOGIC/) and in Paris (http://www-lipn.univ-paris13.fr/jyg60/) this year. Submissions for this special issue are welcome from all the participants to the workshops as well as from other contributors. More details at: http://www.pps.jussieu.fr/~laurent/girard60/ The guest editors, Thomas Ehrhard (thomas.ehrhard at pps.jussieu.fr) Claudia Faggian (claudia.faggian at pps.jussieu.fr) Olivier Laurent (olivier.laurent at pps.jussieu.fr) From sanjiva at cse.iitd.ernet.in Tue Jun 19 08:34:08 2007 From: sanjiva at cse.iitd.ernet.in (sanjiva@cse.iitd.ernet.in) Date: Tue, 19 Jun 2007 18:04:08 +0530 (IST) Subject: [TYPES/announce] Deadline extension: FST TCS 2007 (June 20 2007) In-Reply-To: <466E4C5A.3070506@cse.iitd.ac.in> References: <466E4C5A.3070506@cse.iitd.ac.in> Message-ID: <64816.10.200.2.74.1182256448.squirrel@www.cse.iitd.ernet.in> [Apologies for multiple mailings. This announcement is likely to be of interest to subscribers of various lists] In response to several requests for a 2-3 day extension, the submission deadline has been extended to 20 June 2007. CALL FOR PAPERS (FSTTCS 2007) Foundations of Software Technology and Theoretical Computer Science December 12--14, 2007, New Delhi, India IARCS, the Indian Association for Research in Computing Science, announces the 27th Annual FSTTCS Conference in New Delhi. The FSTTCS conference is a forum for presenting original results in foundational aspects of Computer Science and Software Technology. As in the past, it is expected that the conference proceedings will be published by Springer-Verlag as Lecture Notes in Computer Science (LNCS). The Proceedings of the 2006 conference were published as LNCS 4337. Confirmed invited speakers: Maurice Herlihy, Richard Karp, Benjamin Pierce, Thomas Reps, Salil Vadhan, and Andrew Yao. In addition to invited talks and contributed papers, the FSTTCS 2007 programme will include two one-day workshops in areas of current interest on Dec 11 and Dec 15, 2007. Authors are invited to submit papers presenting original and unpublished research in any area of Theoretical Computer Science or Foundational aspects of Software Technology. Representative areas include, but are not limited to: > Automata, Languages and Computability; > Automated Reasoning, Rewrite Systems, and Applications; > Combinatorial Optimization; > Computational Biology; > Computational Complexity; > Computational Geometry; > Concurrency Theory; > Cryptography and Security Protocols; > Database Theory and Information Retrieval; > Data Structures; > Graph and Network Algorithms; > Logic, Proof Theory, Model Theory and Applications; > Logics of Programs and Temporal Logics; > New Models of Computation; > Parallel and Distributed Computing; > Programming Language Design and Semantics; > Randomized and Approximation Algorithms; > Software Specification and Verification; > Timed and Hybrid Systems; > Type Systems Authors may submit drafts of full papers or extended abstracts. Submissions are limited to 12 pages in LNCS style (see the conference site for full details). Proofs omitted due to space constraints may be put into a clearly marked appendix (but the paper should be intelligible without the appendix, as reviewers are not required to read appendices). Concurrent submission to other conferences / journals is not acceptable. Electronic submission is very strongly recommended. Details will be made available at the conference site http://www.fsttcs.org . For an accepted paper to be included in the proceedings, one of the authors must commit to presenting the paper at the conference. Important dates: New Submission Deadline : 20 June 2007 (anywhere in the world) Notification to Authors : 19 Aug 2007 Final Version due : 17 Sep 2007 Programme Committee: Roberto Amadio (Univ. Paris 7) V. Arvind (IMSc, Chennai), co-chair Iliano Cervesato (CMU, Qatar) Supratik Chakraborty (IIT Bombay) Sunil Chandran (IISc, Bangalore) Samir Datta (CMI, Chennai) Deepak D'Souza (IISc, Bangalore) Sumit Ganguly (IIT Kanpur) Rajeev Gore (ANU and NICTA) Aarti Gupta (NEC Labs, Princeton) Vineet Gupta (Google, Bangalore) Prasad Jayanti (Dartmouth College) Ranjit Jhala (UC San Diego) Deepak Kapur (U. New Mexico) Subhash Khot (Georgia Tech., Atlanta) Johannes Koebler (Humboldt U., Berlin) K. Narayan Kumar (CMI, Chennai) Kim G. Larsen (Aalborg U) Satya Lokam (Microsoft Research) Greg Morrissett (Harvard, Cambridge) Sanjiva Prasad (IIT Delhi), co-chair Shaz Qadeer (Microsoft Research) S. Srinivasa Rao (ITU, Copenhagen) Pranab Sen (TIFR, Mumbai) Helmut Seidl (TU Munchen) Aravind Srinivasan (U. Maryland) C.R. Subramanian (IMSc, Chennai) Denis Therien (McGill U., Montr e al) Ashish Tiwari (SRI, Palo Alto) Vinodchandran Variyam (U. Nebraska) Heribert Vollmer (U. Hannover) Hongseok Yang (QMU, London) Addresses for Correspondence Submissions: Email : fsttcs at imsc.res.in Phone: +91 44 2254 1856 Fax: +91 44 2254 1586 Local Arrangements: FSTTCS '07 Department of Computer Science and Engineering Indian Institute of Technology Delhi Hauz Khas, New Delhi 110016, INDIA Phone: +91 11 2659 1294 Fax: +91 11 2658 1060 URL: http://www.fsttcs.org From icalp08 at ru.is Wed Jun 20 23:11:40 2007 From: icalp08 at ru.is (Icalp08) Date: Thu, 21 Jun 2007 03:11:40 -0000 Subject: [TYPES/announce] ICALP 2008, Reykjavik: Call for Workshops Message-ID: <6F0C4D2AFE6B784CAE783EEE545EB06601A603FC@nike.hir.is> *** Apologies for multiple copies *** ______________________________________________________________________ 35th International Colloquium on Automata, Languages and Programming ICALP 2008 Reykjavik - Iceland Call for Affiliated Workshops Conference Dates: July 7-11, 2008 Affiliated Workshop Dates: July 6, 12, and 13, 2008 ______________________________________________________________________ Researchers and practitioners are invited to submit proposals for workshops on topics related to the conference tracks, namely: Algorithms, Automata, Complexity and Games (track A); Logic, Semantics, and Theory of Programming (track B); and Security and Cryptography Foundations (track C). The purpose of the workshops is to provide participants with a forum for presenting and discussing novel ideas in a small and interactive atmosphere. The main responsibility of organising a workshop goes to the chairperson of the workshop. The format of each workshop is determined by its organisers. The workshop proposals will be selected by the ICALP organization, under advice of the ICALP PC chairs and EATCS. Registrations for the workshops affiliated with ICALP 2008 will be handled by the ICALP organizing committee. Proposals should include: * Name and duration (from half a day to two days) of the proposed workshop. * Preference for a pre- or post-conference workshop, if any. (Note, however, that the final choice of the day when the workshop will be held and other logistic aspects will be decided by the organizing committee.) * A short scientific summary of the topic, including a discussion on the relation with the ICALP topics. * A description of past versions of the workshop, if any, including dates, organisers, submission and acceptance counts, attendance. * Procedures for selecting participants and papers, and expected number of participants. * Plans for dissemination (for example, published proceedings or special issues of journals). IMPORTANT DATES: October 31, 2007: Deadline for submitting workshop proposals November 21, 2007: Notification of acceptance Workshop proposals must be submitted in plain text, PDF or Postscript format by e-mail to icalp08 at ru.is For further information consult the ICALP 2008 web site: http://www.ru.is/icalp08 or contact the ICALP 2008 Workshops Chairs: - Bjarni V. Halldorsson - MohammadReza Mousavi Vinsamlega athugi? a? uppl?singar ? t?lvup?sti ?essum og vi?hengi eru eing?ngu ?tla?ar ?eim sem p?stinum er beint til og g?tu innihaldi? uppl?singar sem eru tr?na?arm?l. Sj? n?nar: http://www.ru.is/trunadur Please note that this e-mail and attachments are intended for the named addresses only and may contain information that is confidential and privileged. Further information: http://www.ru.is/trunadur From Belaid.Benhamou at cmi.univ-mrs.fr Sat Jun 23 14:41:02 2007 From: Belaid.Benhamou at cmi.univ-mrs.fr (benhamou) Date: Sat, 23 Jun 2007 20:41:02 +0200 Subject: [TYPES/announce] New submission deadline for SymCon'07 (June 29th) In-Reply-To: <458EA81F.8070604@cmi.univ-mrs.fr> References: <458EA81F.8070604@cmi.univ-mrs.fr> Message-ID: <467D693E.4070202@cmi.univ-mrs.fr> Please notice that the new submission deadline for SymCon'07 is june 29th. We apologize for multiple copies of this Call. ================================================================ Call for Papers SymCon'07 The Seventh International Workshop on Symmetry and Constraint Satisfaction Problems (http://www.cmi.univ-mrs.fr/~benhamou/symcon07/) To be held at the Thirteenth International Conference on Principles and Practice of Constraint Programming (CP 2007) Providence, RI, USA September 23rd 2007 ================================================================ WORKSHOP DESCRIPTION -------------------- SymCon'07 is the 7th in a series of workshops affiliated with the CP conference, and focuses on the investigation of symmetry and symmetry breaking techniques for Constraint Satisfaction Problems (CSPs). Symmetries occur frequently in CSPs. When undetected, they cause thrashing during traditional backtracking search by redundantly exploring symmetric parts of the search space. The topic was discussed as far back as 1874 by Glaisher, and new techniques to detect and/or break symmetry have been proposed in recent years. However, many outstanding problems remain. For instance, the detection and exploitation of local, dynamic, and weak forms of symmetry remains a challenge. The workshop is a forum for researchers to present advances in symmetry breaking techniques and to discuss the above or other open problems. Additionally, the workshop welcomes the presentation of applications and case studies that exhibit some form of symmetry. The workshop is relevant to the computational group theory (CGT) community because CGT is often the theory underlying many symmetry breaking techniques. Importantly, the organizers welcome submissions from researchers working in other areas of Artificial Intelligence who feel that their work would be of interest to the CP community. Such areas include planning, model checking, QBF formulas, finite model search, and theorem proving in FOL. Workshop topics include, but are not limited to: - Symmetry definition: semantic symmetry, syntactic symmetry, constraint symmetry, solution symmetry - Automatic symmetry detection: static approaches and dynamic approaches - Global symmetry detection and elimination - Dynamic symmetry detection and elimination - Combining symmetry breaking techniques - Exploiting weak forms of symmetries like "dominance" and "almost-symmetries" - Case studies of problems that exhibit interesting symmetries - Application of computational group theory techniques to symmetry breaking - Heuristics that use information about symmetry to guide search - Elimination and avoidance of symmetry by re-modelling - Dynamic avoidance of symmetric states during search - Complexity analysis of symmetry breaking techniques - Application of CSPs to symmetry and related algebraic problems - Comparing symmetry breaking techniques in constraint programming with techniques for dealing with symmetry in other search domains - Symmetry in CNF formulas and OBF formulas - Symmetry in finite model search in first order logic - Novel exploitation of symmetry in varied search domains of interest to the CP community ATTENDANCE ---------- The workshop is open to all members of the CP community. At least one author of each submission accepted for presentation must attend the workshop and present the contribution. All workshop attendees must pay the workshop fee. PAPER SUBMISSION ---------------- To submit a paper to the workshop, please e-mail a PS or PDF file in IJCAI03 style to both Belaid.Benhamou at cmi.univ-mrs.fr and symcon07 at cmi.univ-mrs.fr. Style files can be obtained at http://www.cmi.univ-mrs.fr/~benhamou/symcon07/ Papers must be formated in IJCAI requirements and can be of any length but should not exceed 8 pages. All submissions must be received by June 29th, 2007. The Program Committee Chairs will acknowledge all submissions. If a submitted paper is not acknowledged in 2 working days, the authors are kindly requested to contact one of the chairs. SELECTION PROCESS ----------------- All submissions will be reviewed. Those that present a significant contribution to the workshop topics will be accepted for publication in the workshop proceedings. The proceedings will be available electronically at the workshop web-page and in hardcopy at CP 2007. If necessary, for time reasons, only a subset of the papers will be presented. A selection will then be made by the Program Committee Chairs. Post-publication of the proceedings is currently under negotiation. IMPORTANT DATES --------------- Submission deadline: Friday, 29th June 2007 Notification of acceptance: Tuesday, 17th July 2007 Camera ready deadline: Friday, 3rd August 2007 Workshop: Monday, 23rd PROGRAM COMMITTEE CHAIRS ------------------------ - Bela?d Benhamou Universit? de Provence (Aix-Marseille I) LSIS-CMI, 39 F. Joliot-Curie 13453 Marseille Cedex13 France. Email: Belaid.Benhamou at cmi.univ-mrs.fr - Berthe Y. Choueiry 256 Avery Hall Constraint Systems Laboratory CSE--University of Nebraska-Lincoln Lincoln, NE, 68588-0115, USA Email: choueiry at cse.unl.edu - Brahim Hnich Faculty of Computer Sciences Izmir University of Economics Sakarya Caddesi No:156, 35330 balcova Izmir, Turkey Email: brahim.hnich at ieu.edu.tr PROGRAM COMMITTEE ----------------- - Fadi A. Aloul, American University of Sharjah, U.A.E - Gilles Audemard, Universit? d'Artois, France. - Rolf Backofen, Albert-Ludwigs-University, Germany - Pierre Flener, Sabanci University, Turkey and Uppsala University, Sweden - Zeynep Kiziltan, University of Bologna, Italy - Derek Long, University of Strathclyde, Glasgow, UK - Igor Markov, University of Michigan, U.S.A. - Pedro Meseguer, Universitat Autonoma de Barcelona, Spain. - Michela Milano, University of Bologna, Italy - Justin Pearson, Uppsala University, Sweden - Karen Petrie, Oxford University, UK - Steve Prestwich, University College Cork, Ireland - Jean-Fran?ois Puget, ILOG, France - Lakhdar Sais, Universit? d'Artois, France. - Pierre Seigel, University of Provence, Aix-Marseille I, France - Meinolf Sellmann, Brown University, U.S.A. - Barbara Smith, Cork Constraint Computation Centre, Irland. - Pascal van Hentenryck, Brown University, U.S.A. - Toby Walsh, University of New South Wales, Australia From Pierre-Louis.Curien at pps.jussieu.fr Mon Jun 25 08:28:26 2007 From: Pierre-Louis.Curien at pps.jussieu.fr (Pierre-Louis Curien) Date: Mon, 25 Jun 2007 14:28:26 +0200 Subject: [TYPES/announce] summer school annoncement Message-ID: <13B4D9D3-41A6-4FF8-9915-48148635F754@pps.jussieu.fr> APPLIED SOFTWARE VERIFICATION LASER Summer School, Elba Island (Italy), 8-15 September 2007 Directors: Tony Hoare and Bertrand Meyer 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 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 applied, with a strong contribution from theory. The format of the school favors extensive interaction between participants and speakers. The school brings together six speakers, each closely involved with tools for verification: * Thomas Ball * G?rard Berry * Tony Hoare * Bertrand Meyer * Peter Mueller * Natarajan Shankar The style will be highly participative, with considerable use of verification tools and the use of a common case study. Participants will have the opportunity to become thoroughly familiar with these tools through both lectures and practical exercises. Registration is still possible; see http://se.ethz.ch/laser for details and online registration. G?rard Berry, Chief Scientist, Esterel Technologies 679, av, du Dr. J. Lefebvre , 06270 Villeneuve-Loubet, France +33 4 92 02 40 65 Gerard.Berry at esterel-technologies.com www.esterel-technologies.com -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070625/b60c5bc5/attachment.htm From gupta at utdallas.edu Tue Jun 26 16:41:25 2007 From: gupta at utdallas.edu (Gopal Gupta) Date: Tue, 26 Jun 2007 15:41:25 -0500 (CDT) Subject: [TYPES/announce] PADL 2008: Call for Papers Message-ID: CALL FOR PAPERS!!! Tenth International Symposium on Practical Aspects of Declarative Languages 2008 (PADL '08) http://www.ist.unomaha.edu/padl2008/ San Francisco, USA January 7-8, 2008 Co-located with ACM POPL'08 Declarative languages build on sound theoretical bases to provide attractive frameworks for application development. These languages have been successfully applied to vastly different real-world situations, ranging from data base management to active networks to software engineering to decision support systems. New developments in theory and implementation have opened up new application areas. At the same time, applications of declarative languages to novel problems raises numerous interesting research issues. Well-known questions include designing for scalability, language extensions for application deployment, and programming environments. Thus, applications drive the progress in the theory and implementation of declarative systems, and benefit from this progress as well. PADL is a forum for researchers and practitioners to present original work emphasizing novel applications and implementation techniques for all forms of declarative concepts, including, functional, logic, constraints, etc. Topics of interest include: * innovative applications of declarative languages; * declarative domain-specific languages and applications; * practical applications of theoretical results; * new language developments & their impact on applications; * evaluation of implementation techniques on practical applications; * novel uses of declarative languages in the classroom; and * practical experiences PADL 08 welcomes new ideas and approaches pertaining to applications and implementation of declarative languages. PADL 08 will be co-located with the ACM POPL. IMPORTANT DATES AND SUBMISSION GUIDELINES Paper Submission: August 24, 2007 Notification: September 27, 2007 Camera-ready: October 23, 2007 Symposium: January 7-8, 2008 Authors should submit an electronic copy of the full paper (written in English) in Postscript (Level 2) or PDF. Papers must be no longer than 15 pages, written in 11-point font and with single spacing. Since the final proceedings will be published as Lecture Notes in Computer Science by Springer Verlag, authors are strongly encouraged to use the LNCS paper formatting guidelines for their submission. Each submission must include on its first page the paper title; authors and their affiliations; contact author's email and postal addresses, telephone and fax numbers, abstract, and three to four keywords. The keywords will be used to assist us in selecting appropriate reviewers for the paper. If electronic submission is impossible, please contact the program chair for information on how to submit hard copies. MOST PRACTICAL PAPER AWARD The Most Practical Paper award will be given to the submission that is judged by the program committee to be the best in terms of practicality, originality, and clarity of presentation. The program committee may choose not to make an award, or to make multiple awards. Contacts: For information about papers and submissions, please contact the Program Chair: Paul Hudak PC co-Chair - PADL 2008 Department of Computer Science Yale University P.O. Box 208285 New Haven, CT 06520 - 8285 Email: hudak at cs.yale.edu David S. Warren PC co-Chair - PADL 2008 Department of Computer Science Stony Brook University Stony Brook, NY Email: warren at cs.sunysb.edu For other information about the conference, please contact: Hai-Feng Guo General Chair - PADL 2008 Department of Computer Science College of Information Science & Technology University of Nebraska at Omaha Omaha, NE, U.S.A. Email: haifengguo at mail.unomaha.edu Sponsored by: COMPULOG Americas (http://www.cs.nmsu.edu/~complog) and University of Nebraska at Omaha From icalp08 at ru.is Wed Jun 27 04:47:20 2007 From: icalp08 at ru.is (Icalp08) Date: Wed, 27 Jun 2007 08:47:20 -0000 Subject: [TYPES/announce] First Call for Papers --- ICALP 2008 Message-ID: <6F0C4D2AFE6B784CAE783EEE545EB06601A60406@nike.hir.is> ___________________________________________________________________ CALL FOR PAPERS - ICALP'08 35th International Colloquium on Automata, Languages and Programming July 6-13, 2008, Reykjavik, Iceland http://www.ru.is/icalp08 ___________________________________________________________________ The 35th International Colloquium on Automata, Languages and Programming, the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS), will take place from the 6th to the 13th of July 2008 in Reykjavik, Iceland. Following the successful experience of the last three editions, ICALP 2008 will complement the established structure of the scientific program based on Track A on Algorithms, Automata, Complexity and Games, and Track B on Logic, Semantics, and Theory of Programming, corresponding to the two main streams of the journal Theoretical Computer Science, with a special Track C on Security and Cryptography Foundations. The aim of Track C is to allow a deeper coverage of a particular topic, to be specifically selected for each year's edition of ICALP on the basis of its timeliness and relevance for the theoretical computer science community. In addition to the main conference, ICALP 2008 will also feature pre- and post-conference workshops on July 6, 12, and 13, 2008. A call for workshop is now open, and details on the submission of workshop proposals may be found at http://www.ru.is/icalp08/cfw.html. Papers presenting original research on all aspects of theoretical computer science are sought. Typical but not exclusive topics of interest are: Track A - Algorithms, Automata, Complexity and Games: * Algorithmic Aspects of Networks * Algorithmic Game Theory * Approximation Algorithms * Automata Theory * Combinatorics in Computer Science * Computational Biology * Computational Complexity * Computational Geometry * Data Structures * Design and Analysis of Algorithms * Internet Algorithmics * Machine Learning * Parallel, Distributed and External Memory Computing * Randomness in Computation * Quantum Computing Track B - Logic, Semantics, and Theory of Programming: * Algebraic and Categorical Models * Automata and Formal Languages * Emerging and Non-standard Models of Computation * Databases, Semi-Structured Data and Finite Model Theory * Principles of Programming Languages * Logics, Formal Methods and Model Checking * Models of Concurrent, Distributed, and Mobile Systems * Models of Reactive, Hybrid and Stochastic Systems * Program Analysis and Transformation * Specification, Refinement and Verification * Type Systems and Theory, Typed Calculi Track C - Security and Cryptography Foundations: * Cryptographic Notions, Mechanisms, Systems and Protocols * Cryptographic Proof Techniques, Lower bounds, Impossibilities * Foundations of Secure Systems and Architectures * Logic and Semantics of Security Protocols * Number Theory and Algebraic Algorithms (Primarily in Cryptography) * Pseudorandomness, Randomness, and Complexity Issues * Secure Data Structures, Storage, Databases and Content * Security Modeling: Combinatorics, Graphs, Games, Economics * Specifications, Verifications and Secure Programming * Theory of Privacy and Anonymity * Theory of Security in Networks and Distributed Computing * Quantum Cryptography and Information Theory SUBMISSION GUIDELINES Authors are invited to submit an extended abstract of no more than 12 pages in LNCS style presenting original research on the theory of Computer Science. Submissions should indicate to which track (A, B, or C) the paper is submitted. No simultaneous submission to other publication outlets (either a conference or a journal) is allowed. The proceedings will be published in the Lecture Notes in Computer Science Series by Springer-Verlag. It is recommended that submissions adhere to the specified format and length. Submissions that are clearly too long may be rejected immediately. Additional material intended for the referee but not for publication in the final version - for example details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. INVITED SPEAKERS (Preliminary list) * Ran Canetti (IBM T.J. Watson Research Center and MIT, USA) * Bruno Courcelle (Labri, Universite Bordeaux, France) * Javier Esparza (Technische Universitaet Muenchen, Germany) * Muthu Muthukrishnan (Google, USA) * Peter Winkler (Dartmouth, USA) IMPORTANT DATES (Provisional) * Workshop proposals due: October 31, 2007 * Submission: 23:59 GMT February 10, 2008. * Notification: April 9, 2008 * Final version due: April 30, 2008 PROGRAM COMMITTEE Track A * Michael Bender (State Univ of New York at Stony Brook, USA) * Magnus Bordewich (Durham University, UK) * Peter Bro Miltersen (University of Aarhus, Denmark) * Lenore Cowen (Tufts University, USA) * Pierluigi Crescenzi (Universita' di Firenze, Italy) * Artur Czumaj (University of Warwick, UK) * Edith Elkind (University of Southampton, UK) * David Eppstein (University of California at Irvine, USA) * Leslie Ann Goldberg (University of Liverpool, UK) (chair) * Martin Grohe (Humboldt-Universitaet zu Berlin, Germany) * Giuseppe Italiano (Universita' di Roma "Tor Vergata", Italy) * Christos Kaklamanis (University of Patras, Greece) * Michael Mitzenmacher (Harvard University, USA) * Ian Munro (University of Waterloo, Canada) * Ryan O'Donnell (Carnegie Mellon University, USA) * Dana Ron (Tel-Aviv University, Israel) * Tim Roughgarden (Stanford University, US) * Christian Scheideler (Technische Universitaet Muenchen, Germany) * Christian Sohler (University of Paderborn, Germany) * Luca Trevisan (University of California at Berkeley, USA) * Berthold Vocking (RWTH Aachen University, Germany) * Gerhard Woeginger (Eindhoven University of Technology, the Netherlands) Track B * Parosh Abdulla (Uppsala University, Sweden) * Luca de Alfaro (University of California, Santa Cruz, USA * Christel Baier (Technische Universitaet Dresden, Germany) * Giuseppe Castagna (Universite Paris 7, France) * Rocco de Nicola (Universita' di Firenze, Italy) * Javier Esparza (Technische Universitaet Muenchen, Germany) * Marcelo Fiore (University of Cambridge, UK) * Erich Graedel (RWTH Aachen, Germany) * Jason Hickey (California Institute of Technology, USA) * Martin Hofmann (Ludwig-Maximilians-Universitdt M|nchen, Germany) * Hendrik Jan Hoogeboom (Leiden University, NL) * Radha Jagadeesen (DePaul University, USA) * Madhavan Mukund (Chennai Mathematical Institute, India) * Luke Ong (Oxford University, UK) * Dave Schmidt (Kansas State University, USA) * Philippe Schnoebelen (ENS Cachan, France) * Igor Walukiewicz (Labri, Universite Bordeaux, France) (chair) * Mihalis Yannakakis (Columbia University, USA) * Wieslaw Zielonka (Universite Paris 7, France) Track C * Christian Cachin (IBM Research Zurich, CH) * Jan Camenisch (IBM Research Zurich, CH) * Ivan Damgaard (University of Aarhus, Denmark) (chair) * Stefan Dziembowski ((Universita' di Roma "La Sapienza", Italy) * Dennis Hofheinz (CWI Amsterdam, the Netherlands) * Susan Hohenberger (Johns Hopkins University, USA) * Yuval Ishai (Technion Haifa, Israel) * Lars Knudsen (DTU Copenhagen, Denmark) * Arjen Lenstra (EPFL Lausanne, CH) * Anna Lysyanskaya (Brown University, USA) * Rafael Pass (Cornell University, USA) * David Pointcheval (ENS Paris, France) * Dominique Unruh (Saarland University, Germany) * Serge Vaudenay (EPFL Lausanne, CH) * Bogdan Warinschi (Bristol University, UK) * Douglas Wikstroem * Stefan Wolf (ETH Zurich, CH) ORGANIZING COMMITTEE: ********************* Luca Aceto Magnus M. Halldorsson Anna Ingolfsdottir CONTACT ADDRESSES: ****************** Luca Aceto, Magnus M. Halldorsson and Anna Ingolfsdottir Department of Computer Science Reykjavik University Kringlan 1, 103 Reykjavik, Iceland E-mail: icalp08 at ru.is For further information see: http://www.ru.is/icalp08/ Vinsamlega athugi? a? uppl?singar ? t?lvup?sti ?essum og vi?hengi eru eing?ngu ?tla?ar ?eim sem p?stinum er beint til og g?tu innihaldi? uppl?singar sem eru tr?na?arm?l. Sj? n?nar: http://www.ru.is/trunadur Please note that this e-mail and attachments are intended for the named addresses only and may contain information that is confidential and privileged. Further information: http://www.ru.is/trunadur From david.j.clark at kcl.ac.uk Wed Jun 27 06:59:36 2007 From: david.j.clark at kcl.ac.uk (David Clark) Date: Wed, 27 Jun 2007 11:59:36 +0100 Subject: [TYPES/announce] reminder: call for presentations at PLID 2007 Message-ID: <46824318.2050105@kcl.ac.uk> *REMINDER: CALL FOR PRESENTATIONS* ******************************************************** * The Third International Workshop * * on * * Programming Language Interference and Dependence * * * * (affiliated with SAS'07 and LOPSTR'07) * * * * 21 August, 2007, Kongens Lyngby, Denmark * * * * Call for Contributions * * * * http://www.dcs.kcl.ac.uk/pg/cmu/plid07/ * * * ******************************************************** PLID'07 Important dates: [Expression of interest] July 6, 2007 [Extended abstract] July 20, 2007 [Workshop] August 21, 2007 Scope Interference and dependence are closely related concepts, the first being the observable phenomenon connected to the second. Interference essentially means that behaviour of some parts of a dynamic system may influence the behaviour of other parts of the system. Dependence specifies the relation between the semantics of sub-components of a dynamic system. Discovering, measuring and controlling interference is essential in many aspects of modern computer science, in particular in security, program analysis and verification, debugging, systems specification, model checking, program manipulation, program slicing, reverse engineering, data mining, distributed databases and systems biology. Doing these things requires theories, models and semantics for interference and dependence, as well as algorithms and tools for analysis and reasoning about interference and dependence. The aim of this workshop is to gather together the community of people that study dependence and interference from the different points of view in order to generate new possible research directions. PLID is devoted to bridging all these communities and assisting work towards a common goal, providing the appropriate environment for reasoning about the state of the art in interference and dependence. Organisation and Submission: The workshop welcomes contributions of on-going work and ideas in the field of dependence and interference. Those who are interested in having a talk at the workshop and/or discussing issues related with these subjects are invited to send your expression of interest to David Clark (david.j.clark at kcl.ac.uk) before July 6, 2007. A web-page will be organised collecting all the workshop contributions. Submitted extended abstracts should be of at most 10 pages LNCS-style and should be sent before July 20th 2007. A special issue of Mathematical Structures in Computer Science on the theme of workshop has been arranged. The special issue will not be restricted to papers based on workshop presentations. It will have a December 2007 deadline and its own, separate call for papers. Program Committee Michele Boreale (U. Florence, Italy) David Clark (Kings College, London, UK) (Chair) Roberto Giacobazzi (U. Verona, Italy) Samir Genaim (U. Politecnica de Madrid, Spain) Chris Hankin (Imperial College, London, UK) Mark Harman (King's College, London, UK) Sebastian Hunt (City U., London, UK) Pasquale Malacaria (Queen Mary, London, UK) Isabella Mastroeni (U. Verona, Italy) David Sands (Chalmers UT, Goteborg, Sweden) Nobuko Yoshida (Imperial College, London, UK) -- _______________________________________________________ David Clark, room 541, Department of Computer Science, King's College London, The Strand, London, WC2R 2LS, UK. ph: +44 20 7848 2472 From david.j.clark at kcl.ac.uk Wed Jun 27 07:08:10 2007 From: david.j.clark at kcl.ac.uk (David Clark) Date: Wed, 27 Jun 2007 12:08:10 +0100 Subject: [TYPES/announce] PLID 2007 Special issue of MSCS Message-ID: <4682451A.7060304@kcl.ac.uk> Call for Papers _________________________________________________________ Special issue of Mathemetical Structures in Computer Science on Programming Language Interference and Dependence Guest Editors: David Clark, Kings College London, UK Roberto Giacobazzi, University of Verona, Itaky __________________________________________________________ Important Dates: Guest Editors receive emailed titles and abstracts by 12-Jan-08 Full paper submissions submitted into Manuscript Central by 19-Jan-08 First round of reviews completed by 19-Mar-08 Major revisions due by 19-May-08 Second round of reviews completed by 19-Jun-08 Minor revisions due by 3-Jul-08 Final acceptances given to Authors by 10-Jul-08 Publication materials due by 24-Jul-08 Publication tentatively in late 2008 issue _________________________________________________________________________________ Interference and dependence are closely related concepts, the first being the observable phenomenon connected to the second. Interference essentially means that behaviour of some parts of a dynamic system may influence the behaviour of other parts of the system. Dependence specifies the relation between the semantics of sub-components of a dynamic system. Discovering, measuring and controlling interference is essential in many aspects of modern computer science, in particular in security, program analysis and verification, debugging, systems specification, model checking, program manipulation, program slicing, reverse engineering, data mining, distributed databases and systems biology. Doing these things requires theories, models and semantics for interference and dependence, as well as algorithms and tools for analysis and reasoning about interference and dependence. The aim of this special issue is to publish novel research work that contributes to the development of methodologies, techniques and tools for analysis of dependence and interference as well as applications of this. Topics of interest include but are not limited to: * Security against unwanted interference and dependence * Models and theories of program interference * Algorithms for reducing or removing interference or for ameliorating its effects * Theory and foundations of program slicing and related dependence analyses * Resource declassification theories * Semantics of dependence and interference * Analyses based on interference and dependence * Abstract interpretation for dependence and interference * Dependence and interference in specifications * Slicing models and specifications * Interaction between dependence and refinement Papers are solicited that describe basic research on any of the above topics. Abstracts should be emailed to the guest editors at David.J.Clark at kcl.ac.uk or Roberto.Giacobazzi at univr.it followed by full paper submissions (a week later). Submissions must conform to the journal's submission guidelines and must not have been published previously or be currently under consideration for publication in any other journals or conferences. Significant extensions to substantive papers published in conferences are also welcome. Selected papers from PLID 2007 will be invited to submit an extended version to the special issue. -- _______________________________________________________ David Clark, room 541, Department of Computer Science, King's College London, The Strand, London, WC2R 2LS, UK. ph: +44 20 7848 2472 From gerardo at ifi.uio.no Wed Jun 27 04:16:21 2007 From: gerardo at ifi.uio.no (Gerardo Schneider) Date: Wed, 27 Jun 2007 10:16:21 +0200 Subject: [TYPES/announce] Call for contributions: FLACOS'07 Message-ID: <46821CD5.4030600@ifi.uio.no> CALL FOR CONTRIBUTIONS First Workshop on Formal Languages and Analysis of Contract-Oriented Software (FLACOS'07) Oslo, Norway, 9-10 October, 2007 http://www.ifi.uio.no/flacos07 The fast evolution of the Internet has popularized service-oriented architectures with their promise of dynamic IT-supported inter-business collaborations. Realizing this promise involves integrating services which are geographically distant and are offered by a variety of organizations which do not fully trust each other. Indeed, collaboration presumes a minimum level of mutual trust. Wherever trust is perceived as insufficient, business people turn to contracts as a mechanism to reduce risks. The ability to negotiate contracts (e.g. for quality of service, security, and distribution of information) and to provide services based on them is therefore one of the most pressing needs to make collaborations a reality. High-level models of contracts are slowly making their way into service-oriented architectures, but application developers are still left to their own devices when it comes to writing code that will comply with a contract concluded just before service provision. At the programming language level, contracts appear as separate concerns that crosscut through application logic. The aim of this workshop is to bring together researchers and practitioners working on language-based solutions to the above problem through the formalization of contracts, the design of appropriate abstraction mechanisms that would guide the developer in the production of contract-aware applications, and formal analysis of such contract languages/software. IMPORTANT DATES Paper Submission Deadline: September 3, 2007 Notification of Acceptance: September 15, 2007 Registration for authors closes: September 25, 2007 WORKSHOP: October 9-10, 2007 FLACOS'07 is partially supported by the Nordunet3 project "Contract-Oriented Software Development for Internet Services". SCOPE Typical topics of the workshop include (but are not limited to): * Formal languages for contracts * Contract-oriented software development * Formal analysis of contracts, including static analysis, run-time verification, and model checking techniques * Contract synthesis * Contract transformation and contract refinement * Contract negotiation, discovery and monitoring INVITED PARTICIPANTS * Gilles Barthe (INRIA Sophia-Antipolis, France) * Frank S. de Boer (CWI, The Netherlands) * John-Jules Ch. Meyer (Utrecht University, The Netherlands) - To be confirmed * Marek Sergot (Imperial College, UK) * Isabelle Simplot-Ryl (University of Lille 1, France) * Valent?n Valero Ruiz (University of Castilla-La Mancha, Spain * More to be announced. SUBMISSIONS Authors wishing to give a talk at the workshop are requested to submit an abstract of 1-3 pages (ps or pdf, printable on A4 paper) to flacos-07 at ifi.uio.no by September 3, 2007. Submission of work submitted for formal publication elsewhere and work in progress is permitted. The abstracts of the accepted contributions will be available at the workshop. After the workshop, selected papers will be published in a special issue of the Journal of Logic and Algebraic Programming (Elsevier) together with selected publications from NWPT'07. REGISTRATION INFORMATION * More information to follow. PROGRAMME COMMITTEE * Pablo Giambiagi, SICS, Sweden * Olaf Owe, University of Oslo, Norway (co-chair) * Anders P. Ravn, Aalborg University, Denmark * Gerardo Schneider, University of Oslo, Norway (co-chair) CONTACT INFORMATION * flacos-07 at ifi.uio.no RELATED EVENTS * FLACOS'07 will be co-located with NWPT'07. -- 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 moggi at disi.unige.it Wed Jun 27 09:53:49 2007 From: moggi at disi.unige.it (moggi@disi.unige.it) Date: Wed, 27 Jun 2007 15:53:49 +0200 (CEST) Subject: [TYPES/announce] ICTCS'07 - Call for Participation Message-ID: <20070627135349.9F7923FDCF@mailstore.csita.unige.it> ICTCS'07 10th Italian Conference on Theoretical Computer Science October 3-5 2007, Rome, Italy CALL FOR PARTICIPATION http://www.disp.uniroma2.it/ictcs07/ The 10th Italian Conference on Theoretical Computer Science (ICTCS 2007) will take place from the 3rd to the 5th of October 2007 in Rome, Italy. Besides the contributed papers, invited talks will be delivered by Giorgio Ausiello and Rocco De Nicola. Additionally, the first day of ICTCS 2007 (October 3rd) hosts a colloquium in honor of Mario Coppo, Mariangiola Dezani-Ciancaglini and Simona Ronchi Della Rocca, entitled ``Types and Computations'', which consists of 6 invited presentations delivered by Corrado Boehm, Chantal Berline, Furio Honsell, Giuseppe Longo, Henk Barendregt and Pawel Urzyczyn. The scientific program and registration information for ICTCS'07 can be found at the conference website (http://www.disp.uniroma2.it/ictcs07/). The early registration deadline is July 28, 2007. Researchers and students in all areas of theoretical computer science are encouraged to participate in the conference. From Bob.Coecke at comlab.ox.ac.uk Wed Jun 27 13:54:00 2007 From: Bob.Coecke at comlab.ox.ac.uk (Bob Coecke) Date: Wed, 27 Jun 2007 18:54:00 +0100 (BST) Subject: [TYPES/announce] Categorical Quantum Logic in Oxford, August 11-12 Message-ID: Announcement of a workshop on CATEGORICAL QUANTUM LOGIC August 11-12 Oxford University Invited speakers: * Rick Blute (Ottawa, Canada) * Marcelo Fiore (Cambridge, UK) * John Harding (New Mexico, US) * Chris Isham (Imperial College, UK) * Dusko Pavlovic (Kestrel Institute, US) More details, including other speakers, participants, and modes of participation, can be obtained from: * http://se10.comlab.ox.ac.uk:8080/FOCS/COQL_en.html or by contacting the workshop organiser: * Bob Coecke This workshop will be partly adjacent to and partly interleaved with one on COALGEBRAIC LOGIC which takes place August 10-11 and is organised by Alexander Kurz, and both of these are preceded by the conference ALGEBRAIC AND TOPOLOGICAL METHODS IN NON-CLASSICAL LOGICS: * http://www.maths.ox.ac.uk/notices/events/special/tancl07/ which takes place August 5-9 and is organised by Hilary Priestley and Mai Gehrke, and at which: * Samson Abramsky (Oxford, UK) will be giving an invited address on his work in the area of categorical quantum logic. From ak155 at mcs.le.ac.uk Thu Jun 28 04:27:33 2007 From: ak155 at mcs.le.ac.uk (ak155@mcs.le.ac.uk) Date: 28 Jun 2007 09:27:33 +0100 Subject: [TYPES/announce] COALGEBRAIC LOGIC in Oxford, August 10-11 Message-ID: ================================================= Announcement of a workshop on COALGEBRAIC LOGIC August 10-11 Oxford University Invited speakers: * Marcelo Fiore (Cambridge, UK) * Rob Goldblatt (Wellington, New Zealand) * H.Peter Gumm (Marburg, Germany) * Bart Jacobs (Nijmegen, The Netherlands) * Lawrence Moss (Bloomington, US) * Yde Venema (Amsterdam, The Netherlands) More details, including modes of participation, can be obtained from: * http://se10.comlab.ox.ac.uk:8080/FOCS/COQL_en.html or by contacting the workshop organiser: * Alexander Kurz This workshop will be partly adjacent to and partly interleaved with one on CATEGORICAL QUANTUM LOGIC which takes place August 11-12 and is organised by Bob Coecke, and both of these follow on from the conference ALGEBRAIC AND TOPOLOGICAL METHODS IN NON-CLASSICAL LOGICS III: * http://www.maths.ox.ac.uk/notices/events/special/tancl07/ which takes place August 5-9 and is organised by Hilary Priestley and Mai Gehrke. From areces at loria.fr Mon Jul 2 12:51:36 2007 From: areces at loria.fr (Carlos Areces) Date: Mon, 02 Jul 2007 18:51:36 +0200 Subject: [TYPES/announce] M4M-5 Call for Papers Message-ID: <46892D18.8060901@loria.fr> ==================================================================== 5th Worskhop on "Methods for Modalities" (M4M-5) http://m4m.loria.fr/M4M5 Ecole Normale Superieure de Cachan, France November 29-30, 2007 ==================================================================== Scope ----- The workshop ``Methods for Modalities'' (M4M) aims to bring together researchers interested in developing algorithms, verification methods and tools based on modal logics. Here the term ``modal logics'' is conceived broadly, including temporal logic, description logic, guarded fragments, conditional logic, temporal and hybrid logic, etc. To stimulate interaction and transfer of expertise, M4M will feature a number of invited talks by leading scientists, research presentations aimed at highlighting new developments, and submissions of system demonstrations. We strongly encourage young researchers and students to submit papers and posters, especially for experimental and prototypical software tools which are related to modal logics. More information about the previous editions can be found at http://m4m.loria.fr/ Paper Submissions ------------------ Authors are invited to submit papers in the following three categories. - Regular papers up to 15 pages, describing original results, work in progress, or future directions of research. - System descriptions of up to 12 pages, describing new systems or significant upgrades of existing ones. - Presentation-only papers, describing work recently published or submitted (no page limit). These will not be included in the proceedings, but pre-prints or post-prints can be made available to participants. Submissions should be made via Easychair at the following address: http://www.easychair.org/M4M5/ Final versions of accepted papers will be published online in an Elsevier ENTCS volume. A preliminary version of the proceedings will also be available at the workshop. Invited speakers ----------------- Ahmed Bouajjani (University of Paris 7) Patricia Bouyer (OUCL, Oxford - LSV, ENS Cachan) Balder ten Cate (University of Amsterdam) Koen Claessen (Chalmers University of Technology) Wiebe van der Hoek (University of Liverpool) Important dates --------------- Deadline for submissions: September 7th, 2007 Notification: October 10, 2007 Camera ready versions: November 5, 2007 Workshop dates: November 29-30, 2007 Program Committee ----------------- Natasha Alechina, University of Nottingham Carlos Areces, INRIA Lorraine (co-chair) Philippe Balbiani, IRIT, Nicole Bidoit, Universite Paris-Sud Patrick Blackburn, INRIA Lorraine Torben Brauner, Roskilde University Stephane Demri, ENS de Cachan (co-chair) Maarten de Rijke, University of Amsterdam Valentin Goranko, University of the Witwatersrand Rajeev Gore, The Australian National University, Canberra Carsten Lutz, Dresden University of Technology Nicolas Markey, ENS de Cachan Angelo Montanari, University of Udine Ulrike Sattler, University of Manchester Holger Schlingloff, Humboldt University / FIRST Renate Schmidt, University of Manchester Johan van Benthem, University of Amsterdam/ Stanford University From royer at ecs.syr.edu Thu Jul 5 13:48:12 2007 From: royer at ecs.syr.edu (James S. Royer) Date: Thu, 5 Jul 2007 13:48:12 -0400 Subject: [TYPES/announce] Final call for participation for LCC'07 Message-ID: The Workshop on Logic and Computational Complexity will be held on July 15 in Wroclaw, Poland as a satellite workshop of LICS 2007. The deadline for regular registration is **July 10**. For the details of the program and registration, see: http://www.cis.syr.edu/~royer/icc/LCC07/ From jeremy.siek at gmail.com Thu Jul 5 14:30:31 2007 From: jeremy.siek at gmail.com (Jeremy Siek) Date: Thu, 5 Jul 2007 12:30:31 -0600 Subject: [TYPES/announce] PhD position at the Univ. of Colorado at Boulder Message-ID: <1FD6827E-27C0-4A18-9119-3FD07E3E0541@gmail.com> Ph.D. Research Assistant Position University of Colorado at Boulder Department of Electrical and Computer Engineering A fully funded Ph.D. Research Assistant position is available for a student to work on the Modular Metaprogramming project led by Jeremy Siek. If interested in applying to the Ph.D. program, please send email to jeremy.siek at colorado.edu. A description of the project is at the following URL: http://ece.colorado.edu/~siek/phd-advert.html Best regards, Jeremy _________________________________________________ Jeremy Siek http://ece.colorado.edu/~siek/ Assistant Professor Department of Electrical and Computer Engineering University of Colorado at Boulder -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070705/aa6f98fc/attachment.htm From Lists at Alessio.Guglielmi.name Fri Jul 6 17:03:03 2007 From: Lists at Alessio.Guglielmi.name (Alessio Guglielmi) Date: Fri, 6 Jul 2007 22:03:03 +0100 Subject: [TYPES/announce] Normalisation Control in Deep Inference Via Atomic Flows Message-ID: <20070706210308.85D9043126@janeway.inf.tu-dresden.de> Dear colleagues, Tom Gundersen and I would like to advertise a paper on a new proof normalisation method, which might be of interest to the types community: . Comments are very welcome. Cheers, -Alessio Guglielmi Normalisation Control in Deep Inference Via Atomic Flows We introduce diagrams, called 'atomic flows', that forget much of the syntactic structure of derivations and only retain causal relations between atoms. Using atomic flows on propositional logic, we can design and control several normalisation procedures. In particular, we can obtain cut elimination as a special case of more general normal forms. This technique only relies on substituting derivations in the place of atoms, similarly to natural deduction, and not on permuting inference steps, as in the sequent calculus. Because they abstract away from most syntactic details, atomic flows allow for very simple control of normalisation procedures, which would be otherwise cumbersome in the bare syntax. We operate in deep inference, a very general methodology, where normalisation is more difficult to control than in other syntactic paradigms. Deep inference web page: From ohearn at dcs.qmul.ac.uk Sat Jul 7 04:38:09 2007 From: ohearn at dcs.qmul.ac.uk (Peter O'Hearn) Date: Sat, 7 Jul 2007 09:38:09 +0100 Subject: [TYPES/announce] Postdoc: Program Analysis with Separation Logic Message-ID: Postdoc Position in Program Analysis with Separation Logic Dept of Computer Science, Queen Mary, University of London A full time Research Assistant position is available for 22 months from 1 October 2007 on the EPSRC-funded Smallfoot project. The aim of the project is to develop an automatic verification tool for pointer usage in C programs using separation logic. The project builds on an earlier Smallfoot prototype, and also the Space Invader program analysis. You should have experience in program analysis, as evidenced by your publication record, and relevant knowledge of separation logic and shape analysis. The project calls for both theoretical development of new ideas in program analysis and verification, and practical development of the tool. Smallfoot is a jointly-funded project between Peter O'Hearn at Queen Mary and Cristiano Calcagno and Philippa Gardner at Imperial College. The advertised position is at Queen Mary, where the team also includes Dino Distefano and Hongseok Yang (originators of Space Invader). The position has become open as a result of Distefano, the previous RA, obtaining a 5-year research fellowship from the UK Royal Academy of Engineering. James Brotherston is the project's RA at Imperial. The London teams maintain a close working relationship with Josh Berdine and Byron Cook from Microsoft Cambridge. Early work on the project has resulted in verification of data structure usage for several routines from a firewire device driver for Windows, as well as the discovery of previously-unknown heap-manipulation bugs. See http://www.dcs.qmul.ac.uk/~ohearn/localreasoning.html to get an idea of our recent work. If you have any questions on the position contact Peter O'Hearn (ohearn at dcs.qmul.ac.uk). Application packs with forms and departmental information can be found on http://www.dcs.qmul.ac.uk/staff/recruit/QMApplicationFormBlue1.pdf or please visit http://www.hr.qmul.ac.uk/vacancies Completed application forms with full CV and contact details for three independent references should be returned either by e-mail to ohearn at dcs.qmul.ac.uk or by surface mail to Professor Peter O'Hearn Department of Computer Science Queen Mary, University of London Mile End Road, London, E1 4NS, UK. The closing date for applications is 15 July 2007. From garrigue at math.nagoya-u.ac.jp Tue Jul 10 08:50:05 2007 From: garrigue at math.nagoya-u.ac.jp (Jacques Garrigue) Date: Tue, 10 Jul 2007 21:50:05 +0900 (JST) Subject: [TYPES/announce] CFP: International Symposium on Functional and Logic Programming (FLOPS 2008) Message-ID: <20070710.215005.27773710.garrigue@math.nagoya-u.ac.jp> [We apologize for the multiple postings of this announce] FIRST CALL FOR PAPERS Ninth International Symposium on Functional and Logic Programming (FLOPS 2008) April 14-16, 2008 Ise, Japan Submission deadline: October 10, 2007 http://www.math.nagoya-u.ac.jp/~garrigue/FLOPS2008/ FLOPS is a forum for research on all issues concerning declarative programming, including functional programming and logic programming, and aims to promote cross-fertilization and integration between the two paradigms. Previous FLOPS meetings were held in Fuji Susono (1995), Shonan Village (1996), Kyoto (1998), Tsukuba (1999), Tokyo (2001), Aizu (2002), Nara (2004), and Fuji Susono (2006). TOPICS FLOPS solicits original papers in all areas of functional and logic programming, including (but not limited to): Declarative Pearls: new and excellent declarative programs with illustrative applications; Language issues: language design and constructs, programming methodology, integration of paradigms, interfacing with other languages, type systems, constraints, concurrency and distributed computing; Foundations: logic and semantics, rewrite systems and narrowing, type theory, proof systems; Implementation issues: compilation techniques, memory management, program analysis and transformation, partial evaluation, parallelism; Applications: case studies, real-world applications, graphical user interfaces, Internet applications, XML, databases, formal methods and model checking. The proceedings are expected to be published as an LNCS volume. The proceedings of the previous meeting (FLOPS2006) were published as LNCS 3945. INVITED SPEAKERS To be announced PC CO-CHAIRS Jacques Garrigue (Nagoya, Japan) Manuel Hermenegildo (Madrid, Spain and New Mexico, US) PC MEMBERS Maria Alpuente (Valencia, Spain) Sergio Antoy (Portland, OR, USA) Matthias Blume (TTI, Chicago, USA) Tyng-Ruey Chuang (Academia Sinica, Taiwan) Zhenjiang Hu (Tokyo, Japan) Oleg Kiselyov (FNMOC, Monterey, USA) Herbert Kuchen (Muenster, Germany) Dale Miller (INRIA, Palaiseau, France) Atsushi Ohori (Tohoku, Japan) Enrico Pontelli (New Mexico, USA) Kristoffer Rose (IBM Watson, USA) Kazunori Ueda (Waseda, Japan) Peter Van Roy (Louvain-la-Neuve, Belgium) Benjamin Werner (INRIA, Palaiseau, France) LOCAL CHAIR Shoji Yuen, Nagoya University SUBMISSION Submissions must be unpublished and not submitted for publication elsewhere. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. Submissions should fall into one of the following categories: Regular research papers: they should describe new results and will be judged on originality, correctness, and significance. System descriptions: they should contain a link to a working system and will be judged on originality, usefulness, and design. All submissions must be written in English and can be up to 15 proceedings pages long. Authors are strongly encouraged to use LaTeX2e and the Springer llncs class file, available at http://www.springer.de/comp/lncs/authors.html Regular research papers should be supported by proofs and/or experimental results. In case of lack of space, this supporting information should be made accessible otherwise (e.g. a link to a web page, or an appendix). Submission is Web-based. Please visit the conference site. IMPORTANT DATES Submission deadline: October 10, 2007 Author notification: December 21, 2007 Camera-ready copy: January 21, 2008 Conference: April 14-16, 2008 PLACE Ise, Japan Previous FLOPS: FLOPS 2006, Fuji Susono: http://hagi.is.s.u-tokyo.ac.jp/FLOPS2006/ FLOPS 2004, Nara: http://logic.cs.tsukuba.ac.jp/FLOPS2004/ FLOPS 2002, Aizu: http://www.ipl.t.u-tokyo.ac.jp/FLOPS2002/ FLOPS 2001, Tokyo: http://www.ueda.info.waseda.ac.jp/flops2001/ SPONSOR Japan Society for Software Science and Technology (JSSST) SIG-PPL IN COOPERATION with Asian Association for Foundation of Software (AAFS) (pending) Association for Logic Programming (ALP) INQUIRIES to Jacques Garrigue (garrigue at math.nagoya-u.ac.jp) From Luis.Caires at di.fct.unl.pt Wed Jul 11 07:38:32 2007 From: Luis.Caires at di.fct.unl.pt (=?ISO-8859-1?Q?Lu=EDs_Caires?=) Date: Wed, 11 Jul 2007 12:38:32 +0100 Subject: [TYPES/announce] CONCUR 07: Call For Participation Message-ID: <86B3B793-3BE6-4F49-A574-F1F88E048D0D@di.fct.unl.pt> CALL FOR PARTICIPATION CONCUR'07 18th International Conference on Concurrency Theory September 3th - 8th, 2007 Lisbon, Portugal !!! Early registration open until July 31st. !!! CONCUR 2007, the 18th International Conference on Concurrency Theory, will take place in the Gulbenkian Foundation, 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. Check the web site for all details about the scientific program, social program, and registration instructions. http://concur07.di.fc.ul.pt/ INVITED LECTURES ================ * Luca Aceto, Reykjavik University, Iceland * Peter O'Hearn, University of London, UK * Fred B. Schneider, Cornell University, USA INVITED TUTORIALS ================= * Vincent Danos, Universit? de Paris 7, France * Jos? Fiadeiro, University of Leicester, UK AFFILIATED WORKSHOPS ==================== Expressiveness in Concurrency (EXPRESS) 3rd September 2007 Graph Transformation for Verification and Concurrency (GT-VC) 3rd September 2007 Security Issues in Concurrency (SECCO) 3rd September 2007 Verification and Analysis of Multi-threaded Java-like Programs (VAMP) 3rd September 2007 Applying Concurrency Research in Industry (IFIP WG 1.8) 7th September 2007 Foundations of Coordination Languages and Software Architectures (FOCLASA) 8th September 2007 From Biology To Concurrency and back (FBTC) 8th September 2007 International Workshop on Verification of Infinite-State Systems (INFINITY) 8th September 2007 -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070711/efc8c138/attachment.htm From hilde at itu.dk Wed Jul 11 16:25:48 2007 From: hilde at itu.dk (hilde@itu.dk) Date: Wed, 11 Jul 2007 22:25:48 +0200 (CEST) Subject: [TYPES/announce] EXPRESS'07 - PROGRAMME & CALL FOR PARTICIPATION Message-ID: <34987.80.63.146.6.1184185548.squirrel@secure.itu.dk> ================================================================= CALL FOR PARTICIPATION - PROGRAMME AVAILABLE EXPRESS'07 http://express07.pps.jussieu.fr/ 14th International Workshop on Expressiveness in Concurrency Monday, 3 September, 2007. Faculty of Social and Human Sciences, Universidade Nova de Lisboa, Lisbon, Portugal (5 min. from Gulbenkian Foundation) Affiliated with CONCUR 2007 !!! Early registration open until July 31st. !!! Register at http://concur07.di.fc.ul.pt/ ================================================================= SCOPE: The EXPRESS workshops aim at bringing together researchers interested in the relations between various formal systems, particularly in the field of Concurrency. More specifically, they focus on the comparison between programming concepts (such as concurrent, functional, imperative, logic and object-oriented programming) and between mathematical models of computation (such as process algebras, Petri nets, event structures, modal logics, rewrite systems etc.) on the basis of their relative expressive power. INVITED SPEAKERS: * Jos Baeten, Eindhoven. * C?dric Fournet, Cambridge (Joint with SecCo 2007 workshop). * Fran?ois Laroussinie, Cachan. * Iain Phillips, London (Joint with GT-VC 2007 workshop). MORE INFORMATION AND PROGRAMME: http://express07.pps.jussieu.fr/ ================================================================= From rensink at cs.utwente.nl Thu Jul 12 03:53:00 2007 From: rensink at cs.utwente.nl (Arend Rensink) Date: Thu, 12 Jul 2007 09:53:00 +0200 Subject: [TYPES/announce] PhD position at the University of Twente on Graph-Based Abstract Interpretation Message-ID: <4695DDDC.3070205@cs.utwente.nl> To carry out the recently awarded Dutch (NWO) research project entitled "Graphs for Abstract Interpretation of Languages" (GRAIL), we are offering a position for a PhD student (fully funded) for a period of four years. - Deadline for applications: August 30, 2007 - Project start date: October 1, 2007, or as soon thereafter as possible The Context =========== The project takes place at the Formal Methods and Tools chair of the University of Twente. This chair is part of the Department of Computer Science, one of the largest academic departments for computer science in the etherlands. Project leader is Dr. Arend Rensink. The Project: Graphs for Abstract Interpretation of Languages (GRAIL) ==================================================================== As more and more systems in our everyday environment contain major software parts, and we are depending on such systems more and more (we are counting on them), the importance of the dependability of the embedded software is increasing. Unfortunately, there are still very few generally applicable methods for software verification, i.e., the ensurance of its correct functioning under all circumstances. Reasons for this are, one the one hand, the degree of expertise necessary for existing verification methods, and on the other, their poor embedding in the average software development trajectory. An important practical objection is, moreover, that current verification methods typically assume the existence of a sufficiently detailed and precise model of system behaviour. In practice such models hardly ever exist, and the time and expertise to construct them is missing. Examples of methods that are being used widely in practice are therefore typing and testing, neither of which necessarily depends on the pre-existence of models. In this procect we investigate a new way of automatically verifying software on the basis of code, without assuming a predefined model. The technique used is static analysis, a general principle that encompasses typing; the new aspect is the use of graph transformations to capture the effect of the software. Graphs offer a natural model for the behaviour of dynamic software systems, and at the same time offer the basis for a generic form of static analysis, which can be driven by the properties to be verified. The full project proposal can be found at http://www.cs.utwente.nl/~rensink/projects/grail.pdf The position ============ You should have a MSc or equivalent degree in computer science or a closely related area, or be able to show that you will receive the degree this year (2007). Familiarity with formal verification, abstract interpretation and/or and graph transformations is considered an advantage. You are expected to cooperate in an internationally oriented research environment. Good English speaking and writing skills are demanded, as well as the willingness to learn Dutch. You will enroll in the PhD programme of the Dutch Institute for Programming Research and Algorithmics (IPA). The selected candidate will be appointed for a period of 4 years with a gross salary starting at around EUR 1950 per month (first year) and reaching EUR 2500 per month (final year), plus an 8% holiday allowance and other benefits. Your Application ================ You can obtain further information about the positions by enquiring from: Dr.ir. Arend Rensink, mailto:rensink at cs.utwente.nl, tel: +31 (0)53 489 4862 fax: +31 (0)53 489 3247 If you are interested, please send an application by email to the above address, including: - A cover letter stating your *specific* interest in the position, indicating also your motivation and qualifications for joining the project. (In the absence of such a cover letter your application will be rejected without notification.) - A full curriculum vitae, including the subject and supervisor of your graduate thesis. - Letters of recommendation or references of at least two scientific staff members. All applications must be received ** at or before 30 August 2007 ** From grue at diku.dk Thu Jul 12 18:32:28 2007 From: grue at diku.dk (Klaus Ebbe Grue) Date: Fri, 13 Jul 2007 00:32:28 +0200 (CEST) Subject: [TYPES/announce] Logiweb Message-ID: I am happy to announce the release of the "Logiweb" system. Logiweb is a system for creating a world wide web of theorems, proofs, and much more. To read more or to try Logiweb in your browser, go to http://logiweb.eu/ or http://logiweb.imm.dtu.dk/. Logiweb is available under the GNU public license. Have fun, Klaus Grue --- Features of Logiweb User defined grammar. You may decide e.g. to write 'all X : Y' to get a universal quantifier. User defined rendering. You may decide e.g. to render 'all X : Y' as '\forall X \colon Y'. User defined proof checker. You may define your own proof checker and publish it on Logiweb. Or you may decide to use a proof checker published on Logiweb by somebody else. For a sample proof checker and some sample proofs go to http://logiweb.eu/logiweb/page/check/fixed/body/index.html and click 'PDF'. User defined logic. You may define your own axiomatic system. Or you may decide to use an axiomatic system published on Logiweb by somebody else. For sample definition of propositional calculus, first order predicate calculus, and Peano arithmetic, go to http://logiweb.eu/logiweb/page/check/fixed/body/index.html and click 'PDF'. Turing complete macro expansion. You may define e.g. that < 1 , 2 , 3 > macro expands to 1 :: 2 :: 3 :: <>. Or you may define e.g. that x , y > 5 macro expands to x > 5 & y > 5. Or you may define e.g. that x , y in Odd , Prime macro expands to x in Odd & x in Prime & y in Odd & y in Prime. Journal quality pages. In analogy to 'web pages', anything published on Logiweb is a 'Logiweb page'. Logiweb pages may contain a mixture of arbitrary LaTeX and formal, machine verified mathematics. Users may utilize this to produce journal quality pages. Standing on the shoulders of others. Logiweb pages may reference previously published Logiweb pages. Definitions, lemmas, proofs, axiomatic systems, proof checkers, macros, etc. on referenced pages can be used on referencing pages. Secure publication. Once published, Logiweb pages get a unique identifier by the system (base on a RIPEMD-160 global hash key). After publication, pages may be mirrored, and pages continue to exist as long as just one copy remains on Logiweb. Pages cannot change once published making it secure to reference pages published by somebody else. Automatic loading. When a Logiweb page is machine verified, all transitively referenced pages are located, fetched, and verified as well. Once verified pages are cached. Reader friendly. While authors of Logiweb pages must either use a Logiwiki or install Logiweb locally, readers can view Logiweb pages using an ordinary web browser. Axiomatic mixture. The demo proof checker which comes with Logiweb allows to define arbitrary axiomatic theories and to use several axiomatic theories on the same Logiweb page. As an example, it is possible to define both ZFC and NBG and to state and prove theorems in both systems on one Logiweb page. Lambda calculus. The programming language of Logiweb is essentially lambda calculus. A few twists make the programming language efficient. Using lambda calculus makes it easy to formulate theorems about Logiweb programs. Stand alone executables. The notion of a 'Logiweb machine' allows to express stand alone executables. A Logiweb machine extends lambda calculus with facilities for I/O and interrupt processing. Each Logiweb page can define an arbitrary number of Logiweb machines which can be translated to stand alone executables when rendering the page. How you can help First of all, you can help by helping yourself: publish on Logiweb. After years of design, implementation, and local use, Logiweb is ready to receive contents. Small contributions of contents will be received with appreciation, big ones with greed. If you publish a good Logiweb page, please let me know (grue at diku.dk). Then I will review it and announce it at the logiweb-notices mailing list. If you have a spare Linux box with Internet access, it would be very helpful for the project if you would download and install the Logiweb software. The software includes a server which will connect to other Logiweb servers. The more computers Logiweb runs on, the better will the distributed aspect of the system be tested. You do not need to install the software in order to publish on Logiweb (you may use the Logiwiki at http://logiweb.eu/ or http://logiweb.imm.dtu.dk/). But if you publish on Logiweb you will probably find it most convenient in the long run to have your own copy on your own machine. If you develop mathematical software yourself then consider interfacing with Logiweb. Your system might benefit from version control or web distribution or rendering or some other feature of Logiweb. To connect your system to Logiweb, install Logiweb on a machine which runs your system and enable access to your system in the Logiweb configuration file. When the connection is in place you may start exploring how to use it. A connection to MIZAR is in place, work on exploring it is in progress, and connections to other systems are under consideration. An "Introduction to Logiweb" is included below. --- Introduction to Logiweb Logiweb is a Swiss army knife for mathematicians, software engineers, logicians, programmers, computer scientists, conference chairs, editors, and others who write or handle text which both has to be read by others and has to be processed by machine. Few people will need all of Logiweb. But many people can benefit from some of Logiweb. Logiweb combines literate programming, web publication, and version control. Logiweb supports the writing and editing of programs, operating systems, mathematical textbooks, scientific papers, journals, proceedings, lemmas, proofs, mathematical libraries, program libraries, program documentation, software life-cycle documents, test suites, and other kinds of information. Logiweb offers document production, program compilation, safe linking of programs against libraries across the Internet, software integration and test, proof checking, interfacing to external tools, and other kinds of machine processing of information. Logiweb also offers web publication and version control. And in addition to that, Logiweb offers a lot more. Logiweb is small. When downloading it, the whole download is less than a megabyte. And all of Logiweb except its logo is available under the GNU public license. Logiweb is documented. It is feasible to learn all there is to learn about it to the level where you could implement it yourself if you wanted. The following sections explain how Logiweb could be of help to: - Mathematicians - Programmers - Logicians - Computer scientists - Software engineers - Conference chairs and editors For mathematicians As a mathematician, you may use Logiweb as a tool for writing scientific papers, lecture notes, and text books. As an example, you can tell Logiweb that (( n , m )) denotes the number of combinations in which one can pick m elements from a set of n elements. Furthermore, you can tell Logiweb that (( n , m )) should be rendered as \left(\begin{array}{l} n \\ m \end{array}\right) Then you may write things like \section{The binomial coefficient} Define the binomial coefficient "[[ (( n , m )) ]]" thus: "[[[ (( n , m )) = n ! over m ! ( n ~V m ) ! ]]]" One property of the binomial coefficient reads: "[[[ sum m from 0 to n : (( n , m )) = 2 power n ]]]" With suitable headers, the text above generates nicely typeset text in which the binomial coefficient is rendered the way such coefficients are usually rendered, the sum is represented as a capital sigma with m=0 underneath and n above, and so on. When you are satisfied with the paper, lecture note, or book, then you may ask Logiweb to publish it. That way the paper comes under Logiweb version control and becomes accessible to anyone with an Internet connection. In analogy to the World Wide Web, pieces of work submitted to Logiweb are called 'Logiweb pages' even though 'paper' or 'book' or 'document' might be more appropriate. Once the paper is published, your colleagues or students may reference it using Logiweb. One benefit of referencing a paper is that all definitions on the referenced paper become accessible, so your colleagues or students may start writing (( n , m )) for binomial coefficients. And if you were lucky, you didn't have to define the binomial coefficient yourself in the first place if you could find it on Logiweb. If you publish exercises for your students then your students may hand in their answers through Logiweb. And if you define an algorithm which tells whether or not a result is correct (e.g. asking for the inverse of a given matrix and checking by comparing the answer with the correct result) then you may use Logiweb to check the answers. And if you publish the checking algorithm on Logiweb, then the students can check their answers themselves. For programmers To program using Logiweb, you may either use Logiwebs own programming language or use an external one. The Logiweb programming language is lambda calculus. Due to Logiwebs heavy optimization machinery, the Logiweb programming language is suited for programming in the large. If you are used to functional programming, you should be able to write programs in the Logiweb programming language with little instruction. Just do Tutorial T02 and T05 and look into http://logiweb.eu/logiweb/page/check/fixed/body/tex/page.pdf to see how things are done there. As an example, to define the factorial function you would write: \section{The factorial function} For natural numbers "[[ n ]]" define the factorial "[[ n ! ]]" as the product of the numbers between "[[ 1 ]]" and "[[ n ]]", inclusive. A definition reads "[[[ eager define n ! as if n = 0 then 1 else n * ( n ~V 1 ) ! ]]]" As a test case we have "[[ ttst 5 ! = 120 end test ]]". If suitable headers are added then the text above will define the factorial function, will verify that five factorial equals 120, and will generate a nicely typeset PDF version of your text. Do tutorial T02 to see an example. If you wonder what 'eager define' above means: It defines an 'eager' instead of a 'lazy' function, and it says that if n raises an exception then the result of n! is equal to that exception. So e.g. (1/0)! equals 'division by zero'. To make stand-alone programs, you need to read about Logiweb machines (http://logiweb.eu/logiweb/page/base/fixed/body/tex/page.pdf, Chapter 6) which add I/O and interrupt handling to lambda calculus. A benefit of using the Logiweb programming language is that each and every construct of the language are ultimately defined in lambda calculus which makes it possible to reason about the programs. Instead of using the Logiweb programming language, programmers may define a 'renderer' which extracts pieces of programs expressed in other programming languages from the source text and invokes suitable compilers on them. As an example, one may define a renderer which extracts C-code from a Logiweb paper, arranges it suitable, and sends it through a C-compiler. For logicians To arrange that Logiweb checks proofs, you must publish a proof checker on Logiweb or reference one published by somebody else. A proof checker is no more than a program and it can be published and version controlled by Logiweb like any other program. Once somebody has published a proof checker, anyone can get their proofs checked by that proof checker just by referencing it across the Internet. On Logiweb, a lemma typically states that a particular statement holds in a particular theory where the theory itself is published on Logiweb. A proof typically proves that a lemma is correct and typically indicates that the proof has been checked by a particular version of a particular proof checker. You can find a proof checker in [1] and a definition of propositional calculus, first order predicate calculus, and Peano arithmetic in [2]. To try making your own proof, run Tutorial T03. Tutorials on defining your own theories are under preparation. [1] http://logiweb.eu/logiweb/page/check/fixed/body/tex/page.pdf [2] http://logiweb.eu/logiweb/page/Peano/fixed/body/tex/page.pdf For computer scientists If you write scientific papers which contain computer programs, then Logiweb allows you to write it in such a way that the programs can be extracted from it (c.f. the section "For programmers" above) and you may publish you paper on Logiweb (c.f. the section "For mathematicians" above). If you reason about programs, then Logiweb will typeset both your programs and your proofs. And if your proofs are formal, then Logiweb will check them as well (c.f. the section "For logicians" above). If you want to attack e.g. the POPLMARK challenge, Logiweb should be your weapon of choice (some time in the far future I may do it myself, but if you work on it and get stuck, don't hesitate to contact me). For software engineers If you write Technical Specifications (TSs), Interface Control Documents (ICDs), Architectural Design Documents (ADDs), Detailed Design Documents (DDDs), Code, Unit Test Plans and Reports, Integration Test Plans and Reports, Acceptance Test Plans and Reports, and so on, then you may benefit from putting those documents on Logiweb. On Logiweb, each document published can reference previously published documents in which case all definitions present in the referenced document become available. As an example one could treat each requirement in the TS as a definition which can then be referenced from the ADD and on. Likewise, each object definition in the ADD could be treated as a definition. Such object definitions could be referenced e.g. from traceability matrices, or one could arrange that Logiweb generates stubs for each object automatically. The DDD could reference the objects in the ADD and define the contents of the objects such that, if sufficient detail is given, then Logiweb can auto-generate the final code from the DDD. Furthermore, one can tell Logiweb what to do with the code such as sending it through compilers and linkers. The Unit Test Plans and Reports could reference the DDD. Then one can arrange that Logiweb builds the software system as specified in the DDD and then executes the test suites defined in the Unit Test Plan. The Integration Test Plan and Report could also reference the DDD. Then one can arrange that Logiweb builds the software units as specified in the DDD and then integrates and tests the system according to procedures defined in the Integration Test Plan and Report. The Acceptance Test Plan and Report could also reference the DDD but possibly specify modified integration procedures and new tests. And just in case you don't want complete strangers to read your documents, you can encrypt them and ask Logiweb to 'unpack' (i.e. decrypt) them when fetching them from the Internet. For conference chairs and editors If you want your contributers to use a particular style (e.g. a TeX sty file) or particular notation (e.g. for combinations as described earlier) then publish it on Logiweb and ask your authors to reference your Logiweb page. That will make your style and notation available to your authors. If you want your authors to conform to some guidelines which can be checked automatically, then publish your guideline checker on Logiweb. Then your authors can use Logiweb to check their contributions for conformance. Instead of submitting their contributions to you, your authors may publish their contributions directly on Logiweb and send you a reference. When you have accepted a particular version of a particular paper, you can mirror it locally to ensure its continued existence on Logiweb. When you have a full set of submissions for producing your electronic proceedings or an issue of your electronic journal, you submit a small Logiweb page which simply references the accepted papers. That small page is your proceedings or journal issue. Your references give your seal of approval to the selected versions of the selected papers by saying that the papers were considered appropriate for your proceedings or journal. Back in the paper age, publication and giving the seal of approval was the same thing. Nowadays, authors web-publish long before they get the seal of approval from a publishing house, so the procedure above just brings publication up to date. From rlc3 at mcs.le.ac.uk Fri Jul 13 07:11:40 2007 From: rlc3 at mcs.le.ac.uk (Roy L. Crole) Date: Fri, 13 Jul 2007 12:11:40 +0100 Subject: [TYPES/announce] Lectureship in Computer Science Message-ID: Dear Colleagues, The lectureship outlined below may be of interest to readers of categories and types. Please also pass the details on to others who may wish to apply. Roy Crole. ___________________________________________________________________ Lecturer in Computer Science, University of Leicester Salary Grade 8: ?32,976 to ?40,335 per annum Available from 1 October 2007 The University of Leicester seeks to appoint a Lecturer in Computer Science who can contribute to existing research in model-based software evolution, including meta-modelling and model transformation, model-driven development and re-engineering of legacy systems. Preference will be given to candidates with an interest in formal techniques who can contribute to and make use of the expertise that the Department has in algebraic and categorical structures and methods, including graph transformations and rewriting. Informal enquiries are welcome and should be addressed to Professor Jos? Fiadeiro (jose at mcs.le.ac.uk), Head of Department, or Professor Reiko Heckel (reiko at mcs.le.ac.uk). Downloadable application forms and further particulars are available from www.le.ac.uk/personnel/jobs/a3331p.html. If you require a hard copy, please contact Personnel Services - tel: 0116 252 2758, fax: 0116 252 5140, email: recruitment3 at le.ac.uk Please note that CVs will only be accepted in support of a fully completed application form. Closing Date: 31 July 2007 From Pierre-Louis.Curien at pps.jussieu.fr Fri Jul 13 11:46:42 2007 From: Pierre-Louis.Curien at pps.jussieu.fr (Pierre-Louis Curien) Date: Fri, 13 Jul 2007 17:46:42 +0200 Subject: [TYPES/announce] =?iso-8859-1?q?Journ=E9es_Jean-Yves_Girard_=28FR?= =?iso-8859-1?q?EE_REGISTRATION_OPEN=29?= Message-ID: <681B772F-B878-434C-8117-DCA91CE314B2@pps.jussieu.fr> Following earlier annoucements, I am happy to inform you that a draft programme of the ***************************** Journ?es Jean-Yves Girard Paris, Institut Henri Poincar?, September 10-12 ***************************** is now visible on the website of the event: http://www-lipn.univ-paris13.fr/jyg60/index-en.php Registration is also open on this site. (Registration is free, and serves several purposes: keeping a list of participants, catering on Monday 10th evening, etc...) Please do register if you intend to attend the meeting. Best regards, on behalf of the organizing committee, Pierre-Louis Curien From miculan at dimi.uniud.it Fri Jul 13 12:23:48 2007 From: miculan at dimi.uniud.it (Marino Miculan) Date: Fri, 13 Jul 2007 18:23:48 +0200 Subject: [TYPES/announce] Call for papers: Proceedings of TYPES 2007 Message-ID: <3F9CA03E-8F87-45B2-99E3-AF6102650CEE@dimi.uniud.it> *** Call for papers: Proceedings of TYPES 2007 *** http://users.dimi.uniud.it/types07/ types07-cfp.html * OPEN TO ALL INTERESTED RESEARCHERS * The Post-Proceedings of the TYPES 2007 Annual Conference will be published, after a formal refereeing process, as a volume of the Lecture Notes in Computer Science (LNCS) series. Previous TYPES post- workshop proceedings include LNCS volumes 4502, 3895, 3085, 2646, 2277, 1657, 1512, 1158, 996 and 806. We hope this volume will give a good account of the papers presented at the conference and of recent research in the field in general. ** TOPICS ** We encourage you to submit research papers on the subject of the Types Coordination Action (see http://www.cs.chalmers.se/Cs/Research/ Logic/Types/objectives.html). Topics include, but are not limited to: - foundations of type theory and constructive mathematics - applications of type theory - dependently typed programming - industrial uses of type theory technology - meta-theoretic studies of type systems - implementation of proof-assistants - automation in computer-assisted reasoning - links between type theory and functional programming - formalizing mathematics using type theory Work within the scope of TYPES that was not presented at the workshop or whose authors are not formally involved in the Coordination Action may also be submitted for the proceedings. ** IMPORTANT DATES ** SUBMISSION DEADLINE: Monday, September 24, 2007. NOTIFICATION OF ACCEPTANCE: Monday, November 5, 2007. FINAL VERSION DUE: Monday, December 3, 2007. ** Submission guidelines ** We invite submission of high quality papers, written in English and typeset in LaTeX2e using the LNCS style. (See authors Instructions at Springer Online). Submissions should not have been published and should not be under consideration for publication elsewhere. Submissions should be no more than fifteen pages long in LNCS style. Please email your contribution as a self-contained PDF file to types07 at dimi.uniud.it with subject "Submission to TYPES 2007 proceedings". In a separate email, give the title, authors and abstract of your submission, as well as email address of the corresponding author. All submissions will be acknowledged. LNCS is now published in full-text electronic version, as well as printed books. Thus we will need the final LaTeX source files of accepted submissions. The final versions of accepted submissions must be in the LaTeX2e LNCS style, and be as self-contained as possible. With the final version you will also be asked to complete a copyright form for LNCS accepted papers. We look forward to hearing from you. Marino Miculan, Ivan Scagnetto, Furio Honsell Editors of the TYPES 2007 Proceedings From nathalie.mitton at inria.fr Wed Jul 18 05:14:08 2007 From: nathalie.mitton at inria.fr (Nathalie MITTON) Date: Wed, 18 Jul 2007 11:14:08 +0200 Subject: [TYPES/announce] IMAGINE 2007 - Call For Participation Message-ID: <469DD9E0.8000806@inria.fr> *** Apologies for multiple copies *** Too many research domains are explorated independently one of each other when ones can help in the designing of efficient algorithms for other research areas. IMAGINE is a conference which aims at gathering several research areas which can constitute tools to help the research in the field of dynamic networks. Therefore, it may interest readers of TYPES. ______________________________________________________________________ CALL FOR PARTICIPATION IMAGINE 2007 1st International workshop on Mobility, Algorithms and Graph theory In dynamic NEtworks September 26-27, 2007 Lemesos, Cyprus http://www.lifl.fr/IMAGINE2007/ Collocated with DISC 2007 ______________________________________________________________________ We cordially invite you to attend the IMAGINE 2007 workshop to be held in conjunction with DISC 2007, in Lemesos, Cyprus, which will bring together researchers from academia and industry. By attending IMAGINE, you will be given talks by talented junior researchers from the dynamic graphs research area. Indeed, the scientific program of the workshop consists of 5 invited lectures given by 5 junior speakers selected by a strong PC committee with respect to the quality of their research. This workshop aims at letting junior researchers around the world have a larger view of the recent results of their peers, in order to favor future collaboration. IMAGINE also aims at providing a supportive setting for feedback on junior researchers' current research and guidance on future research directions by offering them comments and fresh perspectives on their work from peers outside their own institution and/or field. Full details are on the conference Web site: http://www.lifl.fr/IMAGINE2007/ Invited speakers ================ Doina Bein (University of Texas at Dallas, USA) Augustin Chaintreau (Thomson Paris Research Lab, France) Hannes Frey (University of Southern Denmark, Denmark) Emmanuelle Lebhar (CNRS, LIAFA, France) Thomas Moscibroda (Microsoft Research, USA) Contact ================ David Ilcinkas (david.ilcinkas at lri.fr) Nathalie Mitton (nathalie.mitton at inria.fr) Nicolas Nisse (nicolas.nisse at lri.fr) Co-sponsored by ================ IEEE Cyprus INRIA Futurs From ioana.manolescu at inria.fr Fri Jul 20 08:04:37 2007 From: ioana.manolescu at inria.fr (Ioana Manolescu) Date: Fri, 20 Jul 2007 12:04:37 +0000 (UTC) Subject: [TYPES/announce] PLAN-X 2008 first call for papers Message-ID: Call for Papers and Demos ========================= PLAN-X 2008 --- Programming Language Techniques for XML ACM SIGPLAN Workshop colocated with POPL 2008 San Francisco, California, USA - 9 January 2008 http://gemo.futurs.inria.fr/events/PLANX2008/ The PLAN-X 2008 workshop is the forum to present and discuss bleeding-edge research at the intersection of programming language and data base technology with an emphasis on tree-shaped data structures and their XML representation. Topics of interest are all aspects of XML processing and querying: theories, methodologies, paradigms, language designs, types, analyses, runtime aspects, implementations, tools, applications. This edition of PLAN-X is particularly interested in blending the XML processing approaches developed by the programming languages and data management communities. Expressive power and high performance are among the common goals that these communities pursue. We encourage the submission of crosscutting contributions that apply techniques from one community to problems from the other. The primary criteria for paper selection are originality, relevance, and timeliness to ensure that we can enjoy reports on ongoing and unfinished work with high potential in the workshop. Submissions =========== We seek submissions in two categories * regular papers (10 pages, 30 minutes presentation) * demo papers (4 pages, 10 minutes plenary presentation + 30 minutes slot for individual discussions shared with other demos) For details see the submission instructions on http://gemo.futurs.inria.fr/events/PLANX2008/?page=subm Important Dates =============== Submission deadline 15 October 2007 Notification 30 November 2007 Final papers due 14 December 2007 Program Committee ================= Veronique Benzaken Universit? de Paris-Sud 11, France Alin Deutsch University of California, San Diego, USA Wenfei Fan University of Edinburgh, UK Mary Fernandez ATT Research, USA Haruo Hosoya University of Tokyo, Japan Ralf L?mmel Universit?t Koblenz, Germany Sebastian Maneth National ICT and UNSW, Sydney, Australia Jim Melton Oracle Corporation, USA Michael Schwartzbach University of Aarhus, Denmark J?r?me Vouillon CNRS, France Ioana Manolescu (general chair) Gemo group, INRIA Futurs, France Peter Thiemann (program chair) University of Freiburg, Germany From mirko.viroli at unibo.it Mon Jul 23 12:12:54 2007 From: mirko.viroli at unibo.it (Mirko Viroli) Date: Mon, 23 Jul 2007 18:12:54 +0200 Subject: [TYPES/announce] Call for Papers: ACM SAC 2008 Message-ID: <46A4D386.604@unibo.it> CALL FOR PAPERS - SAC 2008 The 23rd ACM Symposium on Applied Computing March 16 ? 20, 2008, Fortaleza, Cear?, Brazil http://www.acm.org/conferences/sac/sac2008 co-hosted by University of Fortaleza (UNIFOR) and Federal University of Cear? (UFC) SAC 2008 --------------- For the past twenty-two years, the ACM Symposium on Applied Computing has been a primary gathering forum for applied computer scientists, computer engineers, software engineers, and application developers from around the world. SAC 2008 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and is hosted by the University of Fortaleza and the Federal University of Cear?, in Brazil. PAPERS ------------- Authors are invited to submit original papers in all areas of experimental computing and application development for the technical program via the various tracks hosted by SAC 2008. Submissions fall into the following categories: *) Original and unpublished research work *) Reports of innovative computing applications in the arts, sciences, engineering, and business areas *) Reports of successful technology transfer to new problem domains *) Reports of industrial experience and demos of new innovative systems Peer groups with expertise in the track focus area will blindly review submissions to that track. Accepted papers will be published in the annual conference proceedings and will be made available in the ACM Digital library. Submission guidelines can be found on SAC 2008 Website (on the header). Prospective papers should be submitted per track using the provided automated submission system at http://sac.cs.iupui.edu/SAC2008/ Submission of the same paper to multiple tracks is not allowed. For more information please visit the SAC 2008 Website. SAC 2008 TRACKS ----------------------------- AC: Autonomic Computing ACS: Advances in Computer Simulation AISA: Artificial Intelligence in Space Applications APSLA: Agent-oriented Programming Systems, Languages and Applications ASIIS: Advances in Spatial and Image-Based Information Systems ATOS: Adaptive Techniques in Operating Systems BIO: Bioinformatics CAHC: Computer Applications in Health Care CF: Computer Forensics CISIA: Computational Logic and Computational Intelligence in Signal and Image Analysis CM: Coordination Models, Languages and Applications CN: Computer Networks CSP: Constraint Satisfaction and Programming DADS: Dependable and Adaptive Distributed Systems DE: Document Engineering DM: Data Mining DS: Data Streams DTTA: Database Theory, Technology, and Applications EBA: e-Business Applications EC: Applications of Evolutionary Computation EIS: Enterprise Information Systems ELSDS: Engineering Large-Scale Distributed Systems EMBS: Embedded Systems: Applications, Solutions, and Techniques GCR: Geometric Computing and Reasoning IAR: Information Access and Retrieval MAS: Mobile Agents and Systems MCA: Mobile Computing and Applications ME: Middleware Engineering MMV: Multimedia and Visualization NLSP: Natural Language Processing and Speech Recognition OE: Organizational Engineering OOPS: Object Oriented Programming Languages and Systems PL: Programming Languages PSC: Programming for Separation of Concerns RE: Requirement Engineering RHSES: Robotics: Hardware, Software, and Embedded Systems RTS: Real-Time Systems SE: Software Engineering SEC: Computer Security SOPDS: Self Organization in Pervasive Distributed Systems SV: Software Verification SWA: The Semantic Web and Applications TRECK: Trust, Recommendations, Evidence and other Collaboration Know-how UC: Ubiquitous Computing WT: Web Technologies IMPORTANT DATES ------------------------------- Sept. 8, 2007: Paper submissions Sept. 20, 2007: Tutorial submissions Oct. 16, 2007: Author notification Oct. 30, 2007: Camera-Ready Copy PROGRAM CHAIRS ------------------------------ Ronaldo Menezes, Florida Tech, USA, rmenezes[@]cs.fit.edu Mirko Viroli, Universit? di Bologna, Italy, mirko.viroli[@]unibo.it From gerwin.klein at nicta.com.au Thu Jul 26 02:49:17 2007 From: gerwin.klein at nicta.com.au (Gerwin Klein) Date: Thu, 26 Jul 2007 16:49:17 +1000 Subject: [TYPES/announce] CFP: Systems Software Verification 2008 Message-ID: <46A843ED.8000902@nicta.com.au> 3rd International Workshop on Systems Software Verification (SSV 08) Real Software, Real Problems, Real Solutions Feb 25/26 2008, Sydney, Australia http://nicta.com.au/ssv08/ Industrial-strength software analysis and verification has advanced in recent years through the introduction of model checking, automated and interactive theorem proving, and static analysis techniques as well as correctness by design, correctness by contract, and model-driven development. However, many techniques are working under restrictive assumptions which are invalidated by complex (embedded) system software such as operating system kernels, low-level device drivers or microcontroller code. The aim of this workshop is to bring together researchers and developers from both academia and industry, who are facing real software and real problems to find real, applicable solutions. By "real" we mean problems such as time-to-market or reliability that the industry is facing and is trying to fix in software that is deployed in the market place. A real solution is one that is applicable to the problem in industry and not one that only applies to an abstract, academic toy version of it. This forum will discuss software analysis/development techniques and tools; it will also serve as a platform to discuss open problems and future challenges in dealing with existing and upcoming system code. Topics include (but are not limited to): * model checking * automated and interactive theorem proving * static analysis * automated testing * model-driven development * embedded systems development * programming languages * verifying compilers * software certification * software tools * experience reports Interested speakers should submit their paper (max 15 pages, ENTCS style) to http://www.easychair.org/SSV08/ by Oct 19 2007, 23:59h Samoan time. All papers will be subject to peer review under normal conference standards. Experience reports and papers on work in progress are welcome as long as there is a clear contribution. Accepted submissions are planned to be published at ENTCS. Submissions must be in pdf format and follow the ENTCS style instructions at http://www.entcs.org/prelim.html. Important dates Oct 19 2007 Submission Deadline Dec 14 2007 Notification of accepted papers Jan 11 2008 Final version Jan 11 2008 Registration deadline Feb 25/26 2008 Workshop The workshop is organized as a two-day workshop (Feb 25/26 2008) and might be preceded by a tutorial day. Location The workshop will be held in Sydney, Australia on the campus of the University of New South Wales near Coogee Beach. Program Chair Ralf Huuck (NICTA) Gerwin Klein (NICTA) Bastian Schlich (RWTH Aachen University) Program Committee Andy Chou (Coverity) Byron Cook (Microsoft Research Cambridge) Dennis Dams (Alcatel-Lucent) Ansgar Fehnker (NICTA) David Hardin (Rockwell Collins) Joost-Pieter Katoen (RWTH Aachen University) Thomas Kropf (Robert Bosch GmbH) Gerald Luettgen (York) John Matthews (Galois) Tobias Nipkow (TUM) Michael Norrish (NICTA) Wolfgang Paul (Saarbruecken) Jan Peleska (University of Bremen) Alexander Pretschner (ETH Z?rich) Kai Richter (Symtavision GmbH) Zhong Shao (Yale) Hendrik Tews (Nijmegen) Stavros Tripakis (Verimag/Cadence) Carsten Weise (RWTH Aachen University) From Gilles.Barthe at sophia.inria.fr Thu Jul 26 11:07:40 2007 From: Gilles.Barthe at sophia.inria.fr (Gilles.Barthe@sophia.inria.fr) Date: Thu, 26 Jul 2007 17:07:40 +0200 (CEST) Subject: [TYPES/announce] Deadline extended for TGC07 Message-ID: <3366.138.96.217.63.1185462460.squirrel@imap-sop.inria.fr> Dear all, The deadline for TGC'07, to be held November 5-6 in Sophia Antipolis has been extended. Best Regards, Gilles Barthe [Apologies for multiple copies] ========================================================= New deadlines: - abstracts: August 3, 2007 - papers: August 10, 2007 ===> Proceeding as a volume of Springer LNCS confirmed <=== ========================================================== Call for Papers Trustworthy Global Computing 2007 November 5-6, 2007, Sophia-Antipolis, France http://www-sop.inria.fr/everest/events/tgc/tgc07/ ========================================================== The Symposium on Trustworthy Global Computing is an international annual venue dedicated to safe and reliable computation in global computers. It focuses on providing tools and frameworks for constructing well-behaved applications and for reasoning about their behaviour and properties in models of computation that incorporate code and data mobility over distributed networks with highly dynamic topologies and heterogeneous devices. We solicit paper in all areas of global computing, including (but not limited to): * theories, models and algorithms for global computing and service oriented computing * language concepts and abstraction mechanisms * security through verifiable evidence * information flow and resource usage policies * verification of cryptographic protocols and their use * trust, access control and security enforcement mechanisms * self configuration, adaptation, and dynamic components management * software principles to support debugging and verification * test generators, symbolic interpreters, type checkers * model checkers, theorem provers * privacy, reliability and business integrity Important Dates * Abstract submissions: August 3, 2007 * Paper submissions: August 10, 2007 * Notification to authors: September 17, 2007 * Final version for pre-proceedings: October 5, 2007 * Conference: November 5-6, 2007 * Version for post-proceedings: December 7, 2007 Submission Details Papers can be submitted online at http://www.easychair.org/TGC2007/. Contributions must be in Postscript or PDF and consist of no more than 15 pages in the Springer LNCS style. Additional details and proofs omitted due to space limitations may be included in a clearly marked appendix. Submitted papers must describe work unpublished in refereed venues, and not submitted for publication elsewhere. Proceedings and Special Issue We will publish Springer LNCS post-proceedings shortly after the conference, to give the authors the opportunity to take into account discussions and suggestions at the conference. Pre-proceedings with the accepted papers will be made available at the conference. Invited Speakers * Pierre Fraigniaud (CNRS and University of Paris 7) * Andrew D. Gordon (Microsoft Research) * Martin Hofmann (Ludwig-Maximilians-Universitat Muenchen) Program Chairs * Gilles Barthe (INRIA) * Cedric Fournet (Microsoft Research) Program Committee * Gilles Barthe (INRIA) * Roberto Bruni (University of Pisa) * Luis Caires (Universidade Nova de Lisboa) * Bruno Crispo (Vrije Universiteit Amsterdam) * Silvano Dal Zilio (CNRS) * Rocco De Nicola (University of Pisa) * Cedric Fournet (Microsoft Research) * Manuel Hermenegildo (T.U. of Madrid - UPM) * Alan Jeffrey (Bell Labs - Alcatel Lucent) * Christos Kaklamanis (University of Patras) * Cosimo Laneve (University of Bologna) * Uwe Nestmann (TU Berlin) * Dave Sands (Chalmers University of Technology of Goteborg) * Vladimiro Sassone (University of Southampton) * Ian Stark (University of Edinburgh) * Alan Schmitt (INRIA) * Paul G. Spirakis (University of Patras and RACTI) * Eric Tanter (Universidad de Chile) * Nobuko Yoshida (Imperial College London) From jeremy.siek at gmail.com Sat Jul 28 16:02:49 2007 From: jeremy.siek at gmail.com (Jeremy Siek) Date: Sat, 28 Jul 2007 14:02:49 -0600 Subject: [TYPES/announce] Extended deadline - LCSD 2007 (CFP) Message-ID: <3F5BF4E4-F6C6-47DE-B3F2-5D9CA46AC661@gmail.com> Extended deadline August 5, 2007 for research paper submissions. 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 5 Submission of papers (new deadline) Sep 5 Notification of acceptance Sep 19 Submission of final versions of the papers Oct 21 Symposium SUBMISSION PROCEDURE Submit papers using the START system at the following URL: https://www.softconf.com/starts/lcsd07/submit.html ORGANIZERS * Jaakko Jarvi, Texas A&M University * David Musser, Rensselaer Polytechnic Institute * Sibylle Schupp, Chalmers University of Technology * Jeremy Siek, University of Colorado (Co-Chair) * Frank Tip, IBM T.J. Watson Research (Co-Chair) PROGRAM COMMITTEE * Matthew Austern, Google * Antonio Cisternino, University of Pisa * 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. 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://ece.colorado.edu/~siek/ Assistant Professor Dept. of Electrical and Computer Engineering University of Colorado at Boulder -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070728/18d53359/attachment.htm From carlos.martin at urv.cat Sun Jul 29 13:04:40 2007 From: carlos.martin at urv.cat (carlos.martin@urv.cat) Date: Sun, 29 Jul 2007 17:04:40 GMT Subject: [TYPES/announce] LATA 2008: call for papers Message-ID: ******************************************************************************* Call for papers 2nd INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2008) Tarragona, Spain, March 13-19, 2008 http://www.grlmc.com ******************************************************************************* AIMS: LATA is a yearly conference in theoretical computer science and its applications. As linked to the International PhD School in Formal Languages and Applications that is being developed at the host institute since 2001, LATA 2008 will reserve significant room for young computer scientists at the beginning of their career. It will aim at attracting scholars from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence, etc.). SCOPE: Topics of either theoretical or applied interest include, but are not limited to: - words, languages and automata - grammars (Chomsky hierarchy, contextual, multidimensional, unification, categorial, etc.) - grammars and automata architectures - extended automata - combinatorics on words - language varieties and semigroups - algebraic language theory - computability - computational and structural complexity - decidability questions on words and languages - patterns and codes - symbolic dynamics - regulated rewriting - trees, tree languages and tree machines - term rewriting - graphs and graph transformation - power series - fuzzy and rough languages - cellular automata - DNA and other models of bio-inspired computing - symbolic neural networks - quantum, chemical and optical computing - biomolecular nanotechnology - automata and logic - algorithms on automata and words - automata for system analysis and programme verification - automata, concurrency and Petri nets - parsing - weighted machines - transducers - foundations of finite state technology - grammatical inference and algorithmic learning - text retrieval, pattern matching and pattern recognition - text algorithms - string and combinatorial issues in computational biology and bioinformatics - mathematical evolutionary genomics - language-based cryptography - data and image compression - circuits and networks - language-theoretic foundations of artificial intelligence and artificial life - digital libraries - document engineering STRUCTURE: LATA 2008 will consist of: - 3 invited talks (to be announced in the second call for papers) - 2 tutorials (to be announced in the second call for papers) - refereed contributions - open sessions for discussion in specific subfields or on professional issues PROGRAMME COMMITTEE: Jorge Almeida (Oporto) Stefano Crespi-Reghizzi (Milan) Erzsebet Csuhaj-Varju (Budapest) Carsten Damm (Goettingen) Volker Diekert (Stuttgart) Frank Drewes (Umea) Manfred Droste (Leipzig) Zoltan Esik (Tarragona) Henning Fernau (Trier) Joerg Flum (Freiburg, Germany) Rusins Freivalds (Riga) Christiane Frougny (Paris) Max Garzon (Memphis) Tero Harju (Turku) Lane Hemaspaandra (Rochester) Markus Holzer (Munich) Hendrik Jan Hoogeboom (Leiden) Costas Iliopoulos (London) Kevin Knight (Marina del Rey) Hans-Joerg Kreowski (Bremen) Dietrich Kuske (Leipzig) Thierry Lecroq (Rouen) Carlos Martin-Vide (Tarragona & Brussels, chair) Victor Mitrana (Tarragona) Mark-Jan Nederhof (St.-Andrews) Mitsunori Ogihara (Rochester) Friedrich Otto (Kassel) Jean-Eric Pin (Paris) Kai Salomaa (Kingston, Canada) Jacobo Toran (Ulm) Alfonso Valencia (Madrid) Hsu-Chun Yen (Taipeh) Sheng Yu (London, Canada) ORGANIZING COMMITTEE: Gabor Balazsfalvi Madalina Barbaiani Gemma Bel-Enguix Cristina Bibire Carlos Cruz Reyes Adrian-Horia Dediu Szilard-Zsolt Fazekas Armand-Mihai Ionescu M. Dolores Jimenez-Lopez Alexander Krassovitskiy Guangwu Liu Remco Loos Carlos Martin-Vide (chair) Zoltan-Pal Mecsei Tsetsegkhand Namsrai Catalin-Ionut Tirnauca Sherzod Turaev Florentina-Lilica Voicu SUBMISSIONS: Authors are invited to submit papers presenting original and unpublished research. Papers should not exceed 12 pages and should be formatted according to the usual LNCS article style. Submissions have to be sent through the web page: http://www.easychair.org/LATA2008/ PUBLICATION: A volume of proceedings (expectedly LNCS) will be available by the time of the conference. A refereed volume of selected proceedings containing extended papers will be published soon after it as a special issue of a major journal. REGISTRATION: The period for registration will be open since January 7 to March 13, 2008. Details about how to register will be provided through the website of the conference. Early registration fees: 250 euros Early registration fees (PhD students): 100 euros Registration fees: 350 euros Registration fees (PhD students): 150 euros FUNDING: 25 grants covering partial-board accommodation will be available for nonlocal PhD students. To apply, the candidate must e-mail her/his CV together with a copy of the document proving her/his status as a PhD student. IMPORTANT DATES: Paper submission: November 16, 2007 Application for funding (PhD students): December 7, 2007 Notification of funding acceptance or rejection: December 21, 2007 Notification of paper acceptance or rejection: January 18, 2008 Early registration: February 1, 2008 Final version of the paper for the proceedings: February 15, 2008 Starting of the conference: March 13, 2008 Submission to the journal issue: May 23, 2008 FURTHER INFORMATION: carlos.martin at urv.cat http://www.grlmc.com ADDRESS: LATA 2008 Research Group on Mathematical Linguistics Rovira i Virgili University Plaza Imperial Tarraco, 1 43005 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-559597 From eijiro.sumii at gmail.com Tue Jul 31 00:49:42 2007 From: eijiro.sumii at gmail.com (Eijiro Sumii) Date: Tue, 31 Jul 2007 13:49:42 +0900 (JST) Subject: [TYPES/announce] APLAS 2007 call for poster presentations (Singapore, Nov 29 - Dec 1) Message-ID: <20070731.134942.131103418.sumii@ecei.tohoku.ac.jp> CALL FOR POSTER PRESENTATIONS The Fifth ASIAN Symposium on Programming Languages and Systems (APLAS 2007) November 29 - December 1, 2007 Singapore http://flint.cs.yale.edu/aplas2007/ APLAS 2007 will include a poster session during the conference. The session aims to give students and researchers an opportunity to present their research to the community, and to get responses from other researchers. SCOPE: Poster presentations are sought in all areas of programming languages and systems, including (but not limited to): - 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 FORMAT: A space of A1 paper size (594 mm wide and 841 mm high) will be provided for each presentation. If you need more space, contact the poster chair (sumii AT ecei DOT tohoku DOT ac DOT jp). To prepare a good poster, search the Web for "poster presentation" and you will find many useful resources. REGISTRATION: Each presenter should e-mail a 1-2 page abstract in PDF or PostScript (including the title, authors, affiliations, and a summary of the work) to the poster chair (sumii AT ecei DOT tohoku DOT ac DOT jp) by September 14th, 2007. The program of the poster session will be announced by September 21st, 2007. We hope to accommodate every poster, but may restrict presentations (based on relevance and interest to the community) due to space constraints. IMPORTANT DATES: 1-2 page abstract September 14, 2007 notification September 21, 2007 conference November 29 - December 1, 2007 CONTACT: For questions or requests, please contact the APLAS 2007 poster chair, Eijiro Sumii (sumii AT ecei DOT tohoku DOT ac DOT jp). From poswolsky at itu.dk Tue Jul 31 22:02:44 2007 From: poswolsky at itu.dk (Adam Poswolsky) Date: Wed, 1 Aug 2007 04:02:44 +0200 (CEST) Subject: [TYPES/announce] Public Release of Delphin: HOAS made simple! Message-ID: <4810.68.194.229.39.1185933764.squirrel@secure.itu.dk> The Delphin Programming Language: Functional programming over LF ------------------------- Delphin is a functional programming language that utilizes LF for its datatypes. The key difficulties that we address are in supporting computation over higher-order encodings as well as supporting dependent types. When programming in languages like ML, Haskell, or even Twelf, the notion of "context" and "substitution" are meta-level concepts hidden to the programmer and they remain hidden in our system. We support computation over higher-order encodings by distinguishing between two methods of variable binding. A function can be written as ?fn x => e?. This has the standard meaning of a function, where the binding ?x? is intended for instantiation. The computation of ?e? is triggered by application which first instantiates the ?x?. Alternatively, we provide a ?newness? constructor binding variables that will always remain uninstantiated. We write "{}e", and the evaluation of e occurs while the binding x is uninstantiated. Therefore, for the scope of e, the variable x behaves as a fresh constant, which we call a "parameter". Delphin pervasively distinguishes between parameters and objects and typing statically guarantees that parameters cannot escape their scope. A submitted paper describing the underlying calculus of Delphin is at: http://cs-www.cs.yale.edu/homes/delphin/files/popl08-submission.pdf You are invited to try out our implementation available at: http://cs-www.cs.yale.edu/homes/delphin/delphin.htm (You will need SML/NJ or PolyML to install it) We welcome your feedback as well as any questions. There are many examples illustrating Delphin on the website. These examples range from simple addition, to combinator transformations, to an example of type inference using parameters instead of the typical references. Please direct your comments/questions to poswolsky at itu.dk . Thank you. Adam Poswolsky poswolsky at itu.dk From malexand at wu-wien.ac.at Wed Aug 1 20:10:57 2007 From: malexand at wu-wien.ac.at (Michael Alexander) Date: Thu, 02 Aug 2007 02:10:57 +0200 Subject: [TYPES/announce] Call for Book Chapters: Process Algebra/Algebraic Languages/Specification-based AD Message-ID: <46B12111.6090203@wu-wien.ac.at> Apologies if you received multiple copies of this message CALL FOR BOOK CHAPTERS BOOK TITLE: Process Algebra for Parallel and Distributed Processing: Algebraic Languages in Specification-Based Software Development EDITORS: Michael Alexander, WU Wien Bill Gardner, University of Guelph The book will be published in the Computational Science Series by Chapman and Hall/CRC Press in 2008 INTRODUCTION: Programming today's multi-core processor architectures, clusters, and grids is hard. Compiler research -- despite years of effort -- has still not produced implicit instruction parallelism detection that goes much beyond that of basic loop-parallelism. In addition, parallel programming in the past two decades has seen only measured improvements in parallel algorithms, languages with parallel expressivity, frameworks, and distributed validation support. As compilers have failed to deliver on their original promises, the objective of easing fine-grained parallel application programmability remains. As a consequence, new and additional paradigms are being looked at to solve what amounts to an emerging "parallel software development crisis". The approach that looks most promising is that of specification-based software development. It has its origins 3 decades ago, and it has been in a holding state for many years, only to re-emerge to a wider audience with the advent of the Object Management Group's Model Driven Architecture (MDA). Yet, specification-based software development can only deliver correct, parallel and distributed programs if the specification is precise, sufficiently expressive, and complete. Here, algebraic languages and process algebras are the paradigm that could catalyze solutions to many problems hampering efficient multi-core processor, cluster, and grid programmability problems. They are moving into a wide realm, as evidenced by the recent release of an interpreter for the algebraic Sun Fortress Language. The book is targeted to bring together the state-of-the-art in research on the application of algebraic languages and process algebras to parallel and distributed processing. It will be written to the problem statement of programming today's multi-core processor architectures, clusters, and grids. RECOMMENDED TOPICS INCLUDE BUT ARE NOT LIMITED TO THE FOLLOWING: The book aims to extensively treat algebraic languages/process algebras in parallel processing, embodying the state-of-the-art in many of the following non-inclusive list of subtopics, emphasizing an algebraic approach in each. Parallelism-oriented algebraic languages Process calculi as catalysts to solving the concurrent programming challenge Challenges in parallel programming Formal models in distributed and parallel processing Model checking, verification techniques Program transformation Axiomatizations Concurrent languages Formal semantics Formal object-oriented languages Algebras in the theory of parallel processing and distributed computing (Object oriented) distributed systems algebras Algebras and library-based approaches Frameworks supporting algebraic implementations MPI and process algebras Algebraic treatments of parallel and distributed databases (relational algebras/calculi) Concurrent composition Program generation Specification methods, notations and languages (Z, VDM-SL, B, etc.) Model and algebra transformation Operational semantics of distributed/parallel algebraic languages Parallel and distributed system specification Process algebra compilers Timed algebras Actor models CCS/CSP/ACP/Pi-Calculus/etc. in parallel-and distributed processing Equational Reasoning Software reliability/safety-critical systems Proofs Compositional/noncompositional methods Formal software development Integrated development environments for formal software Tools Case studies The editors invite the submission of abstracts (300-600 words) for proposed chapters, not under consideration elsewhere. Format and preparation instructions for full chapter submissions will be supplied to authors of accepted abstracts. Submitted chapters will undergo peer review. IMPORTANT DATES: Abstracts deadline, August 6, 2007 Notify accepted abstracts, August 13, 2007 Chapters deadline, Sep. 3, 2007 Notify accepted chapters, Dec. 17, 2007 Final manuscripts with index word lists, Feb. 18, 2008 HOW TO SUBMIT: Please post an abstract of your planned submission via EDAS at http://edas DOT info/newPaper.php?c=5487 There, create an EDAS account and paste the abstract text into the paper registration form. The book's website can be found at: http://carmel.cis.uoguelph.ca/paBook Editor Contacts Dr. Michael Alexander Wirtschaftsuniversitaet Wien Department of Information Systems and Process Management Augasse 2-6 A-1090 Vienna, Austria Email: malexand at wu-wien.ac.at Telephone: +43.1.31336.4467 Dr. William Gardner University of Guelph Department of Computing and Information Science 50 Stone Rd E Guelph, ON, N1G 2W1, Canada Email: wgardner at cis.uoguelph.ca Telephone: +1.519.824.4120 x52696 From demis at dimi.uniud.it Thu Aug 2 10:35:25 2007 From: demis at dimi.uniud.it (Demis) Date: Thu, 2 Aug 2007 16:35:25 +0200 Subject: [TYPES/announce] CFP: 3rd Int'l Workshop on Automated Specification and Verification of Web Systems (WWV'07) Message-ID: <957BEC5F-BC86-4EFD-92CB-642C2E5B7652@dimi.uniud.it> [ We apologize for multiple copies ] ******************************************************************* Preliminary Call For Papers 3rd International Workshop on Automated Specification and Verification of Web Systems (WWV'07) San Servolo island, Venice (Italy) December 14, 2007 http://wwv07.dimi.uniud.it/ ******************************************************************* SCOPE The increased complexity of Web sites and the explosive growth of Web-based applications has turned their design and construction into a challenging problem. Nowadays, many companies have diverted their Web sites into interactive, completely-automated, Web-based applications (such as Amazon, on-line banking, or travel agencies) with a high complexity that requires appropriate specification and verification techniques and tools. Systematic, formal approaches to the analysis and verification can address the problems of this particular domain with automated and reliable tools that also incorporate semantic aspects. We solicit original papers on formal methods and techniques applied to Web sites, Web services or Web-based applications, such as: * rule-based approaches to Web site analysis, certification, specification, verification, and optimization * formal models for describing and reasoning about Web sites * model-checking, synthesis and debugging of Web sites * abstract interpretation and program transformation applied to the semantic Web * intelligent tutoring and advisory systems for Web specifications authoring * Web quality and Web metrics * Web usability and accessibility * Testing and evaluation of Web systems and applications The WWV series provides a forum for researchers from the communities of Rule-based programming, Automated Software Engineering, and Web-oriented research to facilitate the cross-fertilization and the advancement of hybrid methods that combine the three areas. LOCATION WWV'07 will be held in December in the convention centre of the island of San Servolo, Venice, Italy. SUBMISSION PROCEDURE Submissions must be received by October 21, 2007. In addition, an ASCII version of the title and abstract must have been submitted by October 14, 2007. Submitted papers should be at most 15 pages in the Electronic Notes in Theoretical Computer Science (ENTCS) style, and should include an abstract and the author's information. See the author's instructions of ENTCS style at http://www.entcs.org. PUBLICATION Accepted papers will be published in a preliminary proceedings volume, which will be available during the workshop. Publication of the workshop post-proceedings in the Elsevier series Electronic Notes in Theoretical Computer Science (ENTCS) is envisaged. PROGRAM CO-CHAIRS Santiago Escobar (Technical University of Valencia, Spain) Massimo Marchiori (University of Padova, Italy) WORKSHOP CHAIR Demis Ballis (University of Udine, Italy) PROGRAM COMMITTEE (to be announced) IMPORTANT DATES Abstract Submission October 14, 2007 Full Paper Submission October 21, 2007 Acceptance Notification November 12, 2007 Camera Ready November 23, 2007 Workshop December 14, 2007 (temptative) From Bob.Coecke at comlab.ox.ac.uk Sat Aug 4 07:14:13 2007 From: Bob.Coecke at comlab.ox.ac.uk (Bob Coecke) Date: Sat, 4 Aug 2007 12:14:13 +0100 (BST) Subject: [TYPES/announce] Coalgebraic and Categorical Quantum Logic in Oxford Message-ID: The programs for: * COALGEBRAIC LOGIC, August 10-11, Oxford, UK * CATEGORICAL QUANTUM LOGIC, August 11-12, Oxford, UK are now available at: * http://se10.comlab.ox.ac.uk:8080/FOCS/COQL_en.html Sincerely, Bob Coecke. From morazanm at shu.edu Sat Aug 4 13:24:07 2007 From: morazanm at shu.edu (Marco T Morazan) Date: Sat, 4 Aug 2007 13:24:07 -0400 Subject: [TYPES/announce] IFL 2007: CFP and Submission Deadline Approaching Message-ID: Dear All, My apologies in advance if you receive multiple copies of IFL's call for papers. This year IFL is co-located with ICFP. I encourage all of you to submit to IFL. It is a lively and very enjoyable event with a post-symposium reviewing process. At IFL, the latest developments in the implementation of functional languages are discussed and the publication-ripe articles are chosen for publication in Springer's LNCS series. Cheers, Marco ********************************************************************** Call for Papers and Participation 19th International Symposium on Implementation and Application of Functional Languages IFL 2007 27th-29th September 2007, Freiburg, Germany co-located with ICFP 2007 http://proglang.informatik.uni-freiburg.de/IFL2007/ ********************************************************************** ==> Submission for Draft Proceedings 31 August 2007 ==> Early Registration & Hotel Deadline 1 September 2007 The aim of the IFL symposium is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. The symposium provides an open forum for researchers who wish to present and discuss new ideas and concepts, work in progress, preliminary results, etc. related primarily but not exclusively to the implementation and application of functional languages. Topics of interest include (but are not limited to): * language concepts * type checking * compilation techniques * (abstract) interpretation * generic programming techniques * automatic program generation * array processing * concurrent/parallel programming * heap management * runtime profiling * performance measurements * debugging and tracing * (abstract) machine architectures * verification * formal aspects * tools and programming techniques Papers on applications or tools demonstrating the suitability of novel ideas in any of the above areas and contributions on related theoretical work are also welcome. The change of the symposium name adding the term "application", introduced in 2004, reflects the broader scope IFL has gained over the years. Contributions Prospective authors are encouraged to submit papers to be published in the draft proceedings and present them at the symposium. All contributions must be written in English, conform to the Springer-Verlag LNCS series format and not exceed 16 pages. The draft proceedings will appear as a technical report. Every attendee of IFL 2007 will have the opportunity to submit a revised version of their paper for post-symposium reviewing. As in previous years, selected papers will be published by Springer Verlag in the Lecture Notes in Computer Science (LNCS) Series. Important Dates Submission for Draft Proceedings 31 August 2007 Early Registration Deadline 1 September 2007 Hotel Registration Deadline 1 September 2007 Symposium 27-29 September 2007 Submission for post-refereeing 2 November 2007 Notification of acceptance / rejection 14 December 2007 Submission of camera-ready version 25 January 2008 Programme Committee Peter Achten Radboud University Nijmegen, The Netherlands Kenichi Asai Ochanomizu University, Japan Manuel Chakravarty The University of New South Wales, Australia Olaf Chitil (chair) University of Kent, UK Martin Erwig Oregon State University, Oregon, USA Marc Feeley Universit? de Montr?al, Canada Martin Gasbichler Z?hlke Engineering AG, Switzerland Kevin Hammond University of St. Andrews, Scotland Zolt?n Horv?th E?tv?s Lor?nd University, Budapest, Hungary John Hughes Chalmers University of Technology, Sweden Ken Friis Larsen University of Copenhagen, Denmark Rita Loogen Philipps-Universit?t Marburg, Germany Michel Mauny ENSTA, France Sven-Bodo Scholz University of Hertfordshire, UK Clara Segura Universidad Complutense de Madrid, Spain Tim Sheard Portland State University, Oregon, USA Glenn Strong Trinity College, Dublin, Ireland Doaitse Swierstra Utrecht University, The Netherlands Malcolm Wallace The University of York, UK Local Organisation Markus Degen Universit?t Freiburg, Germany Peter Thiemann Universit?t Freiburg, Germany Stefan Wehr Universit?t Freiburg, Germany Further Information http://proglang.informatik.uni-freiburg.de/IFL2007/ ********************************************************************************** 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/20070804/ee4279da/attachment.htm From Oege.de.Moor at comlab.ox.ac.uk Mon Aug 6 09:00:32 2007 From: Oege.de.Moor at comlab.ox.ac.uk (Oege.de.Moor@comlab.ox.ac.uk) Date: Mon, 6 Aug 2007 13:00:32 GMT Subject: [TYPES/announce] PEPM 2008 Message-ID: <200708061300.l76D0WBD004912@mercury.comlab.ox.ac.uk> PEPM 2008 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation January 7-8, 2008, San Francisco Keynotes by Ras Bodik (Berkeley) and Monica Lam (Stanford) Co-located with POPL http://www.program-transformation.org/PEPM08/WebHome PEPM is a leading venue for the presentation of cutting-edge research in program analysis, program generation and program transformation. Its proceedings are published by ACM Press; full details of the scope, submission process, and program committee can be found at the above URL. The program committee would particularly welcome submissions from researchers in type systems on any topic relating to type systems for meta-programming Abstracts are due on October 12, and the deadline for full paper submission is October 17. Prospective authors are welcome to contact the program chairs, Robert Glueck (glueck at acm.org) and Oege de Moor (oege at comlab.ox.ac.uk) with any queries they might have. From icfp.publicity at googlemail.com Mon Aug 6 11:55:32 2007 From: icfp.publicity at googlemail.com (Matthew Fluet (ICFP Publicity Chair)) Date: Mon, 6 Aug 2007 10:55:32 -0500 Subject: [TYPES/announce] ICFP07 Call for Participation Message-ID: <53ff55480708060855o4f4f7afat50fd8339a38aa42@mail.gmail.com> ===================================================================== Call for Participation The 12th ACM SIGPLAN International Conference on Functional Programming (ICFP 2007) http://www.informatik.uni-bonn.de/~ralf/icfp07.html Freiburg, Germany, 1-3 October 2007 ===================================================================== ICFP 2007 provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. The conference covers the entire spectrum of work, from practice to theory, including its peripheries. Preliminary program: * http://www.informatik.uni-bonn.de/~ralf/schedule.html * Invited speakers: + John Hughes (Chalmers University of Technology) + Frank Pfenning (Carnegie Mellon University) + John Lloyd (Australian National University) * The Program committee has *deliberately* created extra breaks so as to give participants more time to talk with colleagues. Schedule including related workshops: * 30 Sep: ACM SIGPLAN Haskell Workshop * 30 Sep: ACM SIGPLAN Workshop on Scheme and Functional Programming * 1-3 Oct: ICFP07 * 4 Oct: ACM SIGPLAN Commercial Users of Functional Programming * 4 Oct: ACM SIGPLAN Workshop on Mechanizing Metatheory * 5 Oct: ACM SIGPLAN Erlang Workshop * 5 Oct: ACM SIGPLAN Workshop on ML * 5 Oct: ACM SIGPLAN Programming Languages meets Program Verification Registration information: * http://proglang.informatik.uni-freiburg.de/ICFP2007/registration.shtml * Early registration deadline: September 7, 2007 Accommodations information: * http://proglang.informatik.uni-freiburg.de/ICFP2007/accommodation.shtml * Conference reservation/rate deadline: September 1, 2007 * September/October is Freiburg's main tourist season; participants are advised to book rooms as early as possible. Conference organizers: * General Chair: Ralf Hinze (Universit?t Bonn) * Program Chair: Norman Ramsey (Harvard University) * Local Arrangements Chair: Peter Thiemann (Universit?t Freiburg) * Workshop Co-Chairs: Graham Hutton (University of Nottingham) and Matthias Blume (Toyota Technological Institute at Chicago) * Programming Contest Chair: Johan Jeuring (Universiteit Utrecht) * Publicity Chair: Matthew Fluet (Toyota Technological Institute at Chicago) From gupta at utdallas.edu Mon Aug 6 11:56:23 2007 From: gupta at utdallas.edu (Gopal Gupta) Date: Mon, 6 Aug 2007 10:56:23 -0500 (CDT) Subject: [TYPES/announce] PADL 2008: Call for Papers Message-ID: [ Colleagues, note that this will be the 10th PADL; We strongly urge you to submit papers, the deadline is only 3 weeks way] CALL FOR PAPERS!!! Tenth International Symposium on Practical Aspects of Declarative Languages 2008 (PADL '08) http://www.ist.unomaha.edu/padl2008/ San Francisco, USA January 7-8, 2008 Co-located with ACM POPL'08 Declarative languages build on sound theoretical bases to provide attractive frameworks for application development. These languages have been successfully applied to vastly different real-world situations, ranging from data base management to active networks to software engineering to decision support systems. New developments in theory and implementation have opened up new application areas. At the same time, applications of declarative languages to novel problems raises numerous interesting research issues. Well-known questions include designing for scalability, language extensions for application deployment, and programming environments. Thus, applications drive the progress in the theory and implementation of declarative systems, and benefit from this progress as well. PADL is a forum for researchers and practitioners to present original work emphasizing novel applications and implementation techniques for all forms of declarative concepts, including, functional, logic, constraints, etc. Topics of interest include: * innovative applications of declarative languages; * declarative domain-specific languages and applications; * practical applications of theoretical results; * new language developments & their impact on applications; * evaluation of implementation techniques on practical applications; * novel uses of declarative languages in the classroom; and * practical experiences PADL 08 welcomes new ideas and approaches pertaining to applications and implementation of declarative languages. PADL 08 will be co-located with the ACM POPL. IMPORTANT DATES AND SUBMISSION GUIDELINES Paper Submission: August 24, 2007 Notification: September 27, 2007 Camera-ready: October 23, 2007 Symposium: January 7-8, 2008 Authors should submit an electronic copy of the full paper (written in English) in Postscript (Level 2) or PDF. Papers must be no longer than 15 pages, written in 11-point font and with single spacing. Since the final proceedings will be published as Lecture Notes in Computer Science by Springer Verlag, authors are strongly encouraged to use the LNCS paper formatting guidelines for their submission. Each submission must include on its first page the paper title; authors and their affiliations; contact author's email and postal addresses, telephone and fax numbers, abstract, and three to four keywords. The keywords will be used to assist us in selecting appropriate reviewers for the paper. If electronic submission is impossible, please contact the program chair for information on how to submit hard copies. MOST PRACTICAL PAPER AWARD The Most Practical Paper award will be given to the submission that is judged by the program committee to be the best in terms of practicality, originality, and clarity of presentation. The program committee may choose not to make an award, or to make multiple awards. Contacts: For information about papers and submissions, please contact the Program Chair: Paul Hudak PC co-Chair - PADL 2008 Department of Computer Science Yale University P.O. Box 208285 New Haven, CT 06520 - 8285 Email: hudak at cs.yale.edu David S. Warren PC co-Chair - PADL 2008 Department of Computer Science Stony Brook University Stony Brook, NY Email: warren at cs.sunysb.edu For other information about the conference, please contact: Hai-Feng Guo General Chair - PADL 2008 Department of Computer Science College of Information Science & Technology University of Nebraska at Omaha Omaha, NE, U.S.A. Email: haifengguo at mail.unomaha.edu Sponsored by: COMPULOG Americas (http://www.cs.nmsu.edu/~complog) and University of Nebraska at Omaha From birkedal at itu.dk Wed Aug 8 10:58:55 2007 From: birkedal at itu.dk (Lars Birkedal) Date: Wed, 08 Aug 2007 16:58:55 +0200 Subject: [TYPES/announce] positions at the IT University of Copenhagen Message-ID: <82odhicbtc.fsf@itu.dk> The IT University of Copenhagen invites applications for six (6) assistant/associate professorships starting December 2007. Application deadline is September 3, 2007. Please see http://www1.itu.dk/sw64250.asp for details. Best wishes, Lars Birkedal From Jaafar.Gaber at utbm.fr Thu Aug 9 00:06:18 2007 From: Jaafar.Gaber at utbm.fr (Jaafar.Gaber@utbm.fr) Date: Thu, 09 Aug 2007 06:06:18 +0200 Subject: [TYPES/announce] IEEE GLOBECOM workshop, SUPE07, 30 November 2007, Washington DC Message-ID: <1186632378.46ba92ba5fd26@webmail.utbm.fr> CALL FOR PAPERS IEEE Workshop on Service Discovery and Composition in Ubiquitous and Pervasive Environments with IEEE GLOBECOM07, 26-30 November 2007, Washington DC Please visit http://hpcl.seas.gwu.edu/~bakhouya/SUPE'07.htm for submission guidelines and http://www.ieee-globecom.org/2007 for more information Accepted papers will be available on IEEExplore. The program committee would welcome submissions from researchers in type systems on topics relating to abstract data types; type systems for object-oriented, concurrent, distributed, and mobile programming Best regards, J.Gaber -- Dr J.Gaber Universit? de Technologie de Belfort-Montb?liard Rue Thierry Mieg 90010 Belfort Cedex, France voice: +33 (0)3-8458-3252, +33 (0)6-8134-6243 fax: +33 (0)3-8458-3342 emails: gaber at utbm.fr, gaber at science.gmu.edu From einarj at ifi.uio.no Thu Aug 16 09:29:00 2007 From: einarj at ifi.uio.no (Einar Broch Johnsen) Date: Thu, 16 Aug 2007 15:29:00 +0200 Subject: [TYPES/announce] CfP: Nordic Workshop on Programming Theory (NWPT'07) Message-ID: 2ND CALL FOR PAPERS The 19th Nordic Workshop on Programming Theory (NWPT'07) Oslo, Norway, 10-12 October, 2007 http://www.ifi.uio.no/nwpt07 The NWPT series of annual workshops is a forum bringing together programming theorists from the Nordic and Baltic countries (but also elsewhere). The previous workshops were held in Uppsala (1989, 1999 and 2004), Aalborg (1990), Gothenburg (1991 and 1995), Bergen (1992 and 2000), Turku (1993, 1998, and 2003), Aarhus (1994), Oslo (1996), Tallinn (1997 and 2002), Lyngby (2001), Copenhagen (2005), and Reykjavik (2006). This year it will be held in Oslo. IMPORTANT DATES 3 September: Submission of abstracts 15 September: Notification of acceptance 25 September: Registration CLOSES 10-12 October: WORKSHOP SCOPE Typical topics of the workshop include (but are not limited to): * Semantics of programs * Programming logics * Program verification * Formal specification of programs * Program synthesis * Program transformation and program refinement * Real-Time and hybrid systems * Modeling of concurrency * Programming methods * Tools for program construction and verification INVITED SPEAKERS - Gilles Barthe (INRIA Sophia-Antipolis, France), - Davide Sangiorgi (University of Bologna, Italy), - Neelam Soundarajan (Ohio State Univeristy, USA). SUBMISSIONS Authors wishing to give a talk at the workshop are requested to submit an abstract of 1-3 pages (ps or pdf, printable on A4 paper) to http://www.easychair.org/NWPT07 by the 3rd September 2007. Submission of work submitted for formal publication elsewhere and work in progress is permitted. The abstracts of the accepted contributions will be available at the workshop. After the workshop, selected papers will be published in a special issue of the Journal of Logic and Algebraic Programming (JLAP, Elsevier). PROGRAMME COMMITTEE * Luca Aceto, Reykjavík Univ., Iceland, and Aalborg Univ., Denmark * Michael R. Hansen, Techn. U. of Denmark, Denmark * Anna Ingolfsdottir, Reykjavík Univ., Iceland, and Aalborg Univ., Denmark * Einar Broch Johnsen, University of Oslo, Norway * Kim G. Larsen, Aalborg Univ., Denmark * Bengt Nordström, Univ. of Gothenburg, Chalmers Univ. of Tech., Sweden * Olaf Owe, University of Oslo, Norway * Gerardo Schneider, University of Oslo, Norway * Tarmo Uustalu, Inst. of Cybernetics, Estonia * Jüri Vain, Tallinn Technical University, Estonia * Marina Waldén, Åbo Akademi University, Finland * Uwe E. Wolter, University of Bergen, Norway * Wang Yi, Uppsala University, Sweden ORGANIZING COMMITTEE Einar Broch Johnsen, Olaf Owe, and Gerardo Schneider. EMAIL: nwpt-07(at)ifi.uio.no Co-located Events * The 1st Workshop on Formal Languages and Analysis of Contract-Oriented Software (FLACOS'07): Oct. 9-10 * Nordic Workshop on Dependability: Oct. 8-10 More (and more current) information is available at http://nwpt07.ifi.uio.no A short history of the workshop is available at http://www.cc.ioc.ee/nwpt02/history.html From areces at loria.fr Mon Aug 20 12:34:23 2007 From: areces at loria.fr (Carlos Areces) Date: Mon, 20 Aug 2007 18:34:23 +0200 Subject: [TYPES/announce] M4M-5: EasyChair Submission Page Now Open In-Reply-To: <46666967.3090904@loria.fr> References: <46666967.3090904@loria.fr> Message-ID: <46C9C28F.6060405@loria.fr> ==================================================================== 5th Worskhop on "Methods for Modalities" (M4M-5) http://m4m.loria.fr/M4M5 Ecole Normale Superieure de Cachan, France November 29-30 ==================================================================== The EasyChair Submission Page is now open at: http://www.easychair.org/M4M5/ ==================================================================== Scope ----- The workshop ``Methods for Modalities'' (M4M) aims to bring together researchers interested in developing algorithms, verification methods and tools based on modal logics. Here the term ``modal logics'' is conceived broadly, including temporal logic, description logic, guarded fragments, conditional logic, temporal and hybrid logic, etc. To stimulate interaction and transfer of expertise, M4M will feature a number of invited talks by leading scientists, research presentations aimed at highlighting new developments, and submissions of system demonstrations. We strongly encourage young researchers and students to submit papers and posters, especially for experimental and prototypical software tools which are related to modal logics. More information about the previous editions can be found at http://m4m.loria.fr/ Paper Submissions ------------------ Authors are invited to submit papers in the following three categories. - Regular papers up to 15 pages, describing original results, work in progress, or future directions of research. - System descriptions of up to 12 pages, describing new systems or significant upgrades of existing ones. - Presentation-only papers, describing work recently published or submitted (no page limit). These will not be included in the proceedings, but pre-prints or post-prints can be made available to participants. Submissions should be made via Easychair at the following address: http://www.easychair.org/M4M5/ Final versions of accepted papers will be published online in an Elsevier ENTCS volume. A preliminary version of the proceedings will also be available at the workshop. Invited speakers ----------------- Ahmed Bouajjani (University of Paris 7) Patricia Bouyer (OUCL, Oxford - LSV, ENS Cachan) Balder ten Cate (University of Amsterdam) Koen Claessen (Chalmers University of Technology) Wiebe van der Hoek (University of Liverpool) Important dates --------------- Deadline for submissions: September 7th, 2007 Notification: October 10, 2007 Camera ready versions: November 5, 2007 Workshop dates: November 29-30, 2007 Program Committee ----------------- Natasha Alechina, University of Nottingham Carlos Areces, INRIA Lorraine (co-chair) Philippe Balbiani, IRIT, Nicole Bidoit, Universite Paris-Sud Patrick Blackburn, INRIA Lorraine Torben Brauner, Roskilde University Stephane Demri, ENS de Cachan (co-chair) Maarten de Rijke, University of Amsterdam Valentin Goranko, University of the Witwatersrand Rajeev Gore, The Australian National University Carsten Lutz, Dresden University of Technology Nicolas Markey, ENS de Cachan Angelo Montanari, University of Udine Ulrike Sattler, University of Manchester Holger Schlingloff, Humboldt University / FIRST Renate Schmidt, University of Manchester Johan van Benthem, University of Amsterdam/ Stanford University ================================================================== 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 gerardo at ifi.uio.no Mon Aug 20 07:20:22 2007 From: gerardo at ifi.uio.no (Gerardo Schneider) Date: Mon, 20 Aug 2007 13:20:22 +0200 Subject: [TYPES/announce] FLACOS'07: 2nd call for contributions Message-ID: <46C978F6.6070303@ifi.uio.no> 2nd CALL FOR CONTRIBUTIONS First Workshop on Formal Languages and Analysis of Contract-Oriented Software (FLACOS'07) Oslo, Norway, 9-10 October, 2007 http://www.ifi.uio.no/flacos07 The fast evolution of the Internet has popularized service-oriented architectures with their promise of dynamic IT-supported inter-business collaborations. Realizing this promise involves integrating services which are geographically distant and are offered by a variety of organizations which do not fully trust each other. Indeed, collaboration presumes a minimum level of mutual trust. Wherever trust is perceived as insufficient, business people turn to contracts as a mechanism to reduce risks. The ability to negotiate contracts (e.g. for quality of service, security, and distribution of information) and to provide services based on them is therefore one of the most pressing needs to make collaborations a reality. High-level models of contracts are slowly making their way into service-oriented architectures, but application developers are still left to their own devices when it comes to writing code that will comply with a contract concluded just before service provision. At the programming language level, contracts appear as separate concerns that crosscut through application logic. The aim of this workshop is to bring together researchers and practitioners working on language-based solutions to the above problem through the formalization of contracts, the design of appropriate abstraction mechanisms that would guide the developer in the production of contract-aware applications, and formal analysis of such contract languages/software. IMPORTANT DATES Paper Submission Deadline: September 3, 2007 Notification of Acceptance: September 15, 2007 Registration for authors closes: September 25, 2007 WORKSHOP: October 9-10, 2007 SCOPE Typical topics of the workshop include (but are not limited to): * Formal languages for contracts * Contract-oriented software development * Formal analysis of contracts, including static analysis, run-time verification, and model checking techniques * Contract synthesis * Contract transformation and contract refinement * Contract negotiation, discovery and monitoring INVITED PARTICIPANTS * Gilles Barthe (INRIA Sophia-Antipolis, France) * Gerd Behrmann (Aalborg University, Denmark) * Frank S. de Boer (CWI, The Netherlands) * Ma. Emilia Cambronero Piqueras (University of Castilla-La Mancha, Spain) * Giuseppe Castagna (University of Paris 7, France) * Jean-Marc Eber (LexiFi, France) * Fritz Henglein (DIKU, Denmark) * Fabio Massacci (University of Trento, Italy) * John-Jules Ch. Meyer (Utrecht University, The Netherlands) * Ralf Reussner (University Karlsruhe, Germany) * Marek Sergot (Imperial College, UK) * Isabelle Simplot-Ryl (University of Lille 1, France) * Valentin Valero Ruiz (University of Castilla-La Mancha, Spain) SUBMISSIONS Authors wishing to give a talk at the workshop are requested to submit an abstract of 1-3 pages (ps or pdf, printable on A4 paper) to flacos-07 at ifi.uio.no by September 3, 2007. Submission of work submitted for formal publication elsewhere and work in progress is permitted. The abstracts of the accepted contributions will be available at the workshop. After the workshop, selected papers will be published in a special issue of the Journal of Logic and Algebraic Programming (Elsevier) together with selected publications from NWPT'07. REGISTRATION INFORMATION * More information to follow. PROGRAMME COMMITTEE * Pablo Giambiagi, SICS, Sweden * Olaf Owe, University of Oslo, Norway (co-chair) * Anders P. Ravn, Aalborg University, Denmark * Gerardo Schneider, University of Oslo, Norway (co-chair) CONTACT INFORMATION * flacos-07 at ifi.uio.no RELATED EVENTS * FLACOS'07 will be co-located with NWPT'07. -- 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 simon at dcs.gla.ac.uk Wed Aug 22 04:00:57 2007 From: simon at dcs.gla.ac.uk (Simon Gay) Date: Wed, 22 Aug 2007 09:00:57 +0100 Subject: [TYPES/announce] Post-doc position in Glasgow References: <973307F4-6A0D-43B5-9E71-AB2255EA5E48@dcs.gla.ac.uk> Message-ID: <50A1061C-D799-4C29-9FF7-59DA27FC34DF@dcs.gla.ac.uk> [ This job requires someone with expertise in semantics and type theory, and may be of interest to readers of the Types list. SG ] UNIVERSITY of GLASGOW DEPARTMENT OF COMPUTING SCIENCE RESEARCH ASSOCIATE (GRADE 7) ?29,139 - ?32,796 REF: 13576/DPO/A3 We are seeking to appoint a Research Associate to work on the EPSRC-funded project "Engineering Foundations of Web Services: Theories and Tool Support". This is a collaborative project between the University of Glasgow (Dr Simon Gay), Imperial College London (Dr Nobuko Yoshida) and Queen Mary, University of London (Dr Kohei Honda). The aims of the project are to develop programming languages, methodologies and tools to support the development of distributed software systems such as web services, based on recent research by the principal investigators and others. The work in Glasgow will involve theoretical research, the transfer of theoretical concepts into practical programming language constructs, and the development of software tools, especially in the form of Eclipse plug-ins. You should have a PhD in computer science or a closely related subject, with experience of research in programming language semantics and strong software development skills. A full job description and list of requirements can be found in the application pack (see below). Informal enquiries can be made to Dr Simon Gay (simon at dcs.gla.ac.uk). The post is available from 1 January 2008 up to 31 October 2010 or later. Interviews for this position will be held during the week beginning 22 October 2007. For an application pack, please see our website at www.gla.ac.uk. Applications comprising applicant information form, CV, covering letter, list of publications and names and contact details of two referees should be sent to: Michelle Lazenby, Department of Computing Science, University of Glasgow, 17 Lilybank Gardens, Glasgow G12 8QQ. Please quote the reference number. Closing date: 21 September 2007. From beringer at tcs.ifi.lmu.de Wed Aug 22 11:02:22 2007 From: beringer at tcs.ifi.lmu.de (Lennart Beringer) Date: Wed, 22 Aug 2007 17:02:22 +0200 Subject: [TYPES/announce] Research position in the area of types and verification at LMU Munich Message-ID: <1187794942.3963.13.camel@brennero.tcs.ifi.lmu.de> The Institute for Computer Science at the University of Munich offers a Research assistant position for 2 years starting as soon as possible. The position is available in the EU-funded project ``MOBIUS - mobility, ubiquity, and security''. The aim of the project is to develop a proof-carrying code architecture, where programs are equipped with formal proofs of security- and resource-related properties. We offer the opportunity to work on theoretically challenging and practically relevant topics in an international research environment. You are expected to have earned a good first degree in computer science or a closely related subject. Applications with a strong background in some of the following - programming languages (type systems, program logics, compilers) - verification techniques (static analysis, theorem proving) are particularly welcome. Depending on interest and prior expertise you will work on type systems for resource usage or generation of certificates in formalised program logics. Apart from the scientific work to be reported in scientific papers and prototype implementations you will also participate in the preparation of activity reports and deliverables. Remuneration will be according to age and qualification, following the German public service payment scheme (BAT IIA/TV\"OD 13). MOBIUS (mobius.inria.fr) is a large integrated project with 20 academic and industrial partners. Annual and topical workshops will present you with an excellent opportunity to demonstrate your work, learn new things, and forge contacts. To apply please send as soon as possible a letter of application to the address given below, including a CV, degree certificates, and contact details of at least one referee. The University of Munich is an equal opportunities employer and aims to increase the ratio of women in academia. We therefore particularly encourage female candidates to apply. Applications of handicapped candidates are treated with priority. All applications received before 1st October 2007 will be considered. Later applications are also welcome if the position is still open then. For further enquiries, please contact Lennart Beringer or Martin Hofmann, Institut f\"ur Informatik, Ludwig-Maximilians-Universit\"at M\"unchen, Oettingenstrasse 67, 80538 M\"unchen, www.tcs.ifi.lmu.de/~beringer and www.tcs.ifi.lmu.de/~mhofmann. From pasalic at cs.rice.edu Wed Aug 22 11:30:37 2007 From: pasalic at cs.rice.edu (Emir Pasalic) Date: Wed, 22 Aug 2007 11:30:37 -0400 Subject: [TYPES/announce] GPCE'07: CALL FOR PARTICIPATION Message-ID: <46CC569D.8060506@cs.rice.edu> CALL FOR PARTICIPATON ---------------------------------------------------------------------- Sixth International Conference on Generative Programming and Component Engineering (GPCE'07) October 1-3, Salzburg, Austria http://www.gpce.org/07 Sponsored by ACM SIGPLAN, in cooperation with ACM SIGSOFT co-located with ESWEEK'07 ---------------------------------------------------------------------- Consult http://www.gpce.org/07 for UP-TO-DATE and DETAILED information especially the calls for workshop contributions ---------------------------------------------------------------------- IMPORTANT DATES * Online registration now open at http://www.regonline.com/GPCE * Sep 6, 2007: Early hotel reservation deadline * Sep 30, 2007: Tutorials * Oct 1-3, 2007: Technical papers * Oct 4: GPCE'07 Workshops ---------------------------------------------------------------------- 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. ESWEEK participants are welcome to attend GPCE'07 technical presentation without additional charge. ---------------------------------------------------------------------- 2 INVITED SPEAKERS: * Markus Pueschel: TBA * Bran Selic: TBA 20 TECHNICAL PAPERS (see http://www.gpce.org/07/ConferenceProgram) 4 TUTORIALS T1: Model Driven Development and Generative Techniques for Embedded Systems (Bruce Trask and Angel Roman) T2: Building Composable, Domain-specific and General Purpose Extensions to Java (Eric Van Wyk) T3: Using Feature Models for Product Derivation (Danilo Beuche and Olaf Spinczyk) T4: Product Line Implementation using Models and Aspects (Markus Voelter, Christa Schwanninger and Iris Groher) 2 WORKSHOPS W1: APGES 2007 - Workshop on Automatic Program Generation for Embedded Systems http://www-fp.dcs.st-and.ac.uk/APGES/ W2: AOPLE'07 - Second Workshop on Aspect-Oriented Product Line Engineering http://www.softeng.ox.ac.uk/aople/ ---------------------------------------------------------------------- * 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) Workshops/Tutorials chair: Ulrik P. Schultz (University of Southern Denmark, Denmark) Publicity chair: Emir Pasalic (Rice University, USA) * Steering Committee: Don Batory (University of Texas at Austin, USA) Krzysztof Czarnecki (University of Waterloo, Canada) Ulrich Eisenecker (University of Leipzig, Germany) Stanislaw Jarzabek (National University of Singapore, Singapore) Eugenio Moggi (University of Genoa, Italy) Greg Morrisett (Harvard University, USA) Frank Pfenning (Carnegie Mellon University, USA) Tim Sheard (Portland State University, USA) Yannis Smaragdakis (University of Oregon, USA) Walid Taha (Rice University, USA) For More Information For additional information, clarification, or questions please feel free to contact the Program Chair (gpce07 at diku.dk). Check for latest news at http://gpce07.gpce.org. From Danny.Dube at ift.ulaval.ca Fri Aug 24 20:21:30 2007 From: Danny.Dube at ift.ulaval.ca (=?iso-8859-1?q?Danny_Dub=E9?=) Date: 24 Aug 2007 20:21:30 -0400 Subject: [TYPES/announce] CfParticipation: Scheme and FP 2007 Message-ID: <873ay8zcol.fsf@dadub.ift.ulaval.ca> [Apologies of you receive multiple copies of this message] 2007 Workshop on Scheme and Functional Programming http://sfp2007.ift.ulaval.ca/ Freiburg, Germany --- 30 September 2007 Registration is now open. The early registration deadline is September 7, 2007 (inclusive). (Information taken on August 24.) The preliminary programme follows. Danny Dub? ---------- 9.00 to 9.10: Welcome 9.10 to 10.00: Session I Chairman: Marc Feeley Advanced Macrology and the Implementation of Typed Scheme Ryan Culpepper, Sam Tobin-Hochstadt, and Matthew Flatt Well-typed programs can't be blamed Philip Wadler and Robert Bruce Findler 10.30 to 12.30: Session II Chairman: John Clements Generation-Friendly Eq Hash Tables Abdulaziz Ghuloum and R. Kent Dybvig Exceptional Continuations in JavaScript Florian Loitsch Software Transactions Meet First-Class Continuations Aaron Kimball and Dan Grossman Towards a Portable and Mobile Scheme Interpreter Adrien Pi?rard and Marc Feeley Applications of Fold to XML Transformation Andy Wingo 14.00 to 15.30: Poster Session \alpha Kanren - A Fresh Name in Nominal Logic Programming William E. Byrd and Daniel P. Friedman A Formal Rewriting Logic Semantic Definition of Scheme Patrick Meredith, Mark Hills, and Grigore Rosu Toward abstract profiling Nguyen-Minh Bui Deriving a Comprehensive Document from a Concise Document - Document Engineering in Scheme Kurt Noermark Gannet: a Scheme for Task-level Reconfiguration of Service-based Systems-on-Chip Wim Vanderbauwhede Implementing Language-Dependent Lexicographic Orders in Scheme Jean-Michel Hufflen 16.00 to 17.30: Discussion related to R6RS Chairman: Mitchell Wand From birkedal at itu.dk Sun Aug 26 03:40:15 2007 From: birkedal at itu.dk (Lars Birkedal) Date: Sun, 26 Aug 2007 09:40:15 +0200 Subject: [TYPES/announce] Ph.D. scholarships at the IT University of Copenhagen Message-ID: <82sl66sq00.fsf@itu.dk> A number of Ph.D. scholarships are available at the IT University of Copenhagen, including some in the areas of the Programming, Logic and Semantics (PLS) Group with research in programming languages, automated reasoning, logical frameworks, type theory, semantics, category theory, domain theory, distributed and mobile computing, business processes, concurrency theory, electronic voting. Please let potential students know. Deadline for application is October 22. See http://www1.itu.dk/sw66047.asp for the official announcement. Best wishes, Lars Birkedal Head of the PLS group. From Susanne.Graf at imag.fr Tue Aug 28 16:02:49 2007 From: Susanne.Graf at imag.fr (Susanne Graf) Date: Tue, 28 Aug 2007 23:02:49 +0300 Subject: [TYPES/announce] Call for participation: Between Control and Software --- Grenoble --- 28/09/2007 Message-ID: <46D47F69.6020507@imag.fr> *** Call for Participation *** Between Control and Software *** Workshop dedicated to Paul Caspi *** VERIMAG, Grenoble, France 28/09/2007 http://www.artist-embedded.org/artist/Between-Control-and-Software.html The relationship between control and computation has been in the focus of the research of Paul Caspi, leading, among other things, to the development of the Lustre language which combines the high-level description of control loops as viewed by the control engineer, with insights coming from the theory and practice of programming languages. The result has led to one of the rare examples of a programming language making it way from sound theory to an industrial-strength tool, used in the development of critical parts of airplanes, nuclear plants, elevators and public transportation systems. The workshop Between Control and Software, synchronized with the retirement of Paul Caspi in autumn 2007, will bring together experts in the field and collaborators of Paul at different periods for a series of lectures. Updated program, as well as registration and accommodation information can be found at the workshop web page. Early registration is until August 31, and the number of places is limited. Tentative Program: ----------------- 09:00-10:30 Nicolas Halbwachs, CNRS-VERIMAG Some Recollections of Paul Caspi Jacques Pulou, France Telecom R&D Some Lesser-Known Contributions of Paul Caspi Karl-Erik Arzen, Lund How Hard is Control? 10:30-11:30 Coffee break 1:30-12:30 Daniel Pilaud, Polyspace Technology Transfer in the Embedded Market: Past, Present and Possible Trends Alberto Sangiovanni-Vincentelli, UC Berkeley, Cadence and Parades Distributed Control Systems and Industrial Impact 12:30-14:00 Lunch 14:00-16:00 Albert Benveniste, INRIA/IRISA On Quasi-Synchronous or Loosely-Time-Triggered Architectures Edward Lee, UC Berkeley Using the Principles of Synchronous Languages in Discrete-event and Continuous-time Models Hermann Kopetz, Vienna Time and Determinism 16:30-18:00 Coffee break 16:30-18:30 Oded Maler, CNRS-VERIMAG From Control Loop to Software and from Lustre to Temporal Logic Eugene Asarin, LIAFA On the Theory of Timed Languages Joseph Sifakis, CNRS-VERIMAG The Algebra of Connectors -- Structuring Interaction in BIP (40) Marc Pouzet, Orsay On Combining Synchronous and Functional Programming (40) 20:00-23:00 Dinner in a good restaurant -- =================================================================== Oded Maler VERIMAG, Centre Equation, 2, av. de Vignate, 38610 Gieres, France. Phone: +33 (0) 456 52 03 74 Fax: 456 52 03 44 Oded.Maler at imag.fr http://www-verimag.imag.fr/~maler =================================================================== From damiani at di.unito.it Wed Aug 29 09:34:21 2007 From: damiani at di.unito.it (Ferruccio Damiani) Date: Wed, 29 Aug 2007 15:34:21 +0200 Subject: [TYPES/announce] CDR60 Colloquium (Early Registration by September 15, 2007) Message-ID: <46D575DD.5060408@di.unito.it> TYPES AND COMPUTATIONS: A Colloquium in Honor of Mario Coppo, Mariangiola Dezani-Ciancaglini, Simona Ronchi Della Rocca October 3, 2007 Roma, Italy (http://www.di.unito.it/~lambda/cdr60/) CALL FOR PARTECIPATION ************************************************************************** Early registration deadline: September 15, 2007. ************************************************************************** This special event is organized to celebrate the 60th birthday of Mario Coppo, Mariangiola Dezani-Ciancaglini and Simona Ronchi Della Rocca. The Colloquium will take place on the first day of the Italian Conference on Theoretical Computer Science 2007 (http://www.disp.uniroma2.it/ictcs07/). Invited speakers (in alphabetical order): Henk Barendregt Chantal Berline Corrado Boehm Furio Honsell Giuseppe Longo Pawel Urzyczyn ************************************************************************** On-line Early Registration is available at: http://www.disp.uniroma2.it/ictcs07/registration_colloquium.html ************************************************************************** -- Prof. Ferruccio Damiani Dipartimento di Informatica |Phone: (+39) 011 670 6719 Universit? degli Studi di Torino |Fax : (+39) 011 75 16 03 C.so Svizzera 185 |Email: damiani at di.unito.it I-10149 Torino, Italy |URL : http://www.di.unito.it/~damiani _________________________________________________________________________ Unless unavoidable, no Word, Excel or PowerPoint attachments, please. See http://www.fsf.org/philosophy/no-word-attachments.html From magaud at dpt-info.u-strasbg.fr Thu Aug 30 05:40:40 2007 From: magaud at dpt-info.u-strasbg.fr (Nicolas Magaud) Date: Thu, 30 Aug 2007 11:40:40 +0200 Subject: [TYPES/announce] PhD position available : Building reliable programs in computational geometry and certifying them with Coq Message-ID: <46D69098.1010208@dpt-info.u-strasbg.fr> A three-year PhD-student position is open at LSIIT (http://lsiit.u-strasbg.fr ) in the field of formal proofs in geometry. This proposal fits in the GALAPAGOS research project which has been accepted by the french research agency (ANR) in 2007. This thesis will be supervised by Professor Jean-Fran?ois Dufourd and co-advised by Nicolas Magaud (http://http://dpt-info.u-strasbg.fr/~jfd/ . We would like it to start as soon as possible (at the end of 2007 at the latest). Context : --------- In the GALAPAGOS project, we wish to apply computerized theorem proving tools to two aspects of geometry. The first aspect concerns computational geometry, the second step concerns verifying geometric reasoning steps in usual constructions, such as constructions with ruler and compass. Thesis proposal : Building reliable programs in computational geometry and certifying them ------------------------------------------------------------------------------------------ This thesis aims at improving software quality and at designing new algorithms in the field of computational geometry. To achieve this goal, we shall use combinatorial maps as our topological model and use formal methods to specify, interactively prove and automatically extract programs from their proofs of correctness. This work will be carried out in the Calculus of Inductive Constructions and implemented via the Coq proof assistant. From a specification and a constructive proof, its enables us to extract an Ocaml program via the proofs-as-programs paradigm. This, the program is certified, meaning that it always terminates and that it satisfies its specification. Geometric objects we shall consider are plane subdivisions, modeled by embedded combinatorial maps. Embeddings will be linear and most combinatorial maps involved will be planar. This thesis will make us revisit classic problems in computational geometry, among them, handling plane subdivisions, computing convex hulls, performing point location, co-refining maps, computing Delaunay and Vorono? diagrams. This should be sufficient to show our methodology benefits, especially proof techniques for structural and/or noetherian induction on subdivisions. This will allow us to deal with more complex algorithms such as those required in 3D. Contact Information : --------------------- For further information about this position, please contact either: Jean-Fran?ois Dufourd dufourd at dpt-info.u-strasbg.fr Nicolas Magaud magaud at dpt-info.u-strasbg.fr Applications should be directed to {dufourd,magaud}@dpt-info.u-strasbg.fr . Your application should contain a resume and a cover letter as well as references (e.g. your Master's thesis advisor). -- Nicolas Magaud mailto:magaud at dpt-info.u-strasbg.fr LSIIT - UMR 7005 CNRS-ULP Tel: (+33) 3 90 24 45 61 Bd S?bastien Brant - BP 10413 Fax: (+33) 3 90 24 44 55 67412 ILLKIRCH CEDEX - FRANCE http://dpt-info.u-strasbg.fr/~magaud From qinshengchao at hotmail.com Thu Aug 30 17:01:47 2007 From: qinshengchao at hotmail.com (Shengchao Qin) Date: Thu, 30 Aug 2007 21:01:47 +0000 Subject: [TYPES/announce] Call for Participation - APLAS 2007 Message-ID: Call for Participation The Fifth Asian Symposium on Programming Languages and Systems November 29 - December 1, 2007 Singapore http://www.comp.nus.edu.sg/~aplas07/ http://flint.cs.yale.edu/aplas2007/ Scope of the Conference----------------------- APLAS aims at stimulating programming language research by providing aforum for the presentation of recent results and the exchange of ideasand experience in topics concerned with programming languages andsystems. APLAS is based in Asia, but is an international forum thatserves the worldwide programming languages community. The APLAS series is sponsored by the Asian Association for Foundationof Software (AAFS), which has recently been founded by Asianresearchers in cooperation with many researchers from Europe and theUSA. The past formal APLAS symposiums were successfully held inSydney (2006, Australia), Tsukuba (2005, Japan), Taipei (2004, Taiwan)and Beijing (2003, China) after three informal workshops held inShanghai (2002, China), Daejeon (2001, Korea) and Singapore (2000).Proceedings of the past symposiums were published in Springer-Verlag'sLNCS 2895, 3302, 3780, and 4279. Conference Location------------------- APLAS'07 will be held at Kent Ridge Guild House, National Universityof Singapore. Singapore is a dynamic city rich in contrast and colorwhere you'll find a harmonious blend of culture, cuisine, arts andarchitecture. A bridge between the East and the West for centuries,Singapore, located in the heart of fascinating Southeast Asia,continues to embrace tradition and modernity today. Brimming withunbridled energy and bursting with exciting events, the city offerscountless unique, memorable experiences waiting to be discovered. Registration------------ The early registration deadline is set on 28Sept07. The registrationfees will cover conference proceeding, banquet dinner, andlunches/teas. Deadline Full Fees Student Fees early 28Sep07 S$600 S$400 online 23Nov07 S$650 S$425 on-site 29Nov07 S$700 S$450 Payment can be made with credit cards. Exchange rate (subject tofluctuation) is approx. US$1 = S$1.53 Online registration can be made at: http://www.comp.nus.edu.sg/~aplas07/local.html#registration Accommodation------------- A special rate S$155 per nite (excluding taxes but inclusiveof daily breakfast) is applicable to attendees of APLAS 2007 atRendezvous Hotel Singapore: http://www.rendezvoushotels.com/singapore/ The hotel is located in city center. A free daily shuttle bus will beprovided between this hotel and the conference site (at NUS) duringthe conference period. Our block of rooms is guaranteed till28Sept07, so advanced booking is encouraged as some rooms may bereleased after this date. For reservation, please use a special formthat can be found at: http://www.comp.nus.edu.sg/~aplas07/Hotel.APLAS07.pdf Poster Session-------------- APLAS07 will include a poster session. Submission deadlineis 14 Sept 2007. For details, please see: http://www.comp.nus.edu.sg/~aplas07/posters.html Conference Program------------------ 29 Nov (Thu)------------ 915- 930 Opening note 930-1030 Invited Talk X10: Programming Parallel Machines, Productively Vijay Saraswat (IBM TJ Watson Research Lab) 1100-1230 Session 1 The Nuggetizer: Abstracting Away Higher-Orderness for Program Verification Paritosh Shroff (Johns Hopkins University), Christian Skalka (University of Vermont) and Scott F. Smith (Johns Hopkins University) Local Reasoning for Storable Locks and Threads Alexey Gotsman (University of Cambridge), Josh Berdine (Microsoft Research), Byron Cook (Microsoft Research), Noam Rinetzky (Tel Aviv University) and Mooly Sagiv (Tel Aviv University) Monadic, Prompt Lazy Assertions in Haskell Frank Huch (CAU Kiel) and Olaf Chitil (University of Kent) 1345-1515 Session 2 Translation Correctness for First-Order Object-Oriented Pattern Matching Burak Emir (EPFL Lausanne), Qin Ma (OFFIS) and Martin Odersky (EPFL Lausanne) Persistent Oberon: A Programming Language with Integrated Persistence Luc Blaser (ETH Zurich) More Typed Assembly Languages for Confidentiality Dachuan Yu (DoCoMo Communication Laboratories USA) 1515-1630 Poster Session 1630-1730 Session 3 A Novel Test Case Generation Method for Prolog Programs Based on Call Patterns Semantics Lingzhong Zhao (Guilin University of Electronic Technology), Tianlong Gu (Guilin University of Electronic Technology), Junyan Qian (Guilin University of Electronic Technology) and Guoyong Cai (Guilin University of Electronic Technology) On a Tighter Integration of Functional and Logic Programming Frank Huch (CAU Kiel) and Bernd Brassel (CAU Kiel) 1800-2000 Reception 30 Nov (Fri)------------ 930-1030 Invited Talk Scalable Simulation of Biological Signaling Networks Vincent Danos (University of Paris VII & CNRS) 1100-1230 Session 4 Timed, Distributed, Probabilistic, Typed Processes Martin Berger (Imperial College London) and Nobuko Yoshida (Imperial College London) A Probabilistic Applied Pi-Calculus Jean Goubault-Larrecq (ENS Cachan), Catuscia Palamidessi (Ecole Polytechnique) and Angelo Troina (ENS Cachan & Ecole Polytechnique) Type-Based Verification of Correspondence Assertions for Communication Protocols Daisuke Kikuchi (Tohoku University) and Naoki Kobayashi (Tohoku University) 1400-1530 Session 5 Deriving Compilers and Virtual Machines for a Multi-Level Language Atsushi Igarashi (Kyoto University) and Masashi Iwaki (Kyoto University) Finally Tagless, Partially Evaluated (Tagless Staged Interpreters for Simpler Typed Languages) Jacques Carette (McMaster University), Oleg Kiselyov (FNMOC) and Chung-chieh Shan (Rutgers University) Polymorphic Delimited Continuations Kenichi Asai (Ochanomizu University) and Yukiyoshi Kameyama (University of Tsukuba) 1600-1730 Session 6 Adjunct Elimination in Context Logic for Trees Cristiano Calcagno (Imperial College London), Thomas Dinsdale-Young (Imperial College London) and Philippa Gardner (Imperial College London) Positive Arithmetic without Exchange is a Subclassical Logic Stefano Berardi (University of Torino) and Makoto Tatsuta (National Institute of Informatics, Japan) Mixed Inductive/Coinductive Types and Strong Normalization Andreas Abel (University of Munich) 1900-2100 Banquet 1 Dec (Sat)------------ 930-1030 Invited Talk Static and Dynamic Analysis : Better Together Sriram Rajamani (Microsoft Research India) 1100-1230 Session 7 The Semantics of "Semantic Patches" in Coccinelle: Program Transformation for the Working Programmer Neil Jones (University of Copenhagen) and Rene Rydhof Hansen (University of Copenhagen) An Efficient SSA-based Algorithm for Complete Global Value Numbering Jiu-Tao Nie (Peking University) and Xu Cheng (Peking University) A Systematic Approach to Probabilistic Pointer Analysis Alessandra Di Pierro (University of Verona), Chris Hankin (Imperial College London) and Herbert Wiklicky (Imperial College London) 1400-1530 Session 8 Complete Lattices and Up-to Techniques Damien Pous (ENS Lyon) A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract Alwen Tiu (Australian National University) CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence Frank Valencia (Ecole Polytechnique), Cinzia Di Giusto (University of Bologna), Jesus Aranda (Ecole Polytechnique) and Mogens Nielsen (University of Aarhus) 1600-1700 Session 9 Call-by-Name and Call-by-Value in Normal Modal Logic Yoshihiko Kakutani (University of Tokyo) Call-by-Value is Dual to Call-by-Name, Extended Daisuke Kimura (National Institute of Informatics, Japan) 1700-1715 Closing note Organization------------- 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) Zhendong Su (University of California, Davis, USA) Martin Sulzmann (National University of Singapore, Singapore) Eijiro Sumii (Tohoku University, Japan) Jerome Vouillon (CNRS, France) Kwangkeun Yi (Seoul National University, Korea) Jian Zhang (Chinese Academy of Sciences, China) POSTER SESSION CHAIR Eijiro Sumii (Tohoku University, Japan) LOCAL ARRANGEMENT CHAIR Wei-Ngan Chin (National University of Singapore, Singapore) _________________________________________________________________ Learn. Laugh. Share. Reallivemoms is right place! http://www.reallivemoms.com?ocid=TXT_TAGHM&loc=us -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.seas.upenn.edu/pipermail/types-announce/attachments/20070830/e231ab28/attachment.htm From chinwn at comp.nus.edu.sg Thu Aug 30 20:36:51 2007 From: chinwn at comp.nus.edu.sg (Chin Wei Ngan) Date: Fri, 31 Aug 2007 08:36:51 +0800 (SGT) Subject: [TYPES/announce] APLAS07 - Call for Participation Message-ID: Apologies for a previous garbled posting. Hope this is more readable:) WN ================================================================= Call for Participation The Fifth Asian Symposium on Programming Languages and Systems November 29 - December 1, 2007 Singapore http://www.comp.nus.edu.sg/~aplas07/ http://flint.cs.yale.edu/a