Skip to Main content Skip to Navigation

Récursion généralisée et inférence de types avec intersection

Pascal Zimmer 1
1 MIMOSA - Migration and mobility : semantics and applications
CRISAM - Inria Sophia Antipolis - Méditerranée , Université de Provence - Aix-Marseille 1, MINES ParisTech - École nationale supérieure des mines de Paris
Abstract : In the first part, we define a new programming language with a functional core and generalised recursion, by using Boudol's type system with degrees to rule out unsafe recursions. The language is extended first with recursive records, then with mixins, allowing the programmer to fully mix functional and object-oriented paradigms. We also present an implementation, MlObj, and an abstract machine for execution.

In a second part, we design a new inference algorithm for intersection type systems, on an extension of the lambda-calculus. After proving its correctness, we study its generalisation to references and recursion, we compare it with existing inference algorithms, mainly System I, and we show that its finite rank version becomes decidable.
Document type :
Complete list of metadatas
Contributor : Pascal Zimmer <>
Submitted on : Wednesday, June 23, 2004 - 3:47:31 PM
Last modification on : Saturday, October 3, 2020 - 3:12:38 AM
Long-term archiving on: : Wednesday, September 12, 2012 - 4:20:17 PM


  • HAL Id : tel-00006314, version 1


Pascal Zimmer. Récursion généralisée et inférence de types avec intersection. Autre [cs.OH]. Université Nice Sophia Antipolis, 2004. Français. ⟨tel-00006314⟩



Record views


Files downloads