The S-calculus: Its Typed and Its Extended Versions
暂无分享,去创建一个
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 connuence 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.
[1] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .
[2] Thérèse Hardin,et al. Confluence Results for the Pure Strong Categorical Logic CCL: lambda-Calculi as Subsystems of CCL , 1989, Theor. Comput. Sci..
[3] Gérard P. Huet,et al. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.