Conventional and Uniqueness Typing in Graph Rewrite Systems (Extended Abstract) (1993)
| Venue: | In Proceedings of the 13th Conference on the Foundations of Software Technology and Theoretical Computer Science |
| Citations: | 67 - 4 self |
BibTeX
@INPROCEEDINGS{Barendsen93conventionaland,
author = {Erik Barendsen and Sjaak Smetsers},
title = {Conventional and Uniqueness Typing in Graph Rewrite Systems (Extended Abstract)},
booktitle = {In Proceedings of the 13th Conference on the Foundations of Software Technology and Theoretical Computer Science},
year = {1993},
pages = {41--51},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 `locally 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 languages: efficient space management and interfacing with non-functional operations.
Citations
| 122 | Linear types can change the world - Wadler - 1990 |
| 59 | Concurrent clean - Nöcker, Smetsers, et al. - 1991 |
| 22 | Towards and intermediate language based on graph rewriting - Barendregt, Eekelen, et al. |
| 19 | Term graph reduction - Barendregt, Eekelen, et al. |
| 2 | Partial type assignment in left-linear term rewriting systems - van, Smetsers, et al. - 1992 |
| 1 | Sjaak Smetsers, Graph Rewriting and Copying - Erik - 1992 |
| 1 | Conventional and Linear Formulas in a Logic of Coalgebras - Jacobs - 1993 |
| 1 | van Eekelen and Rinus Plasmeijer, Guaranteeing Safe Destructive Updates through a Type System with Uniqueness Information for Graphs - Sjaak, Barendsen, et al. - 1993 |
