Conventional and Uniqueness Typing in Graph Rewrite Systems

@inproceedings{Barendsen1993ConventionalAU,
  title={Conventional and Uniqueness Typing in Graph Rewrite Systems},
  author={Erik Barendsen and Sjaak Smetsers},
  booktitle={FSTTCS},
  year={1993}
}
In this paper we describe a Curry-like type system for graphs and extend it with uniqueness information to indicate that certain objects are only %cally accessible'. The correctness of type assignment guarantees that no external access on such an object will take place in the future. We prove that types are preserved under reduction (for both type systems) for a large class of rewrite systems. Adding uniqueness information provides a solution to two problems in implementations of functional… CONTINUE READING
BETA

Citations

Publications citing this paper.

FILTER CITATIONS BY YEAR

1994
2018

CITATION STATISTICS

  • 11 Highly Influenced Citations

  • Averaged 3 Citations per year over the last 3 years

References

Publications referenced by this paper.
SHOWING 1-10 OF 23 REFERENCES

Conventional and Linear Formulas in a Logic of Coalgebras

  • B P F Jacobs
  • Conventional and Linear Formulas in a Logic of…
  • 1993
1 Excerpt

Proc. of Parallel Architectures and Languages Europe (PARLE'91), pages 202{ 219

  • J E W Smetsers, M C J D Van Eekelen, M J Plasmeijer, Concurrent Clean
  • Proc. of Parallel Architectures and Languages…
  • 1991

Similar Papers

Loading similar papers…