------------------------------------------------------------------------------- ** Note Non-Standard Time ** ** Note Non-Standard Time ** ------------------------------------------------------------------------------- B O S T O N U N I V E R S I T Y Computer Science Department C O L L O Q U I U M Wednesday November 8, 1995 2:00pm Seminar Room / MCS 135 ------------------------------------------------------------------------------- Themes on explicit substitutions, definitions and generalised reductions Fairouz Kamareddine University of Glasgow In this talk, I will start by presenting a calculus of substitution which remains as close as possible to the lambda calculus rather than being based on categorial combinators (as in the work of Abadi et al and Lescanne et al). The calculus and that of Lescanne are the first calculi of explicit substitution which are both confluent and preserve strong normalisation. The work I am presenting on explicit substitution is a continuation of my earlier work on definitions and generalised reductions which I will also introduce explaining the problems that are still open in the area. Host: Joe Wells ------------------------------------------------------------------------------- For colloquium info, including directions, see http://cs-www.bu.edu/colloquium For more information contact Prof. Mark Crovella -------------------------------------------------------------------------------