Seminars & Workshops

Type Inference for Bimorphic Recursion

Speaker:	Makoto Tatsuta , National Institute of Informatics, Tokyo
When:	2011-03-15 10:30
Place:	Room 308, Bldg 302, SNU

Abstract

Bimorphic recursion is restricted polymorphic recursion such that every recursive call in the body of a function definition has the same type. Bimorphic recursion allows us to assign two different types to a recursively defined function: one is for its recursive calls and the other is for its calls outside its definition. Bimorphic recursion in this talk can be nested. This talk shows bimorphic recursion has principal types and decidable type inference. Hence bimorphic recursion gives us flexible typing for recursion with decidable type inference. This talk also shows that its typability becomes undecidable because of nesting of recursions when one removes the instantiation property from the bimorphic recursion.

Short bio

Bachelors in Law in 1983 and Science in 1985, Master's in Science in 1987, and PhD in 1993 all in University of Tokyo. An assistant professor and an associate professor at Tohoku University from 1989 to 1996. An associate professor at Kyoto University from 1996 to 2001. A professor at National Institute of Informatics since 2001. Interested in theoretical computer science and mathematical logic, in particular, type theory and constructive logic.