Results 1  10
of
10
Confluence properties of Weak and Strong Calculi of Explicit Substitutions
 JOURNAL OF THE ACM
, 1996
"... Categorical combinators [12, 21, 43] and more recently oecalculus [1, 23], have been introduced to provide an explicit treatment of substitutions in the calculus. We reintroduce here the ingredients of these calculi in a selfcontained and stepwise way, with a special emphasis on confluence prope ..."
Abstract

Cited by 120 (7 self)
 Add to MetaCart
Categorical combinators [12, 21, 43] and more recently oecalculus [1, 23], have been introduced to provide an explicit treatment of substitutions in the calculus. We reintroduce here the ingredients of these calculi in a selfcontained and stepwise way, with a special emphasis on confluence properties. The main new results of the paper w.r.t. [12, 21, 1, 23] are the following: 1. We present a confluent weak calculus of substitutions, where no variable clashes can be feared. 2. We solve a conjecture raised in [1]: oecalculus is not confluent (it is confluent on ground terms only). This unfortunate result is "repaired" by presenting a confluent version of oecalculus, named the Envcalculus in [23], called here the confluent oecalculus.
Confluence and Preservation of Strong Normalisation in an Explicit Substitutions Calculus
, 1996
"... Explicit substitutions calculi are formal systems that implement fireduction by means of an internal substitution operator. In that calculi it is possible to delay the application of a substitution to a term or to consider terms with partially applied substitutions. The oe calculus of explicit s ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
Explicit substitutions calculi are formal systems that implement fireduction by means of an internal substitution operator. In that calculi it is possible to delay the application of a substitution to a term or to consider terms with partially applied substitutions. The oe calculus of explicit substitutions, proposed by Abadi, Cardelli, Curien andL evy, is a firstorder rewriting system that implements substitution and renaming mechanism of calculus. However, oe does not preserve strong normalisation of calculus and it is not a confluent system. Typed variants of oe without composition are strongly normalising but not confluent, while variants with composition are confluent but do not preserve strong normalisation. Neither of them enjoys both properties. In this paper we propose the i calculus. This is, as far as we know, the first confluent calculus of explicit substitutions that preserves strong normalisation. 1. Explicit substitutions The calculus is a higherorder theor...
A Calculus of Substitutions for IncompleteProof Representation in Type Theory
, 1997
"... : In the framework of intuitionnistic logic and type theory, the concepts of "propositions" and "types" are identified. This principle is known as the CurryHoward isomorphism, and it is at the base of mathematical formalisms where proofs are represented as typed lambdaterms. In order to see the pr ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
: In the framework of intuitionnistic logic and type theory, the concepts of "propositions" and "types" are identified. This principle is known as the CurryHoward isomorphism, and it is at the base of mathematical formalisms where proofs are represented as typed lambdaterms. In order to see the process of proof construction as an incremental process of term construction, it is necessary to extend the lambdacalculus with new operators. First, we consider typed metavariables to represent the parts of a proof that are under construction, and second, we make explicit the substitution mechanism in order to deal with capture of variables that are bound in terms containing metavariables. Unfortunately, the theory of explicit substitution calculi with typed metavariables is more complex than that of lambdacalculus. And worse, in general they do not share the same properties, notably with respect to confluence and strong normalization. A contribution of this thesis is to show that the pr...
Confluence and Preservation of Strong Normalisation in an Explicit Substitutions Calculus
, 1995
"... Explicit substitutions calculi are formal systems that implement fireduction by means of an internal substitution operator. Thus, in that calculi it is possible to delay the application of a substitution to a term or to consider terms with partially applied substitutions. This feature is useful, f ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
Explicit substitutions calculi are formal systems that implement fireduction by means of an internal substitution operator. Thus, in that calculi it is possible to delay the application of a substitution to a term or to consider terms with partially applied substitutions. This feature is useful, for instance, to represent incomplete proofs in type based proof systems. The oe calculus of explicit substitutions proposed by Abadi, Cardelli, Curien and L'evy gives an elegant way to deal with management of variable names and substitutions of calculus. However, oe does not preserve strong normalisation of calculus and it is not a confluent system. Typed variants of oe without composition are strongly normalising but not confluent, while variants with composition are confluent but do not preserve strong normalisation. Neither of them enjoys both properties. In this paper we propose the i  calculus an we present the full proofs of its main properties. This is, as far as we know, the...
Dependent Types and Explicit Substitutions
, 1999
"... We present a dependenttype system for a #calculus with explicit substitutions. In this system, metavariables, as well as substitutions, are firstclass objects. We show that the system enjoys properties like type uniqueness, subject reduction, soundness, confluence and weak normalization. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We present a dependenttype system for a #calculus with explicit substitutions. In this system, metavariables, as well as substitutions, are firstclass objects. We show that the system enjoys properties like type uniqueness, subject reduction, soundness, confluence and weak normalization.
Confluence of PatternBased Calculi
"... Abstract Different pattern calculi integrate the functional mechanisms from the λcalculus and the matching capabilities from rewriting. Several approaches are used to obtain the confluence but in practice the proof methods share the same structure and each variation on the way patternabstractions a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract Different pattern calculi integrate the functional mechanisms from the λcalculus and the matching capabilities from rewriting. Several approaches are used to obtain the confluence but in practice the proof methods share the same structure and each variation on the way patternabstractions are applied needs another proof of confluence. We propose here a generic confluence proof where the way patternabstractions are applied is axiomatized. Intuitively, the conditions guarantee that the matching is stable by substitution and by reduction. We show that our approach directly applies to different pattern calculi, namely the lambda calculus with patterns, the pure pattern calculus and the rewriting calculus. We also characterize a class of matching algorithms and consequently of patterncalculi that are not confluent.
Metatheoretical properties of ...: A leftlinear variant of ...
, 1997
"... : In this paper we consider explicit substitutions calculi that allow open terms. In particular, we propose a variant of the oe calculus, that we call OE . For this calculus and its simplytyped version, we study its metatheoretical properties. The OE calculus enjoys the same general character ..."
Abstract
 Add to MetaCart
