A generic object-calculus based on Addressed Term Rewriting Systems

Abstract : In a previous paper we have outlined a framework (or a generic object-calculus) called \Obja, for modeling \textit{object calculi}. In this one, we would like to describe the foundations of \Obja{}. This framework is essentially a detailed formal operational semantics of object based languages, in the style of the Lambda Calculus of Objects. As a formalism for specification \Obja{} is arranged in \textit{modules}, permitting a natural classification of many object-based calculi according to their features, including their reduction-strategies. In particular there are modules for calculi of non mutable objects (\ie, \emph{functional object calculi}) and for calculi of mutable objects (\ie, \emph{imperative object calculi}). As a computational formalism \Obja{} is based on rewriting rules. Classical first-order term rewriting systems are not appropriate since we want to reflect aspects of implementation practice such as sharing, cycles in data structures and mutation. Therefore we define the notion of \textit{addressed terms}, and develop the corresponding notion of \textit{addressed term rewriting systems}.
Document type :
Reports
Complete list of metadatas

https://hal-lara.archives-ouvertes.fr/hal-02101981
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:11:18 AM
Last modification on : Wednesday, May 15, 2019 - 6:13:31 AM

File

RR1999-54.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02101981, version 1

Collections

Citation

Daniel Dougherty, Frédéric Lang, Pierre Lescanne, Luigi Liquori, Kristoffer Rose. A generic object-calculus based on Addressed Term Rewriting Systems. [Research Report] LIP RR-1999-54, Laboratoire de l'informatique du parallélisme. 1999, 2+32p. ⟨hal-02101981⟩

Share

Metrics

Record views

3

Files downloads

7