APPSEM
Electronic proceedings of the Second APPSEM Workshop
The second APPSEM workshop
was held in Edinburgh 7-9 September 1999
Workshop program
abstracts of the talks
dvi
ps
APPSEMis a working group in the
ESPRIT program of the
European Union. APPSEM
officially
started on 1 April 1998 and will end on 31 March 2001.
Proceedings
Topic A: Semantics for oject-oriented programming
- Didier Remy Assembling Objects with Internal Concurrency
Using Inheritance Behaviour and Refinement of Synchronisation
(slides)
Topic B: Program structuring
- Hayo Thielecke On the (continuation) semantics of ML exception
(slides)
Topic C : Integration of functional languages and proof assistants
- Andrew Pitts Symbolic Computation Modulo Alpha Conversion
(slides)
Topic D: Verification methods
- Eugenio Moggi (with F. Palumbo)
Monadic Encapsulation of Effects: A Revised Approach
(Talk related to HOOTS'99 paper)
(paper)
- Don Sanella (with Furio Honsell)
Pre-logical Relations (Sumitted for Journal publication 1999)
(paper)
Topic E : Automatic program transformation
- Jens Peter Secher On Perfect Supercompilation
(This talk has already been held at PSI99, Novosibirsk, Russia)
(paper)
Topic F: Games, sequentiality and abstract machines
- Marina Lenisa (with Samson Abramsky)
Fully Complete Models for ML Polymorphic Type
(paper)
Topic G: Types and type inference in programming
- Francois Pottier Three parts for a powerful type inference engine
(paper) for ESOP-2000
- Luke Ong (with A. S. Murawski) :A Linear-time Algorithm for
Verifying MLL Proof Nets via Lamarche's Essential Nets
(paper)
Topic I : Domain theory and real number computation
- Reinhold Heckmann Complexity of Real Arithmetic by Linear Fractional Transformations
(slides)
- Hideki Tsuiki Gray Code Representation of Exact Real Numbers
(paper)
Last modified: Mon Feb 7 12:56:01 GMT 2000