Results 1  10
of
10
Simple easy terms
 Intersection Types and Related Systems, volume 70 of Electronic Notes in Computer Science
, 2002
"... Dipartimento di Informatica Universit`a di Venezia ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
Dipartimento di Informatica Universit`a di Venezia
Intersection Types and Lambda Models
, 2005
"... Invariance of interpretation by #conversion is one of the minimal requirements for any standard model for the #calculus. With the intersection type systems being a general framework for the study of semantic domains for the #calculus, the present paper provides a (syntactic) characterisation of t ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
Invariance of interpretation by #conversion is one of the minimal requirements for any standard model for the #calculus. With the intersection type systems being a general framework for the study of semantic domains for the #calculus, the present paper provides a (syntactic) characterisation of the above mentioned requirement in terms of characterisation results for intersection type assignment systems.
Two behavioural lambda models
 Types for Proofs and Programs
, 2003
"... Abstract. We build a lambda model which characterizes completely (persistently) normalizing, (persistently) head normalizing, and (persistently) weak head normalizing terms. This is proved by using the finitary logical description of the model obtained by defining a suitable intersection type assign ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Abstract. We build a lambda model which characterizes completely (persistently) normalizing, (persistently) head normalizing, and (persistently) weak head normalizing terms. This is proved by using the finitary logical description of the model obtained by defining a suitable intersection type assignment system.
Intersection Types and Lambda Theories
 International Workshop on Isomorphisms of Types
, 2002
"... We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of ltheories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation of an arbitrary simple easy term is any filter which can be desc ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of ltheories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation of an arbitrary simple easy term is any filter which can be described in an uniform way by a recursive predicate. This allows us to prove the consistency of a wellknow ltheory: this consistency has interesting consequences on the algebraic structure of the lattice of ltheories.
Reducibility: a ubiquitous method in lambda calculus with intersection types
, 2002
"... A general reducibility method is developed for proving reduction properties of lambda terms typeable in intersection type systems with and without the universal type #. Su#cient conditions for its application are derived. This method leads to uniform proofs of confluence, standardization, and weak h ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
A general reducibility method is developed for proving reduction properties of lambda terms typeable in intersection type systems with and without the universal type #. Su#cient conditions for its application are derived. This method leads to uniform proofs of confluence, standardization, and weak head normalization of terms typeable in the system with the type #. The method extends Tait's reducibility method for the proof of strong normalization of the simply typed lambda calculus, Krivine's extension of the same method for the strong normalization of intersection type system without #, and StatmanMitchell's logical relation method for the proof of confluence of ##reduction on the simply typed lambda terms. As a consequence, the confluence and the standardization of all (untyped) lambda terms is obtained.
Compositional Characterisations of λterms using Intersection Types
, 2003
"... We show how to characterise compositionally a number of evaluation properties of λterms using Intersection Type assignment systems. In particular, we focus on termination properties, such as strong normalisation, normalisation, head normalisation, and weak head normalisation. We consider also the p ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We show how to characterise compositionally a number of evaluation properties of λterms using Intersection Type assignment systems. In particular, we focus on termination properties, such as strong normalisation, normalisation, head normalisation, and weak head normalisation. We consider also the persistent versions of such notions. By way of example, we consider also another evaluation property, unrelated to termination, namely reducibility to a closed term. Many of these characterisation results are new, to our knowledge, or else they streamline, strengthen, or generalise earlier results in the literature. The completeness parts of the characterisations are proved uniformly for all the properties, using a settheoretical semantics of intersection types over suitable kinds of stable sets. This technique generalises Krivine's and Mitchell's methods for strong normalisation to other evaluation properties.
Behavioural Inverse Limit λModels
, 2003
"... We construct two inverse limit λmodels which completely characterise sets of terms with similar computational behaviours: the sets of normalising, head normalising, weak head normalising λterms, those corresponding to the persistent versions of these notions, and the sets of closable, closable nor ..."
Abstract
 Add to MetaCart
We construct two inverse limit λmodels which completely characterise sets of terms with similar computational behaviours: the sets of normalising, head normalising, weak head normalising λterms, those corresponding to the persistent versions of these notions, and the sets of closable, closable normalising, and closable head normalising λterms. More precisely, for each of these sets of terms there is a corresponding element in at least one of the two models such that a term belongs to the set if and only if its interpretation (in a suitable environment) is greater than or equal to that element. We use the finitary logical description of the models, obtained by defining suitable intersection type assignment systems, to prove this.
Intersection Types and Lambda Theories ∗
, 2002
"... We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of λtheories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation of an arbitrary simple easy term is any filter which can be desc ..."
Abstract
 Add to MetaCart
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of λtheories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation of an arbitrary simple easy term is any filter which can be described in an uniform way by a predicate. This allows us to prove the consistency of a wellknow λtheory: this consistency has interesting consequences on the algebraic structure of the lattice of λtheories.
Resource control and strong normalisation
, 2012
"... We introduce the resource control cube, a system consisting of eight intuitionistic lambda calculi with either implicit or explicit control of resources and with either natural deduction or sequent calculus. The four calculi of the cube that correspond to natural deduction have been proposed by Kesn ..."
Abstract
 Add to MetaCart
We introduce the resource control cube, a system consisting of eight intuitionistic lambda calculi with either implicit or explicit control of resources and with either natural deduction or sequent calculus. The four calculi of the cube that correspond to natural deduction have been proposed by Kesner and Renaud and the four calculi that correspond to sequent lambda calculi are introduced in this paper. The presentation is paramatrized with the set of resources (weakening or contraction), which enables a uniform treatment of the eight calculi of the cube. The simply typed resource control cube, on the one hand, expands the CurryHoward correspondence to intuitionistic natural deduction and intuitionistic sequent logic with implicit or explicit structural rules and, on the other hand, is related to substructural logics. We propose a general intersection type system for the resource control cube calculi. Our main contribution is a characterisation of strong normalisation of reductions in this cube. First, we prove that typeability implies strong normalisation in the “natural deduction base ” of the cube by adapting the reducibility method. We then prove that typeability implies strong normalisation in the “sequent base ” of the cube by using a combination of wellorders and a suitable embedding in the “natural deduction base”. Finally, we prove that strong normalisation implies typeability in the cube using head subject expansion. All proofs are general and can be made specific to each calculus of the cube