Winter Workshop in Logics, Types and Rewriting 2000
Cedar Room, Heriot-Watt University (Edinburgh), February 1-3, 2000
http://www.cedar-forest.org/forest/events/inaugural-workshop2000/
Preliminary Schedule
http://www.cedar-forest.org/forest/events/inaugural-workshop2000/ina-program.html
 |
ULTRA group Useful Logics, Types, Rewriting, and Applications |
 |
UKII UK Institute of Informatics, UK |
Tuesday, 1 February 2000
8.30 - 9.00
REGISTRATION
| 9.00 - 10.00 | The Design of Automath
N.G. de Bruijn |
| 10.00 - 10.30 | BREAK |
| 10.30 - 11.30 | Axioms vs. Rewrite rules : from completeness to cut elimination
Gilles Dowek |
| 11.30 - 12.30 | A type system for bounded space and functional in-place update
Martin Hofmann |
12.30 - 14.00
LUNCH
TUTORIALS
| 14.00 - 15.30 | Chair: Jan Zwanenburg |
| 14.00 - 14.30 | A new approach to the problem of discriminability
Adolfo Piperno |
| 14.30 - 15.00 | A Calculus of contexts: Part I
Mirna Bognar |
| 15.00 - 15.30 | A Calculus of contexts: Part II
Roel de Vrijer |
| 15.30 - 16.00 | BREAK |
| 16.00 - 17.30 | Chair: Roel Bloo |
| 16.00 - 16.30 | Pure Type Systems and Subtyping
Jan Zwanenburg |
| 16.30 - 17.00 | Towards a model of dynamic linking and verification for Java
Sophia Drossopoulou |
| 17.00 - 17.30 | A Statically Allocated Parallel Functional Language
Alan Mycroft |
Wednesday, 2 February 2000
| 9.00 - 10.00 | Intuitionistic Logics and Intersection Type assignment System
Simona Ronchi Della Rocca |
| 10.00 - 10.30 | BREAK |
| 10.30 - 11.30 | A Paradigm Shift in Program Analysis and
Transformation via Intersection and Union Types
Joe Wells |
| 11.30 - 12.30 | Another Meta-Language for Programming with Bound Names Modulo Renaming
Gordon Plotkin |
12.30 - 14.00
LUNCH
| 18:00 - 19.00 |
ULTRA - Useful Logics, Types, Rewriting and Applications.
Look here Fairouz Kamareddine's Inaugural Lecture Chair: Roger Clarke, Vote of Thanks: Henk Barendregt |
19.30
SOCIAL BANQUET
Thursday, 3 February 2000
| 9.00 - 10.00 | Proof-assistants for mathematics
Henk Barendregt |
| 10.00 - 10.30 | BREAK |
| 10.30 - 11.30 | What is a Proof?
Alan Bundy |
| 11.30 - 12.30 | Algebraic Specifications, Higher-Order Types and Set-Theoretic Models
Helene Kirchner |
12.30 - 14.00
LUNCH
| 14.00 - 15.00 | Proof systems for cyclic term graphs
Jan Willem Klop |
| 15.00 - 15.30 | BREAK |
| 15.30 - 16.30 | A notion of computation for Analysis
Stefano Berardi |
| 16.30 - 17.30 | On Lists and Other Abstract Data Types in the Calculus of Constructions
Jonathan Seldin |
18.00
END of Winter workshop 2000
Lectures abstracts can be found at: http://www.cedar-forest.org/forest/events/inaugural-workshop2000/ina-abstracts2.html
Tutorials abstracts can be found at: http://www.cedar-forest.org/forest/events/inaugural-workshop2000/ina-abstracts1.html
Travel information can be found at: http://www.cedar-forest.org/forest/events/inaugural-workshop2000/ina-travel.html