[Prev][Next][Index][Thread]
Winter Workshop in Logics, Types and Rewriting
Programme, Abstracts and Call for Participation
Winter Workshop in Logics, Types and Rewriting
Heriot-Watt University, Edinburgh
1 February - 3 February 2000
http://www.cee.hw.ac.uk/~fairouz/ina-work.html
----------------------------------------------
*Program is now available at:
http://www.cee.hw.ac.uk/~fairouz/ina-program.html
*Deadline for cheap registration is: 12 January 2000
*Abstracts of lectures can now be found on:
http://www.cee.hw.ac.uk/~fairouz/ina-abstracts2.html
*Abstracts of tutorials can now be found on:
http://www.cee.hw.ac.uk/~fairouz/ina-abstracts1.html
Tuesday, 1 February 2000
8.30 - 9.00 REGISTRATION
Morning Session
9.00 - 10.00 N.G. de Bruijn: The Design of Automath.
10.00 - 10.30 BREAK
10.30 - 11.30 Gilles Dowek:
Axioms vs. Rewrite rules : from completeness to cut elimination
11.30 - 12.30 Martin Hofmann:
A type system for bounded space and functional in-place update
12.30 - 14.00 LUNCH
TUTORIALS
14.00 - 14.30 Adolfo Piperno:
A new approach to the problem of discriminability
14.30 - 15.00 Mirna Bognar: A Calculus of contexts: Part I
15.00 - 15.30 Roel de Vrijer: A Calculus of contexts: Part II
15.30 - 16.00 BREAK
16.00 - 16.30 Jan Zwanenburg: Pure Type Systems and Subtyping
16.30 - 17.00 Sophia Drossopoulou:
Towards a model of dynamic linking and verification for Java
Wednesday, 2 February 2000
Morning Session
9.00 - 10.00 Simona Ronchi Della Rocca:
Intuitionistic Logics and Intersection Type assignment System
10.00 - 10.30 BREAK
10.30 - 11.30 Joe Wells: A Paradigm Shift in Program Analysis
and Transformation via Intersection and Union Types
11.30 - 12.30 Gordon Plotkin:
12.30 - 14.00 LUNCH
17:30 - 19.30 Inaugural Lecture: Fairouz Kamareddine
19.30 SOCIAL BANQUET
Thursday, 3 February 2000
Morning Session
9.00 - 10.00 Henk Barendregt: Proof-assistants for mathematics
10.00 - 10.30 BREAK
10.30 - 11.30 Alan Bundy: Can Diagrammatic Reasoning be Automated?
11.30 - 12.30 Helene Kirchner:
Algebraic Specifications, Higher-Order Types and Set-Theoretic Models
12.30 - 14.00 LUNCH
Afternoon Session
14.00 - 15.00Jonathan Seldin:
On Lists and Other Abstract Data Types in the Calculus of Constructions
15.00 - 15.30 BREAK
15.30 - 16.30 Stefano Berardi: A notion of computation for Analysis
16.30 - 17.30 Jan Willem Klop: Proof systems for cyclic term graphs