**ApproxLM17 (Article)
** |

Author(s) | Ugo de' Liguoro |

Title | « *The Approximation Theorem for the $\Lambda \mu $-Calculus »* |

Journal | Mathematical Structures in Computer Science |

Volume | 27 |

Number | 5 |

Page(s) | 560-580 |

Year | 2017 |

Note | available on CJO2015. doi:10.1017/S0960129515000286. |

**Abstract** |

We consider a notion of approximation for terms of de Groote-Saurin $\Lambda \mu $-calculus. Then we introduce an intersection type assignment system for that calculus which is invariant under subject conversion. The type assignment system also induces a filter model, which is an extensional $\Lambda \mu $-model in the sense of Nakazawa and Katsumata. We then establish the approximation theorem, stating that a type can be assigned to a term in the system if and only if it can be assigned to same of its approximations. |

Download the complete article:

```
@article{ApproxLM17,
number = {5},
volume = {27},
author = {Ugo de' Liguoro},
note = {available on CJO2015. doi:10.1017/S0960129515000286.},
tag = {{Mathematical Structures in Computer Science}},
abstract = {We consider a notion of approximation for terms of de
Groote-Saurin $\Lambda\mu$-calculus. Then we introduce an
intersection type assignment system for that calculus which is
invariant under subject conversion. The type assignment system
also induces a filter model, which is an extensional
$\Lambda\mu$-model in the sense of Nakazawa and Katsumata. We then
establish the approximation theorem, stating that a type can be
assigned to a term in the system if and only if it can be assigned
to same of its approximations.},
title = {{The Approximation Theorem for the $\Lambda\mu$-Calculus}},
localfile = {http://www.di.unito.it/~deligu/papers/ApproxLM.pdf},
journal = {{Mathematical Structures in Computer Science}},
year = {2017},
pages = {560-580},
}
```

This document was generated by bib2html 3.3.

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