The framework of action calculi accommodates a variety of disciplines of interaction and computation. A general theory of action calculi is under development; each particular action calculus — such as the π-calculus — will possess also a specific theory. It has previously been shown that any action calculus can be extended in a conservative manner to higher-order, thus allowing its actions to be encapsulated and treated as data. The dynamics of each higher-order calculus includes β-reduction, analogous to the λ-calculus. This paper demonstrates that under an assumption on the arities of a higher-order calculus (analogous to the assumption of simple types in the λ-calculus), β-reduction in higher-order action calculi is strongly normalising.
[1]
Harold T. Hodes,et al.
The | lambda-Calculus.
,
1988
.
[2]
Stefan Kahrs,et al.
Towards a Domain Theory for Termination Proofs
,
1995,
RTA.
[3]
Eike Ritter,et al.
Normalization for Typed Lambda Calculi with Explicit Substitution
,
1993,
CSL.
[4]
Paul-André Melliès.
Typed lambda-calculi with explicit substitutions may not terminate
,
1995,
TLCA.
[5]
Martín Abadi,et al.
Explicit substitutions
,
1989,
POPL '90.
[6]
Pierre Lescanne,et al.
From λσ to λν: a journey through calculi of explicit substitutions
,
1994,
POPL '94.
[7]
Robin Milner.
Higher-Order Action Calculi
,
1993,
CSL.