The s-calculus: its typed and its extended versions (1995) [13 citations — 7 self]
by Fairouz Kamareddine
http://www.macs.hw.ac.uk/~fairouz/papers/research-reports/Glasgow-TR-95-13.ps
Add To MetaCart
Abstract:
We present in this paper the simply typed version of the s-calculus (cf. [KR95]) and prove the strong normalisation of the well typed terms. We also present an extension of the s-calculus: the s e-calculus and prove its local confluence on open terms and the weak normalisation of its corresponding calculus of substitutions s e. The strong normalisation of s e is still an open problem to challenge the rewriting community.
Citations
| 418 | Simple word problems in universal algebras – Knuth, Bendix - 1970 |
| 334 | Explicit substitutions – Abadi, Cardelli, et al. - 1991 |
| 305 | Confluent reductions: Abstract properties and applications to term rewriting systems: Abstract properties and applications to term rewriting systems – Huet - 1980 |
| 117 | Confluence properties of weak and strong calculi of explicit substitutions – Curien, Hardin, et al. - 1996 |
| 88 | AE, a calculus of explicit substitutions which preserves strong normalisation. Journal of Functional Programming – Benaissa, Briaud, et al. - 1996 |
| 64 | A -calculus `a la de Bruijn with explicit substitutions – Kamareddine, Ros - 1995 |
| 51 | Typed -calculi with explicit substitutions may not terminate – Melli`es - 1995 |
| 38 | A Confluent Calculus of Substitutions – Hardin, L'evy - 1989 |
| 34 | Confluence Results for the Pure Strong Categorical Logic CCL : -calculi as Subsystems of CCL – Hardin - 1989 |
| 23 | Generalising reduction in the -calculus – Kamareddine, Nederpelt - 1995 |

