#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2007

2015

- This year (0)
- Last 5 years (4)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- José Espírito Santo, Silvia Ghilezan, Jelena Ivetic
- TYPES
- 2007

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)

- José Espírito Santo, Jelena Ivetic, Silvia Likavec
- Fundam. Inform.
- 2012

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)

- Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Silvia Likavec
- ICTAC
- 2011

- Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Dragisa Zunic
- TbiLLC
- 2009

ion: t x Contraction: y t x z Weakening: t x

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)

- Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Silvia Likavec
- ArXiv
- 2013

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)

- Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Silvia Likavec
- ArXiv
- 2014

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)

- Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne, Silvia Likavec
- ArXiv
- 2011

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
- ›