headers
Martin Odersky | 1 Oct 2002 18:00
Picon
Picon
Favicon

Position Announcement


			    EPFL Lausanne
		      Programming Methods Group
			 Prof. Martin Odersky

I am inviting applications for two

	           Associate Research Scientist

positions in the programming methods group at EPFL. The positions
are linked to the two projects

 * Programming Language Abstractions for Semi-Structured Data
 * Efficient Implementations of Scalable Languages  

which are funded by Hasler Foundation and EPFL, respectively.  The
projects have as common goal the investigation and implementation of
novel programming concepts at the borderline of functional and
object-oriented programming, with special emphasis on interacting with
data in XML format.

Requirement for the positions is a Ph.D. in computer science, and a
strong background in one or more of the following areas:

    - programming language implementation,
    - type systems,
    - functional programming,
    - object-oriented programming,
    - XML and semi-structured data.
(Continue reading)

Permalink | Reply | 0 comments |
headers
etaps02 VERIMAG | 4 Oct 2002 21:20
Picon
Picon
Favicon

TACAS 2003: Paper Submission Deadline approaches

            CALL FOR PAPERS (Deadline October, 18, 2002)

                  Ninth International Conference on
                        TOOLS AND ALGORITHMS
            FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS
                             (TACAS 2003)

        7-11 April 2003                       Warsaw, Poland

               URL:  http://www.mimuw.edu.pl/etaps03

                     A member conference of the
   European Joint Conferences on Theory and Practice of Software
                           (ETAPS 2003)

CONFERENCE DESCRIPTION

TACAS is a forum for researchers, developers and users interested in
rigorously based tools for the construction and analysis of
systems. The conference serves to bridge the gaps between different
communities --- including but not limited to those devoted to formal
methods, software and hardware verification, static analysis,
programming languages, software engineering, real-time systems, and
communications protocols --- that have traditionally had little
interaction but share common interests in, and techniques for, tool
development. In particular, by providing a venue for the discussion of
common problems, heuristics, algorithms, data structures and
methodologies, TACAS aims to support researchers in their quest to
improve the utility, reliability, flexibility and efficiency of tools
for building systems.
(Continue reading)

Permalink | Reply | 0 comments |
headers
Lucilia Camarao de Figueiredo | 4 Oct 2002 21:32
Picon

SBLP 2003 - call for papers

---------------------------------------------------------------------
                            CALL FOR PAPERS

    SBLP 2003 - 7th BRAZILIAN SYMPOSIUM ON PROGRAMMING LANGUAGES

             Ouro Preto, MG, Brazil - May 28-30, 2003

               http://www.inf.pucminas.br/sblp2003

            Sponsored by: Brazilian Computing Society
---------------------------------------------------------------------

SCOPE 

The annual Brazilian Symposium on Programming Languages (SBLP), sponsored
by the Brazilian Computer Society (SBC), aims to provide a forum where
researchers, educators, and practitioners can present and discuss the
fundamental principles and important innovations in the design, analysis
and implementation of programming languages and systems.

We invite authors to contribute to SBLP 2003 with the following kinds of
submissions:

- Technical research papers introducing original research results on 
  topics such as (but not limited to): 

  * Programming language design and implementation 
  * Formal semantics of programming languages 
  * Domain-specific programming languages 
  * Visual programming languages
(Continue reading)

Permalink | Reply | 0 comments |
headers
rosolini | 8 Oct 2002 12:26
Picon
Favicon

DOMAIN THEORY AND APPLICATIONS -- cfp

                Call for Papers

Special Issue of Theoretical Computer Science
(TCS-B, Editor-in-Chief: D. Sannella)

on       DOMAIN THEORY AND APPLICATIONS

Guest Editors:
Lars Birkedal, Martin Escardo,
Achim Jung, Giuseppe Rosolini

