This paper surveys a part of the theory ofβ-reduction inλ-calculus which might aptly be
calledperpetual reductions. The theory is concerned withperpetual reduction strategies, ie …

The ability to incorporate low-power, wireless communication into embedded devices gives
rise to a new genre of embedded software that is distributed, dynamic, and adaptive. This …

Standardization is a fundamental notion for connecting programming languages and
rewriting calculi. Since both programming languages and calculi rely on substitution for …

We provide a coinductive definition of strongly convergent reductions between infinite
lambda terms. This approach avoids the notions of ordinals and metric convergence which …

We present translation techniques to study relations between weak and strong beta-
normalisations in various typed lambda-calculi. We first introduce a translation which …

A Proof of the Standardization Theorem in $\lambda$ -Calculus 37 Page 1 A Proof of the
Standardization Theorem in $\lambda$ -Calculus 鹿島亮 (Ryo Kashima) 東京工業大学大学院 …

We review the basics of functional programming, and give a brief introduction to emerging
techniques and approaches relevant to buildingreal-time software. In doingso we attempt to …

A new “inductive” approach to standardization for the λ-calculus has been recently
introduced by **, allowing him to establish a double-exponential upper bound| M| 2| σ| for …

Page 1 Mathematik Felix Joachimski Reduction Properties of IIIE-Systems · Herbert Utz Verlag
Wissenschaft Page 2 Page 3 Page 4 Page 5 Reduction Properties of IIIE-Systems Dissertation an …

We study confluence and the Church-Rosser property in term rewriting and λ-calculus with
explicit bounds on term sizes and reduction lengths. Given a system R, we are interested in …