Formal Methods in Computing(Most of the papers antecedent to 1995are not included in the list) FRAMES  NO FRAME

 BakBdL11 (In proceedings) Author(s) Steffen van Bakel, Franco Barbanera and Ugo de' Liguoro Title « A Filter Model for $\lambda \mu$ » In Proc. of TLCA'11 Series ARCoSS/LNCS Editor(s) Luke Ong Number 6690 Page(s) 213-228 Year 2011 URL http://www.di.unito.it/~deligu/papers/BBL_FLM.pdf
 Abstract We introduce an intersection type assignment system for the pure $\lambda \mu$-calculus, which is invariant under subject reduction and expansion. The system is obtained by describing Streicher and Reus's denotational model of continuations in the category of $\omega$-algebraic lattices via Abramsky's domain logic approach. This provides a tool for showing the completeness of the type assignment system with respect to the continuation models via a filter model construction. We also show that typed $\lambda \mu$-terms have a non-trivial intersection typing in our system.

 BibTeX code

@inproceedings{BakBdL11,
number = {6690},
author = {Steffen van Bakel and Franco Barbanera and Ugo de' Liguoro},
series = {{ARCoSS/LNCS}},
booktitle = {{Proc. of TLCA'11}},
editor = {Luke Ong},
url = {http://www.di.unito.it/~deligu/papers/BBL_FLM.pdf},
abstract = {We introduce an intersection type assignment system for the pure
$\lambda\mu$-calculus, which is invariant under subject reduction
and expansion. The system is obtained by describing Streicher and
Reus's denotational model of continuations in the category of
$\omega$-algebraic lattices via Abramsky's domain logic approach.
This provides a tool for showing the completeness of the type
assignment system with respect to the continuation models via a
filter model construction. We also show that typed
$\lambda\mu$-terms have a non-trivial intersection typing in our
system.},
title = {{A Filter Model for $\lambda\mu$}},
tag = {{TLCA'12}},
year = {2011},
institution = {London Imperial College, Universit\'a di Catania, Universit\'a
di Torino},
pages = {213-228},
}

 Formal Methods in Computing(Most of the papers antecedent to 1995are not included in the list) FRAMES  NO FRAME

This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)