Domain theory has had applications to programming language semantics and
logics (lambda-calculus, PCF, LCF), recursion theory (Kleene-Kreisel
countable functionals), general topology (injective spaces, function
spaces, locally compact spaces, Stone duality), topological algebra
(compact Hausdorff semilattices) and analysis (measure, integration,
dynamical systems). Moreover, these applications are related - for
example, Stone duality gives rise to a logic of observable properties of
computational processes.

As such, domain theory is highly interdisciplinary. This year, two
workshops devoted to the subject provided a forum where a large number of
researchers from many different areas presented new ideas and surveyed
past results (in Copenhagen, July 20-21, in Birmingham, September 16-19).

With this call we are soliciting papers relating to Domain Theory in an
essential fashion. Topics of interest include, but are not restricted to:

* program semantics
* program logics
(Continue reading)

Permalink | Reply | 0 comments |
headers
F.S.de.Boer | 8 Oct 2002 17:51
Picon
Picon
Favicon

FMCO: Last Call and Final Program

**************************CALL FOR PARTICIPATION*******************************

                  First International Symposium on 

             FORMAL METHODS FOR OBJECTS AND COMPONENTS

                            (FMCO 2002)

                   http://fmco.liacs.nl/fmco02.html

  
IMPORTANT DATES 

- The symposium will be held November 5-8, 2002. 
  Place: Leiden, The Netherlands.

- The deadline for REGISTRATION is October 15, 2002.
  For more information about participation and registration see the FMCO
  site http://fmco.liacs.nl/fmco02.html
  For further information consult 
  F.S. de Boer (frb@...) or M.M. Bonsangue (marcello <at> liacs.nl).

**************************FMCO: PROGRAM***************************

TUESDAY 5th

 8:45 -  9:00 Welcome
 9:00 - 10:00 Tutorial: Bertrand Meyer (ETH Zurich and ISE)
              Trusted components: concepts and progress report
10:00 - 10:30 Break
(Continue reading)

Permalink | Reply | 0 comments |
headers
csmr2003 | 9 Oct 2002 20:46
Picon

CSMR2003 - New Deadline for Submission

Please note that the deadline for submitting papers to the European
Conference on Software Maintenance and Reengineering has been extended
to October 18, 2002.

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

    (Apologies for multiple copies)

                        Seventh European Conference on
                       Software Maintenance and Reengineering
                                   Benevento, Italy
                                  March 26-28,  2003
                           http://rcost.unisannio.it/csmr2003
                                    CALL FOR PAPERS

    CSMR is  the premier  European Conference on  Software Maintenance
    and Reengineering.  Its purpose is to promote  both discussion and
    interaction about evolution, maintenance and reengineering.

    Topics of interest include, but are not restricted to: 

    Evolution, maintenance and reengineering:
            + pattern languages
            + experience reports (successes and failures)
            + tools
            + enabling technologies
            + formal methods
            + system assessment
            + web-site
    Metrics and economics
(Continue reading)

Permalink | Reply | 0 comments |
headers
Pierre | 11 Oct 2002 10:30
Picon
Favicon

CFP for LDTA 2003


      **********************************************************
      ***                       LDTA 2003                    ***
      ***                    APRIL, 6, 2003                  ***
      ***                     WARSAW,  POLAND                ***
      ***                                                    ***
      ***             http://www-sop.inria.fr/LDTA2003       ***
      **********************************************************

Scope:
------
      The aim of this one day workshop is to bring together
      researchers from academia and industry interested in the field
      of formal language definitions and language technologies, with a
      special emphasis on tools developed for or with these language
      definitions. Benefits of such active research fields are, among
      others: 

	     - Program analysis, transformation, generation
	     - Formal analysis of language properties
	     - Automatic generation of language processing tools

      Although these benefits are well-known, they are in current
      practices hardly exploited. For example, language definitions
      can be augmented in a manner that not only
      compilers/interpreters can be automatically generated but also
      other tools such as syntax-directed editors, debuggers, partial
      evaluators, test case generators, documentation generators,
      etc. 
      Domains of applications that are of interest for this workshop
(Continue reading)

Permalink | Reply | 0 comments |
headers
Anton Setzer | 13 Oct 2002 16:34
Picon
Picon
Favicon

