Combining First Order Algebraic Rewriting Systems, Recursion and Extensional Lambda Calculi

@inproceedings{Cosmo1994CombiningFO,
  title={Combining First Order Algebraic Rewriting Systems, Recursion and Extensional Lambda Calculi},
  author={Roberto Di Cosmo and Delia Kesner},
  booktitle={ICALP},
  year={1994}
}
It is well known that confluence and strong normalization are preserved when combining left-linear algebraic rewriting systems with the simply typed lambda calculus. It is equally well known that confluence fails when adding either the usual extensional rule for η, or recursion together with the usual contraction rule for surjective pairing. 
Expanding Extensional Polymorphism
We prove the confluence and strong normalization properties for second order lambda calculus equipped with an expansive version of η-reduction. Our proof technique, based on a simple abstract lemma
On Modular Properties of Higher Order Extensional Lambda Calculi
We prove that confluence and strong normalisation are both modular properties for the addition of algebraic term rewriting systems to Girard's F ω equipped with either β-equality or βη-equality.
Combining Algebraic Rewriting with the Second-order Extensional Polymorphic Lambda Calculus
We prove that strong normalisation and connuence properties are conserved when a left-linear canonical rst-order algebraic rewriting system is combined with the second-order polymorphic-calculus with
Reasoning about Layered, Wildcard and Product Patterns
TLDR
A confluent reduction system is obtained by turning the extensional axioms as expansion rules, and then adding some restrictions to these expansions in order to avoid reduction loops.
An extensional operational and axiomatic semantics for type-inference with recursion and algebraic data types
TLDR
This is the first satisfactory treatment of a polymorphic type inference systems in the presence of extensionality, and it is shown how to add, using some simple but powerful lemmas from the theory of rewriting, algebraic data types and recursion preserving confluence of the system under very liberal conditions.
Simulating eta-expansions with beta-reductions in the Second-Order Polymorphic lambda-calculus
TLDR
A modular proof is presented that the second-order polymorphic λ-calculus with an expansive version of η-reduction is strong normalizing and confluent and shows that other rewriting systems are also strongly normalizing after expanded with certain versions ofη-expansion.
Confluence Properties of Extensional and Non-Extensional lambda-Calculi with Explicit Substitutions (Extended Abstract)
TLDR
A general scheme for explicit substitutions is proposed which describes those abstract properties that are sufficient to guarantee confluence in λ-calculi, and makes it possible to treat at the same time many well-known calculi, or some other new calculi that are proposed in this paper.
Labeling techniques and typed fixed-point operators
Labeling techniques for untyped lambda calculus were developed by Levy, Hyland, Wadsworth and others in the 1970's. A typical application is the proof of confluence from finiteness of de- velopments:
...
...

References

SHOWING 1-10 OF 31 REFERENCES
Some Lambda Calculi with Categorial Sums and Products
TLDR
The simply typed λ-calculus with primitive recursion operators and types corresponding to categorical products and coproducts is considered, and strong normalization and ground (base-type) confluence is proved for the full calculus.
Polymorphic Rewriting Conserves Algebraic Confluence
We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term rewriting. Algebraic and lambda terms are mixed by adding the symbols of the algebraic signature to
A Confluent Reduction for the Extensional Typed lambda-Calculus with Pairs, Sums, Recursion and terminal Object
TLDR
This work proves the calculus to be weakly confluent, and provides an effective mechanism to simulate expansions without expansion rules, so that the strong normalization of the calculus can be derived from that of the underlying, traditional, non extensional system.
A confluent reduction for the extensional typed λ − calculus with pairs , sums , recursion and terminal object
We add extensional equalities for the functional and product types to the typed λ-calculus with not only products and terminal object, but also sums and bounded recursion (a version of recursion that
Simulating expansions without expansions
TLDR
This work proves the calculus to be weakly confluent, and provides an effective mechanism to simulate expansions without expansion rules, so that the strong normalization of the calculus can be derived from that of the underlying, traditional, non extensional system.
A computation model for executable higher-order algebraic specification languages
  • J. Jouannaud, M. Okada
  • Computer Science, Mathematics
    [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science
  • 1991
TLDR
A general modularity result, which allows as particular cases primitive recursive functionals of higher types, transfinite recursion of highertypes, and inheritance for all types, is proved.
Operational and axiomatic semantics of PCF
TLDR
The results suggest that if the equational axioms for PCF are taken as defining the language, the smaller reduction system gives an appropriate operational semantics.
On Mints' Reduction for ccc-Calculus
TLDR
A divide- and-conquer lemma is presented to infer the SN+CR (Strongly Normalization and Church-Rosser) property of a reduction system from that property of its subsystems, and some relations of the two restricted expansions against traditional reductions are obtained.
Closed categories and the theory of proofs
The main aim of this article is to suggest a translation of the simplest concepts of category theory into the language of (structural) theory of proofs, to use this translation to simplify the proofs
La definition de fonctions par cas a l'aide de motifs dans des langages applicatifs
Dans cette these, nous nous sommes interesses a deux modeles de programmation avec definitions de fonctions par cas a l'aide de motifs. Dans la premiere partie, nous introduisons le calcul type avec
...
...