![]() |
CiteULike | ![]() |
dherman's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Conventional and Uniqueness Typing in Graph Rewrite SystemsIn Proceedings of the 13th Conference on the Foundations of Software Technology and Theoretical Computer Science 1993, Bombay (1993)
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractIn 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...
BibTeX record
RIS record