Lectureship of interest for type theoretists

Dear all,

the following position might be of interest to members of the types
community. Swansea has a very strong group in theoretical computer
science and logic (John Tucker, who is head of department, Phil Grant,
Neal Harman, Oliver Kullman, Martin Otto, John Sharp,  one 
postdoc in finite model theory, who has just arrived, and currently
three type theoretists, namely Ulrich Berger and Monika 
Seisenberger who are both working in other areas of logic as well, and
myself.

Closing date is 25 October, but a letter of indent should suffice in
order to meet the deadline.

Anton Setzer

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

(L 4741/LCA/MML)

UNIVERSITY OF WALES SWANSEA

Department of Computer Science

Lecturer 

Lecturer Grade A:	£20470 - £24435 per annum
Lecturer Grade B:	£25455 - £32537 per annum

Applications are invited for the post of Lecturer (A/B), reference
(Continue reading)

Permalink | Reply | 0 comments |
headers
Dieter Hutter | 16 Oct 2002 10:27
Picon
Favicon

Final CfP First International Conference on Security in Pervasive Computing (SPC2003)


                  Final Call for Papers

            First International Conference on 

         Security in Pervasive Computing (SPC-2003)

               March 12 - 14, 2003 
                in Boppard, Germany

            http://www.dfki.de/SPC2003

The ongoing compression of computing facilities into small and 
mobile devices like handhelds, portables or even wearable computers 
will enhance an ubiquitous information processing. The basic para-
digm of such a pervasive computing is the combination of strongly 
decentralized and distributed computing with the help of diversified 
devices allowing for spontaneous connectivity via the internet. 
Computers will become invisible to the users awareness and exchange 
of information between devices will effectively defy users control.

Assuming a  broad usage of  more powerful tools and more effective 
ways to use them the quality of every day life will be strongly 
influenced by the dependability of the new technology. Information 
stored, processed, and transmitted be the various devices is one of 
the most critical resources. Threats exploiting vulnerabilities of 
new kinds of user interfaces, displays, operating systems, networks,
and wireless communications will cause new risks of loosing 
confidentiality, integrity, and availability. Can these risks be 
reduced by countermeasures to an acceptable level or do we have to
(Continue reading)

Permalink | Reply | 0 comments |
headers
Thomas Streicher | 16 Oct 2002 14:47
Picon
Favicon

semantics for F_{sub,rec} ??

In work on semantics of object oriented languages (as e.g. Kim Bruce's
recent book at MIT press) it turns out as useful to translate some basic
OOP languages into F_{sub,rec}, i.e. lambda calculus with bounded 
quantification over types and recursive types.
However, in most of these papers I couldn't find a semantics for F_{sub,rec}.
What comes most naturally to one's mind (at least to mine and that of a couple
of colleagues as well, I presume) are realizability models. If one interprets
types as complete expers, say, (as forcefully suggested in a paper by Mitchell 
and Viswanathan (ICALP'96)) it is more or less obvious that this way one gets

  (1)   an interpretation of bounded quantification  and

  (2)   bifree solutions of type equations of the form  A = F(A,A)
        where F is a mixed variant functor F : Ty^op x Ty -> Ty .

That's essentially the succus of the above mentioned article of Mitchell and
Viswanathan and the immediate reaction of people having worked in 
realizability semantics and SDT (like me) will be : well, yes, of course!

Thus, everything seems to be ok. At least I thought so for quite some time.
However, when looking more closely again into F_{sub,rec} I came to the 
conclusion that (1) and (2) above are not sufficient for interpreting the sort
of recursive types one finds in F_{sub,rec} simply because one want's to solve
type equations of the form A = T(A) where T(X) can NOT be written as F(X,X) 
for some mixed variant functor F : Ty^op x Ty -> Ty. A typical such example is

         A = T(A) := All X <: A. X -> Nat x X

because the natural candidate for a mixed variant functor F with T(A) = F(A,A)
would be
(Continue reading)

Permalink | Reply | 0 comments |

Gmane