RealComp'98: CFP and preliminary programme

[Among other subjects, the following tutorial workshop / summer school
will cover semantics of real number computation and extensions of PCF
with a real number data type.  Therefore, it might be of interest to
TYPES readers.]


                    Call for Participation

                   REAL NUMBER COMPUTATION


              Tutorial Workshop / Summer School

June 19-20, 1998 Indianapolis, Indiana, USA
preceding the IEEE Symposium on Logic in Computer Science (LICS)

Workshop url:  http://theory.doc.ic.ac.uk/~ps15/ws
main LICS url: http://www.lics98.cs.indiana.edu
Registration:  http://www.lics98.cs.indiana.edu/regform.html



  The usual implementation of real numbers in today's computers as
floating point numbers has the well-known deficiency that most numbers
can only be represented up to some fixed accuracy. This means that
even the basic arithmetic operations can not be performed exactly,
leading to the ubiquitous round-off errors. This is a serious problem
in all disciplines where high accuracy calculations are required. Many
different disciplines deal with Real Number Computation in a broad
sense. One of the ultimate goals of the theoretical and practical
research in this area is to overcome the above mentioned problems by
improving the present implementations and algorithms or providing

Aims and Scope

  The meeting aims to present an introduction to the interdisciplinary
area of Real Number Computation. The subject is understood in a broad
sense and covers various different fields like Recursion Theory,
Interval Analysis, Computer Arithmetic, Semantics of Programming
Languages and Numerical Analysis.  All talks will be accessible to
graduate students in any area of computer science, logic and
mathematics.  The workshop is also meant to provide researchers from
the various different communities an opportunity to meet and exchange


    George Corliss (Marquette University, Milwaukee, USA) 
    Abbas Edalat (Imperial College, London, UK) 
    Martin Escardo (University of Edinburgh, UK) 
    Reinhold Heckmann (Universitaet des Saarlandes, Saarbruecken, Germany) 
    Ulrich Kulisch (Technical University of Karlsruhe, Germany) 
    David Matula (Southern Methodist University, Dallas, USA) 
    Jean-Michel Muller (Ecole Normale Superieure, Lyon, France) 
    Peter Potts (Imperial College, London, UK) 
    Marian Pour-El (University of Minnesota, Minneapolis, USA)
    Dana Scott (Carnegie Mellon University, Pittsburgh, USA) 
    Philipp Sunderhauf (Imperial College, London, UK) 
    Jeffery Zucker (McMaster University, Hamilton, Canada) 

Time and Place

  The workshop will take place at the Indiana University Conference
Center in Indianapolis, Indiana (USA) on Friday and Saturday, 19-20
June, 1998, just before the Symposium on Logic in Computer Science
(LICS), which will be on 21-24 June. Local information is available
from the LICS'98 server at http://www.lics98.cs.indiana.edu.

  RealComp'98 is in parallel with a Workshop on Probabilistic Methods
in Verification (PROBMIV'98). Participants of either workshop will be
able to attend the other.


        The registration fee is $115 if payed until May 15 and $130
after that. It includes a registration package, lunches for the days
attended and food service 7:30 - 4:30 (including coffee breaks). To
register, please visit the url

Preliminary Programme

Friday, 19 June

 9:00-10:00  Marian Pour-El     Computability in Analysis and Physics
10:30-11:30  Jean-Michel Muller On the Table Maker's Dilemma
11:45-12:45  Abbas Edalat       Domain-theoretic Models for Computation

 2:15- 3:15  Jeffery Zucker     Abstract vs. Concrete Models of
                                Computation for Topological Algebras

 3:45- 4:45  David Matula       tba
 5:00- 5:45  Philipp Sunderhauf Computable Analysis via Domain Theory

 6:30        Reception (jointly with PROBMIV'98)

Saturday, 20 June

 9:00-10:00  Ulrich Kulisch      Advanced Arithmetic for the Digital 
                                 Computer: Design of Arithmetic Units

10:30-11:15  Peter Potts         Algorithms for Exact Real Arithmetic 
                                 using Moebius Transformations

11:30-12:30  George Corliss      Intervals for Rigorous Global Search:
                                 Industrial Applications
 2:00- 2:45  Reinhold Heckmann   Exact Real Arithmetic via Moebius 
                                 Transformations: Complexity Issues

 3:15- 4:15  Martin Escardo      On Extensions of the Programming
                                 Language PCF with Real Numbers
                                 Data Type
 4:30- 5:30  Dana Scott          A Logic of Types and Computability


  Abbas Edalat
  Dept of Computing
  Imperial College
  180 Queen's Gate
  London SW7 2BZ, UK

  Achim Jung
  School of Computer Science
  University of Birmingham
  Edgbaston, B15 2TT, UK

  Dana Scott
  Computer Science Department
  Wean Hall
  Carnegie Mellon University
  Pittsburgh, PA 15213-3890, USA

  Philipp Sunderhauf 
  Dept of Computing
  Imperial College
  180 Queen's Gate
  London SW7 2BZ, UK

Philipp S"underhauf
Department of Computing
Imperial College, London SW7 2BZ
P.Sunderhauf@doc.ic.ac.uk    http://theory.doc.ic.ac.uk/~ps15