Skip to main content
×
Home
    • Aa
    • Aa

Addressed term rewriting systems: application to a typed object calculus

  • DANIEL J. DOUGHERTY (a1), PIERRE LESCANNE (a2) and LUIGI LIQUORI (a3)
Abstract

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 to describing object-based languages, and as an example we present a language called $\lambda{\cal O}bj^{a}$, incorporating both functional and object-based features. As a case study in how reasoning about languages is supported in the ATRS formalism, we define a type system for $\lambda{\cal O}bj^{a}$ and prove a type soundness result.

Copyright
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 4 *
Loading metrics...

Abstract views

Total abstract views: 31 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 24th June 2017. This data will be updated every 24 hours.