**alesdeza04 (In proceedings)
** |

Author(s) | Fabio Alessi and Mariangiola Dezani-Ciancaglini |

Title | « *Type Preorders and Recursive Terms »* |

In | ITRS 2004 |

Series | Electronic Lecture Notes in Theoretical Computer Science |

Editor(s) | Mario Coppo and Ferruccio Damiani |

Volume | 136 |

Page(s) | 3--21 |

Year | 2005 |

Publisher | Elsevier |

ISSN number | 1571-0661 |

URL | http://www.di.unito.it/~dezani/papers/ad.pdf |

**Abstract** |

We show how to use intersection types for building models of a $\lambda $-calculus enriched with recursive terms, whose intended meaning is of *minimal* fixed points. As a by-product we prove an interesting consistency result. |

```
@inproceedings{alesdeza04,
volume = {136},
issn = {1571-0661},
author = {Alessi, Fabio and Dezani-Ciancaglini, Mariangiola},
series = {Electronic Lecture Notes in Theoretical Computer Science},
booktitle = {ITRS 2004},
editor = {Mario Coppo and Ferruccio Damiani},
url = {http://www.di.unito.it/~dezani/papers/ad.pdf},
abstract = {We show how to use intersection types for building models of a
$\lambda$-calculus enriched with recursive terms, whose intended
meaning is of \emph{minimal} fixed points. As a by-product we
prove an interesting consistency result.},
title = {{Type Preorders and Recursive Terms}},
publisher = {Elsevier},
year = {2005},
pages = {3--21},
}
```

This document was generated by bib2html 3.3.

(Modified by Luca Paolini, under the GNU General Public License)