(Enter summary)
Abstract: This paper is an elaborated version of the work presented in Barendsen and Smetsers
(1995a) and Barendsen and Smetsers (1995c).
2. Term graph rewriting (Update)
Cited by: More
Xprez: A Declarative Presentation Language for - Xml Martijn Schrage
(Correct)
Type Qualifiers: Lightweight Specifications to Improve Software.. - Foster (2002)
(Correct)
XPREZ: A Declarative Presentation Language for XML - Schrage, Jeuring (2003)
(Correct)
Similar documents (at the sentence level):
19.7%: Graph Rewriting Semantics for Functional Programming.. - van Eekelen, Smetsers.. (1996)
(Correct)
Active bibliography (related documents): More All
0.2: Uniqueness Typing in Theory and Practice - Barendsen, Smetsers (1994)
(Correct)
0.2: Addressed Term Rewriting Systems - Lang, Dougherty, Lescanne, Rose (1999)
(Correct)
0.2: A Complete Proof System for Nested Term Graphs - Blom (1995)
(Correct)
Similar documents based on text: More All
0.6: Optimizing Generic Functions - Artem Alimarine And (2004)
(Correct)
0.5: Efficient Generic Functional Programming - Alimarine, Smetsers (2004)
(Correct)
0.4: Fusion in Practice - Diederik Van Arkel (2003)
(Correct)
Related documents from co-citation: More All
11: Once upon a type
- Turner, Wadler et al. - 1995
9: Region-based memory management
- Tofte, Talpin - 1997
8: A syntactic approach to type soundness
- Wright, Felleisen - 1991
BibTeX entry: (Update)
Erik Barendsen and Sjaak Smetsers. Uniqueness typing for functional languages with graph rewriting semantics. Mathematical Structures in Computer Science, 6:579--612, 1996. http://citeseer.ist.psu.edu/barendsen96uniquenes.html More
@article{ barendsen96uniqueness,
author = "Erik Barendsen and Sjaak Smetsers",
title = "Uniqueness Typing for Functional Languages with Graph Rewriting Semantics",
journal = "Mathematical Structures in Computer Science",
volume = "6",
number = "6",
pages = "579-612",
year = "1996",
url = "citeseer.ist.psu.edu/barendsen96uniquenes.html" }
Citations (may not include all citations):
634
A machine-oriented logic based on the resolution principle (context) - Robinson - 1965
184
Linear types can change the world
- Wadler - 1990
81
Once upon a type
- Turner, Wadler et al. - 1995
72
Semantics and Pragmatics of the Lambda Calculus (context) - Wadsworth - 1971
55
A simple algorithm and proof for type inference (context) - Wand - 1987
49
Equational term graph rewriting
- Ariola, Klop - 1995
40
Single-threaded polymorphic lambda calculus (context) - Guzm'an, Hudak - 1990
33
Lecture Notes in Computer Science (context) - Programming, Rennes - 1992
28
Deriving algorithms from type inference systems: Applicaton ..
- Hankin, le M'etayer - 1994
18
A game semantics for linear logic (context) - Blass - 1992
10
Uniqueness type inference (context) - Barendsen, Smetsers
5
Concurrent Clean (context) - Plasmeijer, van Eekelen - 1995
4
Types and Computations in Lambda Calculi and Graph Rewrite S.. (context) - Barendsen - 1995
4
Extending graph rewriting with copying
- Barendsen, Smetsers - 1994
1
Type inference with simple subtypes (context) - Barendsen, Smetsers - 1991
1
Uniqueness typing in natural deduction style (context) - Barendsen, Smetsers - 1995
1
A mixed linear and non-linear logic: Proofs (context) - the, proceedings et al. - 1994
1
Passivity and linear types (context) - Reynolds - 1995
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