: In this paper we consider explicit substitutions calculi that allow open terms. In particular, we propose a variant of the oe calculus, that we call OE . For this calculus and its simplytyped version, we study its metatheoretical properties. The OE calculus enjoys the same general characteristics as oe , i.e. a simple and finitary firstorder presentation, confluent on terms with metavariables, with a composition operator and with simultaneous substitutions. However, OE does not have the nonleftlinear surjective pairing rule of oe which raises technical problems in some frameworks. (R'esum'e : tsvp) Cesar.Munoz@inria.fr Unit'e de recherche INRIA Rocquencourt Domaine de Voluceau, Rocquencourt, BP 105, 78153 LE CHESNAY Cedex (France) T'el'ephone : (33 1) 39 63 55 11  T'el'ecopie : (33 1) 39 63 53 30 Propri'et'es m'etath'eoriques de OE : Une variante lin'eaire `a gauche de oe R'esum'e : Dans cet article, on s'int'eresse aux calculs avec substitutions explicites q...
A Leftlinear Variant of λσ
, 1997
"... In this paper we consider calculi of explicit substitutions that admit open expressions, i.e. expressions with metavariables. In particular, we propose a variant of the oecalculus that we call L . For this calculus and its simplytyped version, we study its metatheoretical properties. The Lcal ..."
Abstract
 Add to MetaCart
In this paper we consider calculi of explicit substitutions that admit open expressions, i.e. expressions with metavariables. In particular, we propose a variant of the oecalculus that we call L . For this calculus and its simplytyped version, we study its metatheoretical properties. The Lcalculus enjoys the same general characteristics as oe, i.e. a simple and finitary firstorder presentation, confluent on expressions with metavariables of terms and weakly normalizing on typed expressions. Moreover, L does not have the nonleftlinear surjective pairing rule of oe which raises technical problems in some frameworks.
Dependent Types with Explicit Substitutions: A metatheoretical development
, 1997
"... We present a theory of dependent types with explicit substitutions. We follow a metatheoretical approach where open expressions expressions with metavariables are firstclass objects. The system enjoys properties like type uniqueness, subject reduction, soundness, confluence and weak normal ..."
Abstract
 Add to MetaCart
We present a theory of dependent types with explicit substitutions. We follow a metatheoretical approach where open expressions expressions with metavariables are firstclass objects. The system enjoys properties like type uniqueness, subject reduction, soundness, confluence and weak normalization.
Operated by Universities Space Research Association
"... CÉSAR MUÑOZ∗ Abstract. We present a dependenttype system for a λcalculus with explicit substitutions. In this system, metavariables, as well as substitutions, are firstclass objects. We show that the system enjoys properties like type uniqueness, subject reduction, soundness, confluence and weak ..."
Abstract
 Add to MetaCart
CÉSAR MUÑOZ∗ Abstract. We present a dependenttype system for a λcalculus with explicit substitutions. In this system, metavariables, as well as substitutions, are firstclass objects. We show that the system enjoys properties like type uniqueness, subject reduction, soundness, confluence and weak normalization.