Visitors

David Turner has held professorships at Queen Mary College, University of Texas at Austin and the University of Kent. He is currently Emeritus Professor at Middlesex University and also at the University of Kent. Professor Turner is best known as the inventor of combinator graph reduction and for designing and implementing a series of pure non-strict functional programming languages, including Miranda which was the main precursor of Haskell. He invented or coinvented many of the ideas which are now standard in functional programming including pattern matching with guards, list comprehensions and the "list of successes" method for eliminating backtracking. His current research interests include "strong functional programming", in which all computations terminate, type systems with dependent types and connections between functional programming and intuitionist logic.

He is being invited by Silvia Clérici and Cristina Zoltan to work together in graphic-functional language issues. He will be around LSI from the 13th to the 17th of May.