Department of Computer and Information Sciences
University of Strathclyde
4pm Tuesday 27th of January, 2009
Room 4.31/4.33, Informatics Forum
Abstract
Containers provide a semantic approach to data types which take
as primitive the concepts of shape and position. This talk asks if
containers are sufficiently flexible to cover not just the usual data
types like trees and lists, but indexed data types like perfect trees,
lambda terms and explicit substitutions. This is a journey which takes us
into the world of induction recursion ...