We give a completeness theorem for the BCD theory of intersection types in an operational semantics based on logical relations
AbstractIn their paper “Intersection types and lambda definability” [Bucciarelli, A., Piperno, A., S...
AbstractTopologies are introduced on the set of lambda terms by their typeability in the full inters...
AbstractBCD [Barendregt, Henk, Mario Coppo and Mariangiola Dezani-Ciancaglini, A filter lambda model...
International audienceIn this paper we consider a type system with a universal type $\omega$ where a...
International audienceIn this paper we consider a type system with a universal type $\omega$ where a...
Working in a variant of the intersection type assignment system of Coppo, Dezani-Ciancaglini and Ven...
This paper will show the usefulness and elegance of strict intersection types for the Lambda Calculu...
This paper will show the usefulness and elegance of strict intersection types for the Lambda Calculu...
We provide a new and elementary proof of strong normalization for the lambda calculus of intersectio...
We show characterisation results for normalisation, head-normalisation, and strong normalisation for...
AbstractIn this paper the intersection type discipline as defined in Barendregt (1983) is studied. W...
One of the basic principles in typed lambda calculi is that typable lambda terms are normalizable. ...
AbstractIn this paper the intersection type discipline as defined in Barendregt (1983) is studied. W...
This paper introduces a notion of intersection type assignment on the Lambda Calculus that is a rest...
We propose a notion of the Kripke-style model for intersection logic. Using a game interpretation, w...
AbstractIn their paper “Intersection types and lambda definability” [Bucciarelli, A., Piperno, A., S...
AbstractTopologies are introduced on the set of lambda terms by their typeability in the full inters...
AbstractBCD [Barendregt, Henk, Mario Coppo and Mariangiola Dezani-Ciancaglini, A filter lambda model...
International audienceIn this paper we consider a type system with a universal type $\omega$ where a...
International audienceIn this paper we consider a type system with a universal type $\omega$ where a...
Working in a variant of the intersection type assignment system of Coppo, Dezani-Ciancaglini and Ven...
This paper will show the usefulness and elegance of strict intersection types for the Lambda Calculu...
This paper will show the usefulness and elegance of strict intersection types for the Lambda Calculu...
We provide a new and elementary proof of strong normalization for the lambda calculus of intersectio...
We show characterisation results for normalisation, head-normalisation, and strong normalisation for...
AbstractIn this paper the intersection type discipline as defined in Barendregt (1983) is studied. W...
One of the basic principles in typed lambda calculi is that typable lambda terms are normalizable. ...
AbstractIn this paper the intersection type discipline as defined in Barendregt (1983) is studied. W...
This paper introduces a notion of intersection type assignment on the Lambda Calculus that is a rest...
We propose a notion of the Kripke-style model for intersection logic. Using a game interpretation, w...
AbstractIn their paper “Intersection types and lambda definability” [Bucciarelli, A., Piperno, A., S...
AbstractTopologies are introduced on the set of lambda terms by their typeability in the full inters...
AbstractBCD [Barendregt, Henk, Mario Coppo and Mariangiola Dezani-Ciancaglini, A filter lambda model...
DOI
Add to ORKG