Results 1 
6 of
6
Intersection types for explicit substitutions
, 2003
"... We present a new system of intersection types for a compositionfree calculus of explicit substitutions with a rule for garbage collection, and show that it characterizes those terms which are strongly normalizing. This system extends previous work on the natural generalization of the classical inte ..."
Abstract

Cited by 19 (7 self)
 Add to MetaCart
We present a new system of intersection types for a compositionfree calculus of explicit substitutions with a rule for garbage collection, and show that it characterizes those terms which are strongly normalizing. This system extends previous work on the natural generalization of the classical intersection types system, which characterized head normalization and weak normalization, but was not complete for strong normalization. An important role is played by the notion of available variable in a term, which is a generalization of the classical notion of free variable.
Characterising Strong Normalisation for Explicit Substitutions
 In Proceedings of Latin American Theoretical Informatics (LATIN'02), 2002. In Proceedings of Latin American Theoretical Informatics (LATIN'02), Canc
, 2002
"... Abstract. We characterise the strongly normalising terms of a compositionfree calculus of explicit substitutions (with or without garbage collection) by means of an intersection type assignment system. The main novelty is a cutrule which allows to forget the context of the minor premise when the c ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We characterise the strongly normalising terms of a compositionfree calculus of explicit substitutions (with or without garbage collection) by means of an intersection type assignment system. The main novelty is a cutrule which allows to forget the context of the minor premise when the context of the main premise does not have an assumption for the cut variable.
On Strong Normalisation of Explicit Substitution Calculi
, 1999
"... In this paper, we present an attempt to build a calculus of explicit substitution expected to be conuent on open terms, to preserve strong normalisation and to simulate one step reduction. We show why our attempt failed and we explain how we found a counterexample to the strong normalisation or ..."
Abstract
 Add to MetaCart
In this paper, we present an attempt to build a calculus of explicit substitution expected to be conuent on open terms, to preserve strong normalisation and to simulate one step reduction. We show why our attempt failed and we explain how we found a counterexample to the strong normalisation or termination of the substitution calculus. As a consequence, we provide also a counterexample to the strong normalisation of another calculus, namely (the substitution calculus of ) of Ris, for which the problem was open.
for Explicit Substitutions Abstract
"... We characterise the strongly normalising terms of a compositionfree calculus of explicit substititions (with or without garbage collection) by means of an intersection type assignment system. The main novelty is a new cutrule which allows to forget the context of the minor premise when the context ..."
Abstract
 Add to MetaCart
(Show Context)
We characterise the strongly normalising terms of a compositionfree calculus of explicit substititions (with or without garbage collection) by means of an intersection type assignment system. The main novelty is a new cutrule which allows to forget the context of the minor premise when the context of the main premise does not have an assumption for the cut variable.