headers
S Barry Cooper | 1 Dec 2010 14:55
Picon
Favicon

[TYPES/announce] New: Algorithmic Randomness and Complexity

[ The Types Forum (announcements only),
     http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

BOOK ANNOUNCEMENT:

**********************************************************************
Rodney G. Downey and Denis R. Hirschfeldt: 'Algorithmic Randomness and 
Complexity' (Springer, November 2010)

One of the most eagerly anticipated books for some years has finally 
been published. It is the first book in the new CiE book series "Theory 
and Applications of Computability". Please ensure your library orders 
this mammoth work, a book destined to be a standard reference work in 
the field for many years.

For ordering details see the Springer webpage:

http://www.springer.com/mathematics/numerical+and+computational+mathematics/book/978-0-387-95567-4

or Amazon:

http://www.amazon.com/Algorithmic-Randomness-Complexity-Applications-Computability/dp/0387955674

And for the Springer page for the series:

http://www.springer.com/series/8819

**********************************************************************

For a printable flyer for your notice board, giving information on the
(Continue reading)

Permalink | Reply | 0 comments |
headers
Sebastian Alexander Mödersheim | 1 Dec 2010 20:13
Picon
Picon
Favicon

[TYPES/announce] ARSPA-WITS 2011 - deadline extension

[ The Types Forum (announcements only),
     http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

Due to several requests, the deadline is extended to 
December 10 for abstracts and 
December 17 for papers. 

CALL FOR PAPERS
===============

ARSPA-WITS'11

Joint Workshop on
Automated Reasoning for Security Protocol Analysis 
and
Issues in the Theory of Security

http://www.avantssar.eu/arspa-wits11

Saarbruecken, Germany
March 26-27, 2011

Affiliated with ETAPS 2011

IMPORTANT DATES
===============

Abstract due: (extended) December 10, 2010 
Papers due: (extended) December 17, 2010
Author Notification: January 21, 2011
(Continue reading)

Permalink | Reply | 0 comments |
headers
Jean-Yves Marion | 2 Dec 2010 06:47
Picon
Favicon

[TYPES/announce] Second call for papers : DICE 2011 / ETAPS

[ The Types Forum (announcements only),
     http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

------------------------------------------------------------------------------

              ------- Call for papers ---------

----------------------------------------------------------------------------------

                Second International  Workshop on
  Developments in Implicit Computational complExity
                        (DICE 2011)

                   http://dice11.loria.fr/

      April, 2nd-3rd, Saarbrücken, Germany
              as part of ETAPS 2011

-----------------------------------------------------------------------------------

SCOPE AND TOPIC:

The area of Implicit Computational Complexity (ICC) has grown out from  several proposals to
use logic and formal methods to provide languages for complexity- bounded computation
(e.g. Ptime, Logspace computation). It aims at studying computational  complexity
without referring to external measuring conditions or a particular  machine model, but
only by considering language restrictions or logical/computational  principles implying complexity
properties.
This workshop focuses on ICC methods related to programs (rather than  descriptive methods).  In this approach
one relates complexity classes to restrictions on
programming paradigms (functional programs, lambda calculi, rewriting  systems), such as ramified recurrence,
weak polymorphic types, linear logic and linear types, and  interpretative measures. The two main objectives of this area are:
- to find natural implicit characterizations of various complexity  classes of
functions, thereby illuminating their nature and importance;
- to design methods suitable for static verification of program  complexity.
Therefore  ICC is related on the one hand to the study of complexity
classes, and on the other hand to static program analysis.

The workshop will be open to contributions on various aspects of ICC  including (but
not exclusively):
- types for controlling complexity,
- logical systems for implicit computational complexity,
- linear logic,
- semantics of complexity-bounded computation,
- rewriting and termination orderings,
- interpretation-based methods for implicit complexity,
- programming languages for complexity bounded computation, 
- application of implicit complexity to other programming paradigms  (e.g. imperative or object-oriented languages)

The first DICE workshop ( http://www.ens-lyon.fr/LIP/DICE2010/) was held in 2010 at ETAPS.  Before that, several meetings
on this topic had already been held with success in  Paris  in 2008
(WICC'08,  http://www-lipn.univ-paris13.fr/~mogbil/wicc08/  ), in  Marseille  in 2006
(GEOCAL'06 workshop on Implicit computational complexity, http://www-lipn.univ-paris13.fr/~baillot/GEOCAL06/ICCworkshop.html) ,
and Paris in 2004  (ICC and logic meeting,  http://www-lipn.univ-paris13.fr/~baillot/workshopGEOCAL/complexite.html).

INVITED SPEAKERS:
  *  Martin Hofmann
  *  Daniel Leivant
   * Ricardo Peña

IMPORTANT DATES:
* Paper submission: December 15th, 2010
* Notification date: January 27th, 2011
* Final version due: February 8th, 2011
* Workshop: April 2nd-3rd, 2011


SUBMISSION PROCEDURE:
There will be two categories of submissions:
  * Full papers: up to 15 pages (including bibliography).
 * Extended abstracts for short presentations (that will not be  included in the proceedings): up to 3 pages;
Authors must indicate if their submission belongs to the second  category (by mentioning "(Extended Abstract)" in the title).

Papers must be sumbitted electronically, as pdf files,  at the  following URL:
   http://www.easychair.org/conferences/?conf=dice2010
Submissions of the first category (full papers) should not have been  published before or submitted simultaneously
to another conference or journal. This restriction does not hold for  the second category (extended abstracts).
These latter submissions will be an opportunity to present work in  progress or to get a feedback from
the audience on a work already published elsewhere. Submissions of  papers authored by  PC members are allowed.

We plan to publish post-proceedings.

PROGRAMME COMMITTEE:
Amir Ben-Amram (Academic College of Tel-Aviv)
Patrick Baillot (ENS Lyon, CNRS)
Jean-Yves Marion (Université de Lorraine) (Chair)
Simone Martini (Università di Bologna)
Damiano Mazza (Université Paris 13)
Georg Moser (Universität Innsbruck)
Ricardo Peña (Universidad de Madrid)
Luca Roversi (Università di Torino)
Jim Royer (Syracuse University)

STEERING COMMITTEE:
Patrick Baillot (ENS Lyon, CNRS) (Chair)
Martin Hofmann (Ludwig-Maximilians-Universität München)
Jean-Yves Marion (Université de Lorraine)
Simona Ronchi Della Rocca (Università di Torino)

FINANCIAL SUPPORT: The workshop is partially supported by:
ANR project COMPLICE (Implicit Computational Complexity, Concurrency  and Extraction),  ANR-08-BLANC-0211-01.

CONTACT:  Jean-Yves.Marion-/zGXu1G9BXs@public.gmane.org
Permalink | Reply | 0 comments |
headers
Antonio Cunei | 3 Dec 2010 16:38
X-Face
Face

[TYPES/announce] CFP: The Second Scala Workshop - Scala Days 2011

[ The Types Forum (announcements only),
     http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

The Second Scala Workshop
=========================

Call for Papers
---------------

Scala is a general purpose programming language designed to express
common programming patterns in a concise, elegant, and type-safe
way. It smoothly integrates features of object-oriented and
functional languages.

This workshop is a forum for researchers and practitioners to share
new ideas and results of interest to the Scala community. The
secondn annual workshop will be held at Stanford University in
the San Francisco Bay Area, on Thursday the 2nd of June 2011,
co-located with Scala Days 2011 (2nd-3rd of June).

We seek papers on topics related to Scala, including (but not
limited to):

1. Language design and implementation -- language extensions,
optimization, and performance evaluation.

2. Library design and implementation patterns for extending Scala --
embedded domain-specific languages, combining language features,
generic and meta-programming.
(Continue reading)

Permalink | Reply | 0 comments |
headers
Arend Rensink | 7 Dec 2010 11:18
Picon
Picon
Picon

[TYPES/announce] Reminder: EAPLS PhD Award 2010: Call for Nominations (deadline 31-12-2010)

[ The Types Forum (announcements only),
     http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

EAPLS PhD Award 2010: Call for Nominations
==========================================
URL: http://eapls.org/pages/phd_award/

The European Association for Programming Languages and Systems
has established a Best Dissertation Award in the international
research area of programming languages and systems. The award
will go to the PhD student who in the previous period has made
the most original and influential contribution to the area. The
purpose of the award is to draw attention to excellent work, to
help the career of the student in question, and to promote the
research field as a whole.

Eligibility
-----------

Eligible for the award are those who successfully defended their PhD
* at an academic institution in Europe
* in the field of Programming Languages and Systems
* in the period from 1 January 2009 – 1 November 2010

Nominations
-----------

Candidates for the award must be nominated by their supervisor.
Nominating a candidate consists of submitting the thesis to
http://www.easychair.org/conferences/?conf=eaplsphd2010. The
(Continue reading)

Permalink | Reply | 0 comments |
headers
Gardner, Philippa A | 8 Dec 2010 17:40
Picon

[TYPES/announce] lectureship at Imperial

[ The Types Forum (announcements only),
     http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

There's a lectureship going in Imperial (actually we're hoping it'll  
turn into two).
Deadline 10th January.

Philippa

Imperial College London
Department of Computing
Lectureship Post (equiv. Assistant Professor)
Lectureship Salary: GBP 42,500 to GBP 47,450 per annum

Imperial College London is a world leading university whose reputation
for excellence in teaching and research attracts students and staff of
the highest international quality. The three Faculties - Engineering,
Natural Sciences and Medicine - together with the Business School
explore the interface between science, medicine, engineering and
management.

The Department of Computing is a leading department of Computer
Science among the UK Universities. It has consistently been awarded
the highest research rating (5*) in Research Assessment Exercises and
was rated as "Excellent" in the previous national assessment of
teaching quality.

Research in the Department is clustered into the following themes:
Computer Systems, Human Centered Computing, Logic & Artificial
Intelligence, Theory of Computational Systems, Quantitative Analysis
(Continue reading)

Permalink | Reply | 0 comments |
headers
Guy McCusker | 9 Dec 2010 12:46
Picon
Favicon

[TYPES/announce] PhD opportunities in Computer Science at Bath

[ The Types Forum (announcements only),
     http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

** PhD studies in Logic and Semantics of Computation at Bath ***

**** Apply by January 18th 2011 to be considered for University Research Studentships ****

Applications are invited for PhD study in the Logic and Semantics of
Computation research group at the University of Bath.

Our staff include Alessio Guglielmi, Jim Laird, Guy McCusker and John Power.
We welcome students interested in logic and proof theory, semantics of
programming languages and proof systems, and category theory.

The research publications of the Department of Computer Science at
Bath were ranked 3rd in the UK at the 2008 Research Assessment
Exercise. The department's other research interests include computer
algebra, computational geometry, logic programming, computer vision
and graphics, artificial intelligence, agents, and human-computer
interaction.

A wide range of funding opportunities, including full stipendiary
studentships as well as scholarships and fee-waivers, is available,
for studies commencing in October 2011. Every application will be
considered competitively for all eligible funding sources. The sooner you apply, the
more opportunities are available.

Applications received by January 18th 2011 will be considered for University Research
Studentships, which pay the cost of EU-rate fees and a stipend.

Please direct informal enquiries to G.A.McCusker-+E0FUbDlCk21Qrn1Bg8BZw@public.gmane.org or visit


for application details


-----

Guy McCusker
Professor of Computer Science
Dept of Computer Science
University of Bath
Bath BA2 7AY
United Kingdom

+44 (0) 1225 383578






Permalink | Reply | 0 comments |
headers
Wouter Swierstra | 9 Dec 2010 13:25

[TYPES/announce] ICFP 2011: Call for papers

[ The Types Forum (announcements only),
     http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

=====================================================================

                        Call for Papers

   ICFP 2011: International Conference on Functional Programming

       Tokyo, Japan, Monday 19 -- Wednesday 21 September 2011

               http://www.icfpconference.org/icfp2011

=====================================================================

Important Dates
~~~~~~~~~~~~~~~

Titles, abstracts & keywords due:  Thursday 17 March 2011 at 14:00 UTC
                 Submissions due:  Thursday 24 March 2011 at 14:00 UTC
                 Author response:  Tuesday & Wednesday 17-18 May
                    Notification:  Monday 30 May  2011
                  Final copy due:  Friday 01 July  2011
                      Conference:  Monday-Wednesday 19-21 September 2011

Scope
~~~~~

ICFP 2011 seeks original papers on the art and science of functional
programming.  Submissions are invited on all topics from principles to
(Continue reading)

Permalink | Reply | 0 comments |
headers
Swarat Chaudhuri | 9 Dec 2010 19:04
Picon
Favicon

[TYPES/announce] POPL 2011: Call for participation

[ The Types Forum (announcements only),
     http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

**************************************************************
*                  ACM SIGPLAN-SIGACT Symposium                    
*                            on                            
*              Principles of Programming Languages                  
*                                                      
*                    January 26-28, 2011                          
*                       Austin, TX, USA                          
*                   Call for Participation                        
*                                      
*                 http://www.cse.psu.edu/popl/11/
***************************************************************

Important dates
------------------------

* Deadline for student travel grant
 applications for full consideration: December 17, 2010
* Hotel reservation deadline: December 21, 2010
* Early registration deadline: December 31, 2010
* Conference: January 26-28, 2011

Scope
-------------------------

The annual Symposium on Principles of Programming Languages is a
forum for the discussion of fundamental principles and important
innovations in the design, definition, analysis, transformation,
(Continue reading)

Permalink | Reply | 0 comments |
headers
Vasco T. Vasconcelos | 10 Dec 2010 13:11
Picon

[TYPES/announce] Places 2011 - Call for Papers

[ The Types Forum (announcements only),
     http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

                         CALL FOR PAPERS
                            PLACES'11
         Programming Language Approaches to Concurrency
               and communication-cEntric Software
                 2nd April 2011, Saarbrücken, Germany
                      Affiliated with ETAPS 2011
                     http://places11.di.fc.ul.pt/

Theme and Goals

Applications on the web today are built using numerous interacting
services; soon off-the-shelf CPUs will host hundreds of cores; and
sensor networks will be composed from a large number of processing
units.  Much normal software, including applications and system-level
services, will soon need to make effective use of thousands of
computing nodes. At some level of granularity, computation in such
systems will be inherently concurrent and communication-centred.

To exploit and harness the richness of this computing environment,
designers and programmers will utilise a rich variety of programming
paradigms, depending on the shape of the data and control
flow. Plausible candidates for such paradigms include structured
imperative concurrent programming, stream-based programming,
concurrent functions with asynchronous message passing, higher-order
types for events, and the use of types for communications and data
structures (such as session types and linear types), to name but a
few. Combinations of these abstractions will be used even in a single
(Continue reading)

Permalink | Reply | 0 comments |

Gmane