See this document in CiteSeerX!

Conventional and Uniqueness Typing in Graph Rewrite Systems (1993)  (Make Corrections)  (61 citations)
Erik Barendsen, Sjaak Smetsers
Proceedings of the 13th Conference on the Foundations of Software Technology and Theoretical Computer Science 1993, Bombay



  Home/Search   Context   Related

 
View or download:
cs.kun.nl/pub/CSI/...93typinggrs.ps.gz
cs.kun.nl/pub/Clea...93typinggrs.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cs.kun.nl/~clean/publications (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

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... (Update)

Cited by:   More
Alias Types for Recursive Data Structures - Walker, Morrisett (2000)   (Correct)
Alias Types - Smith, Walker, Morrisett (1999)   (Correct)
Quasi-Linear Types - Kobayashi (1999)   (Correct)

Similar documents (at the sentence level):
11.2%:   Conventional and Uniqueness Typing in Graph Rewrite Systems .. - Barendsen, Smetsers (1993)   (Correct)

Active bibliography (related documents):   More   All
0.5:   Guaranteeing Safe Destructive Updates through a.. - Smetsers.. (1994)   (Correct)
0.2:   Uniqueness Typing in Theory and Practice - Barendsen, Smetsers (1994)   (Correct)
0.2:   Concurrent Clean - Nöcker, Smetsers, van Eekelen.. (1991)   (Correct)

Similar documents based on text:   More   All
0.4:   Optimizing Generic Functions - Artem Alimarine And (2004)   (Correct)
0.3:   Efficient Generic Functional Programming - Alimarine, Smetsers (2004)   (Correct)
0.1:   Extending Graph Rewriting with Copying - Barendsen, Smetsers (1994)   (Correct)

Related documents from co-citation:   More   All
26:   Linear types can change the world - Wadler - 1990
12:   Typed memory management in a calculus of capabilities - Crary, Walker et al. - 1999
12:   Functional Programming and Parallel Graph Rewriting (context) - Plasmeijer, van Eekelen - 1993

BibTeX entry:   (Update)

Barendsen E., and J.E.W. Smetsers. 1993. Conventional and Uniqueness Typing in Graph Rewrite Systems. In proceedings 13th conference Foundations of Software Technology and Theoretical Computer Science, Bombay, India, December 1993, pp. 41-51, LNCS 761. http://citeseer.ist.psu.edu/article/barendsen93conventional.html   More

@inproceedings{ barendsen93conventional,
    author = "Erik Barendsen and Sjaak Smetsers",
    title = "Conventional and Uniqueness Typing in Graph Rewrite Systems",
    booktitle = "Proceedings of the 13th Conference on the Foundations of Software Technology and Theoretical Computer Science 1993, Bombay",
    publisher = "Springer-Verlag",
    address = "New York, NY",
    year = "1993",
    url = "citeseer.ist.psu.edu/article/barendsen93conventional.html" }
Citations (may not include all citations):
634   A Machine-Oriented Logic Based on the Resolution Principle (context) - Robinson - 1965
382   Lambda Calculi with Types - Barendregt - 1992
184   Linear types can change the world - Wadler - 1990
72   Semantics and Pragmatics of the Lambda Calculus (context) - Wadsworth - 1971
69   Handbook of Logic in Computer Science (context) - Abramsky, Gabbay et al. - 1992
40   Single-Threaded Polymorphic Lambda Calculus (context) - Guzm'an, Hudak - 1990
21   High Level Specification of I/O in Functional Languages - Achten, van Groningen et al. - 1993
20   Term Graph Reduction (context) - Barendregt, van Eekelen et al. - 1987
17   Order-of-Evaluation Analysis for Destructive Updates in Stri.. - William, Clinger et al. - 1993
17   Towards an Intermediate Language based on Graph Rewriting (context) - Barendregt, van Eekelen et al. - 1987
7   Graph Rewriting and Copying - Erik, Smetsers - 1992
3   Partial Type Assignment in Left-Linear Term Rewriting System.. (context) - van and, Smetsers et al. - 1992
2   Marko van Eekelen and Rinus Plasmeijer (context) - Sjaak, Barendsen - 1993
2   van Eekelen and M (context) - Smetsers - 1991



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.kun.nl/~clean/publications.html):   More
The Implementation and Efficiency of Arrays in Clean 1.1 - van Groningen (1997)   (Correct)
A Framework for Deterministically Interleaved Interactive.. - Achten, Plasmeijer (1994)   (Correct)
Partial Intersection Type Assignment in Applicative Term.. - van Bakel (1993)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC