headers
Martin Hofmann | 1 Dec 2000 15:04
Picon
Picon

1st CFP: Workshop on Implicit Computational Complexity


Third international workshop on Implicit Computational Complexity-2001 (ICC'01)
-------------------------------------------------------------------------------

                   (affiliated with PADO and MFPS)

The Implicit Complexity Workshop (ICC'01) will be held on Sunday, 20
May 2001 in Aarhus as part of the joint PADO/MFPS 2000 conferences.

Topics of Interest:
-------------------

The synergy between Logic, Computational Complexity and Programming
Language Theory has gained importance and vigour in recent years,
cutting across areas such as Proof Theory, Computation Theory,
Applicative Programming, and Philosophical Logic. Several
machine-independent approaches to computational complexity have been
developed, which characterize complexity classes by conceptual
measures borrowed primarily from mathematical logic. Collectively
these approaches might be dubbed IMPLICIT COMPUTATIONAL COMPLEXITY.

Practically, implicit computational complexity provides a framework
for a streamlined incorporation of computational complexity into areas
such as formal methods in software development, programming language
theory. In addition to research reports on theoretical advances in
implicit computational complexity, practical contributions bridging
the gap between Computational Complexity and Programming Language
Theory are therefore of particular interest.

Previous Workshops
(Continue reading)

Permalink | Reply | 0 comments |
headers
bcpierce | 1 Dec 2000 17:04
Favicon

TYPES list pause, Dec. 7-24

I'm going to be travelling in far-off lands between the 7th and the 24th
of December, and will not have easy access to email during that period.

Postings and administrative requests for TYPES during that time will
be processed when I get back to Philly.  So if you've got a timely
announcement, burning question, etc. that you'd like to go out before
the 25th, please send it in by this coming Thursday morning.

     - Benjamin
       TYPES moderator

-----------------------------------------------------------------------------
BENJAMIN C. PIERCE
Associate Prof., Computer & Information Science        bcpierce@...
University of Pennsylvania                                    +1 215 898-2012
200 South 33rd St.                                       Fax: +1 215 898-0587
Philadelphia, PA 19104, USA                http://www.cis.upenn.edu/~bcpierce
-----------------------------------------------------------------------------
Permalink | Reply | 0 comments |
headers
Andy Moran | 1 Dec 2000 20:24
Picon

Post-Docs at OGI


			     POST-DOCS AVAILABLE

		       Pacific Software Research Center

	      Oregon Graduate Institute of Science & Technology

The Pacific Software Research Center (PacSoft) explores declarative techniques
for dramatically improving the software development process.  The Center is
composed of faculty (Mark Jones, John Launchbury, James Hook, Richard
Kieburtz, Tim Sheard, Andrew Tolmach, and Michael Gordon (*)), graduate
students and professional staff, and currently numbers over a dozen full-time
technical people.

The Center has active research programs in compiler technology for
functional languages, software-enabled control, meta-programming and the use
of design automation tools for software generation, specification, semantics
and implementation of domain specific languages (including domain analysis),
automatic program optimization using fusion and partial evaluation, the
specification of microprocessor microarchitectures using functional
languages, and the use of formal methods for specification, analysis and
verification.  In addition the Center runs an active visitor program which
attracts high quality researchers from around the world.

POST-DOCS AVAILABLE

PacSoft has immediate openings for postdoctoral researchers to work on the
Programatica project.  Programatica is an environment for the simultaneous
development of systems and formal models of systems that leverages functional
programming, theorem proving, and other applied formal methods.  The primary
(Continue reading)

Permalink | Reply | 0 comments |
headers
Ferruccio DAMIANI | 4 Dec 2000 18:30
Picon
Favicon

Call for Paper ICTCS'01


                           CALL FOR PAPERS

        Seventh Italian Conference on Theoretical Computer Science
                    Torino, October 4th - 6th, 2001

             Sponsored by the European Association
            of Theoretical Computer Science (EATCS)

The seventh Italian Conference on Theoretical Computer Science
will take place in Torino, in the period 4-6 October 2001.
Paper presenting original contributions in any area of theoretical
computer science are being sought.
Topics include (but are not limited to):

     computability, automata, formal languages, new computing
     paradigms, term rewriting, analysis and design of algorithms,
     computational complexity, symbolic and algebraic computation,
     cryptography and security, data types and data structures, theory
     of data base and knowledge bases, semantics of programming
     languages, program specification and verification, foundations of
     functional and logic programming, parallel and distributed
     computation, theory of concurrency, theory of robotics, theory of
     logical design and layout.

PROGRAM COMMITTEE

     A. Asperti, Bologna                 A. Bertoni, Milano
     B. Codenotti, Pisa                  C. De Felice, Salerno
     P. Degano, Pisa                     R. De Nicola, Firenze
(Continue reading)

Permalink | Reply | 0 comments |
headers
Harald Sondergaard | 11 Dec 2000 14:13
Picon
Picon

PPDP 2001: Call for Papers


                   Third International Conference on

          PRINCIPLES AND PRACTICE OF DECLARATIVE PROGRAMMING

                  Firenze, Italy, 5-7 September 2001

                           CALL FOR PAPERS

PPDP 2001 aims to stimulate research on the use of declarative methods
in programming  and on the design,  implementation  and application of
programming languages  that support such methods.   Topics of interest
include any aspect related to understanding, integrating and extending
programming paradigms such as those for functional, logic,  constraint
and  object-oriented  programming;  concurrent extensions  and  mobile
computing; type theory; support for modularity; use of logical methods
in the design of  program  development  tools;  program  analysis  and
verification;  abstract interpretation;  development of implementation
methods;  application of the relevant paradigms and associated methods
in industry and education.   This list is not exhaustive:  submissions
describing new and interesting ideas  relating broadly to  declarative
programming are encouraged.   The technical program  of the conference
will combine presentations  of the accepted papers  with invited talks
and advanced tutorials.

PPDP 2001  is part of a federation of colloquia  known as  Principles,
Logics  and  Implementations  of  high-level   programming   languages
(PLI 2001) which includes the ACM SIGPLAN International Conference on
Functional Programming (ICFP 2001).  The colloquia will run from 2 to
8 September, 2001. The venue for the conference is Firenze (Florence),
(Continue reading)

Permalink | Reply | 0 comments |
headers
Ferruccio DAMIANI | 11 Dec 2000 16:17
Picon
Favicon

Call for papers ICTCS'01 (UPDATED)


                           CALL FOR PAPERS

        Seventh Italian Conference on Theoretical Computer Science
                    Torino, October 4th - 6th, 2001

             Sponsored by the European Association
            of Theoretical Computer Science (EATCS)

The seventh Italian Conference on Theoretical Computer Science
will take place in Torino, in the period 4-6 October 2001.
Paper presenting original contributions in any area of theoretical
computer science are being sought.
Topics include (but are not limited to):

     computability, automata, formal languages, new computing
     paradigms, term rewriting, analysis and design of algorithms,
     computational complexity, symbolic and algebraic computation,
     cryptography and security, data types and data structures, theory
     of data base and knowledge bases, semantics of programming
     languages, program specification and verification, foundations of
     functional and logic programming, parallel and distributed
     computation, theory of concurrency, theory of robotics, theory of
     logical design and layout.

PROGRAM COMMITTEE

     A. Asperti, Bologna                 A. Bertoni, Milano
     B. Codenotti, Pisa                  C. De Felice, Salerno
     P. Degano, Pisa                     R. De Nicola, Firenze
(Continue reading)

Permalink | Reply | 0 comments |
headers
Xavier Leroy | 18 Dec 2000 10:30
Picon
Picon
Favicon

call for papers ICFP 2001

                         ICFP 2001: Call for Papers

       ICFP 2001: International Conference on Functional Programming
                Firenze (Florence), Italy; 3-5 September 2001
         associated with PLI 2001: Colloquium on Principles, Logics,
          and Implementations of High-Level Programming Languages

Important dates:

      Submission deadline                     15 March 2001, 18:00 UTC
      Notification of acceptance or rejection 11 May 2001
      Final paper due                         29 June 2001
      Conference                              3-5 September 2001

Scope:

ICFP 2001 seeks original papers on the full spectrum of the art, science,
and practice of functional programming. The conference invites submissions
on all topics ranging from principles to practice, from foundations to
features, and from abstraction to application. The scope covers all
languages that encourage programming with functions, including both purely
applicative and imperative languages, as well as languages that support
objects and concurrency. Papers setting new directions in functional
programming, or describing novel or exemplary applications of functional
programming, are particularly encouraged. Topics of interest include, but
are not limited to, the following:

   * Foundations: formal semantics, lambda calculus, type theory, monads,
     continuations, control, state, effects.
   * Design: modules and type systems, concurrency and distribution,
(Continue reading)

Permalink | Reply | 0 comments |
headers
Xudong Guan | 19 Dec 2000 03:08
Picon
Favicon

Ask for help: any previous work that has context-like type expressions?


Dear types researchers,

I am currently writing a paper on types for the ambient calculus.
In my type system, a context-like type expression is adopted to make
the system concise and easy-to-prove.  To my knowledge, no previous
work on types for the ambient calculus has such construction.
I wonder is there any existing type system in other fields that has
context-like type expressions?

To go a little further on my work, please read the following.
A process is what we want to type.  A typable process will have a type,
denoted by T.  A process may has the form M.P, where M is some action
and P is some other process.  Suppose M has type W and P has type T.
To derive the type of M.P, T', one way is to define some function F, which
calculates T' from W and T.  Another way is to let W itself to be some
function, when given T, results T'.  When F is difficult to find, the
second way is prefered. In this case, W could be regarded as a type context.

For those interested, a 5-page draft is avaliable at:
    http://go.163.com/~mobileambient/teadraft.zip

Best regards,

Xudong

-----------------------------------------------------------------------
Xudong Guan                                               PhD Candidate
Email: guan-xd@...   Distributed Computing Technology Center
Tel:   +86-21-52581638 ext.17          Room 1105, Haoran Hitech Mansion
(Continue reading)

Permalink | Reply | 0 comments |
headers
Marino Miculan | 19 Dec 2000 19:25
Picon
Favicon

FoSSaCS 2001 Accepted Papers

                     FoSSaCS 2001 Accepted Papers

Please find enclosed the list of papers accepted at FoSSaCS 2001.
The list is available also on the FoSSaCS web site at
http://fossacs.dimi.uniud.it/accepted.html

Furio Honsell
FoSSaCS'01 Chair

-----

1.Verified Bytecode Verifiers
  Tobias Nipkow

2.Axioms for Recursion in Call-by-Value
  Masahito Hasegawa, Yoshihiko Kakutani

3.Decidability of weak bisimilarity for a subset of basic parallel processes
  Colin Stirling

4.On the complexity of parity word automata
  Valerie King, Orna Kupferman, Moshe Vardi

5.Secrecy Types for Asymmetric Communication
  Martin Abadi, Bruno Blanchet

6.Higher-Order Abstract Syntax with Induction in Isabelle/HOL:
  Formalizing the Pi-Calculus and Mechanizing the Theory of Contexts
  Christine Röckl, Daniel Hirschkoff, Stefan Berghofer
(Continue reading)

Permalink | Reply | 0 comments |
headers
Samson Abramsky | 21 Dec 2000 19:20
Picon
Picon

TLCA 2001 Accepted Papers

The list of accepted papers for TLCA 2001 is now available at

http://www.ii.uj.edu.pl/zpi/tlca2001/acc_papers.html

Samson Abramsky
Permalink | Reply | 0 comments |

Gmane