Types and models for higher-order action calculi
Philippa Gardner and Masahito Hasegawa
In Proc. 3rd International Symposium on Theoretical Aspects of
Computer Software (TACS'97), Springer LNCS 1281 (1997) 583-603
action calculi as a framework for
representing models of interactive behaviour. He also introduced the
higher-order action calculi, which add higher-order features to the
basic setting. We present type theories for action calculi and
higher-order action calculi, and give the categorical models of
the higher-order calculi. As applications, we give a semantic proof of the
conservativity of higher-order action calculi over action calculi,
and a precise connection with Moggi's computational lambda
calculus and notions of computation.
Pointers to Related Work
- A. Barber, P. Gardner, M. Hasegawa and G. Plotkin,
From action calculi to linear logic.
In Proc. CSL'97, Springer LNCS 1414 (1998) 78-97.
- P. Gardner and M. Hasegawa,
Higher-order and reflexive action calculi:
their type theory and models.
- R. Milner,
Calculi for interaction.
Acta Informatica 33(8) (1996) 707-737.
- E. Moggi,
Computational lambda-calculus and monads.
Technical report ECS-LFCS-88-66, University of Edinburgh (1988).
- A.J. Power,
Elementary control structures.
In Proc. CONCUR'96, Springer LNCS1119 (1996) 115-130.
Back to Hassei's
Research Page / Home Page