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
In this paper we investigate the λ -calculus, a λ-calculus enriched with resource control. Explicit ...
We characterize those type preorders which yield complete intersection-type assignment systems for \...
AbstractTwo different translations of the usual formulation of intersection types for λ-calculus int...
AbstractWe show how to use intersection types for building models of a λ-calculus enriched with recu...
We show how to use intersection types for building models of a #-calculus enriched with recursive te...
AbstractWe use intersection types as a tool for obtaining λ-models. Relying on the notion of easy in...
AbstractWe show how to characterise compositionally a number of evaluation properties of λ-terms usi...
AbstractThe λY calculus is the simply typed λ calculus augmented with the fixed point operators. We ...
AbstractWe present a type inference system for pure λ-calculus which includes, in addition to arrow ...
We show characterisation results for normalisation, head-normalisation, and strong normalisation for...
We propose a notion of the Kripke-style model for intersection logic. Using a game interpretation, w...
AbstractA type theory with infinitary intersection and union types for an extension of the λ-calculu...
AbstractThe invariance of the meaning of a λ-term by reduction/expansion w.r.t. the considered compu...
AbstractBy using intersection types and filter models we formulate a theory of types for a λ-calculu...
AbstractIn this paper we introduce Curryfied term rewriting systems, and a notion of partial type as...
In this paper we investigate the λ -calculus, a λ-calculus enriched with resource control. Explicit ...
We characterize those type preorders which yield complete intersection-type assignment systems for \...
AbstractTwo different translations of the usual formulation of intersection types for λ-calculus int...
AbstractWe show how to use intersection types for building models of a λ-calculus enriched with recu...
We show how to use intersection types for building models of a #-calculus enriched with recursive te...
AbstractWe use intersection types as a tool for obtaining λ-models. Relying on the notion of easy in...
AbstractWe show how to characterise compositionally a number of evaluation properties of λ-terms usi...
AbstractThe λY calculus is the simply typed λ calculus augmented with the fixed point operators. We ...
AbstractWe present a type inference system for pure λ-calculus which includes, in addition to arrow ...
We show characterisation results for normalisation, head-normalisation, and strong normalisation for...
We propose a notion of the Kripke-style model for intersection logic. Using a game interpretation, w...
AbstractA type theory with infinitary intersection and union types for an extension of the λ-calculu...
AbstractThe invariance of the meaning of a λ-term by reduction/expansion w.r.t. the considered compu...
AbstractBy using intersection types and filter models we formulate a theory of types for a λ-calculu...
AbstractIn this paper we introduce Curryfied term rewriting systems, and a notion of partial type as...
In this paper we investigate the λ -calculus, a λ-calculus enriched with resource control. Explicit ...
We characterize those type preorders which yield complete intersection-type assignment systems for \...
AbstractTwo different translations of the usual formulation of intersection types for λ-calculus int...
Add to ORKG