David Walker, Greg Morrisett  Home/Search
Context Related
| cmu.edu/anon/2000/CMUCS00161K.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/~fox/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Linear type systems permit programmers to deallocate or explicitly recycle memory, but are severely restricted by the fact that they admit no aliasing. This paper describes a pseudo-linear type system that allows a degree of aliasing and memory reuse as well as the ability to define complex recursive data structures. Our type system can encode conventional linear data structures such as linear lists and trees as well as more sophisticated data structures including cyclic and doubly-linked lists ... (Update)
Cited by: More
An Effective Theory of Type Refinements - Mandelbaum, Walker, Harper (2003) (Correct)
Typed Memory Management via Static Capabilities - David Walker Carnegie (2000) (Correct)
Permission-Based Ownership: Encapsulating State - In Higher-Order Typed (Correct)
Similar documents (at the sentence level):
50.2%: Alias Types for Recursive Data Structures - Walker, Morrisett (2000) (Correct)
Active bibliography (related documents): More All
0.3: Safe Programming at the C Level of Abstraction - Grossman (2003) (Correct)
0.2: A Functional Representation of Data Structures with a Hole - Yasuhiko Minamide Research (1998) (Correct)
0.2: The Logical Approach to Stack Typing - Ahmed, Walker (2003) (Correct)
Similar documents based on text: More All
0.4: Alias Types - Smith, Walker, Morrisett (1999) (Correct)
0.2: A Linearly Typed Assembly Language - Cheney, Morrisett (Correct)
0.2: On Regions and Linear Types (Extended Abstract) - Walker, Watkins (2001) (Correct)
Related documents from co-citation: More All
38: Typed memory management in a calculus of capabilities - Crary, Walker et al. - 1999
32: Enforcing high-level protocols in low-level software - ahndrich, DeLine - 2001
26: BI as an assertion language for mutable data structures - Ishtiaq, O'Hearn - 2000
BibTeX entry: (Update)
D. Walker and G. Morrissett. Alias types for recursive data structures. Manuscript, April 2000. 49 http://citeseer.ist.psu.edu/article/walker00alias.html More
@article{ walker01alias,
author = "David Walker and Greg Morrisett",
title = "Alias Types for Recursive Data Structures",
journal = "Lecture Notes in Computer Science",
volume = "2071",
pages = "177--??",
year = "2001",
url = "citeseer.ist.psu.edu/article/walker00alias.html" }
Citations (may not include all citations):306 A syntactic approach to type soundness - Wright, Felleisen - 1994
233 Computational interpretations of linear logic - Abramsky - 1993
215 Theoretical Computer Science (context) - Lafont, abstract - 1988
215 Theoretical Computer Science (context) - Girard - 1987
207 Flow analysis and optimization of Lisp-like structures (context) - Jones, Muchnick - 1981
201 to Typed Assembly Language (context) - Morrisett, Walker et al. - 1998
200 Solving shape-analysis problems in languages with destructiv.. - Sagiv, Reps et al. - 1998
197 Dependent Types in Practical Programming - Xi - 1999
184 Linear types can change the world - Wadler - 1990
150 Parametric shape analysis via 3-valued logic - Sagiv, Reps et al. - 1999
138 Typed closure conversion - Minamide, Morrisett et al. - 1996
137 The design and implementation of a certifying compiler - Necula, Lee - 1998
132 Detecting conflicts between structure accesses (context) - Larus, Hilfinger - 1988
132 Syntactic control of interference (context) - Reynolds - 1978
117 Typed memory management in a calculus of capabilities - Crary, Walker et al. - 1999
110 BI as an assertion language for mutable data structures - Ishtiaq, O'Hearn - 2000
99 A shape analysis for heapdirected pointers in C (context) - Ghiya, Hendren et al. - 1996
97 Stack-based Typed Assembly Language - Morrisett, Crary et al. - 1998
88 Intuitionistic reasoning about shared mutable data structure - Reynolds - 2000
88 Implementation of the typed call-by-value -calculus using a .. (context) - Tofte, Talpin - 1994
83 From region inference to von Neumann machines via region rep.. - Birkedal, Tofte et al. - 1996
81 Once upon a type - Turner, Wadler et al. - 1995
79 ACM Transactions on Programming Languages and Systems (context) - Morrisett, Walker et al. - 1999
61 Conventional and uniqueness typing in graph rewrite systems - Barendsen, Smetsers - 1993
58 Better static memory management: Improving regionbased analy.. - Aiken, Fahndrich et al. - 1995
53 Quasi-linear types - Kobayashi - 1999
52 A simplified account of polymorphic references - Harper - 1994
52 Functional programming with bananas (context) - Meijer, Fokkinga et al. - 1991
51 and Greg Morrisett (context) - Smith, Walker - 2000
41 Some techniques for proving correctness of programs which al.. (context) - Burstall - 1972
40 A decidable logic for describing linked data structures - Benedikt, Reps et al. - 1999
36 Interprocedural may-alias analysis for pointers: Beyond k-li.. (context) - Deutsch - 1994
35 Reference counting as a computational interpretation of line.. - Chirimar, Gunter et al. - 1996
32 Single-threaded polymorphic lambda calculus (context) - Guzm'an, Hudak - 1990
31 An efficient machineindependent procedure for garbage collec.. (context) - Schorr, Waite - 1967
21 Listlessness is Better than Laziness (context) - Wadler - 1985
15 Restructuring Symbolic Programs for Concurrent Execution on .. (context) - Larus - 1989
15 An assertion language for data structures (context) - Cook, Oppen - 1975
10 Science of Computer Programming (context) - Moller, algebra - 1993
9 Recycling continuations - Sobel, Friedman - 1998
7 A functional representation of data structures with a hole - Minamide - 1998
6 Destination-passing style and generational garbage collectio.. (context) - Cheng, Okasaki - 1996
6 Typed Memory Management (context) - Walker - 2001
3 Scalable certification of native code: Experience from compi.. - Grossman, Morrisett - 2000
1 edutalc implementation Typed Assembly Language based Intel's.. (context) - http, cornell et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cmu.edu/~fox/publications.html): More
A Modal Analysis of Staged Computation - Davies, Pfenning (1995) (Correct)
Toward a Practical Type Theory for Recursive Modules - Dreyer, Harper, Crary (2001) (Correct)
Replication-Based Incremental Copying Collection - Nettles, O'Toole, Pierce.. (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