Addressed term rewriting systems: application to a typed object calculus

@article{Dougherty2006AddressedTR,
  title={Addressed term rewriting systems: application to a typed object calculus},
  author={Daniel J. Dougherty and Pierre Lescanne and Luigi Liquori},
  journal={Mathematical Structures in Computer Science},
  year={2006},
  volume={16},
  pages={667-709}
}
We present a formalism called Addressed Term Rewriting Systems, which can be used to model implementations of theorem proving, symbolic computation, and programming languages, especially aspects of sharing, recursive computations and cyclic data structures. Addressed Term Rewriting Systems are therefore well suited for describing object-based languages, and as an example we present a language called λOba, incorporating both functional and object-based features. As a case study in how reasoning… CONTINUE READING
10 Citations
33 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 33 references

Properties of a First-order Functional Language with Sharing

  • M. Abadi, L. Cardelli
  • Object-Oriented Programming,
  • 1996
Highly Influential
5 Excerpts

The Objective Caml system release

  • Springer-Verlag. X. Leroy
  • FM, vol. 1709 of LNCS,
  • 2004

Haskell 98 Language and Libraries: the Revised Report

  • Hall. S. Peyton Jones
  • 2003

Similar Papers

Loading similar papers…