Results 1  10
of
16
Adjoint Rewriting
, 1995
"... This thesis concerns rewriting in the typed calculus. Traditional categorical models of typed calculus use concepts such as functor, adjunction and algebra to model type constructors and their associated introduction and elimination rules, with the natural categorical equations inherent in these s ..."
Abstract

Cited by 25 (11 self)
 Add to MetaCart
This thesis concerns rewriting in the typed calculus. Traditional categorical models of typed calculus use concepts such as functor, adjunction and algebra to model type constructors and their associated introduction and elimination rules, with the natural categorical equations inherent in these structures providing an equational theory for terms. One then seeks a rewrite relation which, by transforming terms into canonical forms, provides a decision procedure for this equational theory. Unfortunately the rewrite relations which have been proposed, apart from for the most simple of calculi, either generate the full equational theory but contain no decision procedure, or contain a decision procedure but only for a subtheory of that required. Our proposal is to unify the semantics and reduction theory of the typed calculus by generalising the notion of model from categorical structures based on term equality to categorical structures based on term reduction. This is accomplished via...
Confluence Properties of Extensional and NonExtensional lambdaCalculi with Explicit Substitutions (Extended Abstract)
 in Proceedings of the Seventh International Conference on Rewriting Techniques and Applications
, 1996
"... ) Delia Kesner CNRS and LRI, B at 490, Universit e ParisSud  91405 Orsay Cedex, France. email:Delia.Kesner@lri.fr Abstract. This paper studies confluence properties of extensional and nonextensional #calculi with explicit substitutions, where extensionality is interpreted by #expansion. For ..."
Abstract

Cited by 22 (5 self)
 Add to MetaCart
) Delia Kesner CNRS and LRI, B at 490, Universit e ParisSud  91405 Orsay Cedex, France. email:Delia.Kesner@lri.fr Abstract. This paper studies confluence properties of extensional and nonextensional #calculi with explicit substitutions, where extensionality is interpreted by #expansion. For that, we propose a general scheme for explicit substitutions which describes those abstract properties that are sufficient to guarantee confluence. Our general scheme makes it possible to treat at the same time many wellknown calculi such as ## , ## # and ## , or some other new calculi that we propose in this paper. We also show for those calculi not fitting in the general scheme that can be translated to another one fitting the scheme, such as #s , how to reason about confluence properties of their extensional and nonextensional versions. 1 Introduction The #calculus is a convenient framework to study functional programming, where the evaluation process is modeled by #reduction. The...
Confluence of Extensional and NonExtensional λcalculi with Explicit Substitutions
 Theoretical Computer Science
