AbstractTwo different translations of the usual formulation of intersection types for λ-calculus into combinatory logic are proposed; in the first one the rule (⩽) is unchanged, while in the second one the rule (⩽) is replaced by three new rules and four axiom-schemes, which seem to be simpler than rule (⩽) itself
This paper will show the usefulness and elegance of strict intersection types for the Lambda Calculu...
In this paper we define several notions of term expansion, used to define terms with less sharing, b...
AbstractIn this paper the intersection type discipline as defined in Barendregt (1983) is studied. W...
AbstractTwo different translations of the usual formulation of intersection types for λ-calculus int...
The intersection type assignment system IT (shown in Figure 1) is a deductive system that assigns fo...
Abstract: Some, but not all, closed terms of the lambda calculus have types; these types are exactly...
AbstractThe aim of this paper is to discuss the design of an explicitly typed λ-calculus correspondi...
The invariance of the meaning of a \u3bb-term by reduction/expansion w.r.t. the considered computati...
AbstractInvariance of interpretation by β-conversion is one of the minimal requirements for any stan...
We characterize those type preorders which yield complete intersection-type assignment systems for \...
The λ-calculus is a programming model based on functions. Its Turing-completeness comes from the fre...
This paper is an introduction to intersection type disciplines, with the aim of illustrating their t...
AbstractThe original λ¯μμ˜ of Curien and Herbelin has a system of simple types, based on sequent cal...
AbstractA type theory with infinitary intersection and union types for an extension of the λ-calculu...
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...
In this paper we define several notions of term expansion, used to define terms with less sharing, b...
AbstractIn this paper the intersection type discipline as defined in Barendregt (1983) is studied. W...
AbstractTwo different translations of the usual formulation of intersection types for λ-calculus int...
The intersection type assignment system IT (shown in Figure 1) is a deductive system that assigns fo...
Abstract: Some, but not all, closed terms of the lambda calculus have types; these types are exactly...
AbstractThe aim of this paper is to discuss the design of an explicitly typed λ-calculus correspondi...
The invariance of the meaning of a \u3bb-term by reduction/expansion w.r.t. the considered computati...
AbstractInvariance of interpretation by β-conversion is one of the minimal requirements for any stan...
We characterize those type preorders which yield complete intersection-type assignment systems for \...
The λ-calculus is a programming model based on functions. Its Turing-completeness comes from the fre...
This paper is an introduction to intersection type disciplines, with the aim of illustrating their t...
AbstractThe original λ¯μμ˜ of Curien and Herbelin has a system of simple types, based on sequent cal...
AbstractA type theory with infinitary intersection and union types for an extension of the λ-calculu...
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...
In this paper we define several notions of term expansion, used to define terms with less sharing, b...
AbstractIn this paper the intersection type discipline as defined in Barendregt (1983) is studied. W...
DOI
Add to ORKG