Hostname: page-component-6766d58669-fx4k7 Total loading time: 0 Render date: 2026-05-22T12:47:32.520Z Has data issue: false hasContentIssue false
  • English
  • Français

Encoding FIX in Object Calculi

Published online by Cambridge University Press:  15 April 2002

Roy L. Crole
Roy L. Crole*
Affiliation:
Department of Mathematics and Computer Science, University of Leicester, University Road, Leicester LE1 7RH, U.K.; (Roy.Crole@mcs.le.ac.uk)
Get access

Abstract

We show that the FIX type theory introduced by Crole and Pitts[3] can be encoded in variants of Abadi and Cardelli'sobject calculi. More precisely, we show that the FIX type theorypresented with judgements of both equality and operational reductioncan be translated into object calculi, and the translation provedsound. The translations we give can be seen as using object calculi as ametalanguge within which FIX can be represented; an analogy can bedrawn with Martin Löf's Theory of Arities and Expressions. Aswell as providing a description of certain interesting recursiveobjects in terms of rather simpler expressions found in the FIXtype theory, the translations will be of interest to those involvedwith the automation of operational semantics.

Keywords

Information

Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 34 , Issue 1 , January 2000 , pp. 15 - 38
Copyright
© EDP Sciences, 2000

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

M. Abadi and L. Cardelli, A Theory of Objects. Springer-Verlag, Monogr. Comput. Sci. (1996).
R.L. Crole, Functional Programming Theory (1995). Department of Mathematics and Computer Science Lecture Notes, LATEX format iv+68 pages with index.
Crole, R.L. and Pitts, A.M., New Foundations for Fixpoint Computations: FIX Hyperdoctrines and the FIX Logic. Information and Computation 98 (1992) 171-210. LICS '90 Special Edition of Information and Computation. CrossRef
A.D. Gordon, Bisimilarity as a theory of functional programming. Electron. Notes Theor. Comput. Sci. 1 (1995).
A.D. Gordon, Everything is an object. Seminar Notes, Microsoft Research U.K. (1997).
C.A. Gunter, Semantics of Programming Languages: Structures and Techniques. Foundations of Computing. MIT Press (1992).
G. Kahn, Natural semantics, edited by K. Fuchi and M. Nivat, Programming of Future Generation Computers. Elsevier Science Publishers B.V. North Holland (1988) 237-258.
Z. Luo, Computation and Reasoning. Oxford University Press, Monogr. Comput. Sci. 11 (1994).
Moggi, E., Notions of computation and monads. Theoret. Comput. Sci. 93 (1989) 55-92.
B. Nordström, K. Petersson and J.M. Smith, Programming in Martin-Löf's Type Theory. Oxford University Press, Monogr. Comput. Sci. (1990).
A.M. Pitts, Operationally Based Theories of Program Equivalence, edited by P. Dybjer and A.M. Pitts, Semantics and Logics of Computation (1997).
G.D. Plotkin, A structural approach to operational semantics. Technical Report DAIMI-FN 19. Department of Computer Science, University of Aarhus, Denmark (1981).
G. Winskel, The Formal Semantics of Programming Languages. Foundations of Computing. The MIT Press, Cambridge, Massachusetts (1993).