"... This paper studies confluence of extensional and nonextensional calculi with explicit substitutions, where extensionality is interpreted by jexpansion. For that, we propose a scheme for explicit substitutions which describes those abstract properties that are sufficient to guarantee confluence. O ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
This paper studies confluence of extensional and nonextensional calculi with explicit substitutions, where extensionality is interpreted by jexpansion. For that, we propose a scheme for explicit substitutions which describes those abstract properties that are sufficient to guarantee confluence. Our method makes it possible to treat at the same time many wellknown calculi such as oe , oe * , OE , s , AE , f , d and dn . Keywords: functional programming, calculi, explicit substitutions, confluence, extensionality. 1 Introduction The calculus is a convenient framework to study functional programming, where the evaluation process is modeled by fireduction. The main mechanism used to perform fireduction is substitution, which consists of the replacement of formal parameters by actual arguments. The correctness of substitution is guaranteed by a systematic renaming of bound variables, inconvenient which can be simply avoided in the calculus `a la de Bruijn by using natur...
Combining Algebraic Rewriting, Extensional Lambda Calculi, and Fixpoints
"... It is well known that confluence and strong normalization are preserved when combining algebraic rewriting systems with the simply typed lambda calculus. It is equally well known that confluence fails when adding either the usual contraction rule for #, or recursion together with the usual contract ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
It is well known that confluence and strong normalization are preserved when combining algebraic rewriting systems with the simply typed lambda calculus. It is equally well known that confluence fails when adding either the usual contraction rule for #, or recursion together with the usual contraction rule for surjective pairing. We show that confluence and strong normalization are modular properties for the combination of algebraic rewriting systems with typed lambda calculi enriched with expansive extensional rules for # and surjective pairing. We also show how to preserve confluence in a modular way when adding fixpoints to di#erent rewriting systems. This result is also obtained by a simple translation technique allowing to simulate bounded recursion. 1 Introduction Confluence and strong normalization for the combination of lambda calculus and algebraic rewriting systems have been the object of many studies [BT88, JO91, BTG94, HM90], where the modularity of these properties is s...
A brief history of rewriting with extensionality
 In Fairouz Kamareddine, editor, International Summer School on Type Theory and Rewriting
, 1996
"... ..."
Eta Expansions in System F
 LIENSDMI, Ecole Normale Superieure
, 1996
"... The use of expansionary jrewrite rules in various typed calculi has become increasingly common in recent years as their advantages over contractive jrewrite rules have become apparent. Not only does one obtain the decidability of fijequality, but rewrite relations based on expansions give a natu ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
The use of expansionary jrewrite rules in various typed calculi has become increasingly common in recent years as their advantages over contractive jrewrite rules have become apparent. Not only does one obtain the decidability of fijequality, but rewrite relations based on expansions give a natural interpretation of long fijnormal forms, generalise more easily to other type constructors, retain key properties when combined with other rewrite relations, and are supported by a categorical theory of reduction. This paper extends the initial results concerning the simply typed calculus to System F, that is, we prove strong normalisation and confluence for a rewrite relation consisting of traditional fireductions and jexpansions satisfying certain restrictions. Further, we characterise the second order long fijnormal forms as precisely the normal forms of the restricted rewrite relation. These results are an important step towards showing that jexpansions are compatible with the m...
Reasoning about Layered, Wildcard and Product Patterns
 ALP '94, volume 850 of LNCS
, 1994
"... We study the extensional version of the simply typed calculus with product types and fixpoints enriched with layered, wildcard and product patterns. Extensionality is expressed by the surjective pairing axiom and a generalization of the jconversion to patterns. We obtain a confluent reduction syst ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We study the extensional version of the simply typed calculus with product types and fixpoints enriched with layered, wildcard and product patterns. Extensionality is expressed by the surjective pairing axiom and a generalization of the jconversion to patterns. We obtain a confluent reduction system by turning the extensional axioms as expansion rules, and then adding some restrictions to these expansions in order to avoid reduction loops. Confluence is proved by composition of modular properties of the extensional and nonextensional subsystems of the reduction calculus. 1 Introduction Patternmatching function definitions is one of the most popular features of functional languages, allowing to specify the behavior of functions by cases, according to the form of their arguments. Lefthand sides of function definitions are usually expressed using Layered, Wildcard and Product Patterns (LWPP), as for example the following Caml Light [ea93] program where the function cons new pair ta...
Simulating etaExpansions with betaReductions in the SecondOrder Polymorphic Calculus
, 1996
"... . We introduce an approach to simulating jexpansions with fireductions in the secondorder polymorphic calculus. This generalizes the work of Di Cosmo and Delia Kesner which simulates jexpansions with fireductions in simply typed settings, positively solving the conjecture on whether the simu ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. We introduce an approach to simulating jexpansions with fireductions in the secondorder polymorphic calculus. This generalizes the work of Di Cosmo and Delia Kesner which simulates jexpansions with fireductions in simply typed settings, positively solving the conjecture on whether the simulation technique can be extended to polymorphic settings. We then present a modular proof that the secondorder polymorphic calculus with an expansive version of jreduction is strong normalizing and confluent. The simulation is also promising to provide modular proofs showing that other rewriting systems are also strongly normalizing after expanded with certain versions of jexpansion. 1 Introduction and Related Work jconversion presents an approach to studying extensional equalities for terms. Given an jequality x:M (x) = j M , where x has no free occurrences in M ; one can either say x:M (x) jcontracts (! j ) to M , or M jexpands (! j ) to x:M (x); the former is usually adopted ...
Rewriting with Extensional Polymorphic λcalculus
, 1996
"... We provide a confluent and strongly normalizing rewriting system, based on expansion rules, for the extensional second order typed lambda calculus with product and unit types: this system corresponds to the Intuitionistic Positive Calculus with implication, conjunction, quantification over propositi ..."
Abstract
 Add to MetaCart
We provide a confluent and strongly normalizing rewriting system, based on expansion rules, for the extensional second order typed lambda calculus with product and unit types: this system corresponds to the Intuitionistic Positive Calculus with implication, conjunction, quantification over proposition and the constant True. This result is an important step towards a new theory of reduction based on expansion rules, and gives a natural interpretation to the notion of second order jlong normal forms used in higher order resolution and unification, that are here just the normal forms of our reduction system.
LIENS (CNRS) DMI
, 1999
"... A brief survey of rewriting in typed λcalculi with extensional rules • confluence, decidability and normalization results • proof techniques • applications Edinburgh, April 99Extensionality and the lambda calculus Extensional axioms (or equalities) are customary in lambda calculus: they give us • c ..."
Abstract
 Add to MetaCart
A brief survey of rewriting in typed λcalculi with extensional rules • confluence, decidability and normalization results • proof techniques • applications Edinburgh, April 99Extensionality and the lambda calculus Extensional axioms (or equalities) are customary in lambda calculus: they give us • categoricity (universal property) of the associated data type • a sort of observational equivalence Typical examples are: • ηequality: (η) λx.Mx = M (x ∈ F V (M)) • surjective pairing: (SP) 〈π1(M), π2(M) 〉 = M • case uniqueness: (+!) case(P, M ◦ inA, M ◦ inB) = MP