Jelena Ivetic

Learn More
This paper gives a characterisation, via intersection types, of the strongly normalising terms of an intuitionistic sequent calculus (where LJ easily embeds). The soundness of the typing system is reduced to that of a well known typing system with intersection types for the ordinary λ-calculus. The completeness of the typing system is obtained from subject(More)
This paper gives a characterisation, via intersection types, of the strongly normalising proof-terms of an intuitionistic sequent calculus (where LJ easily embeds). The soundness of the typing system is reduced to that of a well known typing system with intersection types for the ordinary λ-calculus. The completeness of the typing system is obtained from(More)
We present and analyse various intersection type assignment systems for the λ-calculus, a calculus that embodies the Curry-Howard correspondence for intuitionistic sequent calculus. Three systems λGtz∩, λ∩◦ and λ∩] successfully characterise the strongly normalising terms in λ. The first one is presented as a refinement of two previous, unsuccessful(More)
In this paper we invite the reader to a journey through three lambda calculi with resource control: the lambda calculus, the sequent lambda calculus, and the lambda calculus with explicit substitution. All three calculi enable explicit control of resources due to the presence of weakening and contraction operators. Along this journey, we propose(More)
In this paper we investigate the λr-calculus, a λ-calculus enriched with resource control. Explicit control of resources is enabled by the presence of erasure and duplication operators, which correspond to thinning and contraction rules in the type assignment system. We introduce directly the class of λr-terms and we provide a new treatment of substitution(More)
The notion of resource awareness and control has gained an important role both in theoretical and practical domains: in logic and lambda calculus as well as in programming languages and compiler design. The idea to control the use of formulae is present in Gentzen’s sequent calculus’ structural rules ([6]), whereas the idea to control the use of variables(More)
In this paper we invite the reader to a journey through three lambda calculi with resource control: the lambda calculus, the sequent lambda calculus, and the lambda calculus with explicit substitution. All three calculi enable explicit control of resources due to the presence of weakening and contraction operators. Along this journey, we propose(More)
  • 1