DOIAbstract
AbstractWe show how to use intersection types for building models of a λ-calculus enriched with recursive terms, whose intended meaning is of minimal fixed points. As a by-product we prove an interesting consistency result
AbstractWe show how to use intersection types for building models of a λ-calculus enriched with recursive terms, whose intended meaning is of minimal fixed points. As a by-product we prove an interesting consistency result
AbstractTwo different translations of the usual formulation of intersection types for λ-calculus int...
Natural intersection type preorders are the type structures which agree with the plain intuition of ...
International audienceA cornerstone of the theory of λ-calculus is that intersection types character...
We show how to use intersection types for building models of a #-calculus enriched with recursive te...
AbstractWe show how to use intersection types for building models of a λ-calculus enriched with recu...
We characterize those type preorders which yield complete intersection-type assignment systems for \...
AbstractWe use intersection types as a tool for obtaining λ-models. Relying on the notion of easy in...
We use intersection types as a tool for obtaining lambda-models. Relying on the notion of easy inter...
This paper is an introduction to intersection type disciplines, with the aim of illustrating their t...
The invariance of the meaning of a \u3bb-term by reduction/expansion w.r.t. the considered computati...
AbstractA type theory with infinitary intersection and union types for an extension of the λ-calculu...
this paper we solve completely the characterization problem as far as the three canonical set-theore...
The λ-calculus is a programming model based on functions. Its Turing-completeness comes from the fre...
The intersection type assignment system IT (shown in Figure 1) is a deductive system that assigns fo...
Abstract. This article is the first part of a two articles series about a calculus with higher-order...
AbstractTwo different translations of the usual formulation of intersection types for λ-calculus int...
Natural intersection type preorders are the type structures which agree with the plain intuition of ...
International audienceA cornerstone of the theory of λ-calculus is that intersection types character...
We show how to use intersection types for building models of a #-calculus enriched with recursive te...
AbstractWe show how to use intersection types for building models of a λ-calculus enriched with recu...
We characterize those type preorders which yield complete intersection-type assignment systems for \...
AbstractWe use intersection types as a tool for obtaining λ-models. Relying on the notion of easy in...
We use intersection types as a tool for obtaining lambda-models. Relying on the notion of easy inter...
This paper is an introduction to intersection type disciplines, with the aim of illustrating their t...
The invariance of the meaning of a \u3bb-term by reduction/expansion w.r.t. the considered computati...
AbstractA type theory with infinitary intersection and union types for an extension of the λ-calculu...
this paper we solve completely the characterization problem as far as the three canonical set-theore...
The λ-calculus is a programming model based on functions. Its Turing-completeness comes from the fre...
The intersection type assignment system IT (shown in Figure 1) is a deductive system that assigns fo...
Abstract. This article is the first part of a two articles series about a calculus with higher-order...
AbstractTwo different translations of the usual formulation of intersection types for λ-calculus int...
Natural intersection type preorders are the type structures which agree with the plain intuition of ...
International audienceA cornerstone of the theory of λ-calculus is that intersection types character...
Add to ORKG